An Analytical Approach to Floorplan Design and Optimization

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

Volumn 10, Issue 6, 1991, Pages 761-769

  Sutanthavibul, Suphachai ^a   Shragowitz, Eugene ^a   Rosen, J B ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; MATHEMATICAL PROGRAMMING; OPTIMIZATION;

CHIP AREA; MIXED INTEGER PROGRAMMING; VLSI FLOORPLAN DESIGN/OPTIMIZATION; VLSI TIMING DELAYS;

INTEGRATED CIRCUITS, VLSI;

EID: 0026172095     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.137505     Document Type: Article

References (18)

1. R. H. M. Otten, “Automatic floorplan design,” in Proc. 19th Design Automation Conf., 1982, pp. 261–267.
2. —, “Efficient floorplan optimization,” in Proc. Int. Conf. on Computer-Aided Design, 1983, pp. 499–502.
3. D. F. Wong and C. L. Liu, “A new algorithm for floorplan design,” in Proc. 23rd Design Automation Conf., 1986, pp. 101–107.
4. D. F. Wong and P. S. Sakhamuri, “Efficient floorplan area optimization,” in Proc. 26th Design Automation Conf., 1989, pp. 586–589.
5. T. Mueller, D. F. Wong, and C. L. Liu, “An enhanced bottom-up algorithm for floorplan design,” in Proc. 24th Design Automation Conf., 1987, pp. 524–527.
6. 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.
7. K. A. 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.
8. —, “Rectangular dualization and rectangular dissections,” IEEE Trans. Circuits Syst., vol. 35, pp. 1401–1416, Nov. 1988.
9. J. Bhasker and S. Sahni, “A linear algorithm to find a rectangular dual of a planar triangulated graph,” in Proc. 23rd Design Automation Conf., 1986, pp. 108–114.
10. B. Lokanathan and E. Kinnen, “Performance optimized floor planning by graph planarization,” in Proc. 26th Design Automation Conf., 1989, pp. 116–121.
11. B. Eschermann, et. al., “Hierarchical placement of macrocells: A meet in the middle approach,” in Proc. Int. Conf on Computer-Aided Design, 1988, pp. 460–463.
12. H. Cai, “Connectivity biased channel construction and ordering for building-block layout,” in Proc. 25th Design Automation Conf., 1988, pp. 560–565.
13. J. M. Kleinhans, G. Sigl, and F. M. Johannes, “GORDIAN: A new global optimization/rectangle dissection method for cell placement,” in Proc. Int. Conf on Computer-Aided Design, 1988, pp. 506–509.
14. L. Sha and T. Blank, “ATLAS—A technique for layout using analytic shapes,” in Proc. Int. Conf on Computer-Aided Design, 1987, pp. 84–87.
15. L. Markov, J. R. Fox, and J. H. Blank, “Optimization techniques for two-dimensional placement,” in Proc. 21st Design Automation Conf., 1984, pp. 652–654.
16. H. Youssef, E. Shragowitz, and L. Bening, “Critical path issue in VLSI design,” in Proc. Int. Conf. on Computer-Aided Design, 1989, pp. 520–523.
17. L. Schrage, UNDO: Linear Interactive Discrete Optimizer. Read-wood City, CA: Scientific, 1982.
18. S. Kang, “Linear ordering and application to placement,” in Proc. 20th Design Automation Conf., 1983, pp. 457–464.