Multiple-Bit Upset Protection in Microprocessor Memory Arrays Using Vulnerability-Based Parity Optimization and Interleaving

Mihalis Maniatakos, Maria K. Michael, Yiorgos Makris

    Research output: Contribution to journalArticle

    Abstract

    We propose a technology-independent vulnerability-driven parity selection method for protecting modern microprocessor in-core memory arrays against multiple-bit upsets (MBUs). As MBUs constitute over 50% of the upsets in recent technologies, error correcting codes or physical interleaving are typically employed to effectively protect out-of-core memory structures, such as caches. Such methods, however, are not applicable to high performance in-core arrays, due to computational complexity, high delay, and area overhead. Therefore, we investigate vulnerability-based parity forest formation as an effective mechanism for detecting errors. Checkpointing and pipeline flushing can subsequently be used for correction. As the optimal parity tree construction for MBU detection is a computationally complex problem, an integer linear program formulation is introduced. In addition, vulnerability-based interleaving (VBI) is explored as a mechanism for further enhancing in-core array resiliency in constrained, single parity tree cases. VBI first physically disperses bitlines based on their vulnerability factor and then applies selective parity to these lines. Experimental results on Alpha 21264 and Intel P6 in-core memory arrays demonstrate that the proposed parity tree selection and VBI methods can achieve vulnerability reduction up to 86%, even when a small number of bits are added to the parity trees.

    Original languageEnglish (US)
    Article number6953332
    Pages (from-to)2447-2460
    Number of pages14
    JournalIEEE Transactions on Very Large Scale Integration (VLSI) Systems
    Volume23
    Issue number11
    DOIs
    StatePublished - Nov 1 2015

    Fingerprint

    Microprocessor chips
    Data storage equipment
    Computational complexity
    Pipelines

    Keywords

    • Architectural vulnerability factor (AVF)
    • interleaving
    • memory array
    • modern microprocessor
    • optimization
    • Parity

    ASJC Scopus subject areas

    • Software
    • Hardware and Architecture
    • Electrical and Electronic Engineering

    Cite this

    Multiple-Bit Upset Protection in Microprocessor Memory Arrays Using Vulnerability-Based Parity Optimization and Interleaving. / Maniatakos, Mihalis; Michael, Maria K.; Makris, Yiorgos.

    In: IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Vol. 23, No. 11, 6953332, 01.11.2015, p. 2447-2460.

    Research output: Contribution to journalArticle

    @article{dc10f22f5f3d46ca87514ed931cf07c2,
    title = "Multiple-Bit Upset Protection in Microprocessor Memory Arrays Using Vulnerability-Based Parity Optimization and Interleaving",
    abstract = "We propose a technology-independent vulnerability-driven parity selection method for protecting modern microprocessor in-core memory arrays against multiple-bit upsets (MBUs). As MBUs constitute over 50{\%} of the upsets in recent technologies, error correcting codes or physical interleaving are typically employed to effectively protect out-of-core memory structures, such as caches. Such methods, however, are not applicable to high performance in-core arrays, due to computational complexity, high delay, and area overhead. Therefore, we investigate vulnerability-based parity forest formation as an effective mechanism for detecting errors. Checkpointing and pipeline flushing can subsequently be used for correction. As the optimal parity tree construction for MBU detection is a computationally complex problem, an integer linear program formulation is introduced. In addition, vulnerability-based interleaving (VBI) is explored as a mechanism for further enhancing in-core array resiliency in constrained, single parity tree cases. VBI first physically disperses bitlines based on their vulnerability factor and then applies selective parity to these lines. Experimental results on Alpha 21264 and Intel P6 in-core memory arrays demonstrate that the proposed parity tree selection and VBI methods can achieve vulnerability reduction up to 86{\%}, even when a small number of bits are added to the parity trees.",
    keywords = "Architectural vulnerability factor (AVF), interleaving, memory array, modern microprocessor, optimization, Parity",
    author = "Mihalis Maniatakos and Michael, {Maria K.} and Yiorgos Makris",
    year = "2015",
    month = "11",
    day = "1",
    doi = "10.1109/TVLSI.2014.2365032",
    language = "English (US)",
    volume = "23",
    pages = "2447--2460",
    journal = "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
    issn = "1063-8210",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "11",

    }

    TY - JOUR

    T1 - Multiple-Bit Upset Protection in Microprocessor Memory Arrays Using Vulnerability-Based Parity Optimization and Interleaving

    AU - Maniatakos, Mihalis

    AU - Michael, Maria K.

    AU - Makris, Yiorgos

    PY - 2015/11/1

    Y1 - 2015/11/1

    N2 - We propose a technology-independent vulnerability-driven parity selection method for protecting modern microprocessor in-core memory arrays against multiple-bit upsets (MBUs). As MBUs constitute over 50% of the upsets in recent technologies, error correcting codes or physical interleaving are typically employed to effectively protect out-of-core memory structures, such as caches. Such methods, however, are not applicable to high performance in-core arrays, due to computational complexity, high delay, and area overhead. Therefore, we investigate vulnerability-based parity forest formation as an effective mechanism for detecting errors. Checkpointing and pipeline flushing can subsequently be used for correction. As the optimal parity tree construction for MBU detection is a computationally complex problem, an integer linear program formulation is introduced. In addition, vulnerability-based interleaving (VBI) is explored as a mechanism for further enhancing in-core array resiliency in constrained, single parity tree cases. VBI first physically disperses bitlines based on their vulnerability factor and then applies selective parity to these lines. Experimental results on Alpha 21264 and Intel P6 in-core memory arrays demonstrate that the proposed parity tree selection and VBI methods can achieve vulnerability reduction up to 86%, even when a small number of bits are added to the parity trees.

    AB - We propose a technology-independent vulnerability-driven parity selection method for protecting modern microprocessor in-core memory arrays against multiple-bit upsets (MBUs). As MBUs constitute over 50% of the upsets in recent technologies, error correcting codes or physical interleaving are typically employed to effectively protect out-of-core memory structures, such as caches. Such methods, however, are not applicable to high performance in-core arrays, due to computational complexity, high delay, and area overhead. Therefore, we investigate vulnerability-based parity forest formation as an effective mechanism for detecting errors. Checkpointing and pipeline flushing can subsequently be used for correction. As the optimal parity tree construction for MBU detection is a computationally complex problem, an integer linear program formulation is introduced. In addition, vulnerability-based interleaving (VBI) is explored as a mechanism for further enhancing in-core array resiliency in constrained, single parity tree cases. VBI first physically disperses bitlines based on their vulnerability factor and then applies selective parity to these lines. Experimental results on Alpha 21264 and Intel P6 in-core memory arrays demonstrate that the proposed parity tree selection and VBI methods can achieve vulnerability reduction up to 86%, even when a small number of bits are added to the parity trees.

    KW - Architectural vulnerability factor (AVF)

    KW - interleaving

    KW - memory array

    KW - modern microprocessor

    KW - optimization

    KW - Parity

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

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

    U2 - 10.1109/TVLSI.2014.2365032

    DO - 10.1109/TVLSI.2014.2365032

    M3 - Article

    VL - 23

    SP - 2447

    EP - 2460

    JO - IEEE Transactions on Very Large Scale Integration (VLSI) Systems

    JF - IEEE Transactions on Very Large Scale Integration (VLSI) Systems

    SN - 1063-8210

    IS - 11

    M1 - 6953332

    ER -