DocumentCode
157794
Title
CREAM: A Concurrent-Refresh-Aware DRAM Memory architecture
Author
Tao Zhang ; Poremba, Matthew ; Cong Xu ; Guangyu Sun ; Yuan Xie
Author_Institution
Dept. of Comput. Sci. & Eng., Pennsylvania State Univ., University Park, PA, USA
fYear
2014
fDate
15-19 Feb. 2014
Firstpage
368
Lastpage
379
Abstract
As DRAM density keeps increasing, more rows need to be protected in a single refresh with the constant refresh number. Since no memory access is allowed during a refresh, the refresh penalty is no longer trivial and can result in significant performance degradation. To mitigate the refresh penalty, a Concurrent-REfresh-Aware Memory system (CREAM) is proposed in this work so that memory access and refresh can be served in parallel. The proposed CREAM architecture distinguishes itself with the following key contributions: (1) Under a given DRAM power budget, sub-rank-level refresh (SRLR) is developed to reduce refresh power and the saved power is used to enable concurrent memory access; (2) sub-array-level refresh (SALR) is also devised to effectively lower the probability of the conflict between memory access and refresh; (3) In addition, novel sub-array level refresh scheduling schemes, such as sub-array round-robin and dynamic scheduling, are designed to further improve the performance. A quasi-ROR interface protocol is proposed so that CREAM is fully compatible with JEDEC-DDR standard with negligible hardware overhead and no extra pin-out. The experimental results show that CREAM can improve the performance by 12.9% and 7.1% over the conventional DRAM and the Elastic-Refresh DRAM memory, respectively.
Keywords
DRAM chips; memory architecture; probability; processor scheduling; CREAM architecture; DRAM density; DRAM power budget; JEDEC-DDR standard; SALR; SRLR; concurrent memory access; concurrent-refresh-aware DRAM memory architecture; concurrent-refresh-aware memory system; dynamic scheduling; elastic-refresh DRAM memory; hardware overhead; memory refresh; probability; quasiROR interface protocol; refresh penalty; subarray level refresh scheduling schemes; subarray round-robin; subarray-level refresh; subrank-level refresh; Arrays; Degradation; Erbium; Performance gain; Random access memory; Standards; Timing;
fLanguage
English
Publisher
ieee
Conference_Titel
High Performance Computer Architecture (HPCA), 2014 IEEE 20th International Symposium on
Conference_Location
Orlando, FL
Type
conf
DOI
10.1109/HPCA.2014.6835947
Filename
6835947
Link To Document