ACM Home Page
Please provide us with feedback. Feedback
On the use of flexible, rectilinear blocks to obtain minimum-area floorplans in mixed block and cell designs
Full text PdfPdf (137 KB)
Source ACM Transactions on Design Automation of Electronic Systems (TODAES) archive
Volume 5 ,  Issue 1  (January 2000) table of contents
Pages: 82 - 97  
Year of Publication: 2000
ISSN:1084-4309
Authors
Dinesh P. Mehta  Univ. of Tennessee Space Institute, Tullahoma
Naveed Sherwani  Intel Corp., Hillsboro, OR
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 26,   Citation Count: 3
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/329458.329470
What is a DOI?

ABSTRACT

This paper presents three minimum-area floorplanning algorithms that use flexible arbitrary rectilinear shapes for the standard cell regions in MBC design. The first algorithm (pure HCST) introduces a grid traversal technique which guarantees a minimum-area floorplan. The second algorithm (Hybrid-BF) uses a combination of HCST and Breadth First (BF) traversals to give a practical solution that approximately places flexible blocks at specified locations called seeds. The third algorithm (Hybrid-MBF) improves on the shapes of the flexible blocks generated by Hybrid-BF by using a combination of HCST and a Modified Breadth First (MBF) traversal. All three algorithms are polynomial in the number of grid squares. Optimized implementations of Hybrid-BF and Hybrid-MBF required less than two seconds on a SUN SPARCstation 10.


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
CHONG,K.AND SAHNI, S. 1993. Optimal realizations of floorplans. IEEE Trans. Comput.-Aided Des. 12 (June 1993), 793-801.
 
3
DAI, W., ESCHERMANN, B., KUH, E., AND PEDRAM, M. 1989. Hierarchical placement and floorplanning in BEAR. IEEE Trans. Comput.-Aided Des. 8, 1335-1349.
 
4
 
5
KOZMINSKI,K.A.AND KINNEN, E. 1988. Rectangular dualization and rectangular dissections. IEEE Trans. Circ. Syst. 35 (Nov. 1988), 1401-1416.
6
 
7
MEHTA,D.P.,SHANBHAG, A., AND SHERWANI, N. A. 1995. A new approach for floorplanning in MBC designs. Technical Report No. 95-02. Space Institute, Univ. Tennessee, Knoxville, TN.
 
8
 
9
 
10
OTTEN, R. 1983. Efficient floorplan optimization. In Proceedings of the International Conference on Computer Aided Design 499-503.
 
11
PAN,P.AND LIU, C. L. 1995. Area minimization for floorplans. IEEE Trans. Comput.-Aided Des. 14 (Jan.), 123-132.
 
12
 
13
PUTATUNDA, R., SMITH, D., STEBNISKY, M., PUSCHAK, C., AND PATENT, P. 1988. VITAL: Fully automatic placement strategies for very large semicustom designs. In Proceedings of the International Conference on Computer Design (ICCD '88) 434-439.
 
14
 
15
 
16
 
17
SUTHANTAVIBUL, S., SHRAGOWITZ, E., AND ROSEN, J. B. 1991. An analytic approach to floorplan design and optimization. IEEE Trans. Comput.-Aided Des. 10 (June 1991), 761-769.
18
 
19
VIJAYAN,G.AND TSAY, R. 1991. A new method for floorplanning using topological constraint reduction. IEEE Trans. Comput.-Aided Des. 10 (Dec. 1991), 1494-1501.
 
20
WANG,T.AND WONG, D. 1988. Optimal floorplanning area minimization. IEEE Trans. Comput.-Aided Des. CAD-7, 11 (Nov.), 992-1002.
 
21


Collaborative Colleagues:
Dinesh P. Mehta: colleagues
Naveed Sherwani: colleagues