A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Net reordering and multicommodity flow based global routing for FPGAs
2014 International Conference on ReConFigurable Computing and FPGAs (ReConFig14)
The most popular algorithm for solving the routing problem for field programmable gate arrays (FPGAs) has virtually remained the same for the past two decades. It is essentially an iterative maze technique, such as Dijkstra's algorithm, applied to each net in the circuit repeatedly. During multiple routing iterations, nets are ripped-up and rerouted via different paths to resolve competition for routing resources or to improve circuit delay. The most popular implementation of such a routingdoi:10.1109/reconfig.2014.7032540 dblp:conf/reconfig/AbabeiKZ14 fatcat:wn5qg3hulbe4pj24fngjnujwoi