per-Operation Reusability based Allocation and Migration Policy for Hybrid Cache

Minsik Oh, Kwangsu Kim, Duheon Choi, Hyukjun Lee, Eui Young Chung

Research output: Contribution to journalArticle

Abstract

Recently, a hybrid cache consisting of SRAM and STT-RAM has attracted much attention as a future memory by complementing each other with different memory characteristics. Prior works focused on developing data allocation and migration techniques considering write-intensity to reduce write energy at STT-RAM. However, these works often neglect the impact of operation-specific reusability of a cache line. In this paper, we propose an energy-efficient per-operation reusability-based allocation and migration policy (ORAM) with a unified LRU replacement policy. First, to select an adequate memory type for allocation, we propose a cost function based on per-operation reusability - gain from an allocated cache line and loss from an evicted cache line for different memory types - which exploits the temporal locality. Besides, we present a migration policy, victim and target cache line selection scheme, to resolve memory type inconsistency between replacement policy and the allocation policy, with further energy reduction. Experiment results show an average energy reduction in the LLC and the main memory by 12.3% and 21.2%, and the improvement of latency and execution time by 21.2% and 8.8%, respectively, compared with a baseline hybrid cache management. In addition, the Energy-Delay Product (EDP) is improved by 36.9% over the baseline.

Original languageEnglish
JournalIEEE Transactions on Computers
DOIs
Publication statusAccepted/In press - 2019 Jan 1

Fingerprint

Reusability
Cache
Migration
Data storage equipment
Replacement Policy
Line
Random access storage
Energy
Baseline
Data Allocation
Static random access storage
Energy Efficient
Locality
Inconsistency
Cost functions
Execution Time
Cost Function
Latency
Policy
Resolve

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

@article{1facdbd39861463ba3f51652bca6f7a1,
title = "per-Operation Reusability based Allocation and Migration Policy for Hybrid Cache",
abstract = "Recently, a hybrid cache consisting of SRAM and STT-RAM has attracted much attention as a future memory by complementing each other with different memory characteristics. Prior works focused on developing data allocation and migration techniques considering write-intensity to reduce write energy at STT-RAM. However, these works often neglect the impact of operation-specific reusability of a cache line. In this paper, we propose an energy-efficient per-operation reusability-based allocation and migration policy (ORAM) with a unified LRU replacement policy. First, to select an adequate memory type for allocation, we propose a cost function based on per-operation reusability - gain from an allocated cache line and loss from an evicted cache line for different memory types - which exploits the temporal locality. Besides, we present a migration policy, victim and target cache line selection scheme, to resolve memory type inconsistency between replacement policy and the allocation policy, with further energy reduction. Experiment results show an average energy reduction in the LLC and the main memory by 12.3{\%} and 21.2{\%}, and the improvement of latency and execution time by 21.2{\%} and 8.8{\%}, respectively, compared with a baseline hybrid cache management. In addition, the Energy-Delay Product (EDP) is improved by 36.9{\%} over the baseline.",
author = "Minsik Oh and Kwangsu Kim and Duheon Choi and Hyukjun Lee and Chung, {Eui Young}",
year = "2019",
month = "1",
day = "1",
doi = "10.1109/TC.2019.2944163",
language = "English",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",

}

per-Operation Reusability based Allocation and Migration Policy for Hybrid Cache. / Oh, Minsik; Kim, Kwangsu; Choi, Duheon; Lee, Hyukjun; Chung, Eui Young.

In: IEEE Transactions on Computers, 01.01.2019.

Research output: Contribution to journalArticle

TY - JOUR

T1 - per-Operation Reusability based Allocation and Migration Policy for Hybrid Cache

AU - Oh, Minsik

AU - Kim, Kwangsu

AU - Choi, Duheon

AU - Lee, Hyukjun

AU - Chung, Eui Young

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Recently, a hybrid cache consisting of SRAM and STT-RAM has attracted much attention as a future memory by complementing each other with different memory characteristics. Prior works focused on developing data allocation and migration techniques considering write-intensity to reduce write energy at STT-RAM. However, these works often neglect the impact of operation-specific reusability of a cache line. In this paper, we propose an energy-efficient per-operation reusability-based allocation and migration policy (ORAM) with a unified LRU replacement policy. First, to select an adequate memory type for allocation, we propose a cost function based on per-operation reusability - gain from an allocated cache line and loss from an evicted cache line for different memory types - which exploits the temporal locality. Besides, we present a migration policy, victim and target cache line selection scheme, to resolve memory type inconsistency between replacement policy and the allocation policy, with further energy reduction. Experiment results show an average energy reduction in the LLC and the main memory by 12.3% and 21.2%, and the improvement of latency and execution time by 21.2% and 8.8%, respectively, compared with a baseline hybrid cache management. In addition, the Energy-Delay Product (EDP) is improved by 36.9% over the baseline.

AB - Recently, a hybrid cache consisting of SRAM and STT-RAM has attracted much attention as a future memory by complementing each other with different memory characteristics. Prior works focused on developing data allocation and migration techniques considering write-intensity to reduce write energy at STT-RAM. However, these works often neglect the impact of operation-specific reusability of a cache line. In this paper, we propose an energy-efficient per-operation reusability-based allocation and migration policy (ORAM) with a unified LRU replacement policy. First, to select an adequate memory type for allocation, we propose a cost function based on per-operation reusability - gain from an allocated cache line and loss from an evicted cache line for different memory types - which exploits the temporal locality. Besides, we present a migration policy, victim and target cache line selection scheme, to resolve memory type inconsistency between replacement policy and the allocation policy, with further energy reduction. Experiment results show an average energy reduction in the LLC and the main memory by 12.3% and 21.2%, and the improvement of latency and execution time by 21.2% and 8.8%, respectively, compared with a baseline hybrid cache management. In addition, the Energy-Delay Product (EDP) is improved by 36.9% over the baseline.

UR - http://www.scopus.com/inward/record.url?scp=85072775234&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85072775234&partnerID=8YFLogxK

U2 - 10.1109/TC.2019.2944163

DO - 10.1109/TC.2019.2944163

M3 - Article

AN - SCOPUS:85072775234

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

ER -