OPTIMAL ROUTING ALGORITHM FOR MESH-CONNECTED PARALLEL COMPUTERS

被引：63

作者：

NASSIMI, D ^{[1
]}

SAHNI, S ^{[1
]}

机构：

[1] UNIV MINNESOTA,DEPT COMP SCI,MINNEAPOLIS,MN 55455

来源：

JOURNAL OF THE ACM | 1980年 / 27卷 / 01期

关键词：

D O I：

10.1145/322169.322172

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：6 / 29

页数：24

共 17 条

[1] ILLIAC 4 COMPUTER [J].

BARNES, GH ;

BROWN, RM ;

KATO, M ;

KUCK, DJ ;

SLOTNICK, DL ;

STOKES, RA .

IEEE TRANSACTIONS ON COMPUTERS, 1968, C 17 (08) :746-&

[2]

BENES VE, 1965, MATH THEORY CONNECTI

[3]

CSANKY L, 1975, 16 IEEE FOCS, P11

[4] VERY HIGH-SPEED COMPUTING SYSTEMS [J].

FLYNN, MJ .

PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1966, 54 (12) :1901-&

[5] SOME COMPLEXITY RESULTS FOR MATRIX COMPUTATIONS ON PARALLEL PROCESSORS [J].

GENTLEMAN, WM .

JOURNAL OF THE ACM, 1978, 25 (01) :112-115

[6]

LANG T, 1976, IEEE T COMPUT, V25, P496, DOI 10.1109/TC.1976.1674637

[7]

LAWRIE DH, 1973, THESIS U ILLINOIS

[8]

NASSIMI D, 1979, IEEE T COMPUT, V28, P2, DOI 10.1109/TC.1979.1675216

[9]

NASSIMI D, 1978, 7819 U MINN TECH REP

[10]

ORCUTT SE, 1976, IEEE T COMPUT, V25, P929, DOI 10.1109/TC.1976.1674718

← 1 2 →