Answers are grounded in this paper and cite their sources.
While the operating system (OS) page swapping mechanism enables memory oversubscription, memory-intensive workloads suffer significant performance degradation when the main memory cannot accommodate their entire working sets. This is primarily caused by the performance gap between main memory and backing storage. To hide the swapping overhead, prefetching techniques predict future data accesses and proactively load necessary contents from slower backing storage into the main memory. However, existing OS prefetching algorithms rely on predefined rules to analyze page access patterns, which are not adaptive to changing workloads and fail to align prefetching policies with system status. In this paper, we introduce Merlin , an adaptive, fully automated, and application-transparent page prefetching scheme that employs reinforcement learning (RL) to make intelligent prefetch decisions. We formalize the prefetcher as an RL agent, which extracts critical features from the swap request and system environment to continuously make prefetch decisions. For each prefetch decision, Merlin receives a numerical reward or penalty based on the current system status and prefetch-hit. Merlin learns towards getting higher rewards to make more timely, accurate, and system-aware prefetch decisions. Through extensive evaluation, Merlin achieves up to \(98\% \) prefetching accuracy with less than 20KB metadata overhead, requiring no code modifications to workloads. Compared to Linux’s default prefetcher, it delivers up to 2.7 × speedup in overall execution time on microbenchmarks and up to 1.5 × on real-world workloads.
No takes yet. Share an insight, caveat, or question.
Liu et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: