ACM Home Page
Please provide us with feedback. Feedback
Multilevel floorplanning/placement for large-scale modules using B*-trees
Full text PdfPdf (389 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 40th annual Design Automation Conference table of contents
Anaheim, CA, USA
SESSION: Floorplanning and placement table of contents
Pages: 812 - 817  
Year of Publication: 2003
ISBN:1-58113-688-9
Authors
Hsun-Cheng Lee  Synopsys Inc., Taipei, Taiwan
Yao-Wen Chang  National Taiwan University, Taipei, Taiwan
Jer-Ming Hsu  National Center for High-Performance Computing, Hsinchu, Taiwan
Hannah H. Yang  Strategic CAD Labs, Intel Corporation, Hillsboro, OR
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 37,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

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/775832.776037
What is a DOI?

ABSTRACT

We present in this paper a multilevel floorplanning/placement framework based on the B*-tree representation, called MB*-tree, to handle the floorplanning and packing for large-scale building modules. The MB*-tree adopts a two-stage technique, clustering followed by declustering. The clustering stage iteratively groups a set of modules based on a cost metric guided by area utilization and module connectivity, and at the same time establishes the geometric relations for the newly clustered modules by constructing a corresponding B*-tree for them. The declustering stage iteratively ungroups a set of the previously clustered modules (i.e., perform tree expansion) and then refines the floorplanning/placement solution by using a simulated annealing scheme. In particular, the MB*-tree preserves the geometric relations among modules during declustering, which makes the MB*-tree an ideal data structure for the multilevel floorplanning/placement framework. Experimental results show that the MB*-tree obtains significantly better silicon area and wirelength than previous works. Further, unlike previous works, MB*-tree scales very well as the circuit size increases.


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
C. J. Alpert, J.-H. Huang, and A. B. Kahng, "Multilevel circuit partitioning," IEEE Trans. CAD, vol. 17, no. 8, pp. 655--667, August 1998.
 
3
M. S. Bazaraa, H. D. Sherali, C. M. Shetty, Nonlinear Programming Theory and Algorithms, 1993.
 
4
5
 
6
 
7
8
9
10
11
12
13
14
15
 
16
17
 
18
 
19
 
20
21
 
22
23

CITED BY  10
 
 
 
 
 
 

Collaborative Colleagues:
Hsun-Cheng Lee: colleagues
Yao-Wen Chang: colleagues
Jer-Ming Hsu: colleagues
Hannah H. Yang: colleagues

Peer to Peer - Readers of this Article have also read: