A fast and stable force-directed placement with implicit buffer planning

Lijuan Luo, Qiang Zhou, Yici Cai, Xianlong Hong, Yibo Wang, H.H. Yang
{"title":"A fast and stable force-directed placement with implicit buffer planning","authors":"Lijuan Luo, Qiang Zhou, Yici Cai, Xianlong Hong, Yibo Wang, H.H. Yang","doi":"10.1109/ICASIC.2005.1611438","DOIUrl":null,"url":null,"abstract":"As technology advances, the number of required buffers increases significantly and it is desirable to plan buffers at placement stage. This paper studies the approach of planning buffers during analytical placement. First, a fast and stable force-directed placement is introduced, which is averagely 1.71 times as fast as Capo8.8, a state-of-the-art placement tool, with little degradation of wire-length. Then a new model for planning buffers during placement is proposed, which can efficiently ensure the convergence of placement iterations only by modeling buffers implicitly with changed density distribution and modified connectivity weight between drivers and receivers. Also, equivalent candidate positions for buffer insertion are explored to resolve buffer overlaps. Experiments show that compared with previous buffer planning methods, our new approach can achieve greater efficiency as well as quality improvement","PeriodicalId":431034,"journal":{"name":"2005 6th International Conference on ASIC","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 6th International Conference on ASIC","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASIC.2005.1611438","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

As technology advances, the number of required buffers increases significantly and it is desirable to plan buffers at placement stage. This paper studies the approach of planning buffers during analytical placement. First, a fast and stable force-directed placement is introduced, which is averagely 1.71 times as fast as Capo8.8, a state-of-the-art placement tool, with little degradation of wire-length. Then a new model for planning buffers during placement is proposed, which can efficiently ensure the convergence of placement iterations only by modeling buffers implicitly with changed density distribution and modified connectivity weight between drivers and receivers. Also, equivalent candidate positions for buffer insertion are explored to resolve buffer overlaps. Experiments show that compared with previous buffer planning methods, our new approach can achieve greater efficiency as well as quality improvement
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有隐式缓冲规划的快速稳定的力定向放置
随着技术的进步,所需的缓冲区数量显著增加,在放置阶段规划缓冲区是可取的。本文研究了分析放置过程中缓冲区的规划方法。首先,介绍了一种快速稳定的力导向放置,其平均速度是最先进的放置工具Capo8.8的1.71倍,并且导线长度几乎没有下降。在此基础上,提出了一种新的缓冲区布局规划模型,该模型通过改变缓冲区的密度分布和修改驱动器与接收器之间的连通性权重来隐式建模缓冲区,从而有效地保证了布局迭代的收敛性。此外,还探索了缓冲区插入的等效候选位置以解决缓冲区重叠问题。实验表明,与以往的缓冲规划方法相比,本文提出的方法在提高质量的同时提高了效率
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A CMOS continuous-time Gm-C filter and programmable gain amplifier for WPAN receivers A VLSI architecture for motion compensation interpolation in H.264/AVC Transition traversal coverage estimation for symbolic model checking Power reduction in high-speed inter-chip data communications An optimization of VLSI architecture for DFE used in Ethernet
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1