Resource placement in torus-based networks

被引：59

作者：

Bae, MM ^{[1
]}

Bose, B ^{[1
]}

机构：

[1] OREGON STATE UNIV, DEPT COMP SCI, CORVALLIS, OR 97331 USA

来源：

IEEE TRANSACTIONS ON COMPUTERS | 1997年 / 46卷 / 10期

基金：

美国国家科学基金会;

关键词：

error-correcting code; Lee distance; resource placement; torus network; k-ary n-cube;

D O I：

10.1109/12.628393

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper investigates methods to locate system resources, such as expensive hardware or software modules, to provide the most effective cost/performance trade-offs in a torus parallel machine. This paper contains some solutions to perfect distance-t and perfect/quasi-perfect j-adjacency placement in a k-ary n-cube and a torus using Lee distance error-correcting codes. It also presents generalized resource placement (j-adjacency with distance-t placement) methods based on the concept of covering radius of Lee distance codes.

引用

页码：1083 / 1092

页数：10

共 23 条

[1] Spare processor allocation for fault tolerance in torus-based multicomputers [J].

Bae, MM ;

Bose, B .

PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL SYMPOSIUM ON FAULT-TOLERANT COMPUTING, 1996, :282-291

[2] Resource placement in torus-based networks [J].

Bae, MM ;

Bose, B .

10TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM - PROCEEDINGS OF IPPS '96, 1996, :327-331

[3]

Berlekamp E. R., 1968, ALGEBRAIC CODING THE

[4]

BHUYAN LN, 1984, IEEE T COMPUT, V33, P323, DOI 10.1109/TC.1984.1676437

[5] LEE DISTANCE AND TOPOLOGICAL PROPERTIES OF K-ARY N-CUBES [J].

BOSE, B ;

BROEG, B ;

KWON, Y ;

ASHIR, Y .

IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (08) :1021-1030

[6] EFFICIENT RESOURCE PLACEMENT IN HYPERCUBES USING MULTIPLE-ADJACENCY CODES [J].

CHEN, HL ;

TZENG, NF .

IEEE TRANSACTIONS ON COMPUTERS, 1994, 43 (01) :23-33

[7]

CHEN HL, 1991, P 20 INT C PAR PROC, V1, P517

[8]

CHIU GM, 1990, P 5 DISTR MEM COMP, V1, P894

[9]

Golomb S. W., 1968, Error correcting codes, P175

[10] ON THE COVERING RADIUS OF CODES [J].

GRAHAM, RL ;

SLOANE, NJA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (03) :385-401

← 1 2 3 →