New Performance-Driven FPGA Routing Algorithms

Motivated by the goal of increasing the performance of FPGA-based designs, we propose effective Steiner and arborescence FPGA routing algorithms. Our graphbased Steiner tree constructions have provably-good performance bounds and outperform the best known ones in practice, while our arborescence heuristics produce routing solutions with optimal source-sink pathlengths at a reasonably low wirelength penalty. We have incorporated our algorithms into an actual FPGA router which routed a number ofindustrial circuits using channel widths considerably smaller than was previously possible.
Note: Abstract extracted from PDF file via OCR

Alexander, Michael, and Gabriel Robins. "New Performance-Driven FPGA Routing Algorithms." University of Virginia Dept. of Computer Science Tech Report (1994).