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

Iterative improvement based multi-way netlist partitioning for FPGAs

Published: 01 January 1999 Publication History
First page of PDF

References

[1]
{1} D. Brasen, J.P. Hiol, G. Saucier, "Partitioning with cone structures", Proc. IEEE/ACM Int. Conf. on CAD. (1993): 236-239.
[2]
{2} W. L. Buntine, L. S. Su, A. R. Newton, A. Mayer, "Adaptive Methods for Netlist Partitioning", Proc. IEEE/ACM Int. Conf. on CAD. (1997): 356-363.
[3]
{3} N. C. Chou, L. T. Liu, C. K. Cheng, W. J. Dai, and R. Lindelof, "Circuit partitioning for huge logic emulation systems", Proc. 31st Design Automation Conf. (1994): 244-249.
[4]
{4} C. M. Fiduccia, R. M. Mattheyses, "A linear-time heuristics for improving network partitions", Proc. 19-th Design Automation Conf. (1982): 175-181.
[5]
{5} L. W. Hagen, D. J.-H. Huang, A. B. Kahng, "On Implementation Choices for Iterative Improvement Partitioning Algorithms", IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems 16/10 (1997): 1199-1205.
[6]
{6} D. J.-H. Huang, A. B. Kahng, "Multi-way system partitioning into a single type or multiple types of FPGA's", Proc. FPGA'95 (1995): 140-145.
[7]
{7} S. Hauck, G. Borriello, "An Evaluation of Bipartitioning Techniques", IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems 16/8 (1997): 849-866.
[8]
{8} B. Krishnamurthy, "An improved mincut algorithm for partitioning VLSI networks", IEEE Trans. Comput. C33/5 (1984): 438-446.
[9]
{9} R. Kuznar, F. Brglez, K. Kozminski, "Cost minimization of partitions into multiple devices" Proc. 30-th Design Automation Conference (1993): 315-320.
[10]
{10} R. Kuznar, F. Brglez, B. Zajc, "Multi-way netlist partitioning into heterogeneous FPGAs and minimization of total device cost and interconnect" Proc. 31-st Design Automation Conference (1994): 238- 243.
[11]
{11} R. Kuznar, F. Brglez, B. Zajc, "A Unified cost model for min-cut partitioning with replication applied to optimization of large heterogeneous FPGA partitions" Proc. EURO-DAC (1994): 271-276.
[12]
{12} R. Kuznar, F. Brglez, "PROP: a recursive paradigm for area-efficient and performance oriented partitioning of large FPGA netlists" Proc. IEEE/ACM Int. Conf. on CAD. (1995): 644-649.
[13]
{13} R. Kuznar, Latest Partitioning Results and Directories http://www.cbl.ncsu.edu/kuznar/.
[14]
{14} L. A. Sanchis, "Multiple-Way network partitioning", IEEE Trans. Comput. 38/1 (1989): 62-81.
[15]
{15} Y.-C. Wei, C.-K. Cheng, "Ratio Cut Partitioning for Hierarchical Designs", IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems 10/7 (1991): 911-921.
[16]
{16} H. Liu, D. F. Wong, "Network-Flow-Based Multiway Partitioning with Area and Pin Constraints", IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems 17/1 (1998): 50-59.
[17]
{17} C.-W. Yeh, C.-K. Cheng, T.-T. Y. Lin, "Optimization by Iterative Improvement: An Experimental Evaluation on Two-Way Partitioning", IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems 14/2 (1995): 145-153.

Cited By

View all
  • (1999)Hierarchical Interactive Approach to Partition Large Designs into FPGAsField Programmable Logic and Applications10.1007/978-3-540-48302-1_11(101-110)Online publication date: 1999

Index Terms

  1. Iterative improvement based multi-way netlist partitioning for FPGAs

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    DATE '99: Proceedings of the conference on Design, automation and test in Europe
    January 1999
    730 pages
    ISBN:1581131216
    DOI:10.1145/307418
    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 January 1999

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Article

    Conference

    DATE99
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 518 of 1,794 submissions, 29%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)19
    • Downloads (Last 6 weeks)2
    Reflects downloads up to 17 Oct 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (1999)Hierarchical Interactive Approach to Partition Large Designs into FPGAsField Programmable Logic and Applications10.1007/978-3-540-48302-1_11(101-110)Online publication date: 1999

    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