Efficient VLSI layouts of hypercubic networks

Proceedings - Frontiers 1999, 7th Symposium on the Frontiers of Massively Parallel Computation

Volumn , Issue , 1999, Pages 98-105

  Yeh, Chi Hsiang ^a   Varvarigos, Emmanouel A ^a   Parhami, Behrooz ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

VLSI CIRCUITS;

BUTTERFLY NETWORKS; CUBE-CONNECTED CYCLES; FOLDED HYPERCUBES; GENERALIZED HYPERCUBES; GRID MODEL; HYPER-CUBES; HYPERCUBE; VLSI LAYOUT;

GEOMETRY;

EID: 0141723110     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FMPC.1999.750589     Document Type: Conference Paper

References (29)

1. Adams, G. B. and H. G. Siegel, "The extra stage cube: a faulttolerant interconnection network for supersystems, " IEEE Trans. Comput., vol. 31, no. 5, May. 1982, pp. 443-454.
2. Avior, A., T. Calamoneri, S. Even, A. Litman, and A. Rosenberg, "A tight layout of the butterfly network, " Proc. ACM Symp. Parallel Algorithms and Architectures, Jun. 1996, pp. 170-175.
3. Bertsekas, D. P. and J. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Athena Scientific, 1997.
4. Bhuyan L. N. and D. P. Agrawal, "Generalized hypercube and hyperbus structures for a computer network, " IEEE Trans. Comput., vol. 33, no. 4, Apr. 1984, pp. 323-333.
5. Brebner, G., "Relating routing graphs and two-dimensional grids, " VLSI: Algorithms and Architectures, 1985, pp. 221-231.
6. Chen, C. and D. P. Agrawal, "dBCube: a new class of hierarchical multiprocessor interconnection networks with area efficient layout, " IEEE Trans. Parallel Distrib. Sys., vol. 4, no. 12, Dec. 1993, pp. 1332-1344.
7. Chen G. and F. C. M. Lau, "A compact layout of cubeconnected cycles, " Proc. Int'l Conf. High Performance Computing, Dec. 1997, 422-427.
8. Fernández, A. and K. Efe, "Efficient VLSI layouts for homogeneous product networks, " IEEE Trans. Computer, vol. 46, no. 10, Oct. 1997, pp. 1070-1082.
9. Johnsson, S. L. and C.-T. Ho, "Optimum broadcasting and personalized communication in hypercubes, " IEEE Trans. Computers, vol. 38, no. 9, Sep. 1989, pp. 1249-1268.
10. Lai, T.-H. and A. P. Sprague, "Placement of the processors of a hypercube, " IEEE Trans. Computers, vol. 40, no. 6, Jun. 1991, pp. 714-722.
11. Lakshmivarahan, S. and S. K. Dhall, "A new hierarchy of hypercube interconnection schemes for parallel computers, " J. Supercomputing, vol. 2, 1988, pp. 81-108.
12. Leighton, F. T., Complexity Issues in VLSI : Optimal Layouts for the Shuffle-exchange Graph and Other Networks Cambridge, Mass., MIT Press, 1983.
13. Leighton, F. T., Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan-Kaufman, San Mateo, CA, 1992.
14. Parhami B., Introduction to Parallel Processing: Algorithms and Architectures, Plenum Publishing Corp., 1999.
15. Parhami B. and D.-M. Kwai, "Periodically regular chordal rings, " IEEE Trans. Parallel Distrib. Sys., to appear.
16. Preparata, F. P. and J. E. Vuillemin, "The cube-connected cycles: a versatile network for parallel computation, " Commun. ACM, vol. 24, No. 5, pp. 300-309, May 1981.
17. Sykora and I. Vrt'o, "On VLSI layouts of the star graph and related networks, " Integration, VLSI J. 1994, pp. 83-93.
18. Thompson, C. D., "Area-time complexity for VLSI, " Proc. ACM Symp. Theory of Computing, 1979, pp. 81-88.
19. Thompson, C. D., "A complexity theory for VLSI, " Ph. D. dissertation, Dept. of Computer Science, Carnegie-Mellon Univ., Pittsburgh, PA, 1980.
20. Varvarigos, E. A. and D. P. Bertsekas, "Communication algorithms for isotropic tasks in hypercubes and wraparound meshes, " Parallel Computing, vol. 18, no. 11, Nov. 1992, pp. 1233-1257.
21. Varvarigos, E. A., "Static and dynamic communication in parallel computing, " Ph. D. dissertation, Dept. Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1992.
22. Yeh, C.-H. and B. Parhami, "A class of parallel architectures for fast Fourier transform, " Proc. Midwest Symp. Circuits and Systems, Aug. 1996, pp. 856-859.
23. Yeh, C.-H. and B. Parhami, "Recursive hierarchical swapped networks: versatile interconnection architectures for highly parallel systems, " Proc. IEEESymp. Parallel and Distributed Processing, Oct. 1996, pp. 453-460.
24. Yeh, C.-H. and B. Parhami, "Cyclic networks-a family of versatile fixed-degree interconnection architectures, " Proc. Int'l Parallel Processing Symp., Apr. 1997, pp. 739-743.
25. 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.
26. Yeh, C.-H. and E. A. Varvarigos, "Macro-star networks: efficient low-degree alternatives to star graphs, " IEEE Trans. ParallelDistrib. Sys., Vol. 9, no. 10, Oct. 1998, pp. 987-1003.
27. Yeh, C.-H. and B. Parhami, "VLSI layouts of complete graphs and star graphs, " Information Processing Letters, Vol. 68, Oct. 1998, pp. 39-45.
28. Yeh, C.-H., B. Parhami, and E. A. Varvarigos, "The recursive grid layout scheme for VLSI layout of hierarchical networks, " Proc. Merged Int'l Parallel Processing Symp. & Symp. Parallel and Distributed Processing, Apr. 1999, to appear.
29. Ziavras, S. G., "RH: a versatile family of reduced hypercube interconnection networks, " IEEE Trans. Parallel Distrib. Sys., vol. 5, no. 11, Nov. 1994, pp. 1210-1220.