FARM: an efficient feed-through pin assignment algorithm

Xianlong Hong, Jin Huang, Chung-Kuan Cheng, E. Kuh
{"title":"FARM: an efficient feed-through pin assignment algorithm","authors":"Xianlong Hong, Jin Huang, Chung-Kuan Cheng, E. Kuh","doi":"10.1109/DAC.1992.227747","DOIUrl":null,"url":null,"abstract":"The authors propose an efficient feedthrough pin assignment algorithm, FARM, to minimize the maximum channel density, and at the same time to reduce the wire length and via number. A novel vertical channel routing formulation is devised to model the pin assignment problem. A multirow density minimization followed with a single-row pin assignment is proposed to complete the assignment process. Some experimental results and a comparison with previous work are given.<<ETX>>","PeriodicalId":162648,"journal":{"name":"[1992] Proceedings 29th ACM/IEEE Design Automation Conference","volume":"158 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings 29th ACM/IEEE Design Automation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DAC.1992.227747","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

The authors propose an efficient feedthrough pin assignment algorithm, FARM, to minimize the maximum channel density, and at the same time to reduce the wire length and via number. A novel vertical channel routing formulation is devised to model the pin assignment problem. A multirow density minimization followed with a single-row pin assignment is proposed to complete the assignment process. Some experimental results and a comparison with previous work are given.<>
FARM:一种高效的馈通引脚分配算法
作者提出了一种有效的馈通引脚分配算法FARM,以最小化最大通道密度,同时减少导线长度和通孔数。设计了一种新的垂直信道布线公式来模拟引脚分配问题。提出了一种多行密度最小化和单行引脚分配的方法来完成分配过程。给出了一些实验结果,并与前人的工作进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信