Skip to main content
SpringerLink
Log in

Parallel implementations of graph embeddings

Extended abstract

  • Conference paper
  • First Online:
Parallel Architectures and Their Efficient Use (Nixdorf 1992)

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

Included in the following conference series:

Abstract

This paper addresses the problem of how to efficiently implement a certain class of network emulations. We provide a framework for studying and implementing graph embeddings at a fine level of abstraction, suitable for the specification of pseudocode. Our results show that many networks with regular structure, including meshes, complete-binary trees, butterflies, X-trees, and mesh-of-trees can be efficiently embedded within a hypercube using SIMD-style parallel algorithms for translating node labels.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S.N. Bhatt, F.R.K. Chung, F.T. Leighton, A.L. Rosenberg (1991): Efficient embeddings of trees in hypercubes. SIAM J. Comput., to appear.

    Google Scholar 

  2. T. Bräunl (1989): Structured SIMD programming in Parallaxis. Structured Programming 10/3, 121–132.

    Google Scholar 

  3. M.Y. Chan (1988): Dilation-2 embedding of grids into hypercubes. Intl. Conf. on Parallel Processing, 295–298.

    Google Scholar 

  4. M.Y. Chan and F.Y.L. Chin (1990): Parallelized simulation of grids by hypercubes. Tech. Rpt. TR-90-11, Univ. Hong Kong.

    Google Scholar 

  5. D.S. Greenberg (1987): Minimum expansion embeddings of meshes in hypercubes. Tech. Rpt. DCS/RR-535, Yale Univ.

    Google Scholar 

  6. D.S. Greenberg, L.S. Heath and A.L. Rosenberg (1990): Optimal embeddings of butterfly-like graphs in the hypercube. Math. Syst. Th. 23, 61–77.

    Google Scholar 

  7. I. Havel and P. Liebl (1973): Embedding the polytomic tree into the n-cube. Časopis pro Pěstování Matematiky 98, 307–314.

    Google Scholar 

  8. F.T. Leighton (1992): Introduction to Parallel Algorithms and Architectures. Morgan Kaufmann, San Mateo.

    Google Scholar 

  9. B. Monien and I.H. Sudborough (1990): Embedding one interconnection network on another. In Computational Graph Theory (G. Tinhofer et al., eds,) Springer Verlag, 257–282.

    Google Scholar 

  10. L. Snyder (1990): The XYZ abstraction levels of Poker-like languages. In Languages and Compilers for Parallel Computing (D. Gelernter et al., eds.) MIT Press, 470–489.

    Google Scholar 

  11. H.S. Wilf (1989): Combinatorial algorithms: an update, CBMS-55, SIAM.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Cincinnati, 45221-0008, Cincinnati, OH

    Fred S. Annexstein

Authors
  1. Fred S. Annexstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

F. Meyer B. Monien A. L. Rosenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Annexstein, F.S. (1993). Parallel implementations of graph embeddings. In: Meyer, F., Monien, B., Rosenberg, A.L. (eds) Parallel Architectures and Their Efficient Use. Nixdorf 1992. Lecture Notes in Computer Science, vol 678. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56731-3_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-56731-3_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56731-8

  • Online ISBN: 978-3-540-47637-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation