Nearly Optimal Three Dimensional Layout of Hypercube Networks

1. Biedl, T., Thiele, T., Wood, D.R.: Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 284–295. Springer, Heidelberg (2001)

   Chapter  Google Scholar 

2. Calamoneri, T., Massini, A.: An Optimal Layout of Multigrid Networks. Information Processing Letters 72, 137–141 (1999)

   Article  MATH  MathSciNet  Google Scholar 

3. Calamoneri, T., Massini, A.: Optimal three-dimensional layout of interconnection networks. Theoretical Computer Science 255, 263–279 (2001)

   Article  MATH  MathSciNet  Google Scholar 

4. DeHon, A.: Compact, Multilayer Layout for Butterfly Fat-Tree. In: ACM Symp. on Parallel Algorithms and Architectures (SPPA) (2000)

   Google Scholar 

5. Eades, P., Symvonis, A., Whitesides, S.: Two Algorithms for Three Dimensional Orthogonal Graph Drawing. In: North, S.C. (ed.) GD 1996. LNCS, vol. 1190, pp. 139–154. Springer, Heidelberg (1997)

   Google Scholar 

6. Greenberg, R.I., Guan, L.: On the area of hypercube layouts. Information Processing Letters 84, 41–46 (2002)

   Article  MATH  MathSciNet  Google Scholar 

7. Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees and Hypercubes. Morgan Kaufmann Publ., San Mateo (1992)

   MATH  Google Scholar 

8. Melhorn, K., Preparata, F.P., Sarrafzadeh, M.: Channel routing in knock-knee mode: simplified algorithms and proofs. Algorithmica 1, 213–221 (1986)

   Article  MathSciNet  Google Scholar 

9. Muthukrishnan, S., Paterson, M., Sahinalp, S.C., Suel, T.: Compact Grid Layouts of Multi-Level Networks. In: 31st ACM Symp. on Theory of Computing (1999)

   Google Scholar 

10. Pinter, R.Y.: On routing two-point nets across a channel. In: 19th ACM-IEEE Design Automation Conf., pp. 894–902 (1982)

    Google Scholar 

11. Rosenberg, A.L.: Three-Dimensional VLSI: A Case Study. Journal of the ACM 30(3), 397–416 (1983)

    Article  MATH  Google Scholar 

12. Wood, D.R.: A New Algorithm and Open Problems in Three-Dimensional Orthogonal Graph Drawing. In: Proc. 10th Australasian Work. Combinatorial Algorithms (AWOCA), pp. 157–167 (1999)

    Google Scholar 

13. Yamada, T., Ueno, S.: On Three-Dimensional Layout of De Bruijn Networks. In: 2002 IEEE International Symposium on Circuits and Systems (ISCAS 2002), vol. III, pp. 779–782 (2002)

    Google Scholar 

14. Yamada, T., Ueno, S.: On Three-Dimensional Layout of Pyramid Networks. In: 2002 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS 2002) (2002)

    Google Scholar 

15. Yeh, C.-H., Parhami, B., Varvarigos, E.A., Lee, H.: VLSI Layout and Packaging of Butterfly Networks. In: ACM Symp. on Parallel Algorithms and Architectures (SPPA), pp. 196–205 (2000)

    Google Scholar 

16. Yeh, C.-H., Varvarigos, E.A., Parhami, B.: Multilayer VLSI Layout for Interconnection Networks. In: 2000 Int.l Conference on Parallel Processing (ICPP), pp. 33–40 (2002)

    Google Scholar 

Download references