Simultaneous Floor Planning and Global Routing for Hierarchical Building-Block Layout

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 6, Issue 5, 1987, Pages 828-837

  Dai, Wei Ming ^a   Kuh, Ernest S ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000359078     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/TCAD.1987.1270326     Document Type: Article

References (28)

1. A. V. Aho, M. R. Garey, and F. K. Hwang, “Rectilinear Steiner trees: Efficient special-case algorithms,” Networks, vol. 7, pp. 37–58, 1977.
2. S. Arnborg and A. Proskurowski, “Characterization and recognition of partial 3-trees,” Discrete Math., vol. 7, no. 2, pp. 305–314, 1986.
3. M. Burstein, “A non ‘placement/routing’ approach to automation of VLSI layout design,” in Proc. 1982 IEEE Int. Symp. on Circuits and Syst, 1982, pp. 756–759.
4. M. Burstein and R. Pelavin, “Hierarchical wire routing,” IEEE Trans. Computer-Aided Design, vol. CAD-2, no. 4, pp. 223–234, 1983.
5. N. P. Chen, C. P. Hsu, and E. S. Kuh, “The Berkeley building-block (BEL) layout system for VLSI design,” in Dig. Tech. Papers, IEEE Int. Conf. on Computer-Aided Design, 1983, pp. 40–41.
6. B. W. Colbry and J. Soukup, “Layout aspects of the VLSI microprocessor design,” in Proc. 1982 IEEE Int. Symp. on Circuits and Syst., 1982, pp. 1214–1228.
7. W. M. Dai, T. Asano, and E. S. Kuh, “Routing region definition and ordering scheme for building-block layout,” IEEE Trans. Computer-Aided Design, vol. CAD-4, no, 3, pp. 189–197, 1985.
8. W. M. Dai and E. S. Kuh, “Hierarchical floor planning for building block layout,” in Dig. Tech. Papers, IEEE Int. Conf. Computer-Aided Design, 1986.
9. W. M. Dai, M. Sato, and E. S. Kuh, “A dynamic and efficient representation of building-block layout,” in Proc, 24th Design Automation Conf., 1987, pp. 376–384.
10. M. R. Garey and D. S. Johnson, “The rectilinear Steiner tree problem is NP-complete,” SIAMJ, Appl. Math., vol. 32, no. 4, pp. 826–834, 1977.
11. J. Grason, “An approach to computerized space planning using graph theory,” in Proc. 8th Design Automation Workshop, 1971.
12. W. R, Heller, G. Sorkin, and K. Maling, “The planar package planner for system designers,” in Proc. 19th Design Automation Conf., 1982, pp. 253–260.
13. Y. Kajitani, A. Ishizuka, and S. Ueno, “A characterization of the partial 3-tree in terms of certain structures,” in Proc. 1985 IEEE Int, Symp. Circuits and Syst., 1985, pp. 1179–1182.
14. R. M. Karp, “Reducibiiity among combinatorial problems,” in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher Eds. New York: Plenum Press, 1972, pp. 85–104.
15. K. Kozminski and E. Kinnen, “An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits,” in Proc. 21st Design Automation Conf., 1984, pp. 655–656.
16. U. P. Lauther, “A min-cut placement algorithm for general cell assemblies based on a graph representation,” in Proc. 16th Design Automation Conf., 1979, pp. 1–10.
17. U. P. Lauther, private communication, 1986.
18. W. K. Luk, D. T. Tang, and C. K. Wong, “Hierarchical global wiring for custom chip design,” in Proc. 23rd Design Automation Conf., 1986, pp. 481–489.
19. S. M. Leinwand and Yen-Tai Lai, “An algorithm for building rectangular floorplans,” in Proc. 21st Design Automation Conf., 1984, pp. 663–664.
20. R. H. J. M. Otten, “Automatic floorplan design,” in Proc. 19th Design Automation Conf., 1982, pp. 261–267.
21. B. T. Preas, “Placement and routing algorithms for hierarchical integrated circuit layout,” Ph.D. dissertation. Dep. of Elect. Eng., Stanford Univ., Stanford, CA, 1979.
22. B. T. Preas and P. G. Karger, “Automatic placement, a review of current techniques,” in Proc. 23rd Design Automation Conf., 1986, pp. 622–629.
23. D. J. Rose, “On simple characterization of k -trees,” Discrete Math., vol. 7, pp. 317–322, 1974.
24. D. G. Schweikert, “A 2-dimensional placement algorithm for the layout of electrical circuits,” in Proc. 13th Design Automation Conf., 1976, pp. 408–416.
25. J. Soukup, “Circuit layout,” in Proc. IEEE, vol. 69, no. 10, pp. 1281–1304, 1981.
26. S. Tsukiyama, K. Koike, and I. Shirakawa, “An algorithm to eliminate all complex triangles in a maximal planar graph for use in VLSI floor-plan,” in Proc. 1986 IEEE Int. Symp. on Circuits and Syst., pp. 321–324. 1986.
27. J. A, Wald and C. J. Colbourn, “Steiner trees in outerplanar graphs,” in Proc. 13th Southeastern Conf. on Combinatorics, Graph Theory, and Computing, 1982, pp. 15–22.
28. J. A. Wald and C. J. Colbourn, “Steiner trees, partial 2-trees, and minimum IFI networks,” Networks, vol. 13, pp. 159–167, 1983.