Sciweavers

ISPD
1997
ACM

On two-step routing for FPGAS

13 years 9 months ago
On two-step routing for FPGAS
We present results which show that a separate global and detailed routing strategy can be competitive with a combined routing process. Under restricted architectural assumptions, we compute a new lower bound for detailed routing and show that our detailed router typically requires no more than two extra routing tracks above this computed limit. Also, experimental results show that the Mapping Anomaly presented in [20], which suggests that separated routing may yield arbitrarily poor results in certain instances, is a concern only if nets are restricted to a single track domain. Finally, to motivate future work, we show the latest two-step routing results that we have achieved with the VPR global router and SEGA detailed router tools on the largest CBL benchmark circuits.
Guy G. Lemieux, Stephen Dean Brown, Daniel Vranesi
Added 06 Aug 2010
Updated 06 Aug 2010
Type Conference
Year 1997
Where ISPD
Authors Guy G. Lemieux, Stephen Dean Brown, Daniel Vranesic
Comments (0)