Maple-opt: A performance-oriented simultaneous technology mapping, placement, and global routing algorithm for FPGA's

    Research output: Contribution to journalArticle

    7 Citations (Scopus)

    Abstract

    A new field programmable gate array (FPGA) design algorithm, Maple-opt, is proposed for technology mapping, placement, and global routing subject to a given upper bound of critical signal path delay. The basic procedure of Mapleopt is viewed as top-down hierarchical bipartition of a layout region. In each bipartitioning step, technology mapping onto logic blocks of FPGA's, their placement, and global routing are determined simultaneously, which leads to a more congestionbalanced layout for routing. In addition, Maple-opt is capable of estimating a lower bound of the delay for a constrained path and of extracting critical paths based on the difference between the lower bounds and given constraint values in each bipartitioning step. Two delay-reduction procedures for the critical paths are applied; routing delay reduction and logic-block delay reduction. The routing delay reduction is done by assigning each constrained path to a single subregion when bipartitioning a region. The logic-block delay reduction is done by mapping each constrained path onto a smaller number of logic blocks. Experimental results for benchmark circuits demonstrate that Maple-opt reduces the maximum number of tracks per channel by a maximum of 38% compared with existing algorithms while satisfying almost all the path delay constraints.

    Original languageEnglish
    Pages (from-to)803-818
    Number of pages16
    JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
    Volume17
    Issue number9
    DOIs
    Publication statusPublished - 1998

    Fingerprint

    Routing algorithms
    Field programmable gate arrays (FPGA)
    Networks (circuits)

    Keywords

    • Field programmable gate arrays (fpga's)
    • Global routing
    • Placement
    • Technology mapping

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Hardware and Architecture
    • Computer Science Applications
    • Computational Theory and Mathematics

    Cite this

    @article{31b68c11a0a84a868c2b8f27328b4467,
    title = "Maple-opt: A performance-oriented simultaneous technology mapping, placement, and global routing algorithm for FPGA's",
    abstract = "A new field programmable gate array (FPGA) design algorithm, Maple-opt, is proposed for technology mapping, placement, and global routing subject to a given upper bound of critical signal path delay. The basic procedure of Mapleopt is viewed as top-down hierarchical bipartition of a layout region. In each bipartitioning step, technology mapping onto logic blocks of FPGA's, their placement, and global routing are determined simultaneously, which leads to a more congestionbalanced layout for routing. In addition, Maple-opt is capable of estimating a lower bound of the delay for a constrained path and of extracting critical paths based on the difference between the lower bounds and given constraint values in each bipartitioning step. Two delay-reduction procedures for the critical paths are applied; routing delay reduction and logic-block delay reduction. The routing delay reduction is done by assigning each constrained path to a single subregion when bipartitioning a region. The logic-block delay reduction is done by mapping each constrained path onto a smaller number of logic blocks. Experimental results for benchmark circuits demonstrate that Maple-opt reduces the maximum number of tracks per channel by a maximum of 38{\%} compared with existing algorithms while satisfying almost all the path delay constraints.",
    keywords = "Field programmable gate arrays (fpga's), Global routing, Placement, Technology mapping",
    author = "Nozomu Togawa and Masao Yanagisawa and Tatsuo Ohtsuki",
    year = "1998",
    doi = "10.1109/43.720317",
    language = "English",
    volume = "17",
    pages = "803--818",
    journal = "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems",
    issn = "0278-0070",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "9",

    }

    TY - JOUR

    T1 - Maple-opt

    T2 - A performance-oriented simultaneous technology mapping, placement, and global routing algorithm for FPGA's

    AU - Togawa, Nozomu

    AU - Yanagisawa, Masao

    AU - Ohtsuki, Tatsuo

    PY - 1998

    Y1 - 1998

    N2 - A new field programmable gate array (FPGA) design algorithm, Maple-opt, is proposed for technology mapping, placement, and global routing subject to a given upper bound of critical signal path delay. The basic procedure of Mapleopt is viewed as top-down hierarchical bipartition of a layout region. In each bipartitioning step, technology mapping onto logic blocks of FPGA's, their placement, and global routing are determined simultaneously, which leads to a more congestionbalanced layout for routing. In addition, Maple-opt is capable of estimating a lower bound of the delay for a constrained path and of extracting critical paths based on the difference between the lower bounds and given constraint values in each bipartitioning step. Two delay-reduction procedures for the critical paths are applied; routing delay reduction and logic-block delay reduction. The routing delay reduction is done by assigning each constrained path to a single subregion when bipartitioning a region. The logic-block delay reduction is done by mapping each constrained path onto a smaller number of logic blocks. Experimental results for benchmark circuits demonstrate that Maple-opt reduces the maximum number of tracks per channel by a maximum of 38% compared with existing algorithms while satisfying almost all the path delay constraints.

    AB - A new field programmable gate array (FPGA) design algorithm, Maple-opt, is proposed for technology mapping, placement, and global routing subject to a given upper bound of critical signal path delay. The basic procedure of Mapleopt is viewed as top-down hierarchical bipartition of a layout region. In each bipartitioning step, technology mapping onto logic blocks of FPGA's, their placement, and global routing are determined simultaneously, which leads to a more congestionbalanced layout for routing. In addition, Maple-opt is capable of estimating a lower bound of the delay for a constrained path and of extracting critical paths based on the difference between the lower bounds and given constraint values in each bipartitioning step. Two delay-reduction procedures for the critical paths are applied; routing delay reduction and logic-block delay reduction. The routing delay reduction is done by assigning each constrained path to a single subregion when bipartitioning a region. The logic-block delay reduction is done by mapping each constrained path onto a smaller number of logic blocks. Experimental results for benchmark circuits demonstrate that Maple-opt reduces the maximum number of tracks per channel by a maximum of 38% compared with existing algorithms while satisfying almost all the path delay constraints.

    KW - Field programmable gate arrays (fpga's)

    KW - Global routing

    KW - Placement

    KW - Technology mapping

    UR - http://www.scopus.com/inward/record.url?scp=0032162446&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0032162446&partnerID=8YFLogxK

    U2 - 10.1109/43.720317

    DO - 10.1109/43.720317

    M3 - Article

    AN - SCOPUS:0032162446

    VL - 17

    SP - 803

    EP - 818

    JO - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

    JF - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

    SN - 0278-0070

    IS - 9

    ER -