Jordan S. Swartz
Jonathan Rose
ABSTRACT
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:
For a “low stress” routing problem (which we define as the case where the track supply is at least 10% greater than the minimun number of tracks per channel actually needed to route a circuit) the routing time is very fast. For example, the routing phase (after the netlist is parsed and the routing graph is constructed) for a 20,000 LUT/FF pair circuit with 30% extra tracks is only 23 seconds on a 300 MHz Sparcstation.
For low-stress routing problems the routing time is near-linear in the size of the circuit, and the linearity constant is very small: 1.1 ms per LUT/FF pair, or roughly 55,000 LUT/FF pairs per minute.
For more difficult routing problems (where the track supply is close to the minimum needed) we provide a method that quickly identifies and subdivides this class into two sub-classes: (i) those circuits which are difficult (but possible) to route and will take significantly more time than low-stress problems, and (ii) those circuits which are impossible to route. In the first case the user can choose to continue or reduce the amount of logic; in the second case the user is forced to reduce the amount of logic or obtain a larger FPGA.
- Alle76.J. R. Allen, "A Topologically Adaptable Cellular Router," DAC, 1976, pp. 161-167. Google Scholar
Digital Library
- Apti96.Apfix Corporation, Product Brief.' The System Explorer MP4, 1996. This and other documents are available on the Apfix web site: http://www, aptix.eom.Google Scholar
- Babb97.J. Babb, M. Frank, E. Waingold, R. Bama, M. Taylor, I. Kim, S. Devabhaktuni, P. Finch, and A. Agarwal, "The RAW Benchmark Suite: Computation Structures for General Purpose Computing," FCCM, 1997, pp. 161-171. Google ScholarDigital Library
- Betz97.V. Betz and J. Rose, "VPR: A New Packing, Placement and Routing Tool for FPGA Research,' Int'l Workshop on FPL, 1997, pp. 213-222. Google ScholarDigital Library
- Brow92.S. Brown, R. Francis, J. Rose, and Z. Vranesie, Field-Programmable Gate Arrays, Kluwer Academic Publishers, 1992. Google ScholarDigital Library
- Brow92a.S. Brown, J. Rose, and Z. G. Vranesie, "A Detailed Router for Field-Programmable Gate Arrays" IEEE Trans. on CAD, May 1992, pp. 620-628.Google ScholarDigital Library
- Chen94.C. E. Cheng, "RISA: Accurate and Efficient Placement Routability Modeling", ICCAD, 1994, pp. 690-695. Google ScholarDigital Library
- Cong94.J. Cong and Y. Ding, "Flowmap: An Optimal Technology Mapping Algorithm for Delay Optimization in Lookup-Table Based FPGA Designs}' IEEE Trans. on CAD, Jan. 1994, pp. 1-12.Google ScholarDigital Library
- Corm90.T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, The Massachusetts Institute of Technology, 1990, pp. 469-485. Google ScholarDigital Library
- Ebel95.C. Ebeling, L. McMurchie, S. A. Hauck, and S. Bums, "Placement and Routing Tools for the Triptych FPGA,' IEEE Trans. on VLSI, Dec. 1995, pp. 473-482. Google ScholarDigital Library
- Hutt97.M. Hutton, J. Rose, and D. Comeil, "Generation of Synthetic Sequential Benchmark Circuits,' FPGA, 1997, pp. 149-155. Google ScholarDigital Library
- Korn82.R. Kom, "An Efficient Variable Cost Maze Router", Proc. 19th DAC, June 1992.Google Scholar
- Lee61.C. Y. Lee, '~n Algorithm for Path Connections and its Applications,' IRE Transactions on Electronic Computers, Vol. EC=10, 1961, pp. 346-365.Google Scholar
- Lemi93.G. Lemieux and S. Brown, "A Detailed Router for Allocating Wh:e Segments in FPGAs;' ACM/SIGDA Physical Design Workshop, 1993, pp. 215-226.Google Scholar
- Lewi97.D. M. Lewis, D. R. Galloway, M. van Ierssel, J. Rose, and P. Chow, "The Transmogfifier-2: A 1 Million Gate Rapid Prototyping System" FPGA, 1997, pp. 53- 61. Google ScholarDigital Library
- Nair87.R. Nair, "A Simple Yet Effective Technique for Global Wiring/' IEEE Trans. on Computer-Aided Design, vol. CAD-6, no. 6, March 1987, pp. 165-172.Google Scholar
- Palc92.M. Palczewski, "Plane Parallel A* Router and its Application to FPGAs" DAC, 1992, pp. 691-697. Google ScholarDigital Library
- Rubi74.E Rubin, "The Lee Path Connection Algorithm", IEEE Trans. Computers, vol e-23, no. 9, Sept. 1974.Google ScholarDigital Library
- Sent92.E. M. Sentovieh et. al, "SIS: A System for Sequential Circuit Analysis;' TecE Report No. UCB/ERL 3492/ 41, University of California, Berkeley, 1992.Google Scholar
- Souk78.J. Soukup, '~ast Maze Router" Proc. 15th Design Automation Conf., June 1978, pp. 100-102. Google ScholarDigital Library
- Wilt97.S. Wilton, "Architectures and Algorithms for Field-Programmable Gate Arrays with Embedded Memories;' Ph.D. Dissertation, University of Toronto, 1997. Google ScholarDigital Library
- Wu94.Y.-L. Wu and M. Marek-Sadowka, '~An Efficient Router for 2-D Field-Programmable Gate Arrays;' EDAC, 1994, pp. 412-416.Google Scholar
- Yang91.S. Yang, "Logic Synthesis and Optimization Benchmarks, Version 3.0;' Tech. Report, Mieroeleetronics Centre of North Carolina, 1991.Google Scholar
Index Terms
-
A fast routability-driven router for FPGAs
-
Recommendations
-
Routability of network topologies in FPGAs
A fundamental difference between application-specific integrated circuits (ASICs) and field-programmable gate arrays (FPGAs) is that the wires in ASICs are designed to match the requirements of a particular design. Conversely, in an FPGA, the area is ...
-
A performance and routability-driven router for FPGAs considering path delays
This paper presents a new performance and routability driven router for symmetrical array based field programmable gate arrays (FPGAs). The objectives of our proposed routing algorithm are two-fold: (1) improving the routability of the design (i.e., ...
-
A scalable routability-driven analytical placer with global router integration for FPGAs (abstract only)
FPGA '14: Proceedings of the 2014 ACM/SIGDA international symposium on Field-programmable gate arraysAs the sizes of modern circuits become bigger and bigger, implementing those large circuits into FPGA becomes arduous. The state-of-the-art academic FPGA place-and-route tool, VPR, has good quality but needs around a whole day to complete a placement ...
Comments