Requirements for models of achievable routing
ISPD '00 Proceedings of the 2000 international symposium on Physical design
Why interconnect prediction doesn't work
SLIP '00 Proceedings of the 2000 international workshop on System-level interconnect prediction
Interconnect complexity-aware FPGA placement using Rent's rule
Proceedings of the 2001 international workshop on System-level interconnect prediction
Estimating routing congestion using probabilistic analysis
Proceedings of the 2001 international symposium on Physical design
Congestion estimation during top-down placement
Proceedings of the 2001 international symposium on Physical design
On metrics for comparing routability estimation methods for FPGAs
Proceedings of the 39th annual Design Automation Conference
VPR: A new packing, placement and routing tool for FPGA research
FPL '97 Proceedings of the 7th International Workshop on Field-Programmable Logic and Applications
fGREP - Fast Generic Routing Demand Estimation for Placed FPGA Circuits
FPL '01 Proceedings of the 11th International Conference on Field-Programmable Logic and Applications
Routability Prediction for Hierarchical FPGAs
GLS '99 Proceedings of the Ninth Great Lakes Symposium on VLSI
On Routing Demand and Congestion Estimation for FPGAs
ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
| Hi-index | 0.00 |
Modern large scale FPGA designs require interconnect estimation for cutting down the design cycle times. Most of the available estimation techniques use empirical methods to estimate routability. These methods lack the ability to accurately model back-end routers and the estimation results produced are not very reliable. We recently proposed a fast and generic routability estimation method, fGREP [1], that predicts the peak routing demand and the channel occupancies in a given FPGA architecture. The peak demands are within 3 to 4% of actual detailed routing results produced by the well known physical design suite, VPR [2]. In this paper, we observe that, fGREP spends a significant portion of its execution time in estimating the demands for nets with large number of terminals. We propose a new routability estimation method based on fGREP which offers significant speedups over fGREP, while maintaining the same high levels of accuracy. The new method is up to 36X faster than fGREP, and on an average is about 102X faster than VPR's detailed router.