
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Jehoshua Bruck, ChingTien Ho, Shlomo Kipnis, Eli Upfal, Derrick Weathersby, "Efficient Algorithms for AlltoAll Communications in Multiport MessagePassing Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 11, pp. 11431156, November, 1997.  
BibTex  x  
@article{ 10.1109/71.642949, author = {Jehoshua Bruck and ChingTien Ho and Shlomo Kipnis and Eli Upfal and Derrick Weathersby}, title = {Efficient Algorithms for AlltoAll Communications in Multiport MessagePassing Systems}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {8}, number = {11}, issn = {10459219}, year = {1997}, pages = {11431156}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.642949}, 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  Efficient Algorithms for AlltoAll Communications in Multiport MessagePassing Systems IS  11 SN  10459219 SP1143 EP1156 EPD  11431156 A1  Jehoshua Bruck, A1  ChingTien Ho, A1  Shlomo Kipnis, A1  Eli Upfal, A1  Derrick Weathersby, PY  1997 KW  Alltoall broadcast KW  alltoall personalized communication KW  complete exchange KW  concatenation operation KW  distributedmemory system KW  index operation KW  messagepassing system KW  multiscatter/gather KW  parallel system. VL  8 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—We present efficient algorithms for two alltoall communication operations in messagepassing systems:
In the index operation among
In the concatenation operation, among
[1] V. Bala,J. Bruck,R. Bryant,R. Cypher,P. deJong,P. Elustondo,D. Frye,A. Ho,C.T. Ho,G. Irwin,S. Kipnis,R. Lawrence,, and M. Snir,“The IBM external user interface for scalable parallel systems,” Parallel Computing, vol. 20, no. 4, pp. 445462, Apr. 1994.
[2] V. Bala, J. Bruck, R. Cypher, P. Elustondo, A. Ho, C.T. Ho, S. Kipnis, and M. Snir, "CCL: A Portable and Tunable Collective Communication Library for Scalable Parallel Computers," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 2, pp. 154164, Feb. 1995.
[3] A. BarNoy and S. Kipnis,“Designing broadcasting algorithms in the postal model formessagepassing systems,” Math. Systems Theory, vol. 27, no. 5, pp. 431452, 1994.
[4] L. Bhuyan and D. Agrawal, "Generalized Hypercube and Hyperbus Structures for a Computer Network," IEEE Trans. Computers, vol. 33, no. 4, pp. 323333, Apr. 1984.
[5] S. Bokhari, "Multiphase Complete Exchange on a CircuitSwitched Hypercube," Proc. 1991 Int'l Conf. Parallel Processing, vol. I, pp. 525528, Aug. 1991.
[6] J. Bruck, R. Cypher, L. Gravano, A. Ho, C.T. Ho, S. Kipnis, S. Konstantinidou, M. Snir, and E. Upfal, "Survey of Routing Issues for the Vulcan Parallel Computer," IBM Research Report, RJ8839, June 1992.
[7] J. Bruck, R. Cypher, and C.T. Ho, "FaultTolerant Meshes and Hypercubes with Minimal Numbers of Spares," IEEE Trans. Computers, vol. 42, no. 9, pp. 1,0891,104, Sept. 1993.
[8] C.Y. Chu, "Comparison of Twodimensional FFT Methods on the Hypercubes," Proc. Third Conf. Hypercube Concurrent Computers and Applications, pp. 1,4301,437, 1988.
[9] D. Culler,R. Karp,D. Patterson,A. Sahay,K.E. Schauser,E. Santos,R. Subramonian,, and T. von Eicken,“LogP: Towards a realistic model of parallel computation,” Fourth Symp. Principles and Practices Parallel Programming, SIGPLAN’93, ACM, May 1993.
[10] W.J. Dally, A. Chien, S. Fiske, W. Horwat, J. Keen, M. Larivee, R. Lethin, P. Nuth, S. Wills, P. Carrick, and G. Fyler, "The JMachine: a FineGrain Concurrent Computer," Proc. Information Processing '89, pp. 1,1471,153, 1989.
[11] B. Elspas and J. Turner, "Graphs with Circulant Adjacency Matrices," J. Combinatorial Theory, no. 9, pp. 297307, 1970.
[12] G. Fox,M. Johnson,G. Lyzenga,S. Otto,J. Salmon,, and D. Walker,Solving Problems on Concurrent Processors, Vol. I: General Techniques andRegular Problems.Englewood Cliffs, N.J.: Prentice Hall 1988.
[13] P. Fraigniaud and E. Lazard, "Methods and Problems of Communication in Usual Networks," Discrete Applied Math., vol. 53, pp. 79133, 1994.
[14] G.A. Geist, M.T. Heath, B.W. Peyton, and P.H. Worley, "A User's Guide to PICL: A Portable Instrumented Communication Library," ORNL Technical Report no. ORNL/TM11616, Oct. 1990.
[15] G.A. Geist and V.S. Sunderam, "Network Based Concurrent Computing on the PVM System," ORNL Technical Report no. ORNL/TM11760, June 1991.
[16] S.M. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman, "A Survey of Gossiping and Broadcasting in Communication Networks," Networks, vol. 18, pp. 319349, 1988.
[17] R. Hempel, "The ANL/GMD Macros (PARMACS) in FORTRAN for Portable Parallel Programming Using the Message Passing Programming Model, User's Guide and Reference Manual," technical memorandum, Gesellschaft füMathematik und Datenverabeitung mbH, West Germany.
[18] C.T. Ho and M.T. Raghunath, "Efficient Communication Primitives on Hypercubes," Concurrency: Practice and Experience, vol. 4, no. 6, pp. 427458, Sept. 1992.
[19] S.L Johnsson and C.T. Ho, "Matrix Multiplication on Boolean Cubes Using Generic Communication Primitives," Parallel Processing and MediumScale Multiprocessors, A. Wouk, ed., pp. 108156. SIAM, 1989.
[20] S.L. Johnsson and C.T. Ho,“Spanning graphs for optimum broadcasting and personalizedcommunication in hypercubes,” IEEE Trans. Computers, vol. 38, no. 9, pp. 1,2491,268, Sept. 1989.
[21] S.L. Johnsson and C.T. Ho, "Optimizing Tridiagonal Solvers for Alternating Direction Methods on Boolean Cube Multiprocessors," SIAM J. Scientific and Statistical Computing, vol. 11, no. 3, pp. 563592, 1990.
[22] S.L. Johnsson, C.T. Ho, M. Jacquemin, and A. Ruttenberg, "Computing Fast Fourier Transforms on Boolean Cubes and Related Networks," Advanced Algorithms and Architectures for Signal Processing II, vol. 826, pp. 223231. Soc. PhotoOptical Instrumentation Engineers, 1987.
[23] O.A. McBryan and E.F. Van de Velde, "Hypercube Algorithms and Implementations," SIAM J. Scientific and Statistical Computing, vol. 8, no. 2, pp. 227287, Mar. 1987.
[24] Message Passing Interface Forum, MPI: A MessagePassing Interface Standard, May 1994.
[25] J.F. Palmer, "The NCUBE Family of Parallel Supercomputers," Proc. Int'l Conf. Computer Design, 1986.
[26] F.P. Preparata and J. Vuillemin, “The CubeConnected Cycles: A Versatile Network for Parallel Computation,” Comm ACM, vol. 24, no. 5, pp. 300309, 1981.
[27] A. Skjellum and A.P. Leung, "Zipcode: A Portable Multicomputer Communication Library Atop the Reactive Kernel," Proc. Fifth Distributed Memory Computing Conf., pp. 328337, Apr. 1990.
[28] P.N. Swarztrauber, "The Methods of Cyclic Reduction, Fourier Analysis, and the FACR Algorithm for the Discrete Solution of Poisson's Equation on a Rectangle," SIAM Rev., vol. 19, pp. 490501, 1977.
[29] Connection Machine CM5 Technical Summary. Thinking Machines Corporation, 1991.
[30] L.G. Valiant, “A Bridging Model for Parallel Computation,” Comm. ACM, vol. 33, no. 8, pp. 103111, Aug. 1990.
[31] Express 3.0 Introductory Guide. Parasoft Corporation, 1990.