학술논문

Cache scrubbing in microprocessors: myth or necessity?
Document Type
Conference
Source
10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings. Dependable computing Dependable Computing, 2004. Proceedings. 10th IEEE Pacific Rim International Symposium on. :37-42 2004
Subject
Computing and Processing
Communication, Networking and Broadcast Technologies
Microprocessors
Error correction codes
Error correction
Hardware
Computer architecture
Protection
Writing
Bandwidth
Error analysis
Multiprocessing systems
Language
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. We show 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.