|
Published Articles >> Table of Contents >> Abstract
10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC'04)
pp. 37-42
Cache Scrubbing in Microprocessors: Myth or Necessity?
Shubhendu S. Mukherjee, Intel Corporation
Joel Emer, Intel Corporation
Tryggve Fossum, Intel Corporation
Steven K. Reinhardt, Intel Corporation and University of Michigan
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PRDC.2004.1276550
Send link to a friend
| Abstract |
|
Transient faults from neutron and alpha particle strikes in large SRAM caches have become a major problem for microprocessor designers. To protect these caches, designers often use error correcting codes (ECC), which typically provide single-bit error correction and double-bit error detection (SECDED). Unfortunately, two separate strikes could still flip two different bits in the same ECC-protected word. This we call a temporal double-bit error. SECDED ECC can only detect — not correct — such errors. This paper shows how to compute the mean time to failure for temporal double-bit errors. Additionally, we show how fixed-interval scrubbing — in which error checkers periodically access cache blocks and remove single-bit errors — can mitigate such errors in processor caches. Our analysis using current soft error rates shows that only very large caches (e.g., hundreds of megabytes to gigabytes) need scrubbing to reduce the temporal double-bit error rate to a tolerable range.
|
 Additional Information
|
Citation:
Shubhendu S. Mukherjee, Joel Emer, Tryggve Fossum, Steven K. Reinhardt,
"Cache Scrubbing in Microprocessors: Myth or Necessity?,"
prdc,
pp. 37-42,
10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC'04),
2004
|
|
