Abstract
FPGA routing architectures consist of routing wires and programmable switches that together account for the majority of the fabric delay and area, making evaluation and optimization of an FPGA’s routing architecture very important. Routing architectures have traditionally been evaluated using a full synthesize, pack, place and route CAD flow over a suite of benchmark circuits. While the results are accurate, a full CAD flow has a long runtime and is often tuned to a specific FPGA architecture type, which limits exploration of different architecture options early in the design process. In this article, we present Wotan, a tool to quickly estimate routability for a wide range of architectures without the use of benchmark circuits. At its core, our routability predictor efficiently counts paths through the FPGA routing graph to (1) estimate the probability of node congestion and (2) estimate the probabilities to successfully route a randomized subset of (source, sink) pairs, which are then combined into an overall routability metric. We describe our predictor and present routability estimates for a range of 6-LUT and 4-LUT architectures using mixes of wire types connected in complex ways, showing a rank correlation of 0.91 with routability results from the full VPR CAD flow while requiring 18× less CPU effort.
- Vaughn Betz and Jonathan Rose. 1999. FPGA routing architecture: Segmentation and buffering to optimize speed and density. In FPGA. 59--68. Google Scholar
Digital Library
- Vaughn Betz, Jonathan Rose, and Alexander Marquardt. 1999. Architecture and CAD for Deep-Submicron FPGAs. Kluwer Academic Publishers. Google Scholar
Digital Library
- Stephen Brown, Jonathan Rose, and Zvonko G. Vranesic. 1993. A stochastic model to predict the routability of field-programmable gate arrays. IEEE Trans. Comput.-Aid. Des. 12, 12 (1993), 1827--1838. Google Scholar
Digital Library
- Yao-Wen Chang and D. F. Wong. 1996. Universal switch modules for FPGA design. ACM Trans. Des. Autom. Electon. Syst. 1, 1 (1996), 80--101. Google Scholar
Digital Library
- Charles Colbourn. 1987. The Combinatorics of Network Reliability. Oxford University Press. Google Scholar
Digital Library
- Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford Stein. 2009. Introduction to Algorithms (3rd ed.). The MIT Press. Google Scholar
Digital Library
- Intel Corporation. 2014. Advancing Moore’s Law in 2014. Retrieved from https://www.intel.com/content/dam/www/public/us/en/documents/presentation/advancing-moores-law-in-2014-presentation.pdf.Google Scholar
- Joydip Das and Steven Wilton. 2011. An analytical model relating FPGA architecture parameters to routability. In FPGA. 181--184. Google Scholar
Digital Library
- Abbas El Gamal. 1981. Two-dimensional stochastic model for interconnections in master slice integrated circuits. IEEE Trans. Circ. Syst. 28, 2 (1981), 127--138.Google Scholar
Cross Ref
- Wei Fang and Jonathan Rose. 2008. Modeling routing demand for early-stage FPGA architecture development. In FPGA. 139--148. Google Scholar
Digital Library
- International Technology Roadmap for Semiconductors. 2013. Interconnect. Retrieved from http://www.itrs2.net/2013-itrs.html.Google Scholar
- Parivallal Kannan and Dinesh Bhatia. 2006. Interconnect estimation for FPGAs. IEEE Trans. Comput.-Aid. Des. 25 (2006), 1523--1534. Google Scholar
Digital Library
- T. Kong. 2002. A novel net weighting algorithm for timing-driven placement. In ICCAD. IEEE, 172--176. Google Scholar
Digital Library
- Ian Kuon and Jonathan Rose. 2006. Measuring the gap between FPGAs and ASICs. In FPGA. 21--30. Google Scholar
Digital Library
- Lattice Semiconductor. 2017. iCE40 LP/HX family data sheet.Google Scholar
- G. Lemieux, E. Lee, M. Tom, and A. Yu. 2004. Directional and single-driver wires in FPGA interconnect. In FPT. 41--48.Google Scholar
- David Lewis and others. 2013. Architectural enhancements in stratix V. In FPGA. 147--156. Google Scholar
Digital Library
- Mingjie Lin, John Wawrzynek, and Abbas El Gamal. 2010. Exploring FPGA routing architecture stochastically. IEEE Trans. Comput.-Aid. Des. 29, 10 (2010), 1509--1522. Google Scholar
Digital Library
- Jinan Lou, Thakur Shashidhar, Shankar Krishnamoorthy, and Henry Sheng. 2002. Estimating routing congestion using probabilistic analysis. IEEE Trans. Comput.-Aid. Des. 21, 1 (2002), 32--41. Google Scholar
Digital Library
- Jason Luu and others. 2014. VTR 7.0: Next generation architecture and CAD system for FPGAs. Trans. Recofig. Technol. Syst. 7, 2 (2014), 1--30 Google Scholar
Digital Library
- E. F. Moore and C. E. Shannon. 1956. Reliable circuits using less reliable relays. J. Franklin Inst. 262, 3 (Oct. 1956), 191--208.Google Scholar
Cross Ref
- Kevin Murray, Scott Whitty, Suya Liu, Jason Luu, and Vaughn Betz. 2013. Titan: Enabling large and complex benchmarks in academic CAD. In FPL.Google Scholar
- Oleg Petelin and Vaughn Betz. 2015. Wotan: A tool for rapid evaluation of FPGA architecture routability without benchmarks. In FPL.Google Scholar
- Oleg Petelin and Vaughn Betz. 2016. The speed of diversity: Exploring complex FPGA routing topologies for the global metal layer. In FPL.Google Scholar
- Justin Richardson, Steven Fingulin, Diwakar Raghunathan, Chris Massie, Alan George, and Herman Lam. 2010. Comparative analysis of HPC and accelerator devices: Computation, memory, I/O, and power. In HPRCTA. 1--10.Google Scholar
- Jonathan Rose and Stephen Brown. 1991. Flexibility of interconnection structures for field-programmable gate arrays. J. Solid State Circ. 26, 3 (1991), 277--282.Google Scholar
Cross Ref
- Akshay Sharma, Carl Ebeling, and Scott Hauck. 2005. Architecture adaptive routability-driven placement for FPGAs. In FPL. 427--432.Google Scholar
- Akshay Sharma and Scott Hauck. 2005. Accelerating FPGA routing using architecture-adaptive A* techniques. In FPT. 225--232.Google Scholar
- Alastair Smith, George Constantinides, Steven Wilton, and Peter Cheung. 2009. Concurrently optimizing FPGA architecture parameters and transistor sizing: Implications for FPGA design. In FPT. 54--61.Google Scholar
- Alastair Smith, Joydip Das, and Steven Wilton. 2009. Wirelength modeling for homogeneous and heterogeneous FPGA architectural development. In FPGA. 181--190. Google Scholar
Digital Library
- Leslie Valiant. 1979. The complexity of enumeration and reliability problems. SIAM J. Comput. 8, 3 (1979).Google Scholar
Cross Ref
- Steven J. E. Wilton. 1997. Architectures and Algorithms for Field-Programmable Gate Arrays with Embedded Memory. Ph.D. Dissertation. University of Toronto. Google Scholar
Digital Library
Index Terms
Wotan: Evaluating FPGA Architecture Routability without Benchmarks
Recommendations
NetCracker: A Peek into the Routing Architecture of Xilinx 7-Series FPGAs
FPGA '21: The 2021 ACM/SIGDA International Symposium on Field-Programmable Gate ArraysNovel applications have triggered significant changes at the system level of FPGA architecture design, such as the introduction of embedded VLIW processor arrays and hardened NoCs. However, the routing architecture of the soft logic fabric has largely ...
Exploring FPGA routing architecture stochastically
Special section on the ACM IEEE international conference on formal methods and models for codesign (MEMOCODE) 2009This paper proposes a systematic strategy to efficiently explore the design space of field-programmable gate array (FPGA) routing architectures. The key idea is to use stochastic methods to quickly locate near-optimal solutions in designing FPGA routing ...
t-QuadPlace: Timing Driven Quadratic Placement using Quadrisection Partitioning for FPGAs (Abstact Only)
FPGA '16: Proceedings of the 2016 ACM/SIGDA International Symposium on Field-Programmable Gate ArraysConventional Simulated Annealing (SA) based placement methods for FPGAs generate high quality results in terms of wirelength and critical path delay, but at a high runtime cost. In case of modern multi-million gate FPGAs, SA-based methods for placement ...






Comments