| Recursive bisection placement algorithm with the predicted wirelength | |
Hao J(蒿杰) ; Hao J(蒿杰)
| |
| Source Publication | Journal of Southeast University
 |
| 2008 | |
| Volume | 24Issue:4Pages:462-467 |
| Abstract | Abstract:Toobtainabetterplacementresult, apartitioning-based placementalgorithm withwirelengthpredictioncalledHJ-Plis presented.A new methodisproposedtoestimateproximityof interconnectsinanetlist, whichiscapableofpredictingnotonly shortinterconnects but long interconnects accurately.The predictedwirelengthisembeddedintothepartitioningtoolof bisection-basedglobalplacement, whichcanguideourplacement towardsasolutionwithshorterinterconnects.Inaddition, the timing objective can be handled within the algorithm by minimizingthecriticalpathdelay.Experimentalresultsshow that, compared to Capo10.5, mPL6, and NTUplace, HJ-Pl outperformstheseplacersintermsofwirelengthandruntime. The improvements in terms of average wirelength over Capo10.5, mPL6 andNPUplaceare13%, 3%, and9% withonly 19%, 91%, and 99% of their runtime, respectively.By integrating the predicted wirelength-driven clustering into Capo10.5, theplacerisabletoreduceaveragewirelengthby 3%.Thetiming- |
| Keyword | Words:Hierarchy Interconnect Placement Vlsicircuit Wirelength Prediction |
| Document Type | 期刊论文 |
| Identifier | http://ir.ia.ac.cn/handle/173211/12249 |
| Collection | 国家专用集成电路设计工程技术研究中心 |
| Corresponding Author | Hao J(蒿杰) |
| Recommended Citation GB/T 7714 | Hao J,Hao J. Recursive bisection placement algorithm with the predicted wirelength[J]. Journal of Southeast University,2008,24(4):462-467. |
| APA | Hao J,&蒿杰.(2008).Recursive bisection placement algorithm with the predicted wirelength.Journal of Southeast University,24(4),462-467. |
| MLA | Hao J,et al."Recursive bisection placement algorithm with the predicted wirelength".Journal of Southeast University 24.4(2008):462-467. |
| Files in This Item: | Download All | |||||
| File Name/Size | DocType | Version | Access | License | ||
| 预测线长驱动的二分布局算法_英文_蒿杰.（372KB） | 期刊论文 | 作者接受稿 | 开放获取 | CC BY-NC-SA | View Download | |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment