Skip to content
Conference

FATE: Fairness-Aware Memory Allocation for Multi-Tenant Tiered Memory Environments

Jul 2026 · IEEE International Conference on Cloud Computing · pp. 315-326 · 0 citations · 36 references

Abstract

Tiered memory environments that combine DRAM and CXL provide substantial scalability in modern systems, yet they introduce critical fairness challenges for containerized workloads. Existing Linux kernel memory management primarily relies on access-frequency-based page promotion and demotion to optimize system-wide performance. This approach causes two severe problems: (1) flaws in the current Cgroups memory-limit implementation can trigger infinite page reclamation loops in tiered memory systems, and (2) memory-intensive workloads monopolize fast-tier memory (e.g., DRAM), leading to the noisy neighbor problem in which tier occupancy becomes highly unfair even when containers have identical memory limits. This paper resolves the infinite page reclamation loop problem and proposes FATE, a fairness-aware memory allocation for multi-tenant tiered memory environments. FATE extends the Linux Cgroups memory controller to enforce per-tier high-watermark thresholds that are dynamically proportional to the share of total memory allocated to each container. For workloads requiring deterministic performance, FATE also supports configurable static fast-tier reservations. To enable precise enforcement, we introduce a tier-aware page counter that tracks per-NUMA-node, per-tier usage during allocation, migration, and reclamation. By strictly respecting fast-tier thresholds, FATE eliminates infinite reclamation loops and prevents unnecessary OOM killer invocation. Evaluation with diverse workloads in multi-container environments shows that FATE consistently achieves fair tiered memory allocation across containers with negligible runtime overhead. When occupancy ratios were quantified using Jain’s Fairness Index, FATE improved fairness by 7.3% to 31.7% over the baseline. More importantly, FATE significantly enhances performance predictability—a critical requirement for cloud service-level objectives—by providing strict isolation across memory tiers.

View source

Similar papers

Preprint Jul 2026

MemExchange: Utility-Driven Distributed Memory Reallocation for Multi-Tenant Datacenters

Results show up to 2.3x lower remote-access overhead compared to TCP-based designs, a 13% increase in cluster-wide memory utilization at rack scale, and up to 63% reduction in miss rate for memory-constrained tenants under skewed workloads.

AmirHossein Seyri, Abhisek Pan, Balajee Vamanan · 0 citations
Conference Jul 2026

Ditto: Online Memory Rightsizing and Value-Aware Eviction for Reducing Cold Starts in Serverless Platforms

Modern serverless platforms create function instances based on user-specified memory limits, which often result in memory over-provisioning even when the average runtime footprint is small. This over-provisioning reduces warm container density under a fixed memory budget, leading to early pool saturation, frequent evic...

Dongjae Lee, Kyuli Park, Yeonwoo Jeong et al. · 0 citations
Book Open access Aug 2026

DynamoServe: A Distributed Tiered Memory System for Multi-tenant LLM Serving

DynamoServe is presented, a multi-tenant LLM serving framework that addresses challenges through three key innovations: leveraging stranded GPU memory to offload model weights and KV caches, mitigating resource fragmentation in multi-workload environments, and improving memory locality through coordinated data placemen...

Diman Zad Tootaghaj, Khaled Diab, Bob Lantz et al. · 0 citations
Conference 2026

BRUMM: A Case for Predictable Memory Reclamation

Bounded Reclamation of User-space Memory Mappings makes reclamation latency a first-class resource that can be accounted for, thereby improving isolation and reliability in edge clouds.

Viktor Reusch, Michael Roitzsch, Horst Schirmeier · 0 citations
Open access Aug 2026

GUMPIM: Unitary and Malleable Memory for Processing-in-Memory with Guaranteed PIM Pages

DRAM-based Processing-in-Memory (PIM) addresses the “memory wall” by executing computations directly inside main memory. However, memory interleaving and virtual memory limit contiguous data size visible to PIM units, constraining PIM task granularity. Fine-grained PIM tasks incur significant offloading overhead that n...

Yilong Zhao, Fangxin Liu, Yiwei Hu et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.