A High-Quality Transitive-Closure-Graph-Based Macro Placer
Date Issued
2007
Date
2007
Author(s)
Chen, Hsin-Chen
DOI
en-US
Abstract
In this thesis, we propose a transitive-closure-graph-based (TCG-based) macro placement algorithm that removes macro overlaps and optimizes macro positions. Improving over TCG by working only on its essential edges without loss of the solution quality, our algorithm can efficiently and effectively search for a high quality macro geometric relation. Instead of packing macros along chip boundaries like the most recent previous work, our placer can determine a non-compacted macro placement by linear programming and placement region cost evaluation. Our macro placer is so flexible and versatile that it can easily extend the linear programming formulation to handle various placement constraints/objectives. Combined with various leading academic placers, our macro placer can consistently and significantly reduce the wirelength, implying that our macro placer is robust and has very high quality. For example, based on the ISPD’06 placement benchmarks, combined with our macro placer, the resulting wirelength of Capo 1.2, mPL6, and NTUplace3 can further be reduced by 5%, 6%, and 15% on average, respectively.
Subjects
實體設計
擺置
巨集電路
遞移封閉圖表示法
線性規劃
physical design
placement
macro
Transitive Closure Graph
linear programming
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-96-R94921045-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):5b98a3d9874303d0d2a20e28e83f69dc