DocumentCode :
839671
Title :
BonnPlace: Placement of Leading-Edge Chips by Advanced Combinatorial Algorithms
Author :
Brenner, Ulrich ; Struzyna, Markus ; Vygen, Jens
Author_Institution :
Res. Inst. for Discrete Math., Univ. of Bonn, Bonn
Volume :
27
Issue :
9
fYear :
2008
Firstpage :
1607
Lastpage :
1620
Abstract :
BonnPlace is the placement tool of the University of Bonn, Germany. It is continuously used in the industry for the placement of most complex chips. Global placement is based on quadratic placement and multisection. Legalization of macros and standard cells uses minimum cost flow and dynamic programming algorithms. We describe details of our implementation and present new experimental results.
Keywords :
combinatorial mathematics; dynamic programming; integrated circuit layout; BonnPlace; advanced combinatorial algorithms; cost flow; dynamic programming algorithms; leading-edge chips placement; macros legalization; quadratic placement; Costs; Design optimization; Dynamic programming; Heuristic algorithms; Linear approximation; Mathematics; Partitioning algorithms; Timing; Layout; network flows; physical design; placement; quadratic optimization;
fLanguage :
English
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
0278-0070
Type :
jour
DOI :
10.1109/TCAD.2008.927674
Filename :
4603070
Link To Document :
بازگشت