| Floorplan sizing by linear programming approximation |
| Full text |
Pdf
(66 KB)
|
| Source
|
Annual ACM IEEE Design Automation Conference
archive
Proceedings of the 37th Annual Design Automation Conference
table of contents
Los Angeles, California, United States
Pages: 468 - 471
Year of Publication: 2000
ISBN:1-58113-187-9
|
|
Authors
|
|
Pinhong Chen
|
EECS Dept., Univ. of California at Berkeley, Berkeley, CA
|
|
Ernest S. Kuh
|
EECS Dept., Univ. of California at Berkeley, Berkeley, CA
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 2, Downloads (12 Months): 23, Citation Count: 5
|
|
|
ABSTRACT
In this paper, we present an approximation algorithm by linear programming (LP) for floorplan sizing problem. Given any topological constraints between blocks, we can formulate it as an LP problem with a cost function for the minimum bounding box area. Unlike slicing structures, this approach can handle any topological constraints as well as soft/hard/preplaced blocks, and timing constraints. Empirically, our method needs few iterations to find the optimum solution and shows one order of improvement over previous methods both in run time and capability to handle a larger problem size even on a very limited computing resource PC.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
T. S. Mob, T. S. Chang, and S.L.Hakimi. "Globally optimal floorplanning for a layout problem". IEEE Trans. on Circuit and Systems - I: Fundamental Theory and Applications, Vol.43:pp.713-720, Sep. 1996.
|
 |
3
|
|
| |
4
|
K. Wang and W.K. Chen. "Floorplan Area Optimization using Network Analogous Approach". In Proc. oflEEE International Symposium on Circuits and Systems, pages 167-170, 1995.
|
 |
5
|
|
| |
6
|
|
| |
7
|
|
CITED BY 5
|
|
|
|
|
|
|
|
|
|
|
Ou He , Sheqin Dong , Jinian Bian , Satoshi Goto , Chung-Kuan Cheng, A novel fixed-outline floorplanner with zero deadspace for hierarchical design, Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design, November 10-13, 2008, San Jose, California
|
|
|
|
|