https://scholars.lib.ntu.edu.tw/handle/123456789/316493
標題: | FPGA global routing based on a new congestion metric | 作者: | Wong, D.F. Wong, C.K. YAO-WEN CHANG |
公開日期: | 1995 | 起(迄)頁: | 372-378 | 來源出版物: | IEEE International Conference on Computer Design: VLSI in Computers and Processors | 摘要: | Unlike traditional ASIC routing, the feasibility of routing in FPGA's is constrained not only by the available space within a routing region, but also by the routing capacity of a switch block. Recent work [6] has established the switch-block capacity as a superior congestion-control metric for FPGA global routing. However, the work has two deficiencies: (1) its algorithm for computing the switch-block capacity is not efficient, and (2) it, as well as the other recent works [1, 4, 14], only modeled one type of routing segments-single-length lines. To remedy the deficiencies, we present in this paper efficient algorithms for obtaining the switch-block capacity and a graph modeling for routing on the new-generation FPGA's with a versatile set of segment lengths. Experiments show that our algorithms dramatically reduce the run times for obtaining the switch-block capacities. Experiments with a global router based on the switch-block and channel densities for congestion control show a significant improvement in the area performance, compared with one based on the traditional congestion metric. |
URI: | http://www.scopus.com/inward/record.url?eid=2-s2.0-0029500697&partnerID=MN8TOARS http://scholars.lib.ntu.edu.tw/handle/123456789/316493 |
SDG/關鍵字: | Algorithms; Application specific integrated circuits; Graph theory; Logic design; Logic gates; Mathematical models; Switching networks; Channel density; Congestion-control metric; Field-programmable gate arrays; Global routing; Graph modeling; Routing capacity; Run times; Switched-block capacity; Logic circuits |
顯示於: | 電子工程學研究所 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。