Tidying Up the Address Space
Vinay Banakar, Suli Yang, Kan Wu, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, Kimberly Keeton

TL;DR
This paper presents address-space engineering, a method to reorganize virtual address spaces dynamically, enabling more effective memory tiering and reclamation, leading to significant memory savings with minimal performance impact.
Contribution
It introduces a novel approach to reorganize application address spaces to improve memory tiering efficiency, demonstrated through a compiler-runtime system called HADES.
Findings
Achieves up to 70% memory reduction
Maintains only 3% performance overhead
Enables existing reclamation systems to reclaim memory more effectively
Abstract
Memory tiering in datacenters does not achieve its full potential due to hotness fragmentation -- the intermingling of hot and cold objects within memory pages. This fragmentation prevents page-based reclamation systems from distinguishing truly hot pages from pages containing mostly cold objects, fundamentally limiting memory efficiency despite highly skewed accesses. We introduce address-space engineering: dynamically reorganizing application virtual address spaces to create uniformly hot and cold regions that any page-level tiering backend can manage effectively. HADES demonstrates this frontend/backend approach through a compiler-runtime system that tracks and migrates objects based on access patterns, requiring minimal developer intervention. Evaluations across ten data structures achieve up to 70% memory reduction with 3% performance overhead, showing that address space…
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.
