Sciweavers

Share
FPGA
1998
ACM

A Fast Routability-Driven Router for FPGAs

11 years 9 months ago
A Fast Routability-Driven Router for FPGAs
Three factors are driving the demand for rapid FPGA compilation. First, as FPGAs have grown in logic capacity, the compile computation has grown more quickly than the compute power of the available computers. Second, there exists a subset of users who are willing to pay for very high speed compile with a decrease in quality of result, and accordingly being required to use a larger FPGA or use more real-estate on a given FPGA than is otherwise necessary. Third, very high speed compile has been a long-standing desire of those using FPGA-based custom computing machines, as they want compile times at least closer to those of regular computers. This paper focuses on the routing phase of the compile process, and in particular on routability-driven routing (as opposed to timing-driven routing). We present a routing algorithm and routing tool that has three unique capabilities relating to very high-speed compile:
Jordan S. Swartz, Vaughn Betz, Jonathan Rose
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where FPGA
Authors Jordan S. Swartz, Vaughn Betz, Jonathan Rose
Comments (0)
books