CAFE路由器:一种快速连接感知多网路由算法，用于有障碍物的路由网格

2010 15th Asia and South Pacific Design Automation Conference (ASP-DAC) Pub Date : 2010-01-18 DOI:10.1109/ASPDAC.2010.5419882

Y. Kohira, A. Takahashi

{"title":"CAFE路由器:一种快速连接感知多网路由算法，用于有障碍物的路由网格","authors":"Y. Kohira, A. Takahashi","doi":"10.1109/ASPDAC.2010.5419882","DOIUrl":null,"url":null,"abstract":"In this paper, we propose CAFE router which obtains routes of multiple nets with target wire lengths for single layer routing grid with obstacles. CAFE router extends the route of each net from a pin to the other pin greedily so that the wire length of the net approaches its target wire length. Experiments show that CAFE router obtains the routes of nets with small length error in short time.","PeriodicalId":152569,"journal":{"name":"2010 15th Asia and South Pacific Design Automation Conference (ASP-DAC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"CAFE router: A fast connectivity aware multiple nets routing algorithm for routing grid with obstacles\",\"authors\":\"Y. Kohira, A. Takahashi\",\"doi\":\"10.1109/ASPDAC.2010.5419882\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose CAFE router which obtains routes of multiple nets with target wire lengths for single layer routing grid with obstacles. CAFE router extends the route of each net from a pin to the other pin greedily so that the wire length of the net approaches its target wire length. Experiments show that CAFE router obtains the routes of nets with small length error in short time.\",\"PeriodicalId\":152569,\"journal\":{\"name\":\"2010 15th Asia and South Pacific Design Automation Conference (ASP-DAC)\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-01-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 15th Asia and South Pacific Design Automation Conference (ASP-DAC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ASPDAC.2010.5419882\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 15th Asia and South Pacific Design Automation Conference (ASP-DAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASPDAC.2010.5419882","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 16

摘要

本文提出了一种CAFE路由器，它可以在有障碍物的单层路由网格中获取具有目标线长的多个网的路由。CAFE路由器贪婪地将每个网的路由从一个引脚延伸到另一个引脚，使网的线长接近其目标线长。实验表明，该算法能在短时间内得到长度误差小的网络路由。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

CAFE router: A fast connectivity aware multiple nets routing algorithm for routing grid with obstacles

In this paper, we propose CAFE router which obtains routes of multiple nets with target wire lengths for single layer routing grid with obstacles. CAFE router extends the route of each net from a pin to the other pin greedily so that the wire length of the net approaches its target wire length. Experiments show that CAFE router obtains the routes of nets with small length error in short time.

求助全文

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

来源期刊

2010 15th Asia and South Pacific Design Automation Conference (ASP-DAC)

自引率

0.00%

发文量

期刊最新文献

Platform modeling for exploration and synthesis Application-specific 3D Network-on-Chip design using simulated allocation Rule-based optimization of reversible circuits An extension of the generalized Hamiltonian method to S-parameter descriptor systems Adaptive power management for real-time event streams