Communications of the ACM - Special section on computer architecture
Hypercube message routing in the presence of faults
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
A Fault-Tolerant Communication Scheme for Hypercube Computers
IEEE Transactions on Computers
A Limited-Global-Information-Based Multicasting Scheme for Faulty Hypercubes
IEEE Transactions on Computers
A Fault-Tolerant Routing Strategy in Hypercube Multicomputers
IEEE Transactions on Computers
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant routing strategy using routing capability in hypercube multicomputers
ICPADS '96 Proceedings of the 1996 International Conference on Parallel and Distributed Systems
Fault-Tolerant Routing in Hypercube Multicomputers Using Local Safety Information
IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant routing on complete Josephus Cubes
ACSAC '01 Proceedings of the 6th Australasian conference on Computer systems architecture
A Low-Cost Fault-Tolerant Structure for the Hypercube
The Journal of Supercomputing
Unsafety vectors: a new fault-tolerant routing for the binary n-cube
Journal of Systems Architecture: the EUROMICRO Journal
Fault-tolerant wormhole routing for hypercube networks
Information Processing Letters
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
Fault-tolerant routing in hypercubes using partial path set-up
Future Generation Computer Systems - Systems performance analysis and evaluation
Fault-tolerant routing based on approximate directed routable probabilities for hypercubes
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
Hi-index | 14.98 |
The concept of routing capability is proposed to assist fault-tolerant routing in hypercubes. Routing capability is defined with respect to the entire spectrum of distance. As a result, the amount of information that is useful for message routing is increased. An algorithm is presented to facilitate efficient fault-tolerant routing of messages. The algorithm routes a message in an attempt to minimize derouting. Furthermore, the concept of directed routing capability which contains more useful information for fault-tolerant routing is introduced. Simulation results demonstrate the usefulness of our approach.