This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Total Exchange in Cayley Graphs
November 2001 (vol. 12 no. 11)
pp. 1162-1168

Abstract—Consider an interconnection network and the following situation: Every node needs to send a different message to every other node. This is the total exchange or all-to-all personalized communication problem, one of a number of information dissemination problems known as collective communications. Under the assumption that a node can send and receive only one message at each step (single-port model), it is seen that the minimum time required to solve the problem is governed by the status (or total distance) of the nodes in the network. We present here a time-optimal solution for any Cayley network. Rings, hypercubes, cube-connected cycles, and butterflies are some well-known Cayley networks which can take advantage of our method. The solution is based on a class of algorithms which we call node-invariant algorithms and which behave uniformly across the network.

[1] S.B. Akers and B. Krishnamurthy, “A Group-Theoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555-566, Apr. 1989.
[2] F.S. Annexstein, M. Baumslag, and A.L. Rosenberg, “Group Action Graphs and Parallel Architectures,” SIAM J. Computing, vol. 19 pp. 544-569, 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,292-1,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. 263-275, 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. 487-499, 1984.
[8] F. Buckley and F. Harary, Distance in Graphs. Reading, Mass.: Addison-Wesley, 1990.
[9] G.E. Carlsson,J.E. Cruthirds,, and H.B. Sexton,“Interconnection networks based on a generalization of cube-connectedcycles,” IEEE Trans. Computers, vol. 334, no. 8, pp. 769-772, 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. 639-649, July 1998.
[11] P. Fraigniaud and E. Lazard, "Methods and Problems of Communication in Usual Networks," Discrete Applied Math., vol. 53, pp. 79-133, 1994.
[12] S. Hiranandani, K. Kennedy, and C.-W. Tseng, "Compiling Fortran D for MIMD Distributed-Memory Machines," Comm. ACM, vol. 35, no. 8, pp. 66-80, Aug. 1992.
[13] S.L. Johnsson, "Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures," J. Parallel and Distributed Computing, vol. 4, pp. 133-172, 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,249-1,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. 25-42, Feb. 1993.
[17] Message Passing Interface Forum, "MPI: A Message-Passing Interface Standard," Technical Report CS-93-214, 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. 678-687, July 1994.
[19] F.P. Preparata and J. Vuillemin, “The Cube-Connected Cycles: A Versatile Network for Parallel Computation,” Comm ACM, vol. 24, no. 5, pp. 300-309, 1981.
[20] Y. Saad and M.H. Schultz, "Data Communication in Hypercubes," J. Parallel and Distributed Computing, vol. 6, pp. 115-135, 1989.
[21] E.A. Varvarigos and D.P. Bertsekas, “Communication Algorithms for Isotropic Tasks in Hypercubes and Wraparound Meshes,” Parallel Computing, vol. 18, pp. 1233-1257, 1992.
[22] C.-H. Yeh and E.A. Varvarigos, “Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 10, pp. 987-1003, Oct. 1998.
[23] A.W.-c. Fu and S.-C. Chau, “Cyclic-Cubes: A New Family of Interconnection Networks of Even Fixed-Degrees,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 12, pp. 1253-1268, Dec. 1998.

Index Terms:
Cayley graphs, collective communications, interconnection networks, node-invariant algorithms, total exchange (all-to-all personalized communication).
Citation:
Vassilios V. Dimakopoulos, Nikitas J. Dimopoulos, "Optimal Total Exchange in Cayley Graphs," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 11, pp. 1162-1168, Nov. 2001, doi:10.1109/71.969126
Usage of this product signifies your acceptance of the Terms of Use.