Hypercube message routing in the presence of faults

F. M. Gordon, Q. F. Stout
1988 Proceedings of the third conference on Hypercube concurrent computers and applications Architecture, software, computer systems, and general issues -  
We discuss the problem of routing messages on hypercubes which have faulty processors and/or communication links. We are motivated by the belief that simple algorithms, operating under simple assumptions, can ensure high probabilities of successful message routing. In this paper, we consider the basic problem of routing a single message from an arbitrary source to an arbitrary destination. In our study, a fault is assumed to render the processor or link non-functional for purposes of
more » ... ng messages. As such, we may also consider communications hot spots as node faults, and our results also apply to routing in congested hypercubes.
doi:10.1145/62297.62332 fatcat:nvoxb4mmmjbcbacwtyqnjpq24e