TY - GEN
T1 - Multi-bit error tolerant caches using two-dimensional error coding
AU - Kim, Jangwoo
AU - Hardavellas, Nikos
AU - Mai, Ken
AU - Falsafi, Babak
AU - Hoe, James C.
PY - 2007
Y1 - 2007
N2 - In deep sub-micron ICs, growing amounts of ondie memory and scaling effects make embedded memories increasingly vulnerable to reliability and yield problems. As scaling progresses, soft and hard errors in the memory system will increase and single error events are more likely to cause large-scale multi-bit errors. However, conventional memory protection techniques can neither detect nor correct large-scale multi-bit errors without incurring large performance, area, and power overheads. We propose two-dimensional (2D) error coding in embedded memories, a scalable multi-bit error protection technique to improve memory reliability and yield. The key innovation is the use of vertical error coding across words that is used only for error correction in combination with conventional per-word horizontal error coding. We evaluate this scheme in the cache hierarchies of two representative chip multiprocessor designs and show that 2D error coding can correct clustered errors up to 32x32 bits with significantly smaller performance, area, and power overheads than conventional techniques.
AB - In deep sub-micron ICs, growing amounts of ondie memory and scaling effects make embedded memories increasingly vulnerable to reliability and yield problems. As scaling progresses, soft and hard errors in the memory system will increase and single error events are more likely to cause large-scale multi-bit errors. However, conventional memory protection techniques can neither detect nor correct large-scale multi-bit errors without incurring large performance, area, and power overheads. We propose two-dimensional (2D) error coding in embedded memories, a scalable multi-bit error protection technique to improve memory reliability and yield. The key innovation is the use of vertical error coding across words that is used only for error correction in combination with conventional per-word horizontal error coding. We evaluate this scheme in the cache hierarchies of two representative chip multiprocessor designs and show that 2D error coding can correct clustered errors up to 32x32 bits with significantly smaller performance, area, and power overheads than conventional techniques.
UR - http://www.scopus.com/inward/record.url?scp=47349100793&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=47349100793&partnerID=8YFLogxK
U2 - 10.1109/MICRO.2007.19
DO - 10.1109/MICRO.2007.19
M3 - Conference contribution
AN - SCOPUS:47349100793
SN - 0769530478
SN - 9780769530475
T3 - Proceedings of the Annual International Symposium on Microarchitecture, MICRO
SP - 197
EP - 209
BT - Proceedings of the The 40th IEEE/ACM International Symposium on Microarchitecture, MICRO 2007
T2 - 40th IEEE/ACM International Symposium on Microarchitecture, MICRO 2007
Y2 - 1 December 2007 through 5 December 2007
ER -