Random Adaptive Cache Placement Policy
Vrushank Ahire, Pranav Menon, Aniruddh Muley, Abhinandan S. Prasad

TL;DR
This paper introduces RAC, a hybrid cache replacement policy combining random allocation with a modified V-Way design, which adapts to complex access patterns to improve cache utilization and hit rates.
Contribution
The paper proposes a novel hybrid cache replacement algorithm that extends V-Way cache design with dynamic allocation, achieving significant improvements in cache hit rates.
Findings
Cache hit rate up to 80.82%
Improved cache utilization and reduced memory access times
Moderate IPC improvements
Abstract
This paper presents a new hybrid cache replacement algorithm that combines random allocation with a modified V-Way cache implementation. Our RAC adapts to complex cache access patterns and optimizes cache usage by improving the utilization of cache sets, unlike traditional cache policies. The algorithm utilizes a 16-way set-associative cache with 2048 sets, incorporating dynamic allocation and flexible tag management. RAC extends the V-Way cache design and its variants by optimizing tag and data storage for enhanced efficiency. We evaluated the algorithm using the ChampSim simulator with four diverse benchmark traces and observed significant improvements in cache hit rates up to 80.82% hit rate. Although the improvements in the instructions per cycle (IPC) were moderate, our findings emphasize the algorithm's potential to enhance cache utilization and reduce memory access times.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Distributed and Parallel Computing Systems · Optimization and Search Problems
