Browse > Article

Efficient All-to-All Personalized Communication Algorithms in Wormhole-Routed Networks  

김시관 (금오공과대학교 컴퓨터공학부)
강오한 (안동대학교 컴퓨터교육과)
정종인 (공주대학교 컴퓨터교육과)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.30, no.7_8, 2003 , pp. 359-369 More about this Journal
Abstract
We present efficient generalized algorithms for all-to-all personalized communication operations in a 2D torus. All-to-all personalized communication, or complete exchange, is at the heart of numerous applications, such as matrix transposition, Fast Fourier Transform(FFT), and distributed table lookup. Some algorithms have been Presented when the number of nodes is power-of-2 or multiple-of-four form, but there has been no result for general cases yet. We first present complete exchange algorithm called multiple-Hop-2D when the number of nodes is in the form of multiple-of-two. Then by extending this algorithm, we present two algorithms for an arbitrary number of nodes. Split-and-Merge algorithm first splits the whole network into zones. After each zone performs complete exchange, merge is applied to finish the desired complete exchange. By handling extra steps in Double-Hop-2D algorithm, Modified Double-Hop-2D algorithm performs complete exchange operation for general cases. Finally, we compare the required start-up time for these algorithms.
Keywords
Wormhole Routing; Collective Communication; Torus; All-to-All Communication;
Citations & Related Records
연도 인용수 순위
  • Reference
1 P.K. McKinley, Y.J. Tsai and D.F. Robinson, 'A Survey of Collective Communication in Wormhole Routed Massively Parallel Computers,' Technical Report, MSU-CPS 94 35, Michigan State University, June 1994
2 S. Bokhari and H. Berryman, 'Complete exchange on a circuit switched mesh,' Proc. of the 1992 Scalable High Performance Computing Conference, pp.300-306, 1992   DOI
3 J. Li and M. Chen, 'Compiling Communication efficient programs for massively parallel machines,' IEEE Tran. on Parallel and Ditributed Systems, vol. 2, pp. 361-375, July 1991   DOI   ScienceOn
4 X. Lin and L.M. Ni, 'Multicast Communications in Multicomputer Networks,' Proc. of Int'l Conf. on Parallel Processing, 1990, Vol. III, pp.114-118
5 V. Kumar, A. Grama, and G. Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms, Redwood City, CA: Benjamin/Cummings, 1994
6 P.K. McKinley, H. Xu, and L.M. Ni, 'Efficient Communication Servies for Scalable Architectures,' Technical Report, MSU CPS ACS-58, Dept. of Com. Sci., Michigan State University, East Lansing, MI, Apr. 1992
7 B. Nitzberg and V. Lo, 'Distributed shared Memory: A survey of issues and algorithms,' IEEE Computers, Vol. 24, pp.52-60, Aug. 1991   DOI   ScienceOn
8 P. K. McKinley, H. Xu, A. H. Esfahanian, and L. M. Ni, 'Unicast based Multicast Communication in Wormhole routed Networks,' IEEE Trans actions on Parallel and Distributed Systems, 5(12):1252-1265, Dec 1994   DOI   ScienceOn
9 Message Passing Interface Forum, 'Document for standard message passing interface,' Technical Report CS 93 214, University of Tennessee, Nov. 1993
10 L.M. Ni and P.K. McKinley, 'A Survey of Wormhole Routing Techniques in Direct Networks,' IEEE Computer, Vol. 26, No. 2, pp.62-76, Feb. 1993   DOI   ScienceOn
11 D.A. Reed and R.M. Fujimoto, Multicomputer Networks: Message Based Parallel Processing, MIT Press, Cambridge, MA, 1987
12 N. Sundar, D. Jayasimha, D. Panda, and P. Sadayappan, 'Complete exchange in 2D Meshes,' Proc. of the 1994 Scalable High Performance Computing Conference, pp.406-413, 1994   DOI
13 Yunayuan Yang and Jianchao Wang, 'Optimal All to All Personalized Exchange in Self Routable Multistage Networks,' IEEE Tran. on Parallel and Distributed Systems, Vol. 11, No. 3, pp. 261-274, Mar. 2000   DOI   ScienceOn
14 R. Thakur and A. Choudhary, 'All to all Communication on meshes with wormhole routing,' Proc. of the 1994 International Parallel Processing Symposium, pp.561-565, 1994   DOI
15 Y.C. Tseng and S. Gupta, 'All-to All Person alized Communication in a Wormhole Routed Torus,' IEEE Tran. on Parallel and Distributed Systems, Vol. 7, No. 5, pp.498-505, May 1996   DOI   ScienceOn
16 Y.C. Tseng, T.H. Lin, S. Gupta and D.K. Panda, 'Bandwidth Optimal Complete Exchange on Wormhole Routed 2D/3D Torus Networks: A Diagonal Propagation Approach,' IEEE Tran. on Parallel and Distributed Systems, Vol. 8, No. 4, pp. 380-396, Apr. 1997   DOI   ScienceOn
17 W.C. Athas and C.L. Seitz, Multicomputers: Message Passing Concurrent Computers,' IEEE Computers, Vol. 21, No. 8, pp.9-24, Aug. 1988   DOI   ScienceOn
18 D.F. Robinson, D. Judd, P.K. McKinley, and B.H.C. Cheng, 'Efficient Collective Data Distribution in All Port Wormhole Routed Hypercubes,' Proc. of Supercomputing '93, Nov. 1993, pp.792-801   DOI
19 Y. Suh and S. Yalamanchili, 'Efficients Algorithms for Complete exchange in 2D Tori,' Proc. of the 9th IASTED Int'l Conference Parallel and Distributed Computing and Systems, pp.113-119, 1997
20 Y. Suh and Kang, G. Shin, 'All to All Personalized Communicaton in Multidimensional Torus and Mesh Networks,' IEEE Tran. on Parallel and Ditributed Systems, Vol. 12, No. 1, pp. 38-59, Jan. 2001   DOI   ScienceOn
21 X. Lin and L. Ni, 'Multicast communication in multicomputer networks,' IEEE Tran. on Parallel and Ditributed Systems, vol. 4, no. 10, pp. 1104-1117, October 1993   DOI   ScienceOn