Hyperswitch network for the hypercube computer
ISCA '88 Proceedings of the 15th Annual International Symposium on Computer architecture
Adaptive packet routing in a hypercube
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors
IEEE Transactions on Computers
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
Distributed fault-tolerance for large multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
| Hi-index | 0.00 |
It is important for a distributed computing system to be able to route messages aroundwhatever faulty links or nodes may be present. We present a fault-tolerant routingalgorithm that assures the delivery of every message as long as there is a path betweenits source and destination. The algorithm works on many common mesh architecturessuch as the torus and hexagonal mesh. The proposed scheme can also detect thenonexistence of a path between a pair of nodes in a finite amount of time. Moreover, thescheme requires each node in the system to know only the state (faulty or not) of eachof its own links. The performance of the routing scheme is simulated for both square andhexagonal meshes while varying the physical distribution of faulty components. It isshown that a shortest path between the source and destination of each message istaken with a high probability, and, if a path exists, it is usually found very quickly.