Adaptive Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
Linear Recursive Networks and Their Applications in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A nationwide parallel computing environment
Communications of the ACM
Use of Routing Capability for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
Adaptive Fault-Tolerant Routing in Cube-Based Multicomputers Using Safety Vectors
IEEE Transactions on Parallel and Distributed Systems
Communications of the ACM
IEEE Spectrum - Special issue on technology 1999, analysis and forecast
Development of supercomputers in Japan: hardware and software
Parallel Computing - Special Anniversary issue
IEEE Transactions on Parallel and Distributed Systems
The Josephus cube: a novel interconnection network
Parallel Computing
Safety Levels-An Efficient Mechanism for Achieving Reliable Broadcasting in Hypercubes
IEEE Transactions on Computers
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
An Adaptive Fault-Tolerant Routing Algorithm for Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
This paper proposes and analyses a fault-tolerant routing system for the Complete Josephus Cube [Parallel Computing 26 (2000) 427]. For a Complete Josephus Cube of dimension r, the routing strategy tolerates at least (r + 1) and up to 2(r - 1) encountered component faults. Routes generated are free from cycles and guarantee message delivery. Within stated fault conditions, the message is routed within a maximum of (2(r - 1)) hops. The message overhead incurred is low for the specified fault tolerance level. Finally, our router design shows that hardware support may be simply achieved with practical components, facilitating integration with the host network.