Abstract
In this paper, we introduce super Cayley graphs, a class of communication-efficient networks for parallel processing. We show that super Cayley graphs can embed trees, meshes, hypercubes, as well as star, bubble-sort graphs, and transposition networks with constant dilation. We also show that algorithms developed for star graphs can be emulated on suitably constructed super Cayley graphs with asymptotically optimal slowdown, under several communication models. Basic communication tasks, such as the multinode broadcast (MNB) and the total exchange (TE), can be executed in suitably constructed super Cayley graphs in asymptotically optimal time. Moreover, no interconnection network with similar node degree can perform these communication tasks in time that is better by more than a constant factor than that required in suitably constructed super Cayley graphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akers, S. B., D. Harel, and B. Krishnamurthy, “The star graph: an attractive alternative to the n-cube, ” Proc. Int’l Conf. Parallel Processing, 1987, pp. 393–400.
Akers, S. B. and B. Krishnamurthy, “A group-theoretic model for symmetric interconnection networks, ” IEEE Trans. Comput. Vol. 38, Apr. 1989, pp. 555–565.
Akl, S. G. and K. A. Lyons, Parallel Computational Geometry, Prentice Hall, Englewood Cliffs, NJ, 1993.
Bertsekas, D. P. and J. Tsitsiklis, Parallel and Distributed Computation-Numerical Methods, Athena Scientific, 1997.
Bouabdallah, A., M. C. Heydemann, J. Opatrny, and D. Sotteau, “Embedding complete binary trees into star networks, ” Proc. Int’l Symp. Mathematical Foundations of Computer Science, 1994, pp. 266–275.
Corbett, P. F., “Rotator graphs: an efficient topology for point-to-point multiprocessor networks, ” IEEE Trans. Parallel Distrib. Sys. vol. 3, no. 5, pp. 622–626, Sep. 1992.
Faber, V., J. W. Moore, and W. Y. C. Chen, “Cycle prefix digraphs for symmetric interconnection networks, ” Networks, Oct. 1993, vol. 23, no. 7, pp. 641–649.
Fragopoulou, P. and S. G. Akl, “Optimal communication algorithms on star graphs using spanning tree constructions, ” J. Parallel Distrib. Computing. Vol. 24, 1995, pp. 55–71.
Huang, J.-P., S. Lakshmivarahan, and S. K. Dhall, “Analysis of interconnection networks based on simple Cayley coset graphs, ” Proc. IEEE Symp. Parallel and Distributed Processing, 1993, pp. 150–157.
Johnsson, S. L. and C.-T. Ho, “Optimum broadcasting and personalized communication in hypercubes, ” IEEE Trans. Comput. vol. 38, no. 9, Sep. 1989, pp. 1249–1268.
Jwo J. S., S. Lakshmivarahan, and S. K. Dhall, “Embedding of cycles and grids in star graphs, ” Proc. IEEE Symp. Parallel and Distributed Processing, 1990, pp. 540–547.
Latifi, S. and P. K. Srimani, “Transposition networks as a class of fault-tolerant robust networks, ” IEEE Trans. Parallel Distrib. Sys. Vol. 45, no. 2, Feb. 1996, pp. 230–238.
Leighton, F. T., Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan-Kaufman, San Mateo, CA, 1992.
Miller, Z., D. Pritikin, and I. H. Sudborough, “Bounded dilation maps of hypercubes into Cayley graphs on the symmetric group, ” Math. Sys. Theory, Vol. 29, no. 6, Springer-Verlag, Nov.-Dec., 1996, pp. 551–572.
Mišić, J. and Z. Jovanović, “Communication aspects of the star graph interconnection network, ” IEEE Trans. Parallel Distrib. Sys. Vol. 5, no. 7, Jul. 1994, pp. 678–687.
Varvarigos, E. A., “Static and dynamic communication in parallel computing, ” Ph. D. dissertation, Dept. Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1992.
Varvarigos, E. A. and D. P. Bertsekas, “Multinode broadcast in hypercubes and rings with randomly distributed length of packets, ” IEEE Trans. Parallel Distrib. Sys. vol. 4, no. 2, Feb. 1993, pp. 144–154.
Yeh, C.-H. and B. Parhami, “Recursive hierarchical swapped networks: versatile interconnection architectures for highly parallel systems, ” Proc. IEEE Symp. Parallel and Distributed Processing, Oct. 1996, pp. 453–460.
Yeh, C.-H. and B. Parhami, “Cyclic networks-a family of versatile fixed-degree interconnection architectures, ” Proc. Int’l Parallel Processing Symp., Apr. 1997, 739–743.
Yeh, C.-H., “Efficient low-degree interconnection networks for parallel processing: topologies, algorithms, VLSI layouts, and fault tolerance, ” Ph. D. dissertation, Dept. Electrical & Computer Engineering, Univ. of California, Santa Barbara, Mar. 1998.
Yeh, C.-H. and E. A. Varvarigos, “Macro-star networks: efficient low-degree alternatives to star graphs, ” IEEE Trans. Parallel Distrib. Sys. vol. 9, no. 10, Oct. 1998, pp. 987–1003.
Yeh, C.-H. and B. Parhami, “A new representation of graphs and its applications to parallel processing, ” Proc. Int’l Conf. Parallel and Distributed Systems, Dec. 1998, pp. 702–709.
Yeh, C.-H. and E. A. Varvarigos, “Parallel algorithms on the rotation-exchange network-a trivalent variant of the star graph, ” Proc. Symp. Frontiers of Massively Parallel Computation, Feb. 1999, pp. 302–309.
Yeh, C.-H. and B. Parhami, “The index-permutation graph model for hierarchical interconnection networks, ” Proc. Int’l Conf. Parallel Processing, Sep. 1999, to appear.
Yeh, C.-H. and B. Parhami, “Routing and embeddings in cyclic Petersen networks: an efficient extension of the Petersen graph, ” Proc. Int’l Conf. Parallel Processing, Sep. 1999, to appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yeh, CH., Varvarigos, E.A., Lee, H. (1999). Routing and Embeddings in Super Cayley Graphs. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1999. Lecture Notes in Computer Science, vol 1662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48387-X_16
Download citation
DOI: https://doi.org/10.1007/3-540-48387-X_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66363-8
Online ISBN: 978-3-540-48387-8
eBook Packages: Springer Book Archive