Adaptive fault-tolerant routing in hypercube multicomputers
- International Business Machines Corp., Yorktown Heights, NY (USA). Thomas J. Watson Research Center
- Michigan Univ., Ann Arbor, MI (USA). Dept. of Electrical Engineering and Computer Science
A connected hypercube with faulty links and/or nodes is called an {ital injured hypercube}. To enable any nonfaulty node to communicate with any other nonfaulty node in an injured hypercube, the information on component failures has to be made available to nonfaulty nodes so as to route messages around the faulty components. The authors propose a distributed adaptive fault-tolerant routing scheme 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 {ital n}-dimensional hypercube as long as the number of faulty components is less than {ital 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 to that of a shortest path. Due to the insufficient information on faulty components, however, the paths chosen by the 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.
- OSTI ID:
- 5862333
- Journal Information:
- IEEE Transactions on Computers (Institute of Electrical and Electronics Engineers); (USA), Journal Name: IEEE Transactions on Computers (Institute of Electrical and Electronics Engineers); (USA) Vol. 39:12; ISSN ITCOB; ISSN 0018-9340
- Country of Publication:
- United States
- Language:
- English
Similar Records
An efficient modular spare allocation scheme and its application to fault tolerant binary hypercubes
Algorithm-based fault tolerance on a hypercube multiprocessor