https://scholars.lib.ntu.edu.tw/handle/123456789/581503
標題: | A DAG-Based Algorithm for Obstacle-Aware Topology-Matching On-Track Bus Routing | 作者: | Hsu C.-H Hung S.-C Chen H Sun F.-K Chang Y.-W. YAO-WEN CHANG |
關鍵字: | Buses; Directed graphs; Graph algorithms; Graphic methods; Routing algorithms; Buffer insertion; Clock frequency; Clustering techniques; Directed acyclic graph (DAG); Routing congestion; State of the art; Timing constraints; Topology matching; Topology | 公開日期: | 2021 | 卷: | 40 | 期: | 3 | 起(迄)頁: | 533-546 | 來源出版物: | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems | 摘要: | As clock frequencies increase, topology-matching bus routing is desired to provide an initial routing result which facilitates the following buffer insertion to meet the timing constraints. In this article, we present a complete topology-matching bus routing framework considering nonuniform track configurations. In the framework, a bus clustering technique is proposed to reduce the routing complexity by grouping buses sharing similar pin locations. To perform topology-matching routing in a nonuniform track configuration, we propose a directed acyclic graph-based algorithm to connect a bus in a specific topology. Furthermore, a rip-up and reroute scheme is applied to alleviate the routing congestion. Compared with the state-of-the-art topology-matching bus routers, our proposed algorithm significantly improves the routing quality and reduces the number of spacing violations in comparable runtime. ? 1982-2012 IEEE. |
URI: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85086703918&doi=10.1109%2fTCAD.2020.3002546&partnerID=40&md5=53f2cab3a580c116715067fd9f0c7970 https://scholars.lib.ntu.edu.tw/handle/123456789/581503 |
ISSN: | 02780070 | DOI: | 10.1109/TCAD.2020.3002546 |
顯示於: | 電信工程學研究所 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。