Recursive bisection placement algorithm with the predicted wirelength
Hao J(蒿杰); Hao J(蒿杰)
2008
发表期刊Journal of Southeast University
卷号24期号:4页码:462-467
摘要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-
关键词Words:Hierarchy Interconnect Placement Vlsicircuit Wirelength Prediction
文献类型期刊论文
条目标识符http://ir.ia.ac.cn/handle/173211/12249
专题国家专用集成电路设计工程技术研究中心
通讯作者Hao J(蒿杰)
推荐引用方式
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.
条目包含的文件 下载所有文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
预测线长驱动的二分布局算法_英文_蒿杰.(372KB)期刊论文作者接受稿开放获取CC BY-NC-SA浏览 下载
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Hao J(蒿杰)]的文章
[蒿杰]的文章
百度学术
百度学术中相似的文章
[Hao J(蒿杰)]的文章
[蒿杰]的文章
必应学术
必应学术中相似的文章
[Hao J(蒿杰)]的文章
[蒿杰]的文章
相关权益政策
暂无数据
收藏/分享
文件名: 预测线长驱动的二分布局算法_英文_蒿杰.pdf
格式: Adobe PDF
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。