CFP last date
20 May 2024
Reseach Article

WARP: Workload Nature Adaptive Replacement Policy

by Balaji S, Gautham Shankar R, Arvind Krishna P
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 70 - Number 7
Year of Publication: 2013
Authors: Balaji S, Gautham Shankar R, Arvind Krishna P
10.5120/11978-7849

Balaji S, Gautham Shankar R, Arvind Krishna P . WARP: Workload Nature Adaptive Replacement Policy. International Journal of Computer Applications. 70, 7 ( May 2013), 35-38. DOI=10.5120/11978-7849

@article{ 10.5120/11978-7849,
author = { Balaji S, Gautham Shankar R, Arvind Krishna P },
title = { WARP: Workload Nature Adaptive Replacement Policy },
journal = { International Journal of Computer Applications },
issue_date = { May 2013 },
volume = { 70 },
number = { 7 },
month = { May },
year = { 2013 },
issn = { 0975-8887 },
pages = { 35-38 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume70/number7/11978-7849/ },
doi = { 10.5120/11978-7849 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:32:17.945935+05:30
%A Balaji S
%A Gautham Shankar R
%A Arvind Krishna P
%T WARP: Workload Nature Adaptive Replacement Policy
%J International Journal of Computer Applications
%@ 0975-8887
%V 70
%N 7
%P 35-38
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In the present universal scenario where the dependence on heterogeneous multi-core processors is tremendous, dealing with algorithms focusing on coherence between shared caches is imperative. WARP redesigns the replacement policy in the last level cache. In this policy, the shared (clean) lines and the private exclusive line are given the first two priorities dynamically followed by private modified and shared lines. By this method a set of victims are presented over which any replacement policy can be chosen to select a viable victim. Implementing the same, a significant performance improvement is observed with the last level shared cache. This performance improvement was solely from the policy implemented on the last level cache and not from any other parameters.

References
  1. A. Jaleel et al, "High Performance Cache Replacement using Re-reference Interval Prediction (RRIP)", in ISCA 2010, pp. 60-71.
  2. Moinuddin K. Qureshi et al, "Set-Dueling-Controlled Adaptive Insertion For High-Performance Caching" in MICRO IEEE 2008.
  3. Biswabandan Panda, Shankar Balachandran, "CSHARP - Coherence and SHaring Awareness Replacement Policies for Parallel Applications", in Proceedings of 24th IEEE International Symposium on Computer Architecture and High Performance Computing, New York, 2012.
  4. N. Binkert et al, "The gem5 simulator", SIGARCH Comput. Archit. News, Aug 2011.
  5. M. Gebhart et al, "Running PARSEC 2. 1 on M5", The University of Texas at Austin, Department of Computer Science, Technical Report #TR-09-32, October 2009.
  6. C. Bienia et al, "The PARSEC Benchmark Suite: Characterization and Architectural Implications" in PACT 2008.
  7. Major Bhadauria et al, "Understanding PARSEC Performance on Contemporary CMPs".
  8. Y. Chen, et al, "Efficient Shared Cache Management through Sharing-Aware Replacement and Streaming-Aware Insertion Policy", in IPDPS 2009, pp. 1-8.
  9. A. Jaleel et al, "Adaptive Insertion Policies for Managing Shared Caches", in PACT 2008.
  10. L. A. Belady, "A study of replacement algorithms for virtual storage computers", in IBM Systems Journal 1966, pp. 78-101.
Index Terms

Computer Science
Information Sciences

Keywords

Last level Shared cache Replacement algorithm Set dueling