A high-level synthesis algorithm with inter-island distance based operation chainings for RDR architectures

    Research output: Contribution to journalArticle

    1 Citation (Scopus)

    Abstract

    In deep-submicron era, interconnection delays are not negligible even in high-level synthesis and regular-distributed-register architectures (RDR architectures) have been proposed to cope with this problem. In this paper, we propose a high-level synthesis algorithm using operation chainings which reduces the overall latency targeting RDR architectures. Our algorithm consists of three steps: The first step enumerates candidate operations for chaining. The second step introduces maximal chaining distance (MCD), which gives the maximal allowable inter-island distance on RDR architecture between chaining candidate operations. The last step performs list-scheduling and binding simultaneously based on the results of the two preceding steps. Our algorithm enumerates feasible chaining candidates and selects the best ones for RDR architecture. Experimental results show that our proposed algorithm reduces the latency by up to 40.0% compared to the original approach, and by up to 25.0% compared to a conventional approach. Our algorithm also reduces the number of registers and the number of multiplexers compared to the conventional approaches in some cases.

    Original languageEnglish
    Pages (from-to)1366-1375
    Number of pages10
    JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    VolumeE98A
    Issue number7
    DOIs
    Publication statusPublished - 2015 Jul 1

    Fingerprint

    High-level Synthesis
    Latency
    List Scheduling
    Interconnection
    Scheduling
    Architecture
    High level synthesis
    Experimental Results

    Keywords

    • Floorplan
    • High-level synthesis
    • Interconnection delay
    • Operation chaining
    • RDR architecture

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Computer Graphics and Computer-Aided Design
    • Applied Mathematics
    • Signal Processing

    Cite this

    @article{917bfb1033904273b70d804cea12e8cb,
    title = "A high-level synthesis algorithm with inter-island distance based operation chainings for RDR architectures",
    abstract = "In deep-submicron era, interconnection delays are not negligible even in high-level synthesis and regular-distributed-register architectures (RDR architectures) have been proposed to cope with this problem. In this paper, we propose a high-level synthesis algorithm using operation chainings which reduces the overall latency targeting RDR architectures. Our algorithm consists of three steps: The first step enumerates candidate operations for chaining. The second step introduces maximal chaining distance (MCD), which gives the maximal allowable inter-island distance on RDR architecture between chaining candidate operations. The last step performs list-scheduling and binding simultaneously based on the results of the two preceding steps. Our algorithm enumerates feasible chaining candidates and selects the best ones for RDR architecture. Experimental results show that our proposed algorithm reduces the latency by up to 40.0{\%} compared to the original approach, and by up to 25.0{\%} compared to a conventional approach. Our algorithm also reduces the number of registers and the number of multiplexers compared to the conventional approaches in some cases.",
    keywords = "Floorplan, High-level synthesis, Interconnection delay, Operation chaining, RDR architecture",
    author = "Kotaro Terada and Masao Yanagisawa and Nozomu Togawa",
    year = "2015",
    month = "7",
    day = "1",
    doi = "10.1587/transfun.E98.A.1366",
    language = "English",
    volume = "E98A",
    pages = "1366--1375",
    journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
    issn = "0916-8508",
    publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
    number = "7",

    }

    TY - JOUR

    T1 - A high-level synthesis algorithm with inter-island distance based operation chainings for RDR architectures

    AU - Terada, Kotaro

    AU - Yanagisawa, Masao

    AU - Togawa, Nozomu

    PY - 2015/7/1

    Y1 - 2015/7/1

    N2 - In deep-submicron era, interconnection delays are not negligible even in high-level synthesis and regular-distributed-register architectures (RDR architectures) have been proposed to cope with this problem. In this paper, we propose a high-level synthesis algorithm using operation chainings which reduces the overall latency targeting RDR architectures. Our algorithm consists of three steps: The first step enumerates candidate operations for chaining. The second step introduces maximal chaining distance (MCD), which gives the maximal allowable inter-island distance on RDR architecture between chaining candidate operations. The last step performs list-scheduling and binding simultaneously based on the results of the two preceding steps. Our algorithm enumerates feasible chaining candidates and selects the best ones for RDR architecture. Experimental results show that our proposed algorithm reduces the latency by up to 40.0% compared to the original approach, and by up to 25.0% compared to a conventional approach. Our algorithm also reduces the number of registers and the number of multiplexers compared to the conventional approaches in some cases.

    AB - In deep-submicron era, interconnection delays are not negligible even in high-level synthesis and regular-distributed-register architectures (RDR architectures) have been proposed to cope with this problem. In this paper, we propose a high-level synthesis algorithm using operation chainings which reduces the overall latency targeting RDR architectures. Our algorithm consists of three steps: The first step enumerates candidate operations for chaining. The second step introduces maximal chaining distance (MCD), which gives the maximal allowable inter-island distance on RDR architecture between chaining candidate operations. The last step performs list-scheduling and binding simultaneously based on the results of the two preceding steps. Our algorithm enumerates feasible chaining candidates and selects the best ones for RDR architecture. Experimental results show that our proposed algorithm reduces the latency by up to 40.0% compared to the original approach, and by up to 25.0% compared to a conventional approach. Our algorithm also reduces the number of registers and the number of multiplexers compared to the conventional approaches in some cases.

    KW - Floorplan

    KW - High-level synthesis

    KW - Interconnection delay

    KW - Operation chaining

    KW - RDR architecture

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

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

    U2 - 10.1587/transfun.E98.A.1366

    DO - 10.1587/transfun.E98.A.1366

    M3 - Article

    VL - E98A

    SP - 1366

    EP - 1375

    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 - 7

    ER -