A fault-secure high-level synthesis algorithm for RDR architectures

Sho Tanaka, Masao Yanagisawa, Tatsuo Ohtsuki, Nozomu Togawa

    Research output: Contribution to journalArticle

    12 Citations (Scopus)

    Abstract

    As device feature size decreases, the reliability improvement against soft errors becomes quite necessary. A fault-secure system, in which concurrent error detection is realized, is one of the solutions to this problem. On the other hand, average interconnection delays exceed gate delays which leads to a serious timing closure problem. By using regular-distributed-register architecture (RDR architecture), we can estimate interconnection delays very accurately and their influence can be much reduced even in behavioral-level design. In this paper, we propose a fault-secure high-level synthesis algorithm for an RDR architecture. In fault-secure high-level synthesis, a recomputation CDFG as well as a normal-computation CDFG must be scheduled to control steps and bound to functional units. Firstly, our algorithm re-uses vacant areas on RDR islands to allocate new function units additionally for the recomputation CDFG. Secondly, we propose an efficient edge-break algorithm which considers comparison nodes' scheduling/binding. We can have small-latency scheduling/binding for both the normal CDFG and recomputation CDFG. Our algorithm reduces the required control steps by up to 53% compared with the conventional approach.

    Original languageEnglish
    Pages (from-to)150-165
    Number of pages16
    JournalIPSJ Transactions on System LSI Design Methodology
    Volume4
    DOIs
    Publication statusPublished - 2011

    Fingerprint

    Scheduling
    Error detection
    High level synthesis

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Computer Science Applications

    Cite this

    A fault-secure high-level synthesis algorithm for RDR architectures. / Tanaka, Sho; Yanagisawa, Masao; Ohtsuki, Tatsuo; Togawa, Nozomu.

    In: IPSJ Transactions on System LSI Design Methodology, Vol. 4, 2011, p. 150-165.

    Research output: Contribution to journalArticle

    @article{642a4facd9d84a5488c9e58b6ded1c21,
    title = "A fault-secure high-level synthesis algorithm for RDR architectures",
    abstract = "As device feature size decreases, the reliability improvement against soft errors becomes quite necessary. A fault-secure system, in which concurrent error detection is realized, is one of the solutions to this problem. On the other hand, average interconnection delays exceed gate delays which leads to a serious timing closure problem. By using regular-distributed-register architecture (RDR architecture), we can estimate interconnection delays very accurately and their influence can be much reduced even in behavioral-level design. In this paper, we propose a fault-secure high-level synthesis algorithm for an RDR architecture. In fault-secure high-level synthesis, a recomputation CDFG as well as a normal-computation CDFG must be scheduled to control steps and bound to functional units. Firstly, our algorithm re-uses vacant areas on RDR islands to allocate new function units additionally for the recomputation CDFG. Secondly, we propose an efficient edge-break algorithm which considers comparison nodes' scheduling/binding. We can have small-latency scheduling/binding for both the normal CDFG and recomputation CDFG. Our algorithm reduces the required control steps by up to 53{\%} compared with the conventional approach.",
    author = "Sho Tanaka and Masao Yanagisawa and Tatsuo Ohtsuki and Nozomu Togawa",
    year = "2011",
    doi = "10.2197/ipsjtsldm.4.150",
    language = "English",
    volume = "4",
    pages = "150--165",
    journal = "IPSJ Transactions on System LSI Design Methodology",
    issn = "1882-6687",
    publisher = "Information Processing Society of Japan",

    }

    TY - JOUR

    T1 - A fault-secure high-level synthesis algorithm for RDR architectures

    AU - Tanaka, Sho

    AU - Yanagisawa, Masao

    AU - Ohtsuki, Tatsuo

    AU - Togawa, Nozomu

    PY - 2011

    Y1 - 2011

    N2 - As device feature size decreases, the reliability improvement against soft errors becomes quite necessary. A fault-secure system, in which concurrent error detection is realized, is one of the solutions to this problem. On the other hand, average interconnection delays exceed gate delays which leads to a serious timing closure problem. By using regular-distributed-register architecture (RDR architecture), we can estimate interconnection delays very accurately and their influence can be much reduced even in behavioral-level design. In this paper, we propose a fault-secure high-level synthesis algorithm for an RDR architecture. In fault-secure high-level synthesis, a recomputation CDFG as well as a normal-computation CDFG must be scheduled to control steps and bound to functional units. Firstly, our algorithm re-uses vacant areas on RDR islands to allocate new function units additionally for the recomputation CDFG. Secondly, we propose an efficient edge-break algorithm which considers comparison nodes' scheduling/binding. We can have small-latency scheduling/binding for both the normal CDFG and recomputation CDFG. Our algorithm reduces the required control steps by up to 53% compared with the conventional approach.

    AB - As device feature size decreases, the reliability improvement against soft errors becomes quite necessary. A fault-secure system, in which concurrent error detection is realized, is one of the solutions to this problem. On the other hand, average interconnection delays exceed gate delays which leads to a serious timing closure problem. By using regular-distributed-register architecture (RDR architecture), we can estimate interconnection delays very accurately and their influence can be much reduced even in behavioral-level design. In this paper, we propose a fault-secure high-level synthesis algorithm for an RDR architecture. In fault-secure high-level synthesis, a recomputation CDFG as well as a normal-computation CDFG must be scheduled to control steps and bound to functional units. Firstly, our algorithm re-uses vacant areas on RDR islands to allocate new function units additionally for the recomputation CDFG. Secondly, we propose an efficient edge-break algorithm which considers comparison nodes' scheduling/binding. We can have small-latency scheduling/binding for both the normal CDFG and recomputation CDFG. Our algorithm reduces the required control steps by up to 53% compared with the conventional approach.

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

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

    U2 - 10.2197/ipsjtsldm.4.150

    DO - 10.2197/ipsjtsldm.4.150

    M3 - Article

    AN - SCOPUS:82455188572

    VL - 4

    SP - 150

    EP - 165

    JO - IPSJ Transactions on System LSI Design Methodology

    JF - IPSJ Transactions on System LSI Design Methodology

    SN - 1882-6687

    ER -