TY - JOUR
T1 - High performance, energy efficient chipkill correct memory with multidimensional parity
AU - Jian, Xun
AU - Sartori, John
AU - Duwe, Henry
AU - Kumar, Rakesh
PY - 2013/7
Y1 - 2013/7
N2 - It is well-known that a significant fraction of server power is consumed in memory; this is especially the case for servers with chipkill correct memories. We propose a new chipkill correct memory organization that decouples correction of errors due to local faults that affect a single symbol in a word from correction of errors due to device-level faults that affect an entire column, sub-bank, or device. By using a combination of two codes that separately target these two fault modes, the proposed chipkill correct organization reduces code overhead by half as compared to conventional chipkill correct memories for the same rank size. Alternatively, this allows the rank size to be reduced by half while maintaining roughly the same total code overhead. Simulations using PARSEC and SPEC benchmarks show that, compared to a conventional double chipkill correct baseline, the proposed memory organization, by providing double chipkill correct at half the rank size, reduces power by up to 41%, 32% on average over a conventional baseline with the same chipkill correct strength and access granularity that relies on linear block codes alone, at only 1% additional code overhead.
AB - It is well-known that a significant fraction of server power is consumed in memory; this is especially the case for servers with chipkill correct memories. We propose a new chipkill correct memory organization that decouples correction of errors due to local faults that affect a single symbol in a word from correction of errors due to device-level faults that affect an entire column, sub-bank, or device. By using a combination of two codes that separately target these two fault modes, the proposed chipkill correct organization reduces code overhead by half as compared to conventional chipkill correct memories for the same rank size. Alternatively, this allows the rank size to be reduced by half while maintaining roughly the same total code overhead. Simulations using PARSEC and SPEC benchmarks show that, compared to a conventional double chipkill correct baseline, the proposed memory organization, by providing double chipkill correct at half the rank size, reduces power by up to 41%, 32% on average over a conventional baseline with the same chipkill correct strength and access granularity that relies on linear block codes alone, at only 1% additional code overhead.
KW - DRAM
KW - chipkill correct
KW - low power
KW - reliable memory
UR - http://www.scopus.com/inward/record.url?scp=84891156827&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84891156827&partnerID=8YFLogxK
U2 - 10.1109/L-CA.2012.21
DO - 10.1109/L-CA.2012.21
M3 - Article
AN - SCOPUS:84891156827
SN - 1556-6056
VL - 12
SP - 39
EP - 42
JO - IEEE Computer Architecture Letters
JF - IEEE Computer Architecture Letters
IS - 2
M1 - 6231590
ER -