ACM Home Page
Please provide us with feedback. Feedback
Modern floorplanning based on fast simulated annealing
Full text PdfPdf (396 KB)
Source International Symposium on Physical Design archive
Proceedings of the 2005 international symposium on Physical design table of contents
San Francisco, California, USA
SESSION: Floorplanning table of contents
Pages: 104 - 112  
Year of Publication: 2005
ISBN:1-59593-021-3
Authors
Tung-Chieh Chen  National Taiwan University, Taiwan
Yao-Wen Chang  National Taiwan University, Taiwan
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 94,   Citation Count: 16
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Unlike classical floorplanning that usually handles only block packing to minimize silicon area, modern VLSI floorplanning typically needs to pack blocks within a fixed die (outline) and additionally considers the packing with block positions and interconnect constraints. Floorplanning with bus planning is one of the most challenging modern floorplanning problems because it needs to consider the constraints with interconnect and block positions simultaneously. We study in this paper two types of modern floorplanning problems: (1) fixed-outline floorplanning and (2) bus-driven floorplanning. Our floorplanner uses the B*-tree floorplan representation and is based on a fast three-stage simulated annealing scheme, called Fast-SA. For fixed-outline floorplanning, we present an adaptive Fast-SA that can dynamically change the weights in the cost function to optimize wirelength under the outline constraint. Experimental results show that our floorplanner can achieve almost 100% success rates efficiently for fixed-outline floorplanning with various aspect ratios, compared to 10%--90% success rates obtained by the most recent works. For the bus-driven floorplanning, we explore the feasibility conditions of the B*-tree with the bus constraints and develop a bus-driven floorplanning algorithm based on the conditions and Fast-SA. Experimental results show that our floorplanner on the average reduces 20% (55%) dead space for the floorplanning with hard (soft) macro blocks, compared with the most recent work. In particular, our floorplanner is more efficient than the previous works.


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
E.H.L. Aarts and P.J.M. van Laarhoven, "A new polynomial time cooling schedule," Proceedings of IEEE/ACM International Conference on Computer-Aided Design, 1985.
 
2
3
 
4
S. N. Adya and I. L. Markov, "Fixed-outline Floorplanning: Enabling Hierarchical Design," IEEE Trans. on VLSI Systems, vol 11(6), pp. 1120--1135, December 2003.
5
 
6
J.-C. Chi and M. C. Chi, "A block placement algorithm for VLSI circuits," Chung Yuan Journal, Vol. 31, No. 1, March 2003, pp. 69--75.
 
7
GSRC Floorplan Benchmark Suite, http://www.cse.ucsc.edu/research/surf/GSRC/GSRCbench.html
 
8
C. Sechen and A. Sangiovanni-Vincentelli, "The TimberWolf placement and routing package," IEEE Journal of Solid-State Circuits, pp. 510--522, Volume 20, 1985.
9
10
 
11
S. Kirpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Science, pp.671--680, 1983.
12
 
13
 
14
 
15
Parquet: Fixed-Outline Floorplanner, http://vlsicad.eecs.umich.edu/BK/parquet/
 
16
F. Rafiq, M. Chrzanowska-Jeske, H. H. Yang, and N. Sherwani, "Bus-based integrated floorplanning," Proceedings of IEEE International Synposium on Circuits and Systems, pp. 875--878, 2002.
17
 
18
19
 
20
 
21
 
22

CITED BY  16
 
 
 
 
 
 

Collaborative Colleagues:
Tung-Chieh Chen: colleagues
Yao-Wen Chang: colleagues