An Application-Aware Cache Replacement Policy for Last-Level Caches

Warrier, Tripti S.; Anupama, B.; Mutyam, Madhu

doi:10.1007/978-3-642-36424-2_18

Cited by 14 publications

(5 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Figure 3(b) shows it as a metadata of each LLC block. The existing partitioning techniques [15], [16] as well as some replacement policies [29], [32], [33] need process id for each block. Hence the overhead of maintaining process id in LLC as metadata cannot be considered as the overhead of TPPD.…”

Section: B Targeted Pseudo Partitioning Based Defense (Tppd)mentioning

confidence: 99%

TPPD: Targeted Pseudo Partitioning based Defence for Cross-Core Covert Channel Attacks

Kaur¹,

Das²

2022

Preprint

View full text Add to dashboard Cite

Contemporary computing employs cache hierarchy to fill the speed gap between processors and main memories. In order to optimise system performance, Last Level Caches(LLC) are shared among all the cores. Cache sharing has made them an attractive surface for cross-core timing channel attacks. In these attacks, an attacker running on another core can exploit the access timing of the victim process to infiltrate the secret information. One such attack is called cross-core Covert Channel Attack (CCA). Timely detection and then prevention of crosscore CCA is critical for maintaining the integrity and security of users, especially in a shared computing environment. In this work, we have proposed an efficient cross-core CCA mitigation technique. We propose a way-wise cache partitioning on targeted sets, only for the processes suspected to be attackers. In this way, the performance impact on the entire LLC is minimised, and benign applications can utilise the LLC to its full capacity. We have used a cycle-accurate simulator (gem5) to analyse the performance of the proposed method and its security effectiveness. It has been successful in abolishing the cross-core covert timing channel attack with no significant performance impact on benign applications. It causes 23% less cache misses in comparison to existing partitioning based solutions while requiring ≈ 0.26% storage overhead.

show abstract

Section: B Targeted Pseudo Partitioning Based Defense (Tppd)mentioning

confidence: 99%

TPPD: Targeted Pseudo Partitioning based Defence for Cross-Core Covert Channel Attacks

Kaur¹,

Das²

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…The re-reference distance is the basis for Timekeeping [19], EHC [20] and Leeway [21]. A mixed approach is used in Modified LRU [22], DIP [15], DRRIP [14], SBAR [23], EVA [24] and ACR [25]. Recent state-of-the-art policies classify blocks in cache-averse or cache-friendly and manage each class differently, such as DBCP [26], AIP/LvP [27], CHAR [28], the Reuse Cache [29], SHiP [30], ReD [31] or Hawkeye [32].…”

Section: Replacement Policies For Shared Caches In Multicore Processorsmentioning

confidence: 99%

Near-optimal replacement policies for shared caches in multicore processors

et al. 2021

View full text Add to dashboard Cite

An optimal replacement policy that minimizes the miss rate in a private cache was proposed several decades ago. It requires knowing the future access sequence the cache will receive. There is no equivalent for shared caches because replacement decisions alter this future sequence. We present a novel near-optimal policy for minimizing the miss rate in a shared cache that approaches the optimal execution iteratively. During each iteration, the future access sequence is reconstructed on every miss interleaving the future per-core sequences, taken from the previous iteration. This single sequence feeds a classical private-cache optimum replacement policy. Our evaluation on a shared last-level cache shows that our proposal iteratively converges to a near-optimal miss rate that is independent of the initial conditions, within a margin of 0.1%. The best state-of-the-art online policies achieve around 65% of the miss rate reduction obtained by our near-optimal proposal. In a shared cache, miss rate optimization does not imply the optimization of other metrics. Therefore, we also propose a new near-optimal policy to maximize fairness between cores. The best state-ofthe-art online policy achieves 60% of the improvement in fairness seen with our near-optimal policy. Our proposals are useful both for setting upper performance bounds and inspiring implementable mechanisms for shared caches.

show abstract

“…Frequency based LRU Eviction based on frequency of cache access Natarajan et al (2013) Sharing-aware policy Reuse of shared LLC blocks by crossthreads Warrier et al (2013) Application-aware replacement policy Depriving high access rate application to override low access rate application Li et al (2014) Reference affinity scheme Allocating frequently used data closely Lathigara et al (2015) Application behaviour-aware replacement policy (ABRip) Predictions of re-reference interval of the block based on application behaviour and block locality Mahto et al (2017) AB-aware adaptive cache management policy (ACAM) Eviction based on application behaviour towards cache access Thread level parallelism aware partitioning (TAP) Eviction based on UCP and RRIP Mekkat et al (2013) LLC management policy GPUs tolerance towards the latency in accessing memory The research community has proposed several techniques to address main memory contention which we discuss next.…”

Section: Replacement Policy Referencementioning

confidence: 99%

A review on shared resource contention in multicores and its mitigating techniques

Jain¹,

Surve²

2020

IJHPSA

View full text Add to dashboard Cite

Chip multiprocessor (CMP) systems have become inevitable to meet high computing demands. In such systems sharing of resources is imperative for better resource utilisation. The challenge arises when various application programs running on neighbouring cores compete for these resources concurrently and introduce contention. We aim to present in a simple, lucid and captivating manner a review of previous work on contention in multicores due to various shared resources like shared caches, main memory, memory bus bandwidth, prefetchers etc. The work investigates key ideas proposed by the research community to alleviate resource contention due to these various resources, under a single umbrella. The prime objective of the study is to throw light upon the fact that, alone a single shared component is not a dominant reason for performance degradation in CMPs, rather all elements in the memory hierarchy introduce resource contention thereby affecting performance cumulatively. The work presented would assist novice readers, researchers and academicians to further serve to propose optimal policies to address contention in designing multicore applications, considering the overall impact of these resources on the performance of multicore systems.

show abstract

An Application-Aware Cache Replacement Policy for Last-Level Caches

Cited by 14 publications

References 10 publications

TPPD: Targeted Pseudo Partitioning based Defence for Cross-Core Covert Channel Attacks

TPPD: Targeted Pseudo Partitioning based Defence for Cross-Core Covert Channel Attacks

Near-optimal replacement policies for shared caches in multicore processors

A review on shared resource contention in multicores and its mitigating techniques

Contact Info

Product

Resources

About