Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Interconnection networks for high-performance parallel computers
Interconnection networks for high-performance parallel 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
IEEE Spectrum - Special issue on technology 1999, analysis and forecast
The Josephus cube: a novel interconnection network
Parallel Computing
An Adaptive Fault-Tolerant Routing Algorithm for Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
This paper introduces the Complete Josephus Cube, a fault-tolerant class of the recently proposed Josephus Cube [12] and proposes a cost-effective, fault-tolerant routing strategy for the Complete Josephus Cube. For a Complete Josephus Cube of order r, the routing algorithm can tolerate up to (r + 1) encountered component faults in its message path and generates routes that are both deadlock-free and livelock-free. The message is guaranteed to be optimally (respectively, sub-optimally) delivered within a maximum of r (respectively, 2r + 1) hops. The message overhead incurred is only a single (r + 2)-bit routing vector accompanying the message to be communicated.