CLARA: Circular Linked-List Auto and Self Refresh Architecture

被引:2
|
作者
Agrawal, Aditya
O'Connor, Mike
Bolotin, Evgeny
Chatterjee, Niladrish
Emer, Joel
Keckler, Stephen
机构
关键词
DRAM; Auto refresh; Self refresh;
D O I
10.1145/2989081.2989084
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
With increasing DRAM densities, the performance and energy overheads of refresh operations are increasingly significant. When the system is active, refresh commands render DRAM banks unavailable for increasing periods of time. These refresh operations can interfere with regular memory operations and hurt performance. In addition, when the system is idle, DRAM self-refresh is the dominant source of energy consumption, and it directly impacts battery life and standby time. Prior refresh reduction techniques seek to reduce active-mode auto-refresh energy, reduce self-refresh energy, improve performance, or some combination thereof. In this paper, we present CLARA, a circular linked-list based refresh architecture which meets all three goals with very low overheads and without sacrificing DRAM capacity. This approach exploits the variation in retention time at a chip granularity as opposed to a DIMM-wide, rank granularity in prior work. CLARA reduces auto-and self-refresh by 86.2%, independent of workload. Auto refresh reduction improves average CPU performance by 3.1% and 6.5% in the normal and extended temperature range, respectively. GPU performance improves by 2.1% on average in the extended temperature range. DRAM idle power during self-refresh is reduced by 44%. The area overhead of CLARA in the DRAM is about 0.085% and negligible in the memory controller.
引用
收藏
页码:338 / 349
页数:12
相关论文
共 34 条
  • [1] LINKED-LIST VISUALIZATION FOR DEBUGGING
    SHIMOMURA, T
    ISODA, S
    [J]. IEEE SOFTWARE, 1991, 8 (03) : 44 - 51
  • [2] Automated detection on the security of the linked-list operations
    Kuang, Hongyu
    Wang, Jian
    Li, Ruilin
    Feng, Chao
    Su, YunFei
    Zhang, Xing
    [J]. FRONTIERS OF COMPUTER SCIENCE, 2022, 16 (02)
  • [3] Automated detection on the security of the linked-list operations
    Hongyu KUANG
    Jian WANG
    Ruilin LI
    Chao FENG
    YunFei SU
    Xing ZHANG
    [J]. Frontiers of Computer Science., 2022, 16 (02) - 169
  • [4] Learning Assertions to Verify Linked-List Programs
    Muhlberg, Jan Tobias
    White, David H.
    Dodds, Mike
    Luettgen, Gerald
    Piessens, Frank
    [J]. SOFTWARE ENGINEERING AND FORMAL METHODS, 2015, 9276 : 37 - 52
  • [5] Automated detection on the security of the linked-list operations
    Hongyu Kuang
    Jian Wang
    Ruilin Li
    Chao Feng
    YunFei Su
    Xing Zhang
    [J]. Frontiers of Computer Science, 2022, 16
  • [6] Hash-Based Linked-List Histogram Construction
    Peng, Yan-Tsung
    Cheng, Fan-Chieh
    Ruan, Shanq-Jang
    Lin, Chang-Hong
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2013, E96D (05): : 1204 - 1205
  • [7] Comparing the Performance of Concurrent Linked-List Implementations in Haskell
    Sulzmann, Martin
    Lam, Edmund S. L.
    Marlow, Simon
    [J]. ACM SIGPLAN NOTICES, 2009, 44 (05) : 11 - 20
  • [8] Evolutionary ordered neural network with a linked-list encoding scheme
    Lee, CH
    Kim, JH
    [J]. 1996 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '96), PROCEEDINGS OF, 1996, : 665 - 669
  • [9] On the Optimization of Improved Apriori Algorithm via Linked-list Trie
    Mlambo, Mercy
    Gasela, Naison
    Esiefarienrhe, Michael
    Isong, Bassey
    [J]. ICBDR 2017: PROCEEDINGS OF 2017 INTERNATIONAL CONFERENCE ON BIG DATA RESEARCH, 2015, : 62 - 66
  • [10] A linked-list data structure for advance reservation admission control
    Xiong, Q
    Wu, CL
    Xing, JB
    Wu, LB
    Zhang, HY
    [J]. NETWORKING AND MOBILE COMPUTING, PROCEEDINGS, 2005, 3619 : 901 - 910