ACM Home Page
Please provide us with feedback. Feedback
Efficient floorplan area optimization
Full text PdfPdf (533 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 26th ACM/IEEE Design Automation Conference table of contents
Las Vegas, Nevada, United States
Pages: 586 - 589  
Year of Publication: 1989
ISBN:0-89791-310-8
Authors
D. F. Wong  Department of Computer Sciences, University of Texas at Austin, Austin, Texas
P. S. Sakhamuri  Department of Electrical and Computer Enginnering, University of Texas at Austin, Austin, Texas
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS\TCDA : TC Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 43,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/74382.74481
What is a DOI?

ABSTRACT

The floorplan area optimization problem is to determine the shape and dimensions of all the modules when the topology of the floorplan is given. The objective is to minimize the area of the resulting floorplan. Existing methods only apply to slicing floorplans. We present in this paper an algorithm for general hierarchical floorplans. Our algorithm combines the curve-adding technique used in the case of slicing floorplans and a new technique that computes shape curves by iterative modification of the shape and dimensions of individual modules. We also present an optimal points selection algorithm using the technique of dynamic programming to further enhance the process of shape curves construction.


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.

 
AhHU74
 
DaKu87
Dai, Wei-Ming and E. S. Kuh, "Simultaneous Floor Planning and Gtobal Routing for Hierarchical Building-Block Layout," {EEE Trans. on CAD, Vol. CAD.6. NO.5. (1987), 828-837.
 
Laut80
Lauther, U., "A Min-Cut Placement Algorithm for General Cell Assemblies Based on a Graph Representation," Journal of Digital Systeme, Vol. IV, Issue 1, (1980), 21-34.
 
Otte82
 
Otte84
Otten, R. H. M., "Efficient Floorplan Optimization," Proc. ICCD 83, (1983), 499-502.
 
PrVa79
 
Stoc85
 
WoLi86
 
WoLi87
Wong, D. F. and C. L. Liu, "Floorplan Design for Rectangular and L-Shaped Modules", Proc. IEEE Intl. Conf. on CompuIer-Aided-Design, (1987), 520-523,

CITED BY  7

Collaborative Colleagues:
D. F. Wong: colleagues
P. S. Sakhamuri: colleagues