Embedding interconnection networks in grids via the layered cross product

Networks

Volumn 36, Issue 2, 2000, Pages 91-95

  Even, Guy ^a   Even, Shimon ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Butterfly network; Graph drawing; Grid layout; Layered cross product; Mesh of trees; Network area

Indexed keywords

EID: 0034259701     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0037(200009)36:2<91::AID-NET3>3.0.CO;2-4     Document Type: Article

References (8)

1. [1] A. Avior, T. Calamoneri, S. Even, A. Litman, and A.L. Rosenberg, A tight layout of the Butterfly network, Theory Comput Syst 31 (1998), 475-488.
2. [2] R.P. Brent and H.T. Kung, On the area of binary tree layouts, Inf Proc Lett 11 (1980), 44-46.
3. [3] Ye. Dinitz, A compact layout of butterfly on the square grid, Technical Report No. 873, Dept. of Computer Science, Technion, 1995, 7 pp.
4. [4] Ye. Dinitz, S. Even, and M. Zapolotsky, An optimal layout of the butterfly network, Manuscript, 1999, 14 pp, presented at the Dagstuhl Seminar (No. 219) on Graph Algorithms and Applications, July 1998.
5. [5] S. Even and A. Litman, Layered cross product - A technique to construct interconnection networks, Networks 29 (1992), 219-223.
6. [6] M.J. Fischer and M.S. Paterson, Optimal tree layout, 12th ACM Symp on Theory of Computing, 1980, pp. 177-189.
7. [7] T. Leighton, Parallel computation using meshes of trees, Proc WG'83, Int Workshop on Graph Theoretic Concepts in Computer Science, M. Nagl and J. Perl (Editors), Trauner Verlag, Linz, 1984, pp. 200-218.
8. [8] Y. Shiloach, Linear and planar arrangements of graphs, Doctoral Thesis, Dept. of Applied Mathematics, The Weizmann Institute of Science, Rehovot, Israel, 1976.