Skip to main content
SpringerLink
Log in

Routing and Embeddings in Super Cayley Graphs

  • Conference paper
  • First Online:
Parallel Computing Technologies (PaCT 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1662))

Included in the following conference series:

  • 353 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Google Scholar 

  2. Akers, S. B. and B. Krishnamurthy, “A group-theoretic model for symmetric interconnection networks, ” IEEE Trans. Comput. Vol. 38, Apr. 1989, pp. 555–565.

    Article  MATH  MathSciNet  Google Scholar 

  3. Akl, S. G. and K. A. Lyons, Parallel Computational Geometry, Prentice Hall, Englewood Cliffs, NJ, 1993.

    Google Scholar 

  4. Bertsekas, D. P. and J. Tsitsiklis, Parallel and Distributed Computation-Numerical Methods, Athena Scientific, 1997.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. 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.

    Article  Google Scholar 

  7. 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.

    Article  MATH  MathSciNet  Google Scholar 

  8. 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.

    Article  Google Scholar 

  9. 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.

    Google Scholar 

  10. 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.

    Article  MathSciNet  Google Scholar 

  11. 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.

    Google Scholar 

  12. 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.

    MATH  Google Scholar 

  13. Leighton, F. T., Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan-Kaufman, San Mateo, CA, 1992.

    MATH  Google Scholar 

  14. 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.

    MATH  MathSciNet  Google Scholar 

  15. 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.

    Article  Google Scholar 

  16. Varvarigos, E. A., “Static and dynamic communication in parallel computing, ” Ph. D. dissertation, Dept. Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1992.

    Google Scholar 

  17. 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.

    Article  Google Scholar 

  18. 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.

    Google Scholar 

  19. 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.

    Google Scholar 

  20. 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.

    Google Scholar 

  21. 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.

    Article  Google Scholar 

  22. 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.

    Google Scholar 

  23. 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.

    Google Scholar 

  24. 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.

    Google Scholar 

  25. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA, 93106-9560, USA

    Chi-Hsiang Yeh, Emmanouel A. Varvarigos & Hua Lee

Authors
  1. Chi-Hsiang Yeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emmanouel A. Varvarigos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hua Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computing Center, 6 Lavrentiev Avenue, Novosibirsk, 630090, Russia

    Victor Malyshkin

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation