A revisit to floorplan optimization by Lagrangian relaxation

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

Volumn , Issue , 2006, Pages 164-171

  Lin, Chuan ^a   Zhou, Hai ^b   Chu, Chris ^c  

^a MAGMA DESIGN AUTOMATION   (United States)

^b NORTHWESTERN UNIVERSITY   (United States)

^c IOWA STATE UNIVERSITY   (United States)

Author keywords

Floorplan; Lagrangian relaxation

Indexed keywords

COMPUTER-AIDED DESIGN; COST FLOW; DEEP SUB-MICRON (DSM); EXPERIMENTAL RESULTS; FLOOR PLANNING; FLOOR-PLANNING; FLOORPLANNER; INTERNATIONAL CONFERENCES; LA-GRANGIAN RELAXATION (LR); LAGRANGIAN DUAL PROBLEMS; MCNC BENCHMARKS; METRICS (CO); OPTIMAL SOLUTIONS; PHYSICAL DESIGNS; PROBLEM SIZES; RUNNING TIME; TEST CASES; TO PACKAGING; TRUST REGION METHODS;

COST ACCOUNTING; DESIGN; DIMENSIONAL STABILITY; FLUID MECHANICS; LAGRANGE MULTIPLIERS; PRESSURE DROP; PROCESS DESIGN; PROCESS ENGINEERING;

ASPECT RATIO;

EID: 46149102946     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2006.320081     Document Type: Conference Paper

References (29)

1. R. K. Ahuja, T. L. Magnanti, and J. B, Orlin. Network Flows: Theory, Algorithms, and Application. Prentice Hall, 1993,
2. M. S. Bazaraa, H. D. Sherali, and C. M. Shetty. Nonlinear programming: theory and algorithms. John Wiley & Sons. Inc., second edition, 1997.
3. S. Boyd and L. Vandenberghe. Convex optimization. Cambridge University Press, 2004.
4. 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.
5. 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.
6. T.-C. Chen and Y.-W. Chang. Modern floorplanning based on fast simulated annealing. In ISPD, pages 104-112, 2005.
7. A. V. Goldberg. An efficient implementation of a scaling minimum-cost flow algorithm. Journal of Algorithms, 22:1-29, 1997.
8. G. H. Golub and C. F. van Loan. Matrix Computations. Johns Hopkins, 3rd edition, 1996.
9. 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.
10. 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 fioorplan. In ICCAD, pages 8-12, 2000.
11. 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.
12. J.-M. Lin and Y.-W. Chang. TCG: A transitive closure graph-based representation for non-slicing floorplans. In DAC, pages 764-769, 2001.
13. D. G. Luenberger. Linear and nonlinear programming. Addison-Wesley, Reading, Massachusetts, 1984.
14. 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.
15. H. Murata, K. Fujiyoshi, S. Nakatake, and Y. Kajitani. Rectangle-packing based module placement. In ICCAD, pages 472-179, 1995.
16. H. Murata and E. S. Kuh. Sequence-pair based placement method for hard/soft/pre-placed modules. In ISPD, pages 167-172, 1998.
17. S. Nakatake, K. Fujiyoshi, H. Murata, and Y Kajitani. Module placement on BSG-structure and IC layout applications. In ICCAD, pages 484-493, 1996.
18. J. Nocedal and S. J. Wright. Numerical optimization. Springer Series in Operations Research, Springer Verlag, 1999.
19. R. H. J. M. Otten. Automatic fioorplan design. In DAC, pages 261-267, 1982.
20. P. Pan and C. L. Liu. Area minimization for floorplans. IEEE TCAD, 14(1):123-132, January 1995.
21. K. Sakanushi and Y Kajitani. The quarter-state sequence (qsequence) to represent the fioorplan and applications to layout optimization. In IEEE APCCAS, pages 829-832, 2000.
22. L. Stockmeyer. Optimal orientations of cells in slicing fioorplan designs. Information and Control, 59:91-101, 1983.
23. T.-C. Wang and D. F Wong. An optimal algorithm for fioorplan area optimization. In DAC, pages 180-186, 1990.
24. T.-C. Wang and D. F. Wong. Optimal fioorplan area optimization. IEEE TCAD, 2(8):992-1001, 1992.
25. D. F. Wong and C. L. Liu. A new algorithm for fioorplan design. In DAC, pages 101-107,1986.
26. B. Yao, H. Chen, C. K. Cheng, and R. Graham. Revisiting fioorplan representation. In ISPD, pages 138-143, 2001.
27. F. Y. Young, C. C. N. Chu, W. S. Luk, and Y. C. Wong. Handling soft modules in general non-slicing fioorplan using lagrangian relaxation. IEEE TCAD, 20(5):687-692, May 2001.
28. F. Y. Young, C. C. N. Chu, and Z. C. Shen. Twin binary sequences: A non-redundant representation for general non-slicing fioorplan. IEEE TCAD, 22(4):457-469, April 2003.
29. H. Zhou and J. Wang. Acg-adjacent constraint graph for general floorplans. In 1CCD, pages 572-575,2004.