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
Supercube: An optimally fault tolerant network architecture
Acta Informatica
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
Network reliability and algebraic structures
Network reliability and algebraic structures
IEEE Transactions on Computers
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
Packet routing in fixed-connection networks: a survey
Journal of Parallel and Distributed Computing
IEEE Spectrum - Special issue on technology 1999, analysis and forecast
The Josephus cube: a novel interconnection network
Parallel Computing
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
Embedding Graphs onto the Supercube
IEEE Transactions on Computers
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
Properties and Performance of Folded Hypercubes
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 |
The Complete Josephus Cube is proposed as a fault-tolerant node cluster architecture A reliable and cost-effective communications strategy is also presented. For a Complete Josephus Cube of dimension r, the strategy tolerates up to (r + 1) encountered faults in its routes that are deadlock-free and livelock-free. The message is optimally (respectively, sub-optimally) delivered in at most r (respectively, 2r + 1) hops. Message overhead is one of the lowest reported for the specified fault tolerance--with only a single (r + 2)-bit routing vector accompanying the message to be communicated. Associated routing hardware may be implemented with standard logic.