A flexible bit-pattern associative router for interconnection networks

被引：15

作者：

Summerville, DH ^{[1
]}

DelgadoFrias, JG ^{[1
]}

Vassiliadis, S ^{[1
]}

机构：

[1] DELFT UNIV TECHNOL,DEPT ELECT ENGN,DELFT,NETHERLANDS

来源：

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | 1996年 / 7卷 / 05期

关键词：

routing algorithm execution; interconnection networks; associative memories; oblivious routing; adaptive routing; flexible routers;

D O I：

10.1109/71.503772

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A programmable associative approach to execute implicit routing algorithms is presented. Algorithms are mapped onto a set of bit-patterns that are matched in parallel. We have studied and mapped a large number of routing algorithms for a wide range of interconnection network topologies. Here we report three cases that illustrate the capabilities of the router scheme. For the studied topologies, the number of required bit-patterns is of the same order as the topology degree. The proposed approach is one of the fastest routers and requires a very small amount of hardware.

引用

页码：477 / 485

页数：9

共 16 条

[1]

CHIEN AA, 1993, P HOT INT 93 PAL ALT

[2]

DECARLINI U, 1991, TRANSPUTERS PARALLEL

[3]

Delgado-Frias J. G., 1994, Proceedings. Fourth Great Lakes Symposium on VLSI. Design Automation of High Performance VLSI Systems GLSV '94 (Cat. No.94TH0603-1), P124, DOI 10.1109/GLSV.1994.289982

[4] THE TWISTED N-CUBE WITH APPLICATION TO MULTIPROCESSING [J].

ESFAHANIAN, AH ;

NI, LM ;

SAGAN, BE .

IEEE TRANSACTIONS ON COMPUTERS, 1991, 40 (01) :88-93

[5] THE TURN MODEL FOR ADAPTIVE ROUTING [J].

GLASS, CJ ;

NI, LM .

JOURNAL OF THE ACM, 1994, 41 (05) :874-902

[6]

HOROWITZ E, 1981, IEEE T COMPUT, V30, P247, DOI 10.1109/TC.1981.1675772

[7]

*INMOS LTD, 1991, 72TRN22800 INMOS

[8]

LEIGHTON T, 1990, 2 ANN ACM S PAR ALG, P2

[9]

MOOIJ WGP, 1989, LECT NOTES COMPUTER, V365

[10]

NI LM, 1994, IEEE COMPUTER ARCHIT, P31

← 1 2 →