Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/201310.201331acmconferencesArticle/Chapter ViewAbstractPublication PagesfpgaConference Proceedingsconference-collections
Article
Free access

Spectral-based multi-way FPGA partitioning

Published: 15 February 1995 Publication History
  • Get Citation Alerts
  • Abstract

    Recent research on FPGA partitioning has focussed on finding minimum cuts between partitions without regard to the routability of the partitioned subcircuits. In this paper we develop a spectral approach to multi-way partitioning in which the primary goal is to produce routable subcircuits while maximizing FPGA device utilization. To assist the partitioner in assessing the routability of the partitioned subcircuits, we have developed a theory to predict the routability of the partitioned subcircuits prior to partitioning. Advancement over the current work is evidenced by results of experiments on the standard MCNC benchmarks.

    References

    [1]
    XILINX: The Programmable Gate Array Data Book. 2100 logic Drive, San Jose, CA 95124,1993.
    [2]
    C. J. A~pert an~~.~. l~. ahng. Multi-way partitioning via spacefilling curves and dynamic programming. 31~t DAC, pg. 652-657, CA, June 1994.
    [3]
    N. Bhat and D. I-I~lI. Routable Technology Mapping for LUT FPGAs. IUUD, pg. 95-98, Oct. 1992.
    [4]
    P. K. Chan, M. Schlag, and J. Zien. On rout ability prediction for field-programmable gate arrays. 30tn DAC, pg. 326-330, Texas, June 1993.
    [5]
    P. K. Chan, M. Schlag, and J. Zien. Spectral k-way ratio-cut partitioning and clustering. IEEE Trans. CAD, pg. 1088-1096, Sept. 1994.
    [6]
    ~n._C. Chou, L.-T. Liu, C.-K. Cheung, W.-J. Dai, and R. Lindelof. Circuit partitioning for huge logic emulation systems. 31~t DAC, pg. 244-249, CA, June 1994.
    [7]
    W. Donath and A. Hoffman. Lower bounds for the partitioning of graphs. IBM J. R U D, pg. 420-425, 1973.
    [8]
    A. E1 Gamal. Two-Dimensional Stochastic Model for Interconnections in Master Slice Integrated Circuits. IEEE Trans. on CAS, pg. 127-138, Feb. 1981.
    [9]
    J. Frankle and R. M. K arp. Circuit placements and cost bounds by eigenvector decomposition. IEEE ICCAD-$6, pg. 414-417,F Santa Clara, CA, Nov 1986.
    [10]
    R. Kuznar, Brglez, and K. Kozminski. Cost minimization of partition into multiple devices. 30tn ADAC, pg. 315-320, Texas, June 199_~
    [11]
    . Pothen, H. D. Simon, and K. . Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal of Matrix Analysis and Applications,
    [12]
    ~1(3):430-452~1990. . Rendl and .. Wolkowicz. A projection technique for partitioning the nodes of a graph. Tech. report, University of Waterloo, Apr. 1991.
    [13]
    S. Trimberger and M.-R. Chene. Placement- Based Partitioning for Lookup-Table-Based FPGAs. ICCD, pg. 91-94, Oct 1992.
    [14]
    N.-S. Woo and J. Kim. An efficient method of partitioning circuits for multiple-FPGA implementation. 30th DAC, pg. 202-207, Texas, June 1993.

    Cited By

    View all
    • (2019)Revealing Cluster Hierarchy in Gate-level ICs Using Block Diagrams and Cluster Estimates of Circuit EmbeddingsACM Transactions on Design Automation of Electronic Systems10.1145/332908124:5(1-19)Online publication date: 12-Jun-2019
    • (2018)Reverse Engineering Digital ICs through Geometric Embedding of Circuit GraphsACM Transactions on Design Automation of Electronic Systems10.1145/319312123:4(1-19)Online publication date: 18-Jul-2018
    • (2008)A high-level clustering algorithm targeting dual Vdd FPGAsACM Transactions on Design Automation of Electronic Systems10.1145/1391962.139196513:4(1-20)Online publication date: 3-Oct-2008
    • Show More Cited By

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    FPGA '95: Proceedings of the 1995 ACM third international symposium on Field-programmable gate arrays
    February 1995
    174 pages
    ISBN:089791743X
    DOI:10.1145/201310
    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: 15 February 1995

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Article

    Conference

    FPGA95
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 125 of 627 submissions, 20%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)52
    • Downloads (Last 6 weeks)25

    Other Metrics

    Citations

    Cited By

    View all
    • (2019)Revealing Cluster Hierarchy in Gate-level ICs Using Block Diagrams and Cluster Estimates of Circuit EmbeddingsACM Transactions on Design Automation of Electronic Systems10.1145/332908124:5(1-19)Online publication date: 12-Jun-2019
    • (2018)Reverse Engineering Digital ICs through Geometric Embedding of Circuit GraphsACM Transactions on Design Automation of Electronic Systems10.1145/319312123:4(1-19)Online publication date: 18-Jul-2018
    • (2008)A high-level clustering algorithm targeting dual Vdd FPGAsACM Transactions on Design Automation of Electronic Systems10.1145/1391962.139196513:4(1-20)Online publication date: 3-Oct-2008
    • (2006)Network-flow-based multiway partitioning with area and pin constraintsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.67363217:1(50-59)Online publication date: 1-Nov-2006
    • (2006)A hierarchical functional structuring and partitioning approach for multiple-FPGA implementationsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.66268016:10(1188-1195)Online publication date: 1-Nov-2006
    • (2004)Power-Driven Design PartitioningField Programmable Logic and Application10.1007/978-3-540-30117-2_75(740-750)Online publication date: 2004
    • (2001)Automated design synthesis and partitioning for adaptive reconfigurable hardwareHardware implementation of intelligent systems10.5555/570780.570781(3-52)Online publication date: 1-Jan-2001
    • (2001)Fine-grained and coarse-grained behavioral partitioning with effective utilization of memory and design space exploration for multi-FPGA architecturesIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/92.9208299:1(140-159)Online publication date: 1-Feb-2001
    • (2000)Design-Space Exploration for Block-Processing Based Temporal Partitioning of Run-Time Reconfigurable SystemsField-Programmable Custom Computing Technology: Architectures, Tools, and Applications10.1007/978-1-4615-4417-3_5(55-83)Online publication date: 2000
    • (1998)Circuit partitioning with complex resource constraints in FPGAsProceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays10.1145/275107.275122(77-84)Online publication date: 1-Mar-1998
    • 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