Adaptive fault-tolerant routing in hypercube multicomputers
Ming-Syan Chen,Kang G. Shin +1 more
TLDR
A distributed adaptive fault-tolerant routing scheme is proposed for an injured hypercube in which each node is required to know only the condition of its own links and is shown to be capable of routing messages successfully in an injured n-dimensional hypercube as long as the number of faulty components is less than n.Abstract:
A connected hypercube with faulty links and/or nodes is called an injured hypercube. A distributed adaptive fault-tolerant routing scheme is proposed for an injured hypercube in which each node is required to know only the condition of its own links. Despite its simplicity, this scheme is shown to be capable of routing messages successfully in an injured n-dimensional hypercube as long as the number of faulty components is less than n. Moreover, it is proved that this scheme routes messages via shortest paths with a rather high probability, and the expected length of a resulting path is very close so that of a shortest path. Since the assumption that the number of faulty components is less than n in an n-dimensional hypercube might limit the usefulness of the above scheme, a routing scheme based on depth-first search which works in the presence of an arbitrary number of faulty components is introduced. Due to the insufficient information on faulty components, however, the paths chosen by this scheme may not always be the shortest. To guarantee all messages to be routed via shortest paths, the authors propose to equip every node with more information than that on its own links. The effects of this additional information on routing efficiency are analyzed, and the additional information to be kept at each node for the shortest path routing is determined. Several examples and remarks are given to illustrate the results. >read more
Citations
More filters
Journal ArticleDOI
Deadlock-free adaptive routing in multicomputer networks using virtual channels
William J. Dally,H. Aoki +1 more
TL;DR: Two deadlock-free adaptive routing algorithms are described that allocate virtual channels using a count of the number of dimension reversals a packet has performed to eliminate cycles in resource dependency graphs and improve virtual channel utilization.
Book
Interconnection Networks
TL;DR: The authors present in a structured way the basic underlying concepts of most interconnection networks and provide representative solutions that have been implemented in the industry or proposed in the research literature.
Book
Adaptive routing protocols for hypercube interconnection networks
TL;DR: A taxonomy for characterizing adaptive routing protocols for hypercube interconnection networks (HINs) is presented in this paper, which is based on classes of routing decisions common to any HIN.
Journal ArticleDOI
A family of fault-tolerant routing protocols for direct multiprocessor networks
TL;DR: A new class of adaptive routing algorithms-misrouting backtracking with m misroutes (MB-m) is presented, made possible by PCS, and an analysis of the performance and static fault-tolerant properties of MB-m is provided.
Journal ArticleDOI
Adaptive routing protocols for hypercube interconnection networks
TL;DR: A taxonomy for characterizing adaptive routing protocols for hypercube interconnection networks (HINs) based on classes of routing decisions common to any HIN is presented and results of simulation studies of representative protocols are presented.
References
More filters
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Journal ArticleDOI
Topological properties of hypercubes
Y. Saad,M.H. Schultz +1 more
TL;DR: The authors examine the hypercube from the graph-theory point of view and consider those features that make its connectivity so appealing and propose a theoretical characterization of the n-cube as a graph.
Journal ArticleDOI
The cosmic cube
TL;DR: Cosmic Cube as discussed by the authors is a hardware simulation of a future VLSI implementation that will consist of single-chip nodes, which offers high degrees of concurrency in applications and suggests that future machines with thousands of nodes are both feasible and attractive.
Journal ArticleDOI
Optimum broadcasting and personalized communication in hypercubes
S.L. Johnsson,C.-T. Ho +1 more
TL;DR: In this article, the authors proposed three spanning trees for the Boolean n-cube for the routing, and scheduling disciplines provably optimum within a small constant factor are proposed with appropriate scheduling and concurrent communication on all ports of every processor.
Related Papers (5)
An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes
Daniel H. Linder,Jim C. Harden +1 more