Jehad Al-Sadi
ABSTRACT
This paper describes a new fault-tolerant routing algorithm for the k-ary n-cube using the concept of "probability vectors". To compute these vectors, a node determines first its faulty set, which contains all its neighbouring nodes that are faulty or unreachable due to faulty nodes or links. Each node then calculates a probability vector, where the i-th element represents the probability that a destination node at distance i cannot be reached using a minimal path due to a faulty node or link. The probability vectors are used by all the nodes to achieve an efficient fault-tolerant routing in the network. Results from a performance analysis presented below show that the new algorithm exhibits good fault-tolerance properties in terms of the achieved percentage of reachablity and routing distances.
- J. Al-Sadi, K. Day, M. Ould-Khaoua, Probability-based fault-tolerant routing in hypercubes, Proc. Europar'2000, in Lecture Notes in Computer Science, Springer-Verlag, Munich, Aug. 29-Sept. 1, 2000, pp. 935-938.]] Google Scholar
Digital Library
- M. S. Chen, K. G. Shin, Adaptive fault-tolerant routing in hypercube multicomputers, IEEE Trans. Computers, vol. 39, no. 12, 1990, pp. 1406-1416.]] Google ScholarDigital Library
- M. S. Chen, K. G. Shin, On hypercube fault-tolerant routing using global information, Proc. 4th Conf. Hypercube Concurrent Computers & Applications, 1989, pp. 83-86.]]Google Scholar
- M. S. Chen, K. G. Shin, Depth-first search approach for fault-tolerant routing in hypercube multicomputers, IEEE Trans. Parallel & Distributed Systems, vol. 1, no. 2, 1990, pp. 152-159.]] Google ScholarDigital Library
- Cray Research Inc., The Cray T3E scalable parallel processing system, on Cray's web page at http://www.cray.com/PUBLIC/product-info/T3E.]]Google Scholar
- J. Duato, S. Yalamanchili, L. Ni, Interconnection networks: An engineering approach, IEEE Computer Society Press, 1997.]] Google ScholarDigital Library
- P. T. Gaughan, S. Yalamanchili, Adaptive routing protocols for hypercube interconnection networks, IEEE Computer, vol. 26, no. 5, 1993, pp. 12-24.]] Google ScholarDigital Library
- J. M. Gordon, Q. F. Stout, Hypercube message routing in the presence of faults, Proc. 3rd Conf. Hypercube Concurrent Computers and Applications, 1988, pp. 251-263.]] Google ScholarDigital Library
- L. Gravano, G. Pifarre, P. Berman, J. Sanz, Adaptive deadlock- and livelock-free routing with all minimal paths in torus networks, IEEE Trans. Parallel & Distributed Systems, vol. 5, no. 12, 1994, pp. 1233-1251.]] Google ScholarDigital Library
- R. E. Kessler, J. L. Schwarzmeier, CRAY T3D: A new dimension for Cray Research, in CompCon, Spring 1993, pp. 176-182.]]Google Scholar
- S. F. Nugent, The iPSC/2 Direct-Connect communication technology, Proc. Conf. on Hypercube Concurrent Computers & Applications, vol. 1, pp. 51-60, 1988.]] Google ScholarDigital Library
- C. P. Ravikumar, C. S. Panda, Adaptive routing in k-ary n-cubes using incomplete diagnostic information, Microprocessors and Microsystems, vol. 20, 1997, pp. 351-360.]]Google ScholarCross Ref
- H. Sarbazi-Azad, M. Ould-Khaoua, L. M. Mackenzi, An accurate model of adaptive wormhole routing in k-ary n-cubes interconnection networks, Performance Evaluation vol. 43, 2001, pp. 165-179.]] Google ScholarDigital Library
- J. P. Sheu, M. Y. Su, A multicast algorithm for hypercube multiprocessors, Proc. Int. Conf. Parallel Processing, 1992, pp. 18-22.]]Google Scholar
- B. Vanvoorst, S. Seidel, E. Barscz, Workload of an iPSC/860, Proc. Scalable High-Performance Computing Conf., 1994, pp.221-228.]]Google ScholarCross Ref
- J. Wu, Adaptive fault-tolerant routing in cube-based multicomputers using safety vectors, IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 4, 1998, pp. 321-334.]] Google ScholarDigital Library
- J. Wu, F. Gao, Z. Li, Y. Min, Optimal Fault-Tolerant Routing in Hypercubes Using Extended Safety Vectors, Proc. of 7th International Conf. on Parallel and Distributed Systems (ICPADS'2000), July 2000, pp. 264-271.]] Google ScholarDigital Library
Index Terms
- Probability vectors: a new fault-tolerant routing algorithm for k-ary n-cubes
Recommendations
Unsafety vectors: a new fault-tolerant routing for the binary n-cube
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 ...
A New Probabilistic Approach for Fault-Tolerant Routing in k-Ary n-Cubes
ICPADS '02: Proceedings of the 9th International Conference on Parallel and Distributed SystemsThis paper describes the new fault-tolerant routingalgorithm for k-ary n-cubes using the concept of"probability vectors"[2] and conducts an extensiveperformance analysis for the new algorithm. To computethese vectors, a node determines first its faulty ...
A fault-tolerant routing algorithm in HyperX topology based on unsafety vectors
HyperX is a promising high-radix topology proposed by a group of researchers in HP laboratories. The topology offers numerous advantages of high-radix routers, among which are very low diameter and low average distance. Increasing degree of routers and ...
Comments