DocumentCode
2799587
Title
Robust mixed-size placement under tight white-space constraints
Author
Cong, Jason ; Romesis, Michail ; Shinnerl, Joseph R.
Author_Institution
Dept. of Comput. Sci., UCLA, Los Angeles, CA, USA
fYear
2005
fDate
6-10 Nov. 2005
Firstpage
165
Lastpage
172
Abstract
A novel and very simple correct-by-construction top-down methodology for high-utilization mixed-size placement is presented. The Polarbear algorithm combines recursive cut-size-driven partitioning with fast and scalable legalization of every placement subproblem generated by every partitioning. The feedback provided by the legalizer at all stages of partitioning improves final placement quality significantly on standard IBM benchmarks and dramatically on low-white-space adaptations of them. Compared to Feng Shui 5.1 and Capo 9.3, Polarbear is the only tool that can consistently find high-quality placements for benchmarks with less than 5% white space. With white space at 5%, Polarbear beats Capo 9.3 by 10% in average total wirelength while Feng Shui 5.1 frequently fails to find legal placements altogether. With 20% white space, POLARBEAR still beats Capo 9.3 by 1% and Feng Shui 5.1 by 1% in average total wirelength, in comparable run times.
Keywords
circuit layout CAD; integrated circuit layout; logic CAD; logic partitioning; Polarbear algorithm; construction top-down methodology; cut-size-driven partitioning; fast scalable legalization; final placement quality; high-quality placements; high-utilization mixed-size placement; recursive bipartitioning; robust mixed-size placement; tight white-space constraint; Algorithm design and analysis; Computer science; Costs; Design automation; Law; Legal factors; Partitioning algorithms; Robustness; Timing; White spaces;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer-Aided Design, 2005. ICCAD-2005. IEEE/ACM International Conference on
Print_ISBN
0-7803-9254-X
Type
conf
DOI
10.1109/ICCAD.2005.1560058
Filename
1560058
Link To Document