
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Vassilios V. Dimakopoulos, Nikitas J. Dimopoulos, "Optimal Total Exchange in Cayley Graphs," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 11, pp. 11621168, November, 2001.  
BibTex  x  
@article{ 10.1109/71.969126, author = {Vassilios V. Dimakopoulos and Nikitas J. Dimopoulos}, title = {Optimal Total Exchange in Cayley Graphs}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {12}, number = {11}, issn = {10459219}, year = {2001}, pages = {11621168}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.969126}, 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  Optimal Total Exchange in Cayley Graphs IS  11 SN  10459219 SP1162 EP1168 EPD  11621168 A1  Vassilios V. Dimakopoulos, A1  Nikitas J. Dimopoulos, PY  2001 KW  Cayley graphs KW  collective communications KW  interconnection networks KW  nodeinvariant algorithms KW  total exchange (alltoall personalized communication). VL  12 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—Consider an interconnection network and the following situation: Every node needs to send a different message to every other node. This is the
[1] S.B. Akers and B. Krishnamurthy, “A GroupTheoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555566, Apr. 1989.
[2] F.S. Annexstein, M. Baumslag, and A.L. Rosenberg, “Group Action Graphs and Parallel Architectures,” SIAM J. Computing, vol. 19 pp. 544569, 1990.
[3] P. Berthome, A. Ferreira, and S. Perennes, “Optimal Information Dissemination in Star and Pancake Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 12, pp. 1,2921,300, Dec. 1996.
[4] D. Bertsekas, C. Ozveren, G. Stamoulis, P. Tseng, and J. Tsitsiklis, "Optimal Communication Algorithms for Hypercubes," J. Parallel and Distributed Computing, vol. 11, pp. 263275, 1991.
[5] D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation.Englewood Cliffs, N.J.: Prentice Hall International, 1989.
[6] N. Biggs, Algebraic Graph Theory, Second ed. Cambridge, G.B.: Cambridge Univ. Press, 1993.
[7] F. Boesch and R. Tindell, “Circulants and Their Connectivities,” J. Graph Theory, vol. 8, pp. 487499, 1984.
[8] F. Buckley and F. Harary, Distance in Graphs. Reading, Mass.: AddisonWesley, 1990.
[9] G.E. Carlsson,J.E. Cruthirds,, and H.B. Sexton,“Interconnection networks based on a generalization of cubeconnectedcycles,” IEEE Trans. Computers, vol. 334, no. 8, pp. 769772, Aug. 1985.
[10] V.V. Dimakopoulos and N.J. Dimopoulos, “A Theory for Total Exchange in Multidimensional Interconnection Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 7, pp. 639649, July 1998.
[11] P. Fraigniaud and E. Lazard, "Methods and Problems of Communication in Usual Networks," Discrete Applied Math., vol. 53, pp. 79133, 1994.
[12] S. Hiranandani, K. Kennedy, and C.W. Tseng, "Compiling Fortran D for MIMD DistributedMemory Machines," Comm. ACM, vol. 35, no. 8, pp. 6680, Aug. 1992.
[13] S.L. Johnsson, "Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures," J. Parallel and Distributed Computing, vol. 4, pp. 133172, 1987.
[14] 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.
[15] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[16] D.B. Loveman, “High Performance Fortran,” IEEE Parallel and Distributed Technology, vol. 1, pp. 2542, Feb. 1993.
[17] Message Passing Interface Forum, "MPI: A MessagePassing Interface Standard," Technical Report CS93214, Univ. of Tennessee, Apr. 1994.
[18] J. Misic and Z. Jovanovic, "Communication Aspects of the Star Graph Interconnection Network," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 7, pp. 678687, July 1994.
[19] F.P. Preparata and J. Vuillemin, “The CubeConnected Cycles: A Versatile Network for Parallel Computation,” Comm ACM, vol. 24, no. 5, pp. 300309, 1981.
[20] Y. Saad and M.H. Schultz, "Data Communication in Hypercubes," J. Parallel and Distributed Computing, vol. 6, pp. 115135, 1989.
[21] E.A. Varvarigos and D.P. Bertsekas, “Communication Algorithms for Isotropic Tasks in Hypercubes and Wraparound Meshes,” Parallel Computing, vol. 18, pp. 12331257, 1992.
[22] C.H. Yeh and E.A. Varvarigos, “MacroStar Networks: Efficient LowDegree Alternatives to Star Graphs,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 10, pp. 9871003, Oct. 1998.
[23] A.W.c. Fu and S.C. Chau, “CyclicCubes: A New Family of Interconnection Networks of Even FixedDegrees,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 12, pp. 12531268, Dec. 1998.