Shortest Path Routing on the Hypercube with Faulty Nodes
CS174 Spring 99, lecture 11 summary, John Canny
2.6 Routing Mechanisms for Interconnection Networks Efficient algorithms for routing a message to its destination are critical to the performance of parallel computers. A routing mechanism determines the path a message takes through the network to get from ...
Parallel Processing, Low-Diameter Architectures - ppt video online download
Part 3 (pdf)
Optimal routing of parentheses on the hypercube | Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Routing algorithms for tree-hypercube networks | Proceedings of the 1998 ACM symposium on Applied Computing
A 3-dimensional, 8-processor hypercube. | Download Scientific Diagram
A four-dimensional hypercube with seven faulty nodes. | Download Scientific Diagram
Hypercube Routing - YouTube
Fault-tolerant routing based on approximate directed routable probabilities for hypercubes - ScienceDirect