Chuan Lin
ABSTRACT
With the advent of deep sub-micron (DSM) era, floorplanning has become increasingly important in physical design process. In this paper we clarify a misunderstanding in using Lagrangian relaxation for the minimum area floorplanning problem. We show that the problem is not convex and its optimal solution cannot be obtained by solving its Lagrangian dual problem. We then propose a modified convex formulation and solve it using min-cost flow technique and trust region method. Experimental results under module aspect ratio bound [0.5, 2.0] show that the running time of our floorplanner scales well with the problem size in MCNC benchmark. Compared with the floorplanner in [27], our flooplanner is 9.5X faster for the largest case "ami49". It also generates a floorplan with smaller deadspace for almost all test cases. In addition, since the generated floorplan has an aspect ratio closer to 1, it is more friendly to packaging. Our floorplanner is also amicable to including interconnect cost and other physical design metrics.
- R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Application. Prentice Hall, 1993. Google Scholar
Digital Library
- M. S. Bazaraa, H. D. Sherali, and C. M. Shetty. Nonlinear programming: theory and algorithms. John Wiley & Sons, Inc., second edition, 1997.Google Scholar
- S. Boyd and L. Vandenberghe. Convex optimization. Cambridge University Press, 2004. Google ScholarDigital Library
- Y.-C. Chang, Y.-W. Chang, G.-M. Wu, and S.-W. Wu. B*-trees: A new representation for non-slicing floorplans. In DAC, pages 458--463, 2000. Google ScholarDigital Library
- C.-P. Chen, C. C. N. Chu, and D. F. Wong. Fast and exact simultaneous gate and wire sizing by lagrangian relaxation. IEEE TCAD, 18(7):1014--1025, July 1999. Google ScholarDigital Library
- T.-C. Chen and Y.-W. Chang. Modern floorplanning based on fast simulated annealing. In ISPD, pages 104--112, 2005. Google ScholarDigital Library
- A. V. Goldberg. An efficient implementation of a scaling minimum-cost flow algorithm. Journal of Algorithms, 22:1--29, 1997. Google ScholarDigital Library
- G. H. Golub and C. F. van Loan. Matrix Computations. Johns Hopkins, 3rd edition, 1996.Google Scholar
- P.-N. Guo, C.-K. Cheng, and T. Yoshimura. An O-tree representation of non-slicing floorplan and its applications. In DAC, pages 268--273, 1999. Google ScholarDigital Library
- X. Hong, G. Huang, Y. Cai, J. Gu, S. Dong, C.-K. Cheng, and J. Gu. Corner block list: An effective and efficient topological representation of non-slicing floorplan. In ICCAD, pages 8--12, 2000. Google ScholarDigital Library
- M. Kang and W. W. M. Dai. General floorplanning with l-shaped, t-shaped and soft blocks based on bounded slicing grid structure. In ASP-DAC, pages 265--270, 1997.Google ScholarCross Ref
- J.-M. Lin and Y.-W. Chang. TCG: A transitive closure graph-based representation for non-slicing floorplans. In DAC, pages 764--769, 2001. Google ScholarDigital Library
- D. G. Luenberger. Linear and nonlinear programming. Addison-Wesley, Reading, Massachusetts, 1984.Google Scholar
- T.-S. Moh, T.-S. Chang, and S. L. Hakimi. Globally optimal floorplanning for a layout problem. IEEE Transaction on Circuit and Systems - I: Fundamental Theory and Applications, 43(9):713--720, 1996.Google ScholarCross Ref
- H. Murata, K. Fujiyoshi, S. Nakatake, and Y. Kajitani. Rectangle-packing based module placement. In ICCAD, pages 472--479, 1995. Google ScholarDigital Library
- H. Murata and E. S. Kuh. Sequence-pair based placement method for hard/soft/pre-placed modules. In ISPD, pages 167--172, 1998. Google ScholarDigital Library
- S. Nakatake, K. Fujiyoshi, H. Murata, and Y. Kajitani. Module placement on BSG-structure and IC layout applications. In ICCAD, pages 484--493, 1996. Google ScholarDigital Library
- J. Nocedal and S. J. Wright. Numerical optimization. Springer Series in Operations Research, Springer Verlag, 1999.Google Scholar
- R. H. J. M. Otten. Automatic floorplan design. In DAC, pages 261--267, 1982. Google ScholarDigital Library
- P. Pan and C. L. Liu. Area minimization for floorplans. IEEE TCAD, 14(1):123--132, January 1995. Google ScholarDigital Library
- K. Sakanushi and Y. Kajitani. The quarter-state sequence (qsequence) to represent the floorplan and applications to layout optimization. In IEEE APCCAS, pages 829--832, 2000.Google ScholarCross Ref
- L. Stockmeyer. Optimal orientations of cells in slicing floorplan designs. Information and Control, 59:91--101, 1983. Google ScholarDigital Library
- T.-C. Wang and D. F Wong. An optimal algorithm for floorplan area optimization. In DAC, pages 180--186, 1990. Google ScholarDigital Library
- T.-C. Wang and D. F. Wong. Optimal floorplan area optimization. IEEE TCAD, 2(8):992--1001, 1992.Google Scholar
- D. F. Wong and C. L. Liu. A new algorithm for floorplan design. In DAC, pages 101--107, 1986. Google ScholarDigital Library
- B. Yao, H. Chen, C. K. Cheng, and R. Graham. Revisiting floorplan representation. In ISPD, pages 138--143, 2001. Google ScholarDigital Library
- F. Y. Young, C. C. N. Chu, W. S. Luk, and Y. C. Wong. Handling soft modules in general non-slicing floorplan using lagrangian relaxation. IEEE TCAD, 20(5):687--692, May 2001. Google ScholarDigital Library
- F. Y. Young, C. C. N. Chu, and Z. C. Shen. Twin binary sequences: A non-redundant representation for general non-slicing floorplan. IEEE TCAD, 22(4):457--469, April 2003. Google ScholarDigital Library
- H. Zhou and J. Wang. Acg-adjacent constraint graph for general floorplans. In ICCD, pages 572--575, 2004. Google ScholarDigital Library
Index Terms
- A revisit to floorplan optimization by Lagrangian relaxation
Recommendations
An enhanced congestion-driven floorplanner
In this paper, a rectilinear-based congestion-driven floorplanning algorithm is presented to enhance the wire congestion and the CPU runtime. The proposed algorithm contains two stages, including the simulated-annealing (SA) based approach with the ...
Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
Optimization problems whose objective function and constraints are quadratic polynomials are called quadratically constrained quadratic programs (QCQPs). QCQPs are NP-hard in general and are important in optimization theory and practice. There have been ...
Comments