Dynamic Non-Decaying ABRIP for Shared Level 3 Cache Memory Systems

Authors : Nirmol Munvar, Shoba Gopalakrishnan, Arati Phadke

Volume/Issue : Volume 4 - 2019, Issue 10 - October

Google Scholar : https://goo.gl/DF9R4u

Scribd : https://bit.ly/2P7R6BR

When all blocks are occupied inside a cache of a processor, the system uses a concept known as ‘Replacement policy’ to evict an existing block inside the cache memory to bring the required block from the main memory. There are many replacement policies applied to caches which itself have many levels. The policy ‘Application Behavior Aware Re-Reference Interval Prediction’ is an extension of existing policy of ‘Re-Reference Interval Prediction.’ The ABRIP policy has two levels of RRPV, implemented in two levels as we will see further. However, the ABRIP policy’s algorithm waits until all the cache blocks have max RRPV value hence ‘decaying’ the cache blocks. Proposed method intends to correct the decaying phenomenon by implementing Dynamic Non-decaying ABRIP or DND- ABRIP. Gem5 simulator was used in system emulation mode with SPEC2006 Benchmarks. We see a 0.1% improvement in IPC, 1.4% improvement in Read hits and 0.3% improvement in Write Hits for DND-ABRIP over ABRIP.

Keywords : Replacement Policy, Re-Reference Interval Prediction, Application Behavioral Re-Reference Interval Prediction, decaying, Dynamic Non-decaying ABRIP.


Paper Submission Last Date
31 - May - 2022

Paper Review Notification
In 1-2 Days

Paper Publishing
In 2-3 Days

Never miss an update from Papermashup

Get notified about the latest tutorials and downloads.

Subscribe by Email

Get alerts directly into your inbox after each post and stay updated.

Subscribe by RSS

Add our RSS to your feedreader to get regular updates from us.