Abstract
A fault-tolerant and heuristic routing algorithm for faulty hypercube systems is described. To improve the efficiency, the algorithm adopts a heuristic backtracking strategy and each node has an array to record its all neighbors’ faulty link information to avoid unnecessary searching for the known faulty links. Furthermore, the faulty link information is dynamically accumulated and the technique of heuristically searching for optimal link is used. The algorithm routes messages through the minimum feasible path between the sender and receiver if at least one such path exists, and takes the optimal path with higher probability when faulty links exist in the faulty hypercube.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Saad Y, Schultz M H. Topological properties of hypercubes.IEEE Transactions On Computers, 1988, 37: 867–872.
Sullivan H, Bashkow T, Klappholz D. A large scale, homogeneous, fully distributed parallel machine. InProc. 4th Symp. on Computer Architecture, Mar. 1977. pp.105–124.
Ho C T, Johnson L. Distributed routing algorithms for broadcasting and personalized communication in hypercubes. InProc. of the 1986 Inter. Conf. on Parallel Processing, 1986,pp. 640–648.
Katseff H. Incomplete hypercubes.IEEE Transactions On Computers, 1988, 37: 604–608.
Gordon J M, Stout Q F. Hypercube message routing in the presence of faults. InProc. 3rd Conf. on Hypercube Concurrent Comput. and Appl., Jan. 1988, pp. 318–327.
Lee Tze Chiang, Hayes John P. A fault-tolerant communication scheme for hypercube computers.IEEE Transactions on Computers, 1992, 41: 1242–1256.
Chen M S, Shin K G. Depth-first search approach for fault-tolerant routing in hypercube multicomputers.IEEE Trans. on Parallel and Distributed Systems, 1990, 1(2): 152–159.
Chow E, Madan H, Peterson J, Grunwald D, Reed D. Hyperwitch network for the hypercube computer. InProc. 15th Symp. on Computer Architecture, 1988, pp. 90–99.
Hayes J P, Mudge T N, Stout Q F. Architecture of a hypercube supercomputer. InProc. of the 1986 Inter. Conf. on Parallel Processing, 1986, pp. 653–660.
Won Y, Sahni S. Maze routing on a hypercube multiprocessor computer. InProc. of the 1987 Inter. Conf. on Parallel Processing, 1987, pp. 630–637.
Author information
Authors and Affiliations
Additional information
This work is supported by The National Natural Science Foundation of China under Grant No. 69473024.
Min Youli received his B.S. and M.S. degrees both from University of Science and Technology of China in 1982 and 1984 respectively, and his Ph.D. degree from Insitute of Computing Technology, The Chinese Academy of Sciences in 1995 all in Computer Science. He was a Lecturer at the Department of Computer, East China Institute of Technology during 1986–1992. He now works with People’s Construction Bank of China. His research interests include fault-tolerance and reliability and database systems.
Min Yinghua graduated from the Department of Mathematics at Jilin University in 1962 and visited Stanford University and other universities in USA during the years of 1981–1987. He is now a Professor of computing science at the Institute of Computing Technology, The Chinese Academy of Sciences. His research interests include electronic testing, reliable and high performance computing. He is a senior member of IEEE and IEEE Computer Society. He serves on the editorial board of Journal of Electronic Testing (JETTA), and Journal of Computer Science and Technology. He was the Program Chairman of the Second IEEE Asian Test Symposium, and now serves on the Program Committees of five IEEE International Conferences.
Rights and permissions
About this article
Cite this article
Min, Y., Min, Y. A fault-tolerant and heuristic routing algorithm for faulty hypercubes. J. of Comput. Sci. & Technol. 10, 536–544 (1995). https://doi.org/10.1007/BF02943511
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02943511