HJ-hPl: Hierarchical mixed-size placement algorithm with priori wirelength estimation
Hao Jie; Peng Silong; Silong Peng
2008
会议名称9th International Conference for Young Computer Scientists ICYCS 2008
会议录名称Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for
页码pp 947-952
会议日期2008/11/18-2008/11/21
会议地点中国Zhang Jia Jie Hunan China
摘要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%.
关键词Mixed-size Partitioning Placement Vlsiwirelength Estimation.
文献类型会议论文
条目标识符http://ir.ia.ac.cn/handle/173211/12252
专题国家专用集成电路设计工程技术研究中心
通讯作者Silong Peng
推荐引用方式
GB/T 7714
Hao Jie,Peng Silong,Silong Peng. HJ-hPl: Hierarchical mixed-size placement algorithm with priori wirelength estimation[C],2008:pp 947-952.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Hao Jie]的文章
[Peng Silong]的文章
[Silong Peng]的文章
百度学术
百度学术中相似的文章
[Hao Jie]的文章
[Peng Silong]的文章
[Silong Peng]的文章
必应学术
必应学术中相似的文章
[Hao Jie]的文章
[Peng Silong]的文章
[Silong Peng]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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