Effectively Prefetching Remote Memory with Leap
summary
Leap is a Linux kernel patch (tested on 4.4) that implements an online, majority-based prefetching algorithm plus a stripped data path that cuts out generic block/bio overhead for RDMA-backed remote memory. Integrated with InfinitySwap and similar frameworks, it raises page-cache hit rates, reduces median remote-page latency by up to 104.04× and tail latency by 22.62×, and yields up to 10.16× end-to-end application speedups in their experiments.
AI-written summary · about
chapters (10)
- 0:00Introduction to LiP
- 0:41Motivation and challenges
- 3:25Latency overhead analysis
- 7:08LiP design principles
- 11:00Trend detection mechanism
- 15:01Prefetch window management
- 16:20Implementation and setup
- 16:51Performance evaluation
- 19:44Component benefits and outlook
- 21:19Conclusion
related talks
28mPersistent Memory plus RDMA, new age remote device
18mFileMR: Rethinking RDMA Networking for Scalable Persistent Memory
18mSeer: Enabling Future-Aware Online Caching in Networked Systems
19mFineMem: Breaking the Allocation Overhead vs. Memory Waste Dilemma in Fine-Grained...
20mPeRF: Preemption-enabled RDMA Framework
16mA Tale of Two Paths: Toward a Hybrid Data Plane for Efficient Far-Memory Applications
16mPatronus: High-Performance and Protective Remote Memory
16mAchieving Wire-Latency Storage Systems by Exploiting Hardware ACKs
