Low cost concurrent error detection strategy for the control logic of high performance microprocessors and its application to the instruction decoder

D. Rossi, M. Omaña, G. Garrammone, C. Metra, A. Jas, R. Galivanche

    Research output: Contribution to journalArticlepeer-review

    1 Citation (Scopus)

    Abstract

    We propose a low cost concurrent error detection strategy to improve the Reliability, Availability, Serviceability (RAS) of high performance microprocessors, by specifically targeting one of its most critical blocks (from the point of view of the microprocessor RAS), that is the control logic. By discovering codes that are inherently present within the control logic because of its performed functionality and verification needs (referred to as Control Logic Function-Inherent Codes), it allows to achieve concurrent error detection at very limited costs in terms of area, power consumption, impact on performance and design. Considering for instance the case of the instruction decoder of a public domain microprocessor, we will prove that our approach requires significantly lower area and power than traditional parity encoding, while providing higher concurrent error detection ability. Therefore, if adopted together with a system level (generally software implemented) recovery technique, our strategy constitutes a viable and successful approach to increase the microprocessor RAS, at very limited costs.

    Original languageEnglish
    Pages (from-to)401-413
    Number of pages13
    JournalJournal of Electronic Testing: Theory and Applications (JETTA)
    Volume29
    Issue number3
    DOIs
    Publication statusPublished - 1 Jun 2013

    Keywords

    • Concurrent error detection
    • Control logic
    • High performance microprocessor
    • RAS

    Fingerprint

    Dive into the research topics of 'Low cost concurrent error detection strategy for the control logic of high performance microprocessors and its application to the instruction decoder'. Together they form a unique fingerprint.

    Cite this