Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Parivallal Kannan, Shankar Balachandran, and Dinesh Bhatia, “fGREP-Fast Generic routing Demand Estimation for Placed FPGA Circuits,” in 11th International Workshop on Field-Programmable Logic and Applications, FPL. August 2001, Springer-Verlag,Berlin.
Vaughn Betz and Jonathan Rose, “VPR: A New Packing, Placement and Routing Tool for FPGA research,” in Field-Programmable Logic and Applications. Sep 1997, pp. 213–222, Springer-Verlag, Berlin.
H. B. Bakoglu, Circuits, Interconnections, and Packaging for VLSI, Addison Wesley, Reading, MA, 1990.
H. Van Marck, D. Stroobandt, and J. Van Campenhout, “Toward an Extension of Rent’s Rule for Describing Local Variations in Interconnection Complexity,” in Proceedings of the 4th International Conference for Young Computer Scientists, 1995, pp. 136–141.
G. Parthasarathy, M. Marek-Sadaowska, and A. Mukherjee, “Interconnect Complexityaware FPGA Placement Using Rent’s Rule,” in Proc. Intl. Workshop on System Level Interconnect Prediction (SLIP), April 2001.
Wei Li, “Routability Prediction for Hierarchical FPGAs,” in Proc. Great Lakes Symposium on VLSI, 1999.
R. Kastner X. Yang and M. Sarrafzadeh, “Congestion Estimation During Top-down Placement,” in Proceedings of the 2001 International Symposium on Physical Design (ISPD), 2001.
Abbas A. El Gamal, “Two-Dimensional Stochastic Model for Interconnections in Master Slice Integrated Circuits,” IEEE Trans. CAS., Feb 1981.
S. Brown, J. Rose, and Z.G. Vranesic, “A Stochastic Model to Predict the Routability of Field Programmable Gate Arrays,” IEEE Transactions on CAD, pp. 1827–1838, Dec 1993.
S. Krishnamoorthy J. Lou and H.S. Sheng, “Estimating Routing Congestion using Probabilistic Analysis,ld in Proceedings of the 2001 International Symposium on Physical Design (ISPD), 2001.
Shankar Balachandran, Parivallal Kannan, and Dinesh Bhatia, “On Routing Demand and Congestion Estimation for FPGAs,” in Proc. 15th Intl. Conf. on VLSI Design and 7th ASP-DAC, January 2002.
S. Mantik A.B. Kahng and D. Stroobandt, “Requirements for Models of Achievable Routing,“ in Proceedings of the 2000 International Symposium on Physical Design (ISPD), 2000.
L. Scheffer and E. Nequist, “Why Interconnect Prediction doesnt Work,” in Proc. Intl. Workshop on System Level Interconnect Prediction (SLIP), April 2000.
Parivallal Kannan, Shankar Balachandran, and Dinesh Bhatia, “On Metrics for Comparing Routability Estimation Methods for FPGAs,” in Proc. 39th DAC, June 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kannan, P., Balachandran, S., Bhatia, D. (2002). Rapid and Reliable Routability Estimation for FPGAs. In: Glesner, M., Zipf, P., Renovell, M. (eds) Field-Programmable Logic and Applications: Reconfigurable Computing Is Going Mainstream. FPL 2002. Lecture Notes in Computer Science, vol 2438. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46117-5_26
Download citation
DOI: https://doi.org/10.1007/3-540-46117-5_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44108-3
Online ISBN: 978-3-540-46117-3
eBook Packages: Springer Book Archive