Abstract
We present a time-optimal solution to the total exchange problem, under the single-port assumption, for any Cayley graph. We exploit symmetries inherent in Cayley graphs to devise what we call node-invariant algorithms which behave uniformly across the network.
This research was supported in part through grants from NSERC and the University of Victoria.
Chapter PDF
Similar content being viewed by others
References
Akers, S. B., Krishnamurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38 (Apr. 1989) 555–566
Annexstein, F., Baumslag, M., Rosenberg, A. L.: Group action graphs and parallel architectures. SIAM J. Comput. 19 (June 1990) 544–569
Bertsekas, D. P., et. al. Optimal communication algorithms for hypercubes. J. Parallel Distrib. Comput. 11 (1991) 263–275
Bertsekas, D. P., Tsitsiklis, J. N.: Parallel and Distributed Computation: Numerical Methods. Englewoods Cliffs, N.J.: Prentice-Hall 1989
Biggs, N.: Algebraic Graph Theory (2nd edition). Cambridge, G.B.: Cambridge University Press 1993
Boesch, F., Tindell, R.: Circulants and their connectivities. Journal of Graph Theory 8 (1984) 487–499
Buckley, F., Harary, F.: Distance in Graphs. Reading, Mass.: Addison — Wesley 1990
Carlsson, G. E., Cruthirds, J. E., Sexton, H. B., Wright, C. G.: Interconnection networks based on a generalization of cube-connected cycles. IEEE Trans. Comput. C-34 (Aug. 1985) 769–772
Dimakopoulos, V. V., Dimopoulos, N. J.: Optimal total exchange in Cayley graphs. Technical Report ECE-96-1, University of Victoria. (Jan. 1996)
Leighton, F. T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees Hypercubes. San Diego, CA: Morgan Kaufmann 1992
Misŝić, J., Jovanović, Z.: Communication aspects of the star graph interconnection network. IEEE Trans. Parall. Distrib. Syst. 5 (July 1994) 678–687
Preparata F. P., Vuillemin, J.: The cube-connected cycles: a versatile network for parallel computation. Commun. ACM 24 (May 1981) 300–309
Saad, Y., Schultz, M. H.: Data communications in hypercubes. J. Parallel Distrib. Comput. 6 (1989) 115–135
Varvarigos, E. A., Bertsekas, D. P.: Communication algorithms for isotropic tasks in hypercubes and wraparound meshes. Parallel Comput. 18 (1992) 1233–1257
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dimakopoulos, V.V., Dimopoulos, N.J. (1996). Total exchange in Cayley networks. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61626-8_44
Download citation
DOI: https://doi.org/10.1007/3-540-61626-8_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61626-9
Online ISBN: 978-3-540-70633-5
eBook Packages: Springer Book Archive