Probability vectors: A new fault-tolerant routing algorithm for k-Ary n-cubes

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2002, Pages 830-834

  Al Sadi, Jehad ^a   Day, Khaled ^a   Ould Khaoua, Mohamed ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

Fault Tolerant routing; k Ary n Cubes; Multicomputers; Performance analysis; Probability

Indexed keywords

ALGORITHMS; FAULT TOLERANT COMPUTER SYSTEMS; PROBABILITY; ROUTERS; VECTORS;

FAULT TOLERANT ROUTING; MULTICOMPUTERS; PROBABILITY VECTORS;

COMPUTER NETWORKS;

EID: 0036041869     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Probability-based fault-tolerant routing in hypercubes
2. Adaptive fault-tolerant routing in hypercube multicomputers
3. On hypercube fault-tolerant routing using global information
4. Depth-first search approach for fault-tolerant routing in hypercube multicomputers
5. Adaptive routing protocols for hypercube interconnection networks
6. Hypercube message routing in the presence of faults
7. Adaptive deadlock- and livelock-free routing with all minimal paths in torus networks
8. CRAY T3D: A new dimension for cray research
9. The iPSC/2 Direct-Connect communication technology
10. Adaptive routing in k-ary n-cubes using incomplete diagnostic information
11. An accurate model of adaptive wormhole routing in k-ary n-cubes interconnection networks
12. A multicast algorithm for hypercube multiprocessors
13. Workload of an iPSC/860
14. Adaptive fault-tolerant routing in cube-based multicomputers using safety vectors
15. Optimal fault-tolerant routing in hypercubes using extended safety vectors