GORDIAN: VLSI Placement by Quadratic Programming and Slicing Optimization

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

Volumn 10, Issue 3, 1991, Pages 356-365

  Kleinhans, Jurgen M ^a   Sigl, Georg ^b   Johannes, Frank M ^b   Antreich, Kurt J ^b  

^a SIEMENS AG   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; MATHEMATICAL PROGRAMMING; OPTIMIZATION;

DIVIDE-AND-CONQUER PARADIGM; GLOBAL OPTIMIZATION; PARTITIONING SCHEMES; QUADRATIC PROGRAMMING; SOFTWARE PACKAGE GORDIAN; VLSI PLACEMENT;

INTEGRATED CIRCUITS, VLSI;

EID: 0026131224     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.67789     Document Type: Article

References (33)

1. U. Lauther, “A min-cut placement algorithm for general cell assemblies based on a graph representation,” in ACM/IEEE Proc. 16th Design Automation Conf., 1979, pp. 1–10.
2. A. E. Dunlop and B. W. Kernighan, “A procedure for placement of standard-cell VLSI circuits,” IEEE Trans. Computer-Aided Design, vol. CAD-4, pp. 92–98, Jan. 1985.
3. D. P. LaPotin and S. W. Director, “Mason: A global floorplanning approach for VLSI design,” IEEE Trans. Computer-Aided Design, vol. CAD-5, pp. 477–489, Oct. 1986.
4. P. R. Suaris and G. Kedem, “An algorithm for quadrisection and its application to standard cell placement,” IEEE Trans. Circuits Syst., vol. 35, pp. 294–303, Mar. 1988.
5. B. W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” Bell Syst. Tech. J., pp. 291–307, 1970.
6. C. M. Fiduccia and R. M. Mattheyses, “A linear-time heuristic for improving network partitions,” in ACM/IEEE Proc. 19th Design Automation Conf., 1982, pp. 175–181.
7. T.-K. Ng, J. Oldfield, and V. Pitchumani, “Improvements of a mincut partition algorithm,” in Proc. IEEE Int. Conf CAD, IC-CAD-87, 1987, pp. 470–473.
8. K. J. Antreich, F. M. Johannes, and F. H. Kirsch, “A new approach for solving the placement problem using force models,” in IEEE Int. Symp. Circuits and Systems, Proc. ISCAS, 1982, pp. 481–486.
9. G. J. Wipfler, M. Wiesel, and D. A. Mlynski, “A combined force and cut algorithm for hierarchical VLSI layout,” in ACM/IEEE Proc. 19th Design Automation Conf., 1982, pp. 671–676.
10. C.-K. Cheng and E. S. Kuh, “Module placement based on resistive network optimization,” IEEE Trans. Computer-Aided Design, vol. CAD-3, pp. 218–225, July 1984.
11. K. M. Just, J. M. Kleinhans, and F. M. Johannes, “On the relative placement and the transportation problem for standard-cell layout,” in ACM/IEEE Proc. 23rd Design Automation Conf., 1986, pp. 308–313.
12. R. Tsay, E. S. Kuh, and C.-P. Hsu, “PROUD: A fast sea-of-gates placement algorithm,” in ACM/IEEE Proc. 25th Design Automation Conf., 1988, pp. 318–323.
13. R. H. J. M. Otten, “Eigensolutions in top-down layout design,” in IEEE Int. Symp. on Circuits and Systems, Proc. ISCAS, 1982, pp. 1017–1020.
14. J. P. Blanks, “Near-optimal placement using a quadratic objective function,” in ACM/IEEE Proc. 22nd Design Automation Conf., 1985, pp. 609–615.
15. J. Frankie and R. M. Karp, “Circuit placements and cost bounds by eigenvector decomposition,” IEEE Int. Conf, on CAD, ICCAD-86, pp. 414–417, 1986.
16. J. M. Kleinhans, “Ein Plazierungsverfahren für den zellenbasierten Layoutentwurf hochintegrierter Schaltungen,” Ph.D. dissertation, Inst. Computer-Aided Design, Dep. Elect. Eng., Tech. Univ. Munich, 1989.
17. B. Preas and K. Roberts, presented at Physical Design Workshop, Hilton Head, SC, 1987.
18. J. M. Kleinhans, G. Sigl, and F. M. Johannes, “GORDIAN: A new global optimization/rectangle dissection method for cell placement,” in Proc. IEEE Int. Conf. on CAD, ICCAD-88, 1988, pp. 506–509.
19. —, “Sea-of-gates placement by simultaneous quadratic programming combined with improved partitioning,” in Proc. IFIP TC 10/WG 10.5 Int. Conf. on Very Large Scale Integration, VLSI '89, 1989, pp. 445–454.
20. A. A. Szepieniec and R. H. J. M. Otten, “The genealogical approach to the layout problem,” in ACM/IEEE Proc. 17th Design Automation Conf., 1980, pp. 164–170.
21. R. H. J. M. Otten, “Graphs in floor-plan design,” Int. J. Circuit Theory Appl., vol. 16, pp. 391–410, 1988.
22. M. R. Hestenes and E. Stiefel, “Methods of conjugate gradients for solving linear systems,” J. Res. Nat. Bur. Stand., vol. 49, no. 6, pp. 409–436, 1952.
23. G. H. Golub and C. F. Van Loan, Matrix Computations. Baltimore, MD: Johns Hopkins University, 1985.
24. P. E. Gill, W. Murray, and M. H. Wright, Practical Optimization. London, U.K.: Academic, 1981.
25. L. P. P. P. van Ginneken and R. H. J. M. Otten, “Optimal slicing of plane point placements,” in ACM/IEEE Proc. 1st European Design Automation Conf., 1990, pp. 322–326.
26. R. H. J. M. Otten, “Efficient floorplan optimization,” in Proc. Int. Conf on Computers and Design, ICCD-83, 1983, pp. 499–501.
27. L. Stockmeyer, “Optimal orientations of cells in slicing floorplan designs,” Inform. Control, vol. 57, pp. 91–101, 1983.
28. G. Zimmermann, “A new area and shape function estimation technique for VLSI layouts,” ln ACM/IEEE Proc. 25th Design Automation Conf., 1988, pp. 60–65.
29. International Workshop on Layout Synthesis, Microelectronics Center of North Carolina, Research Triangle Park, NC, May 1990.
30. M. Bartholomeus and R. Weismantel, “Simulated annealing for standard-cell placement: Introduction, implementation and results,” in Proc. of Operations Research, Ulm, West Germany, 1989, pp. 171–190.
31. E. Hörbst, C. Müller-Schloer, and H. Schwärtzel, Design of VLSI Circuits Based on VENUS. Berlin, Germany: Springer-Verlag, 1987.
32. L. Schrader, N. Half, and A. Weller, “An ADVANCELL 1.0 mainframe chipset—2.2 million transistors on 11 ICs,” in Proc. IEEE Custom Integrated Circuits Conf., C/CC-90, 1990.
33. U. Lauther, “On automatic placement methods,” Technical Rep., Siemens Corp. Res. Develop., Appl. Comput. Sci. and Software, Syst. Design Automation, (in German). Munich, Germany, Nov. 1988.