Embedding interconnection networks in grids via the Layered Cross Product | SpringerLink
Skip to main content
Springer Nature Link
Log in

Embedding interconnection networks in grids via the Layered Cross Product

  • Invited Presentations
  • Conference paper
  • First Online:
Algorithms and Complexity (CIAC 1997)

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

Included in the following conference series:

Abstract

A technique for automatically producing a rectilinear planar drawings of interconnection networks is described. It is based on the Layered Cross Product suggested by Even and Litman. The technique is demonstrated on the Butterfly network, the binary tree and the Meshof-Trees of Leighton.

On leave from the Computer Sci. Dept., Technion — Israel Inst. of Tech., Haifa, Israel 32000. Research was partly supported by the United States-Israel Binational Science Foundation, grant No. 94-00266/1.

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.

Similar content being viewed by others

References

  1. A. Avior, T. Calamoneri, S. Even, A. Litman and A.L. Rosenberg (1996): “A Tight Layout of the Butterfly Network”, 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 170–175.

    Google Scholar 

  2. R.P. Brent and H.T. Kung (1980): “On the Area of Binary Tree Layouts.” Inf. Proc. Let. 11, 44–46.

    Google Scholar 

  3. Ye. Dinitz: “A Compact layout of Butterfly on the Square Grid”, Technical Report No. 873, Dept. of Comp. Sci., Technion, 1995, 7p.

    Google Scholar 

  4. S. Even and A. Litman (1992): “Layered Cross Product — A Technique to Construct Interconnection Networks”, 4th ACM Symp. on Parallel Algorithms and Architectures, 60–69. To appear in Networks.

    Google Scholar 

  5. M.J. Fischer and M.S. Paterson (1980): “Optimal Tree Layout.” 12th ACM Symp. on Theory of Computing, 177–189.

    Google Scholar 

  6. T. Leighton (1984): “Parallel Computation Using Meshes of Trees”, Proc. WG'83, International Workshop on Graphtheoretic Concepts in Computer Science, (M. Nagl and J. Perl eds.), Trauner Verlag, 200–218.

    Google Scholar 

  7. Y. Shiloach (1976): “Linear and Planar Arrangements of Graphs”, Doctoral thesis, Dept. of Appl. Math., The Weizmann Inst. of Sci., Rehovot, Israel.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universitaet des Saarlandes, FB 14 Informatik, Lehrstuhl Prof. Paul, Postfach 15 11 50, 66041, Saarbrücken, Germany

    Guy Even

  2. Bell-Labs, Lucent Technologies, 700 Mountain Ave., 07974, Murray Hill, NJ

    Shimon Even

Authors
  1. Guy Even
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shimon Even
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giancarlo Bongiovanni Daniel Pierre Bovet Giuseppe Di Battista

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Even, G., Even, S. (1997). Embedding interconnection networks in grids via the Layered Cross Product. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds) Algorithms and Complexity. CIAC 1997. Lecture Notes in Computer Science, vol 1203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62592-5_56

Download citation

  • DOI: https://doi.org/10.1007/3-540-62592-5_56

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62592-6

  • Online ISBN: 978-3-540-68323-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics