Enhanced Prefetching via Dynamic Multi-Step SARSA based Reinforcement Learning
Cache prefetchers are essential for system performance, and reinforcement learning (RL) offers a lightweight alternative to heavy machine learning techniques for modern prefetchers. While previous work used 1-step SARSA-based RL for cache prefetching, it can struggle with complex memory access patterns. This study proposes using n-step SARSA instead of 1-step to capture broader contextual learning. We incorporate a dynamic property to reduce the use of outdated Q-values, guiding the RL agent to improve prefetching effectiveness. Our approach achieves approximately 12% better performance than non-RLbased prefetchers in multi-core setups and also outperforms previous RL-based prefetcher.
Authors
- Dip Sankar Banerjee (ORCID: https://orcid.org/0000-0002-0476-1224)
- Sheel Sindhu Manohar (ORCID: https://orcid.org/0000-0001-7490-6209)
- Palash Das (ORCID: https://orcid.org/0000-0002-1979-0298)
- Aman Goyal (ORCID: https://orcid.org/0000-0001-8062-5657)
- Sabuzima Nayak (ORCID: https://orcid.org/0000-0001-7572-1054)
Institutions
- Indian Institute of Technology Jodhpur (IN)
- Shiv Nadar University (IN)
Publication Details
- Journal
- IEEE Embedded Systems Letters
- Published
- 2025-01-01
- DOI
- https://doi.org/10.1109/les.2025.3574850
- Primary Topic
- Cooperative Communication and Network Coding
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Science and Engineering Research Board