Wong, D.F.D.F.WongWong, C.K.C.K.WongYAO-WEN CHANG2018-09-102018-09-101995http://www.scopus.com/inward/record.url?eid=2-s2.0-0029500697&partnerID=MN8TOARShttp://scholars.lib.ntu.edu.tw/handle/123456789/316493Unlike 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.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 circuitsconference paper2-s2.0-0029500697