Implicit-storing and redundant-encoding-of-attribute information in error-correction-codes
Date
2013Author
Sazeides, YiannakisÖzer, E.
Kershaw, D.
Nikolaou, Panagiota
Kleanthous, Marios M.
Abella, J.
ISBN
978-1-4503-2638-4Source
MICRO 2013 - Proceedings of the 46th Annual IEEE/ACM International Symposium on Microarchitecture46th Annual IEEE/ACM International Symposium on Microarchitecture, MICRO 2013
Pages
160-171Google Scholar check
Keyword(s):
Metadata
Show full item recordAbstract
This paper proposes implicit-storing to extend the logical capacity of a memory array without increasing its physical capacity by leveraging the array's error-correction-codes to infer the implicitly stored bits. Implicit-storing is related to error-code-tagging, a technique that distinguishes between faults in data and invariant attributes of a location when the attributes are not stored in the memory array but are encoded in the error-correction-codes. Both error-code-tagging and implicit-storing cause a code-strength reduction due to their encoding of additional information in the code meant to only protect data. Redundant-encoding-of-attributes is introduced to improve the strength of a code by encoding same information in multiple codewords in a cache or memory. We demonstrate how EREA and IREA, two derivatives of redundant-encoding, alleviate the code-strength reduction experienced by error-code-tagging and implicit-storing respectively. Implementing the proposed methods requires minor modifications in the encoding and decoding logic of the baseline error-correction scheme used in this work. The paper discusses several uses of the proposed schemes to help demonstrate their usefulness. © 2013 ACM.
Collections
Cite as
Related items
Showing items related by title, author, creator and subject.
-
Article
Measuring the impact of adversarial errors on packet scheduling strategies
Fernández Anta, A.; Georgiou, Chryssis; Kowalski, D. R.; Widmer, J.; Zavou, Elli (2016)In this paper, we explore the problem of achieving efficient packet transmission over unreliable links with worst-case occurrence of errors. In such a setup, even an omniscient offline scheduling strategy cannot achieve ...
-
Article
Finite-state machine embeddings for nonconcurrent error detection and identification
Hadjicostis, Christoforos N. (2005)In digital sequential systems that operate over several time steps, a state-transition fault at any time step during the operation of the system can corrupt its state and render its future functionality useless. Such ...
-
Article
Performance analysis for a changepoint problem
Hibey, J. L.; Charalambos, C. D. (1999)Nonlinear stochastic differential equations are used to model a version of the changepoint problem. State estimates of the minimum mean-square-error-type are used in likelihood-ratio tests to detect the time of change. ...