平面并行A*迷宫路由器及其在fpga中的应用

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

M. Palczewski

{"title":"平面并行A*迷宫路由器及其在fpga中的应用","authors":"M. Palczewski","doi":"10.1109/DAC.1992.227797","DOIUrl":null,"url":null,"abstract":"A plane-parallel maze-routing method for field programmable gate arrays is presented. It was demonstrated that a plane-parallel approach was significantly faster than traditional approaches, without compromising quality as measured by routing length. A framework is established for unified code to support traditional wire routing, timing driven routing, and plane parallel and global routing.<<ETX>>","PeriodicalId":162648,"journal":{"name":"[1992] Proceedings 29th ACM/IEEE Design Automation Conference","volume":"262 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"44","resultStr":"{\"title\":\"Plane parallel A* maze router and its application to FPGAs\",\"authors\":\"M. Palczewski\",\"doi\":\"10.1109/DAC.1992.227797\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A plane-parallel maze-routing method for field programmable gate arrays is presented. It was demonstrated that a plane-parallel approach was significantly faster than traditional approaches, without compromising quality as measured by routing length. A framework is established for unified code to support traditional wire routing, timing driven routing, and plane parallel and global routing.<<ETX>>\",\"PeriodicalId\":162648,\"journal\":{\"name\":\"[1992] Proceedings 29th ACM/IEEE Design Automation Conference\",\"volume\":\"262 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"44\",\"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.227797\",\"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.227797","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 44

摘要

提出了一种面向现场可编程门阵列的平面平行迷宫布线方法。结果表明，平面并行方法比传统方法明显更快，而且不会影响路由长度测量的质量。建立了统一代码的框架，支持传统的线路由、定时驱动路由、平面并行和全局路由

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

查看原文本刊更多论文

Plane parallel A* maze router and its application to FPGAs

A plane-parallel maze-routing method for field programmable gate arrays is presented. It was demonstrated that a plane-parallel approach was significantly faster than traditional approaches, without compromising quality as measured by routing length. A framework is established for unified code to support traditional wire routing, timing driven routing, and plane parallel and global routing.<>

求助全文

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

来源期刊

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

自引率

0.00%

发文量