An adaptive and fault tolerant wormhole routing strategy for k -ary n-cubes

Author

Linder, Daniel H. ; Harden, Jim C.

Author_Institution

Dept. of Electr. Eng., Mississippi State Univ., MS, USA

Volume

40

Issue

1

fYear

1991

fDate

1/1/1991 12:00:00 AM

Firstpage

2

Lastpage

12

Abstract

The concept of virtual channels is extended to multiple virtual communication systems that provide adaptability and fault tolerance in addition to being deadlock-free. A channel dependency graph is taken as the definition of what connections are possible, and any routing function must use only those connections defined by it. Virtual interconnection networks allowing adaptive, deadlock-free routing are examined for three k-ary n-cube topologies: unidirectional, torus-connected bidirectional, and mesh-connected bidirectional

Keywords

computer architecture; concurrency control; fault tolerant computing; adaptability; adaptive routing; channel dependency graph; deadlock-free; deadlock-free routing; fault tolerant wormhole routing strategy; k-ary n-cubes; mesh-connected bidirectional; torus-connected bidirectional; unidirectional; virtual channels; virtual communication systems; virtual interconnection networks; Adaptive systems; Computer architecture; Concurrent computing; Fault tolerance; Fault tolerant systems; Message passing; Multiprocessor interconnection networks; Routing; System recovery; Topology;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.67315

Filename

67315