Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/329166.329203acmconferencesArticle/Chapter ViewAbstractPublication PagesfpgaConference Proceedingsconference-collections
Article
Free access

Automatic generation of FPGA routing architectures from high-level descriptions

Published: 01 February 2000 Publication History

Abstract

In this paper we present a “high-level” FPGA architecture description language which lets FPGA architects succinctly and quickly describe an FPGA routing architecture. We then present an “architecture generator” built into the VPR CAD tool [1, 2] that converts this high-level architecture description into a detailed and completely specified flat FPGA architecture. This flat architecture is the representation with which CAD optimization and visualization modules typically work. By allowing FPGA researchers to specify an architecture at a high-level, an architecture generator enables quick and easy “what-if” experimentation with a wide range of FPGA architectures. The net effect is a more fully optimized final FPGA architecture. In contrast, when FPGA architects are forced to use more traditional methods of describing an FPGA (such as the manual specification of every switch in the basic file of the FPGA), far less experimentation can be performed in the same time, and the architectures experimented upon are likely to be highly similar, leaving important parts of the design space completely unexplored.
This paper describes the automated routing architecture generation problem, and highlights the two key difficulties — creating an FPGA architecture that matches all of an FPGA architect's specifications, while simultaneously determining good values for the many unspecified portions of an FPGA so that a high quality FPGA results. We describe the method by which we generate FPGA routing architectures automatically, and present several examples.

References

[1]
V. Betz, "Architecture and CAD for Speed and Area Optimization of FPGAs," Ph.D. Thesis, University of Toronto, 1998.
[2]
V. Betz, J. Rose and A. Marquardt, Architecture and CAD for Deep-Submicron FPGAs, Kluwer Academic Publishers, 1999.
[3]
S. Brown, R. Francis, J. Rose and Z. Vranesic, Field-Programmable Gate Arrays, Kluwer Academic Publishers, 1992.
[4]
S. Brown, J. Rose, and Z. Vranesic, "A Detailed Router for Field-Programmable Gate Arrays," IEEE Trans. on CAD, May 1992, pp. 620 - 628.
[5]
G Lemieux, and S. Brown, "A Detailed Router for Allocating Wire Segments in FPGAs," ACM/SIGDA Physical Design Workshop, 1993, pp. 215 - 226.
[6]
D. Cronquist and L. McMurchie, "Emerald -- An Architecture-Driven Tool Compiler for FPGAs," ACM Syrup. on FPGAs, 1996, pp. 144 - 150.
[7]
J. Rose and S. Brown, "Flexibility of Interconnection Structures for Field-Programmable Gate Arrays," JSSC, March 1991, pp. 277 - 282.
[8]
E Chow, S. Set, J. Rose, K. Chung, G. Paez and I. Rahardja, "The Design of an SRAM-Based Field-Programmable Gate Array, Part I: Architecture," June 1999, pp. 191 - 197.
[9]
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.
[10]
G. Lernieux, S. Brown, D. Vranesic, "On Two-Step Routing for FPGAs," ACM Symp. on Physical Design, 1997, pp. 60 - 66.
[11]
H. Hseih, et al, "Third-Generation Architecture Boosts Speed and Density of Field-Programmable Gate Arrays," CICC, 1990, pp. 31.2.1 - 31.27.
[12]
M. Khellah, S. Brown and Z. Vranesic, "Minimizing Interconnection Delays in Array-Based FPGAs," CICC, 1994, pp. 181 - 184.
[13]
V. Betz, "VPR User's Manual, Version 4.22," Available from http://www.eecg.toronto.edu/vaughn/vpr/vpr.html, Nov. 1998.
[14]
V. Betz and J. Rose, "Cluster-Based Logic Blocks for FPGAs: Area-Efficiency vs. Input Sharing and Size," CICC, 1997, pp. 551 - 554.
[15]
A. Marquardt, V. Betz and J. Rose, "Using Cluster-Based Logic Blocks and Timing-Driven Packing to Improve FPGA Speed and Density," ACM Symp. on FPGAs, 1999, pp. 37 - 46.
[16]
E Leventis, "Placement Algorithms and Routing Architecture for Long-Line Based FPGAs," Undergraduate Thesis, University of Toronto, 1999.
[17]
B.K. Britton et al., "Second Generation ORCA Architecture Utilizing 0.5 ktm Process Enhances the Speed and Usable Gate Capacity of FPGAs," IEEEInt. ASIC Conf., Sept. 1994, pp. 474 - 478.

Cited By

View all
  • (2024)From Topology to Realization in FPGA/VPR RoutingProceedings of the 2024 ACM/SIGDA International Symposium on Field Programmable Gate Arrays10.1145/3626202.3637572(85-96)Online publication date: 1-Apr-2024
  • (2023)A Field Programmable Gate Array Placement Methodology for Netlist-Level Circuits with GPU AccelerationElectronics10.3390/electronics1301003713:1(37)Online publication date: 20-Dec-2023
  • (2023)Extending Memory Compatibility with Yosys Front-End in VTR FlowProceedings of the 34th International Workshop on Rapid System Prototyping10.1145/3625223.3649269(1-8)Online publication date: 21-Sep-2023
  • Show More Cited By

Index Terms

  1. Automatic generation of FPGA routing architectures from high-level descriptions

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    FPGA '00: Proceedings of the 2000 ACM/SIGDA eighth international symposium on Field programmable gate arrays
    February 2000
    223 pages
    ISBN:1581131933
    DOI:10.1145/329166
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 01 February 2000

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Article

    Conference

    FPGA00
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 125 of 627 submissions, 20%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)149
    • Downloads (Last 6 weeks)23
    Reflects downloads up to 12 Nov 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)From Topology to Realization in FPGA/VPR RoutingProceedings of the 2024 ACM/SIGDA International Symposium on Field Programmable Gate Arrays10.1145/3626202.3637572(85-96)Online publication date: 1-Apr-2024
    • (2023)A Field Programmable Gate Array Placement Methodology for Netlist-Level Circuits with GPU AccelerationElectronics10.3390/electronics1301003713:1(37)Online publication date: 20-Dec-2023
    • (2023)Extending Memory Compatibility with Yosys Front-End in VTR FlowProceedings of the 34th International Workshop on Rapid System Prototyping10.1145/3625223.3649269(1-8)Online publication date: 21-Sep-2023
    • (2020)VTR 8ACM Transactions on Reconfigurable Technology and Systems10.1145/338861713:2(1-55)Online publication date: 1-Jun-2020
    • (2019)A Study on Switch Block Patterns for Tileable FPGA Routing Architectures2019 International Conference on Field-Programmable Technology (ICFPT)10.1109/ICFPT47387.2019.00039(247-250)Online publication date: Dec-2019
    • (2018)Recognized as the Best: The ACM\/SIGDA TCFPGA Hall of Fame for FPGAs and Reconfigurable ComputingIEEE Solid-State Circuits Magazine10.1109/MSSC.2018.282286110:2(30-35)Online publication date: Sep-2019
    • (2017)An innovation tool-chain for synthesis and implementation of Xilinx FPGA devices2017 2nd IEEE International Conference on Integrated Circuits and Microsystems (ICICM)10.1109/ICAM.2017.8242152(124-127)Online publication date: Nov-2017
    • (2016)FPGA Synthesis and Physical DesignElectronic Design Automation for IC Implementation, Circuit Design, and Process Technology10.1201/b19714-18(373-413)Online publication date: 14-Apr-2016
    • (2015)Fast and Memory-Efficient Routing Algorithms for Field Programmable Gate Arrays With Sparse Intracluster Routing CrossbarsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2015.244573934:12(1928-1941)Online publication date: 18-Nov-2015
    • (2014)VTR 7.0ACM Transactions on Reconfigurable Technology and Systems10.1145/26175937:2(1-30)Online publication date: 4-Jul-2014
    • Show More Cited By

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media