|HJ-hPl: Hierarchical mixed-size placement algorithm with priori wirelength estimation|
|Hao Jie; Peng Silong; Silong Peng
|Conference Name||9th International Conference for Young Computer Scientists ICYCS 2008
|Source Publication||Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for
|Conference Place||中国Zhang Jia Jie Hunan China
|Abstract||A partitioning-based placement algorithm with
priori wirelength estimation called HJ-hPl is presented
in this paper. We propose a new methodology to
estimate proximity of wirelengths in a netlist which is
capable of estimating not only short interconnects but
long interconnects accurately. We embed the wirelength estimation into the partitioning tool of our
global placement which can guide our placement
towards a solution with shorter wirelengths. In
addition we employ a regular structure clustering
technique to reduce the size of the original placement
which can also bring on a tighter placement result.
Experimental results show that compared to
Capo10.5 mPL6 and NTUplace HJ-hPl outperforms
theirs in term of wirelength and run time. The
improvements in terms of average wirelength over
Capo10.5 mPL6 and NPUplace are 13% 3% and 9%
with only 19% 91% and 99% of their runtime
respectively. By integrating our estimated wirelength
driven clustering into Capo10.5 we are able to reduce
average wirelength by 3%.|
|Keyword||Mixed-size Partitioning Placement Vlsiwirelength Estimation.
|Corresponding Author||Silong Peng|
Hao Jie,Peng Silong,Silong Peng. HJ-hPl: Hierarchical mixed-size placement algorithm with priori wirelength estimation[C],2008:pp 947-952.
|Files in This Item:||
||There are no files associated with this item.
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.