Message routing in an injured hypercube

Authors:
M-S. Chen;K. G. Shin
Affiliations:
Real-Time Computing Laboratory, Department of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor, MI;Real-Time Computing Laboratory, Department of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor, MI
Venue:
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Year:
1988

Citing 5
Cited 9

The cosmic cube

Communications of the ACM - Special section on computer architecture
Multigrid Algorithms on the Hypercube Multiprocessor

IEEE Transactions on Computers
A parallel architecture comes of age at last

IEEE Spectrum
Processor allocation in an N-cube multiprocessor using gray codes

IEEE Transactions on Computers
Distributed fault-tolerance for large multiprocessor systems

ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture

Reliable Broadcast in Hypercube Multicomputers

IEEE Transactions on Computers
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers

IEEE Transactions on Computers
Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers

IEEE Transactions on Computers
Global Commutative and Associative Reduction Operations in Faulty SIMD Hypercubes

IEEE Transactions on Computers
All-to-All Broadcasting in Faulty Hypercubes

IEEE Transactions on Computers
A Fault-Tolerant Communication Scheme for Hypercube Computers

IEEE Transactions on Computers
A Fault-Tolerant Routing Strategy in Hypercube Multicomputers

IEEE Transactions on Computers
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers

IEEE Transactions on Parallel and Distributed Systems
An Efficient Modular Spare Allocation Scheme and Its Application to Fault Tolerant Binary Hypercubes

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.02

Visualization

Abstract

A connected hypercube containing faulty components (nodes or links) is called an injured hypercube. To enable non-faulty nodes to communicate with each other in an injured hypercube, the information of component failures must be made available to those non-faulty nodes for them to route messages around the faulty components.We develop a fault-tolerant routing scheme which requires each node to know only the information on the failure of its own links. Performance of this scheme is rigorously analyzed. This scheme is not only shown to be capable of routing messages successfully in injured hypercubes when the number of component failures is less than n, but also proved to be able to choose a shortest path with a very high probability.