AVF-driven parity optimization for MBU protection of in-core memory arrays

Mihalis Maniatakos, Maria K. Michael, Yiorgos Makris

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We propose an AVF-driven parity selection method for protecting modern microprocessor in-core memory arrays against MBUs. As MBUs constitute more than 50% of the upsets in latest technologies, error correcting codes or physical interleaving are typically employed to effectively protect out-of-core memory structures, such as caches. However, such methods are not applicable to high-performance in-core arrays, due to computational complexity, high delay and area overhead. To this end, we revisit parity as an effective mechanism to detect errors and we resort to pipeline flushing and checkpointing for correction. We demonstrate that optimal parity tree construction for MBU detection is a computationally complex problem, which we then formulate as an integer-linear-program (ILP). Experimental results on Alpha 21264 and Intel P6 in-core memory arrays demonstrate that optimal parity tree selection can achieve great vulnerability reduction, even when a small number of bits are added to the parity trees, compared to simple heuristics. Furthermore, the ILP formulation allows us to find better solutions by effectively exploring the solution space in the presence of multiple parity trees; results show that the presence of 2 parity trees offers a vulnerability reduction of more than 50% over a single parity tree.

Original languageEnglish (US)
Title of host publicationProceedings - Design, Automation and Test in Europe, DATE 2013
Pages1480-1485
Number of pages6
StatePublished - Oct 21 2013
Event16th Design, Automation and Test in Europe Conference and Exhibition, DATE 2013 - Grenoble, France
Duration: Mar 18 2013Mar 22 2013

Other

Other16th Design, Automation and Test in Europe Conference and Exhibition, DATE 2013
CountryFrance
CityGrenoble
Period3/18/133/22/13

Fingerprint

Data storage equipment
Microprocessor chips
Computational complexity
Pipelines

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Maniatakos, M., Michael, M. K., & Makris, Y. (2013). AVF-driven parity optimization for MBU protection of in-core memory arrays. In Proceedings - Design, Automation and Test in Europe, DATE 2013 (pp. 1480-1485). [6513747]

AVF-driven parity optimization for MBU protection of in-core memory arrays. / Maniatakos, Mihalis; Michael, Maria K.; Makris, Yiorgos.

Proceedings - Design, Automation and Test in Europe, DATE 2013. 2013. p. 1480-1485 6513747.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Maniatakos, M, Michael, MK & Makris, Y 2013, AVF-driven parity optimization for MBU protection of in-core memory arrays. in Proceedings - Design, Automation and Test in Europe, DATE 2013., 6513747, pp. 1480-1485, 16th Design, Automation and Test in Europe Conference and Exhibition, DATE 2013, Grenoble, France, 3/18/13.
Maniatakos M, Michael MK, Makris Y. AVF-driven parity optimization for MBU protection of in-core memory arrays. In Proceedings - Design, Automation and Test in Europe, DATE 2013. 2013. p. 1480-1485. 6513747
Maniatakos, Mihalis ; Michael, Maria K. ; Makris, Yiorgos. / AVF-driven parity optimization for MBU protection of in-core memory arrays. Proceedings - Design, Automation and Test in Europe, DATE 2013. 2013. pp. 1480-1485
@inproceedings{0baca5d14a954969851a5589ee49bdc9,
title = "AVF-driven parity optimization for MBU protection of in-core memory arrays",
abstract = "We propose an AVF-driven parity selection method for protecting modern microprocessor in-core memory arrays against MBUs. As MBUs constitute more than 50{\%} of the upsets in latest technologies, error correcting codes or physical interleaving are typically employed to effectively protect out-of-core memory structures, such as caches. However, such methods are not applicable to high-performance in-core arrays, due to computational complexity, high delay and area overhead. To this end, we revisit parity as an effective mechanism to detect errors and we resort to pipeline flushing and checkpointing for correction. We demonstrate that optimal parity tree construction for MBU detection is a computationally complex problem, which we then formulate as an integer-linear-program (ILP). Experimental results on Alpha 21264 and Intel P6 in-core memory arrays demonstrate that optimal parity tree selection can achieve great vulnerability reduction, even when a small number of bits are added to the parity trees, compared to simple heuristics. Furthermore, the ILP formulation allows us to find better solutions by effectively exploring the solution space in the presence of multiple parity trees; results show that the presence of 2 parity trees offers a vulnerability reduction of more than 50{\%} over a single parity tree.",
author = "Mihalis Maniatakos and Michael, {Maria K.} and Yiorgos Makris",
year = "2013",
month = "10",
day = "21",
language = "English (US)",
isbn = "9783981537000",
pages = "1480--1485",
booktitle = "Proceedings - Design, Automation and Test in Europe, DATE 2013",

}

TY - GEN

T1 - AVF-driven parity optimization for MBU protection of in-core memory arrays

AU - Maniatakos, Mihalis

AU - Michael, Maria K.

AU - Makris, Yiorgos

PY - 2013/10/21

Y1 - 2013/10/21

N2 - We propose an AVF-driven parity selection method for protecting modern microprocessor in-core memory arrays against MBUs. As MBUs constitute more than 50% of the upsets in latest technologies, error correcting codes or physical interleaving are typically employed to effectively protect out-of-core memory structures, such as caches. However, such methods are not applicable to high-performance in-core arrays, due to computational complexity, high delay and area overhead. To this end, we revisit parity as an effective mechanism to detect errors and we resort to pipeline flushing and checkpointing for correction. We demonstrate that optimal parity tree construction for MBU detection is a computationally complex problem, which we then formulate as an integer-linear-program (ILP). Experimental results on Alpha 21264 and Intel P6 in-core memory arrays demonstrate that optimal parity tree selection can achieve great vulnerability reduction, even when a small number of bits are added to the parity trees, compared to simple heuristics. Furthermore, the ILP formulation allows us to find better solutions by effectively exploring the solution space in the presence of multiple parity trees; results show that the presence of 2 parity trees offers a vulnerability reduction of more than 50% over a single parity tree.

AB - We propose an AVF-driven parity selection method for protecting modern microprocessor in-core memory arrays against MBUs. As MBUs constitute more than 50% of the upsets in latest technologies, error correcting codes or physical interleaving are typically employed to effectively protect out-of-core memory structures, such as caches. However, such methods are not applicable to high-performance in-core arrays, due to computational complexity, high delay and area overhead. To this end, we revisit parity as an effective mechanism to detect errors and we resort to pipeline flushing and checkpointing for correction. We demonstrate that optimal parity tree construction for MBU detection is a computationally complex problem, which we then formulate as an integer-linear-program (ILP). Experimental results on Alpha 21264 and Intel P6 in-core memory arrays demonstrate that optimal parity tree selection can achieve great vulnerability reduction, even when a small number of bits are added to the parity trees, compared to simple heuristics. Furthermore, the ILP formulation allows us to find better solutions by effectively exploring the solution space in the presence of multiple parity trees; results show that the presence of 2 parity trees offers a vulnerability reduction of more than 50% over a single parity tree.

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

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

M3 - Conference contribution

AN - SCOPUS:84885196634

SN - 9783981537000

SP - 1480

EP - 1485

BT - Proceedings - Design, Automation and Test in Europe, DATE 2013

ER -