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
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
A Fault-Tolerant Communication Scheme for Hypercube Computers
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
An Adaptive Fault-Tolerant Routing Algorithm for Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
A large scale, homogeneous, fully distributed parallel machine, I
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Fault-tolerant routing strategy using routing capability in hypercube multicomputers
ICPADS '96 Proceedings of the 1996 International Conference on Parallel and Distributed Systems
Optimal Fault-Tolerant Routing in Hypercubes Using Extended Safety Vectors
ICPADS '00 Proceedings of the Seventh International Conference on Parallel and Distributed Systems
Efficient fault-tolerant routing algorithm for OTIS-cube using unsafety vectors
Proceedings of the 2004 ACM symposium on Applied computing
Fault-tolerant routing in hypercubes using partial path set-up
Future Generation Computer Systems - Systems performance analysis and evaluation
Efficient routing algorithms on optoelectronic networks
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
| Hi-index | 0.00 |
This paper presents a new fault-tolerant routing algorithm for the binary n-cube which overcomes the limitations of the recently-proposed safety vectors algorithm (IEEE Trans. Parallel Distribut. Syst. 9 (4) (1998) 321). The algorithm is based on the concept of "unsafety vectors". Each node A starts by computing a first level unsafety set, S1A, composed of the set of unreachable neighbours. It then performs (m - 1) exchanges with its neighbours to determine the k-level unsafety set, SkA, for all 1 ≤ k ≤ m, where m is an adjustable parameter between 1 and n. SkA represents the set of all nodes at Hamming distance k from node A which are faulty or unreachable from A due to faulty nodes (or links). Equipped with these unsafety sets, each node calculates unsafety vectors, which are then used to achieve an efficient fault-tolerant routing in the binary n-cube. The kth element of the unsafety vector of node A represents a measure of the routing unsafety at distance k from A. We present an analytical study proving some properties of the proposed algorithm. We also conduct a comparative analysis through extensive simulation experiments that reveal the superiority of the proposed algorithm over the safety vectors algorithm (IEEE Trans. Parallel Distribut. Syst. 9 (4) (1998) 321) in terms of different performance measures, e.g. routing distances and percentage of reachability.