
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
YuChee Tseng, TingHsien Lin, Sandeep K. S. Gupta, Dhabaleswar K. Panda, "BandwidthOptimal Complete Exchange on WormholeRouted 2D/3D Torus Networks: A DiagonalPropagation Approach," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 4, pp. 380396, April, 1997.  
BibTex  x  
@article{ 10.1109/71.588613, author = {YuChee Tseng and TingHsien Lin and Sandeep K. S. Gupta and Dhabaleswar K. Panda}, title = {BandwidthOptimal Complete Exchange on WormholeRouted 2D/3D Torus Networks: A DiagonalPropagation Approach}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {8}, number = {4}, issn = {10459219}, year = {1997}, pages = {380396}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.588613}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  BandwidthOptimal Complete Exchange on WormholeRouted 2D/3D Torus Networks: A DiagonalPropagation Approach IS  4 SN  10459219 SP380 EP396 EPD  380396 A1  YuChee Tseng, A1  TingHsien Lin, A1  Sandeep K. S. Gupta, A1  Dhabaleswar K. Panda, PY  1997 KW  Collective communication KW  complete exchange KW  distributed memory systems KW  interprocessor communication KW  parallel computing KW  torus KW  wormhole routing. VL  8 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—Alltoall personalized communication, or complete exchange, is at the heart of numerous applications in parallel computing. Several complete exchange algorithms have been proposed in the literature for wormhole meshes. However, these algorithms, when applied to tori, cannot take advantage of wraparound interconnections to implement complete exchange with reduced latency. In this paper, a new
[1] G. Bilardi and F.P. Preparata, "Horizons of Parallel Computation," J. Parallel and Distributed Computing, vol. 27, pp. 172182, 1996.
[2] S.H. Bokhari, H. Berryman, "Complete Exchange on a Circuit Switched Mesh," Proc. Scalable High Performance Computing Conf., pp. 300306, 1992.
[3] S. Borkar, R. Cohn, G. Cox, S. Gleason, T. Gross, H.T. Kung, M. Lam, B. Moore, C. Peterson, J. Pieper, L. Rankin, P.S. Tseng, J. Sutton, J. Urbanski, and J. Webb iWarp: An Integrated Solution to HighSpeed Parallel Computing, Proc. 1988 Int'l Conf. Supercomputing, pp. 330339., IEEE CS and ACM SIGARCH, Orlando, Fla., Nov. 1988.
[4] Cray T3D System Architecture Overview. Cray Research, Inc., 1993.
[5] W.J. Dally, R. Davison, J.A.S. Fiske, G. Fyler, J.S. Keen, R.A. Lethin, M. Noakes, and P.R. Nuth, "The JMachine: A FineGrain Concurrent Computer," Proc. Information Processing 89, IFIP, pp. 1,1471,153, 1989.
[6] W.J. Dally and C.L. Seitz, "The Torus Routing Chip," J. Parallel and Distributed Computing, vol. 1, no. 3, pp. 187196, 1986.
[7] I.T. Foster, Designing and Building Parallel Programs AddisonWesley, Reading, Mass., 1995.
[8] P. Fragopoulou and S.G. Akl, "A Framework for Optimal Communication on the Multidimensional Torus Network," Technical Report 94363, Dept. of Computing and Information Science, Queen's Univ., 1994.
[9] S. Gupta, S. Hawkinson, and B. Baxter, "A Binary Interleaved Algorithm for Complete Exchange on a Mesh Architecture," technical report, Intel Corp., 1994.
[10] S. Hinrichs, C. Kosak, D.R. O'Hallaron, T.M. Sticker, and R. Take, "An Architecture for Optimal AlltoAll Personalized Communication," Proc. Symp. Parallel Algorithms and Architectures, pp. 310319, 1994.
[11] H. Li and M. Maresca,“Polymorphictorus network,” IEEE Trans. on Computers, vol. 38, no. 9, pp. 13451351, Sept. 1989.
[12] M. Lin, R.P. Tsang, and D. Du, "Performance Characteristics of the Connection Machine Hypertree Network," J. Parallel and Distributed Computing, vol. 19, pp. 245254, 1993.
[13] MP1 Family DataParallel Computers. MasPar Computer Co.
[14] MPI: A MessagePassing Interface Standard. Message Passing Interface Forum, May 1994.
[15] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 6276, Feb. 1993.
[16] W. Oed, Massively Parallel Processor System Cray T3D. Cray Research GmbH, 1993.
[17] D.S. Scott, "Efficient AlltoAll Communication Patterns in Hypercube and Mesh Topologies," Proc. Sixth Conf. Distributed Memory Concurrent Computers, pp. 398403, 1991.
[18] S.R. Seidel, "Circuit Switched vs. StoreandForward Solutions to Symmetric Communication Problems," Proc. Fourth Conf. Hypercube Concurrent Computers and Applications, pp. 253255, 1989.
[19] N.S. Sundar, D.N. Jayasimha, D.K. Panda, and P. Sadayappan, "Complete Exchange in 2D Meshes," Proc. Scalable High Performance Computing Conf., pp. 406413, 1994.
[20] M.R. Thistle and B.J. Smith, "A Processor Architecture for Horizon," Proc. Supercomputing, pp. 3541, 1988.
[21] Y.C. Tseng and S. Gupta, “AlltoAll Personalized Communication in a WormholeRouted Torus,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 5, pp. 498505, May 1996.
[22] Y.C. Tseng, S. Gupta, and D. Panda, "An Efficient Scheme for Complete Exchange in 2D Tori," Proc. Int'l Parallel Processing Symp. pp. 532536, 1995.