A Fast Data Structure for HPWL Based on Reusablity Analysis
In the process of solution evaluation for simulated annealing, the computation for wire-length is still a time consuming part, though now the buffer planning and thermal model have taken up a lot of time. And the traditional wire-length model HPWL executes in O(n×m)time in which n stands for the number of nets and m is the average number of the modules that the nets connect. In order to reduce the time for HPWL calculation, we propose two new data structures in this paper: “Nets Union and “Subset Chain to handle two typical kinds of reusable nets information respectively that are “Complete Overlap and “Partial Overlap. Then the HPWL calculation can be finished in O(αn×βm) ,0＜α,β＜1 . And our experiment results show the effectiveness of our algorithm.
Jiayi Liu Sheqin Dong Xianlong Hong
Department of Computer Science and Technology Tsinghua University Beijing, China
国际会议
2006 International Conference on Communications,Circuits and Systems(第四届国际通信、电路与系统学术会议)
广西桂林
英文
2439-2443
2006-06-25（万方平台首次上网日期，不代表论文的发表时间）