Communications of the ACM - Special section on computer architecture
Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Message routing in an injured hypercube
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
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
The technology of parallel processing: parallel processing architectures and VLSI hardware (vol. 1)
The technology of parallel processing: parallel processing architectures and VLSI hardware (vol. 1)
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
On the design of deadlock-free adaptive routing algorithms for multicomputers: theoretical aspects
EDMCC2 Proceedings of the 2nd European conference on Distributed memory computing
A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers
IEEE Transactions on Computers
Flexible routing criteria for circuit-switched hypercubes
Journal of Parallel and Distributed Computing
Cooperative diagnosis and routing in fault-tolerant multiprocessor systems
Journal of Parallel and Distributed Computing
Communications of the ACM - Special issue on parallelism
A Fault-Tolerant Communication Scheme for Hypercube Computers
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
Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Reliable Unicasting in Faulty Hypercubes Using Safety Levels
IEEE Transactions on Computers
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 Transactions on Parallel and Distributed Systems
Fault-Tolerant Routing in Hypercube Multicomputers Using Local Safety Information
IEEE Transactions on Parallel and Distributed Systems
A Low-Cost Fault-Tolerant Structure for the Hypercube
The Journal of Supercomputing
Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results
IEEE Transactions on Computers
Unsafety vectors: a new fault-tolerant routing for the binary n-cube
Journal of Systems Architecture: the EUROMICRO Journal
A Rectilinear-Monotone Polygonal Fault Block Model for Fault-Tolerant Minimal Routing in Mesh
IEEE Transactions on Computers
Strong Fault-Tolerance: Parallel Routing in Networks with Faults
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Adaptive Fault-Tolerant Wormhole Routing Algorithms for Hypercube and Mesh Interconnection
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Fault Tolerant Algorithms for a Linear Array with a Reconfigurable Pipelined Bus System
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Implementation of Finite Lattices in VLSI for Fault-State Encoding in High-Speed Networks
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
A Genetic Routing Algorithm for a 2D-Meshed Fault-Tolerant Network System
AISA '02 Proceedings of the First International Workshop on Advanced Internet Services and Applications
Fault-tolerant wormhole routing for hypercube networks
Information Processing Letters
Journal of Parallel and Distributed Computing
Fault-tolerant multicasting in hypercubes using local safety information
Journal of Parallel and Distributed Computing
Fault-tolerant routing in hypercubes using partial path set-up
Future Generation Computer Systems - Systems performance analysis and evaluation
Journal of Systems Architecture: the EUROMICRO Journal
Unicast-based fault-tolerant multicasting in wormhole-routed hypercubes
Journal of Systems Architecture: the EUROMICRO Journal
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
Broadcast in the locally k-subcube-connected hypercube networks with faulty tolerance
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
| Hi-index | 14.99 |
We investigate fault-tolerant routing which aims at finding feasible minimum paths in a faulty hypercube. The concept of unsafe node and its extension are used in our scheme. A set of stringent criteria is proposed to identify the possibly bad candidates for forwarding a message. As a result, the number of such undesirable nodes is reduced without sacrificing the functionality of the mechanism. Furthermore, the notion of degree of unsafeness for classifying the unsafe nodes is introduced to facilitate the design of efficient routing algorithms which rely on having each node keep the states of its nearest neighbors. We show that a feasible path of length no more than the Hamming distance between the source and the destination plus four can always be established by the routing algorithm as long as the hypercube is not fully unsafe. The issue of deadlock freeness is also addressed in this research. More importantly, another fault-tolerant routing algorithm, which requires only a constant of five virtual networks in wormhole routing to ensure the property of deadlock freeness for a hypercube of any size, is presented in this paper.