To obtain a better placement result，a partitioning—based
placement algorithm with wirelenIgth prediction calledⅢ一Pl is
presented．A new method is proposed to estimate proximity of
interconnects in a netlist，which is capable of predicting not only
short interconnects but long interconnects accurately．The
predicted wirelength is embedded into the partitioning tool of
bisection—based global placement，which can guide our placement
towards a solution with shorter interconnects．In addition．the
timing objective Call be handled within the algorithm by
mi。ni。ml。zi‘ng the critical path delay．Experimental resuiLs show
that．compared to Capol0．5，mPL6，and NTUplace，l-lJ—Pl
outperforms these placers in terms of wirelength and run time．
The improvements in terms of average wirelength over
Capol0．5，mPL6 and NPUplace are 13％，3％，and 9％with only
19％．9l％，and 99％ of their runtime，respectively．By
integrating the predicted wirelength—driven clustering into
Capol0．5，the placer is able to reduce average wirelength by
3％．The timing—driven HJ—PI can reduce the criticaI path delay
by 23％．
; 马鸿
修改评论