skip to main content
10.1145/1233501.1233643acmconferencesArticle/Chapter ViewAbstractPublication PagesiccadConference Proceedingsconference-collections
Article

Un/DoPack: re-clustering of large system-on-chip designs with interconnect variation for low-cost FPGAs

Published: 05 November 2006 Publication History

Abstract

FPGA device area is dominated by interconnect, so low-cost FPGA architectures often have reduced interconnect capacity. This limited routing capacity creates a hard channel width constraint that can make it difficult for CAD tools to successfully map a circuit into these devices. Instead of migrating a design to a high-cost, resource-rich architecture that is easier to route, we present a cheaper alternative: a fully automated CAD flow (Un/DoPack) that finds local regions of high interconnect demand and reduces it by spreading out the logic in that region. This is done by introducing whitespace in the form of empty logic elements (LEs) within the configurable logic blocks (CLBs) of the congested region. After spreading, the congested region occupies more routing channels and so obtains access to greater aggregate interconnect capacity. Although this has the side effect of using more CLBs, it has the advantage of lowering peak interconnect demands and making a previously-unroutable circuit routable. We also design a new set of synthetic benchmark circuits that model interconnect variation within a large design. Using these benchmarks, we show that circuits with high interconnect variation require FPGA devices to have large channel widths. However, since congestion of such circuits is localized, Un/DoPack is very good at reducing the peak demands of circuits with high interconnect variation. Our results suggest that even for an average Rent exponent of 0.62 (a modest value), a large variation of this exponent within a design will also require FPGAs to have large channel widths. Thus, it is crucial to study interconnect variation of benchmark circuits when designing lowcost FPGAs. Previous research studying interconnect properties focuses on average Rent exponent values of each design, but we believe new work should study variation as well. For circuits with high interconnect variation, we demonstrate that channel widths can be reduced by up to ~40% with only ~10% increase in area.

References

[1]
A. DeHon, "Balancing Interconnect and Computation in a Reconfigurable Computing Array (or, why you don't really want 100% LUT utilization)," Field Programmable Gate Arrays, 1999.
[2]
R. Tessier and H. Giza, "Balancing Logic Utilization and Area Efficiency in FPGAs," Field Programmable Logic (FPL), 2000.
[3]
M. Tom and G. Lemieux, "Logic Block Clustering of Large Designs for Channel-Width Constrained FPGAs," DAC, 2005.
[4]
A. Sharma, C. Ebeling and S. Hauck, "Architecture-Adaptive Routability-Driven Placement for FPGAs," FPL, pp. 427--432 2005.
[5]
A. Singh and M. Marek-Sadowska, "Efficient Circuit Clustering for Area and Power Reduction in FPGAs," Field-Programmable Gate Arrays, Feb, 2002.
[6]
J. Cong and Y. Ding, "FlowMap: An Optimal Technology Mapping Algorithm for Delay Optimization in Lookup-Table Based FPGA Design," IEEE TCAD, Vol.13, no.1, pp.1--12, Jan 1994.
[7]
V. Betz, A. Marquardt, and J. Rose, Architecture and CAD for Deep-Submicron FPGAs, Kluwer, Norwell, MA, 1999
[8]
E. Bozorgzadeh et al, "Routability-Driven Packing: Metrics and Algorithms for Cluster-based FPGAs," Journal of Circuits, Systems, and Computers, 13(1), pp. 77--100, Feb. 2004.
[9]
D. Leong and G. Lemieux, "iPlace: An Incremental Placement Algorithm for Field-Programmable Gate Arrays," in preparation, 2006.
[10]
U. Brenner and A. Rohe, "An Effective Congestion Driven Placement Framework," Int'l Symp. on Physical Design. pp.6--11, 2002.
[11]
P. Verplaetse, D. Stroobandt and J. Van Campenhout, "Synthetic Benchmark Circuits for Timing-driven Physical Design Applications," Int'l Conf. on VLSI, pp. 31--37, 2002.
[12]
LGSynth93 Benchmark Suite, Microelectronics Centre of North Carolina. Tech. Report, 1993.
[13]
J. Pistorius and M. Hutton, "Placement Rent Exponent Calculation Methods, Temporal Behaviour and FPGA Architecture Evaluation," Int'l Workshop on System-Level Interconnect Prediction, pp.31--38, 2003.

Cited By

View all
  • (2024)VIPER: A VTR Interface for Placement with Error ResilienceProceedings of the 14th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies10.1145/3665283.3665300(99-108)Online publication date: 19-Jun-2024
  • (2019)Multi‐objective optimisation algorithm for routability and timing driven circuit clustering on FPGAsIET Computers & Digital Techniques10.1049/iet-cdt.2018.511513:4(273-281)Online publication date: 19-Feb-2019
  • (2018)GPlace3.0ACM Transactions on Design Automation of Electronic Systems10.1145/323324423:5(1-33)Online publication date: 12-Oct-2018
  • Show More Cited By

Index Terms

  1. Un/DoPack: re-clustering of large system-on-chip designs with interconnect variation for low-cost FPGAs

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    ICCAD '06: Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
    November 2006
    147 pages
    ISBN:1595933891
    DOI:10.1145/1233501
    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: 05 November 2006

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. channel width constraints
    2. clustering
    3. field-programmable gate arrays (FPGA)
    4. packing

    Qualifiers

    • Article

    Conference

    ICCAD06
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 457 of 1,762 submissions, 26%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)2
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 07 Mar 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)VIPER: A VTR Interface for Placement with Error ResilienceProceedings of the 14th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies10.1145/3665283.3665300(99-108)Online publication date: 19-Jun-2024
    • (2019)Multi‐objective optimisation algorithm for routability and timing driven circuit clustering on FPGAsIET Computers & Digital Techniques10.1049/iet-cdt.2018.511513:4(273-281)Online publication date: 19-Feb-2019
    • (2018)GPlace3.0ACM Transactions on Design Automation of Electronic Systems10.1145/323324423:5(1-33)Online publication date: 12-Oct-2018
    • (2018)UTPlaceF 2.0ACM Transactions on Design Automation of Electronic Systems10.1145/317484923:4(1-23)Online publication date: 9-May-2018
    • (2018)RippleFPGAIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2017.277805837:10(2022-2035)Online publication date: 1-Oct-2018
    • (2017)Clock-aware ultrascale FPGA placement with machine learning routability predictionProceedings of the 36th International Conference on Computer-Aided Design10.5555/3199700.3199828(929-936)Online publication date: 13-Nov-2017
    • (2016)An improved diffusion based placement algorithm for reducing interconnect demand in congested regions of FPGAsInternational Journal of Reconfigurable Computing10.1155/2015/7560142015(8-8)Online publication date: 1-Jan-2016
    • (2013)Integration of Net-Length Factor with Timing- and Routability-Driven Clustering AlgorithmsACM Transactions on Reconfigurable Technology and Systems10.1145/25173246:3(1-21)Online publication date: 1-Oct-2013
    • (2011)Net-length-based routability-driven power-aware clusteringACM Transactions on Reconfigurable Technology and Systems10.1145/2068716.20687244:4(1-16)Online publication date: 28-Dec-2011
    • (2011)MO-packProceedings of the 48th Design Automation Conference10.1145/2024724.2024908(818-823)Online publication date: 5-Jun-2011
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media