FARM:一种高效的馈通引脚分配算法

[1992] Proceedings 29th ACM/IEEE Design Automation Conference Pub Date : 1992-07-01 DOI:10.1109/DAC.1992.227747

Xianlong Hong, Jin Huang, Chung-Kuan Cheng, E. Kuh

{"title":"FARM:一种高效的馈通引脚分配算法","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":"{\"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}","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

摘要

作者提出了一种有效的馈通引脚分配算法FARM，以最小化最大通道密度，同时减少导线长度和通孔数。设计了一种新的垂直信道布线公式来模拟引脚分配问题。提出了一种多行密度最小化和单行引脚分配的方法来完成分配过程。给出了一些实验结果，并与前人的工作进行了比较。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

FARM: an efficient feed-through pin assignment algorithm

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.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1992] Proceedings 29th ACM/IEEE Design Automation Conference

自引率

0.00%

发文量