A simultaneous technology mapping, placement, and global routing algorithm for fpgas with path delay constraints

Nozomu Togawa, Masao Sato, Tatsuo Ohtsuki

    Research output: Contribution to journalArticle

    Abstract

    In this paper, we propose a new FPGA design algorithm, Maple-opt, in which technology mapping, placement, and global routing are executed so that the delay of each critical signal path in an input circuit is within a specified upper bound imposed on it. The basic algorithm of Maple-opt is top-down hierarchical bi-partitioning of regions. Technology mapping onto logic-blocks of FPGAs, their placement, and global routing are determined simultaneously in each hierarchical process. This simultaneity leads to less congested layout for routing. In addition to that, Maple-opt computes a lower bound of delay for each path with a constraint value and determines critical paths based on the difference between the lower bound and the constraint value dynamically in each hierarchical process. Two delay reduction processes are executed for the critical paths; one is routing delay reduction and the other is logic-block delay reduction. Routing delay reduction is realized such that, when bi-partitioning a region, each constrained path is assigned to one subregion. Logic-block delay reduction is realized such that each constrained path is mapped onto fewer logic-blocks. Experimental results for some benchmark circuits show its efficiency and effectiveness.

    Original languageEnglish
    Pages (from-to)321-329
    Number of pages9
    JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    VolumeE79-A
    Issue number3
    Publication statusPublished - 1996

    Fingerprint

    Routing algorithms
    Routing Algorithm
    Field Programmable Gate Array
    Placement
    Path
    Routing
    Maple
    Logic
    Field programmable gate arrays (FPGA)
    Critical Path
    Partitioning
    Networks (circuits)
    Lower bound
    Simultaneity
    Surjection
    Algorithm Design
    Layout
    Benchmark
    Upper bound
    Experimental Results

    Keywords

    • FPGA
    • Layout
    • Path delay
    • Performance optimization
    • Technology mapping

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Hardware and Architecture
    • Information Systems

    Cite this

    @article{f7ddd8c41a824665a1c8fc231bc48851,
    title = "A simultaneous technology mapping, placement, and global routing algorithm for fpgas with path delay constraints",
    abstract = "In this paper, we propose a new FPGA design algorithm, Maple-opt, in which technology mapping, placement, and global routing are executed so that the delay of each critical signal path in an input circuit is within a specified upper bound imposed on it. The basic algorithm of Maple-opt is top-down hierarchical bi-partitioning of regions. Technology mapping onto logic-blocks of FPGAs, their placement, and global routing are determined simultaneously in each hierarchical process. This simultaneity leads to less congested layout for routing. In addition to that, Maple-opt computes a lower bound of delay for each path with a constraint value and determines critical paths based on the difference between the lower bound and the constraint value dynamically in each hierarchical process. Two delay reduction processes are executed for the critical paths; one is routing delay reduction and the other is logic-block delay reduction. Routing delay reduction is realized such that, when bi-partitioning a region, each constrained path is assigned to one subregion. Logic-block delay reduction is realized such that each constrained path is mapped onto fewer logic-blocks. Experimental results for some benchmark circuits show its efficiency and effectiveness.",
    keywords = "FPGA, Layout, Path delay, Performance optimization, Technology mapping",
    author = "Nozomu Togawa and Masao Sato and Tatsuo Ohtsuki",
    year = "1996",
    language = "English",
    volume = "E79-A",
    pages = "321--329",
    journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
    issn = "0916-8508",
    publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
    number = "3",

    }

    TY - JOUR

    T1 - A simultaneous technology mapping, placement, and global routing algorithm for fpgas with path delay constraints

    AU - Togawa, Nozomu

    AU - Sato, Masao

    AU - Ohtsuki, Tatsuo

    PY - 1996

    Y1 - 1996

    N2 - In this paper, we propose a new FPGA design algorithm, Maple-opt, in which technology mapping, placement, and global routing are executed so that the delay of each critical signal path in an input circuit is within a specified upper bound imposed on it. The basic algorithm of Maple-opt is top-down hierarchical bi-partitioning of regions. Technology mapping onto logic-blocks of FPGAs, their placement, and global routing are determined simultaneously in each hierarchical process. This simultaneity leads to less congested layout for routing. In addition to that, Maple-opt computes a lower bound of delay for each path with a constraint value and determines critical paths based on the difference between the lower bound and the constraint value dynamically in each hierarchical process. Two delay reduction processes are executed for the critical paths; one is routing delay reduction and the other is logic-block delay reduction. Routing delay reduction is realized such that, when bi-partitioning a region, each constrained path is assigned to one subregion. Logic-block delay reduction is realized such that each constrained path is mapped onto fewer logic-blocks. Experimental results for some benchmark circuits show its efficiency and effectiveness.

    AB - In this paper, we propose a new FPGA design algorithm, Maple-opt, in which technology mapping, placement, and global routing are executed so that the delay of each critical signal path in an input circuit is within a specified upper bound imposed on it. The basic algorithm of Maple-opt is top-down hierarchical bi-partitioning of regions. Technology mapping onto logic-blocks of FPGAs, their placement, and global routing are determined simultaneously in each hierarchical process. This simultaneity leads to less congested layout for routing. In addition to that, Maple-opt computes a lower bound of delay for each path with a constraint value and determines critical paths based on the difference between the lower bound and the constraint value dynamically in each hierarchical process. Two delay reduction processes are executed for the critical paths; one is routing delay reduction and the other is logic-block delay reduction. Routing delay reduction is realized such that, when bi-partitioning a region, each constrained path is assigned to one subregion. Logic-block delay reduction is realized such that each constrained path is mapped onto fewer logic-blocks. Experimental results for some benchmark circuits show its efficiency and effectiveness.

    KW - FPGA

    KW - Layout

    KW - Path delay

    KW - Performance optimization

    KW - Technology mapping

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

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

    M3 - Article

    VL - E79-A

    SP - 321

    EP - 329

    JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

    JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

    SN - 0916-8508

    IS - 3

    ER -