Instruction Criticality Based Energy-Efficient Hardware Data Prefetching

被引:5
|
作者
Kalani, Neelu Shivprakash [1 ]
Panda, Biswabandan [2 ]
机构
[1] Ecole Polytech Fed Lausanne, CH-1015 Lausanne, Switzerland
[2] Indian Inst Technol, Mumbai 400076, Maharashtra, India
关键词
Prefetching; IP networks; Benchmark testing; Energy consumption; Memory management; Detectors; Measurement; Cache memory; microarchitecture; POWER;
D O I
10.1109/LCA.2021.3117005
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Hardware data prefetching is a latency hiding technique that mitigates the memory wall problem by fetching data blocks into caches before the processor demands them. For high performing state-of-the-art data prefetchers, this increases dynamic and static energy in memory hierarchy, due to increase in number of requests. A trivial way to improve energy-efficiency of hardware prefetchers is to prefetch instructions on the critical path of execution. As criticality-based data prefetching does not degrade performance significantly; this is an ideal approach to solve the energy-efficiency problem. We discuss limitations of existing critical instruction detection techniques and propose a new technique that uses re-order buffer occupancy as a metric to detect critical instructions and performs prefetcher-specific threshold tuning. With our detector, we achieve maximum memory hierarchy energy savings of 12.3% with 1.4% higher performance, for PPF, and average as follows: (i) SPEC CPU 2017 benchmarks: 2.04% lower energy, 0.3% lower performance, for IPCP at L1D, (ii) client/server benchmarks: 4.7% lower energy, 0.15% lower performance, for PPF, (iii) Cloudsuite benchmarks: 2.99% lower energy, 0.36% higher performance, for IPCP at L1D. IPCP and PPF are state-of-the-art data prefetchers.
引用
收藏
页码:146 / 149
页数:4
相关论文
共 50 条
  • [21] On the design of energy-efficient hardware transactional memorysystems
    Gaona, E.
    Titos, R.
    Fernandez, J.
    Acacio, M. E.
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2013, 25 (06): : 862 - 880
  • [22] ePF-DASH: Energy-Efficient Prefetching Based Dynamic Adaptive Streaming over HTTP
    Kim, Seohyang
    Oh, Hayoung
    Kim, Chongkwon
    2015 INTERNATIONAL CONFERENCE ON BIG DATA AND SMART COMPUTING (BIGCOMP), 2015, : 124 - 129
  • [23] Energy-Efficient Dynamic Instruction Scheduling Logic Through Instruction Grouping
    Sasaki, Hiroshi
    Kondo, Masaaki
    Nakamura, Hiroshi
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2009, 17 (06) : 848 - 852
  • [24] Energy-efficient dynamic instruction scheduling logic through instruction grouping
    Sasaki, Hiroshi
    Kondo, Masaaki
    Nakamura, Hiroshi
    ISLPED '06: PROCEEDINGS OF THE 2006 INTERNATIONAL SYMPOSIUM ON LOW POWER ELECTRONICS AND DESIGN, 2006, : 43 - 48
  • [25] An Adaptive Filtering Mechanism for Energy Efficient Data Prefetching
    Dang, Xianglei
    Wang, Xiaoyin
    Tong, Dong
    Xie, Zichao
    Li, Lingda
    Wang, Keyi
    2013 18TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE (ASP-DAC), 2013, : 332 - 337
  • [26] Exploring configuration of dual speed pipelines for criticality-based energy-efficient processors
    Chiyonobu, A
    Sato, T
    8TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL II, PROCEEDINGS: COMPUTING TECHNIQUES, 2004, : 16 - 21
  • [27] EDF-based Energy-Efficient Probabilistic Imprecise Mixed-Criticality Scheduling
    Zhang, Yi-Wen
    Zhang, Jin-Long
    JOURNAL OF SYSTEMS ARCHITECTURE, 2025, 160
  • [28] An Energy-Efficient Data Gathering Based on Compressive Sensing
    Tang, Ke-Ming
    Yang, Hao
    Qiu, Xin
    Wu, Lv-Qing
    CLOUD COMPUTING AND SECURITY, ICCCS 2016, PT II, 2016, 10040 : 133 - 137
  • [29] AN EVALUATION OF HARDWARE AND SOFTWARE DATA PREFETCHING
    BAER, JL
    CHEN, TF
    APPLICATIONS IN PARALLEL AND DISTRIBUTED COMPUTING, 1994, 44 : 257 - 266
  • [30] Energy-Efficient Strategy Based on Data Recovery in Storm
    Pu Y.
    Yu J.
    Lu L.
    Li Z.
    Guo B.
    Liao B.
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2021, 58 (03): : 479 - 496