Browse > Article

Efficient Fault-Tolerant Multicast on Hypercube Multicomputer System  

명훈주 (서강대학교 공과대학 컴퓨터학과)
김성천 (서강대학교 공과대학 전자계산학과)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.30, no.5_6, 2003 , pp. 273-279 More about this Journal
Abstract
Hypercube multicomputers have been drawing considerable attention from many researchers due to their regular structure and short diameter. One of keys to the performance of Hypercube is the efficiency of communication among processors. Among several communication patterns, multicast is important, which is found in a variety of applications as data replication and signal processing. As the number of processors increases, the probability of occurrences of fault components also increases. So it would be desirable to design an efficient scheme that multicasts messages in the presence of faulty component. In fault-tolerant routing and multicast, there are local information based scheme, global information based scheme and limited information based scheme in terms of information. In general, limited information is easy to obtain and maintain by compressing information in a concise format. In this paper, we propose a new routing scheme and a new multicast scheme using recently proposed fully reachability information scheme and new local information scheme. The proposed multicast scheme increases multicast success possibility and reduce deroute cases. Experiments show that multicast success possibility can increase at least 15% compared to previous method.
Keywords
Hypercube; fault-tolerance; multicast; fully reachability; local information;
Citations & Related Records
연도 인용수 순위
  • Reference
1 J. Bruck, R. Cypher, and D. Soroker. 'Embedding cube-connected cycles graphs into faulty hyper-cube', IEEE Trans. Computers, 43(10), pp.1210-1220, October 1994   DOI   ScienceOn
2 C.-M. Chiu and K.-S. Chen, 'Efficient Fault-Tolerant Multicast Scheme for Hypercube Multi-computers', IEEE Trans. parallel and distributed systems, 9(10), pp.952-962   DOI   ScienceOn
3 Y. Saad and M.H. Shultz, 'Tological properties of hypercube,' IEEE Trans. Computers, 37(7): 867-872, July 1988   DOI   ScienceOn
4 Silicon Graphics, 'Origin 2000 and Origin 2000,' techinical report, Dec. 1996
5 Y. Lan. A. H. Esfahanian, and L.M. Ni, 'Multicast in hypercube mutliprocessors,' J. Parrallel and Distributed Computing, vol. 8, pp. 30-40, 1990   DOI   ScienceOn
6 X. Lin and L.M. Ni, 'Multicast communication in multicomputer networks,' Proc. 1990 Int'l Conf. Parallel Processing, Vol III, pp. 114-118, 1990
7 Keiichi Kaneko and Hideo Ito, 'Fault-Tolerant Routing Algorithms for Hypercube Networks,' IPPS 1999, pp.218-224, March 1999
8 N.-F. Tzeng and H.-L Chen. 'Structural and tree embedding aspects of incomplete hypercubes, 'IEEE Trans. Computers, 43(12):1434-1439, December 1994   DOI   ScienceOn
9 G.-M. Chiu and S.-P. Wu, 'A fault-tolerant routing strategy in hypercube multicomputers', IEEE Trans. Computers, 45(2), pp.143-155, February 1996   DOI   ScienceOn
10 Jie Wu and Kejun Yao, 'A Limited-Global-Information-Based Multicasting Scheme for Faulty Hypercube', IEEE Trans. Computers, 44(9), pp. 1162-1166, September 1995   DOI   ScienceOn