IEEE Transactions on Computers
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes
IEEE Transactions on Computers
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Communication Scheme for Hypercube Computers
IEEE Transactions on Computers
A Fully Adaptive Routing Algorithm for Dynamically Injured Hypercubes, Meshes, and Tori
IEEE Transactions on Parallel and Distributed Systems
Adaptive and Deadlock-Free Routing for Irregular Faulty Patterns in Mesh Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Routing algorithms for tree-hypercube networks
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Routing in quad tree-hypercube networks
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 2
Fault-tolerant routing on complete Josephus Cubes
ACSAC '01 Proceedings of the 6th Australasian conference on Computer systems architecture
Unsafety vectors: a new fault-tolerant routing for the binary n-cube
Journal of Systems Architecture: the EUROMICRO Journal
Building a Multicasting Tree in a High-Speed Network
IEEE Concurrency
A Genetic Routing Algorithm for a 2D-Meshed Fault-Tolerant Network System
AISA '02 Proceedings of the First International Workshop on Advanced Internet Services and Applications
Fault-tolerance of Complete Josephus Cubes
Journal of Systems Architecture: the EUROMICRO Journal
Fault-tolerant routing for complete Josephus cubes
Parallel Computing - Special issue: High-performance parallel bio-computing
IEEE Transactions on Parallel and Distributed Systems
Explanation of Performance Degradation in Turn Model
The Journal of Supercomputing
A fault-tolerant routing strategy for fibonacci-class cubes
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
| Hi-index | 0.00 |
This paper presents a partially adaptive fault-tolerant routing algorithm for hypercube multicomputers. The algorithm is tolerant to n驴 1 link and/or node faults for an n-cube. It makes routing decisions adaptively based on local failure information only. It is simple to implement and needs a very small message overhead. A comparison between the algorithm and a popular previous work is given.