Skip to content
Book Open access

RDPart: A reuse-based OS-level cache-partitioning policy for fairness optimization in cloud data centers

Sep 2026 · Proceedings of the International Conference on Parallel Processing · 1 citation · 33 references

TL;DR

RDPart is proposed, an OS-level Reuse-Driven LLC Partitioning policy designed to improve fairness while preserving the QoS of cloud workloads, and adopts a black-box design, making it well-suited for public cloud environments where real-time QoS feedback from applications is unavailable.

Abstract

In cloud data centers, the colocation of multiple services and applications on the same physical server is crucial for maximizing resource utilization and reducing utility costs. Unfortunately, contention for shared resources across cores, such as the Last-Level Cache (LLC), may lead to severe interference among applications. This complicates quality-of-service (QoS) enforcement and causes performance disparities among applications, ultimately degrading user experience and system fairness. To address these issues, this paper proposes RDPart, an OS-level Reuse-Driven LLC Partitioning policy designed to improve fairness while preserving the QoS of cloud workloads. In contrast to existing fair LLC-partitioning techniques, RDPart eliminates the need for online performance profiling under varying LLC allocations, thereby avoiding undesired QoS violations typically stemming from such invasive exploratory approaches. Furthermore, RDPart adopts a black-box design, making it well-suited for public cloud environments where real-time QoS feedback from applications is unavailable. We implement RDPart in the Linux kernel and evaluate its effectiveness across a diverse set of workloads, including cloud services and HPC/scientific applications. The results reveal that RDPart achieves a 32.1% average fairness improvement with respect to a state-of-the-art black-box cache-partitioning proposal, while keeping QoS violations consistently low across workloads.

Read PDF

Similar papers

Preprint Aug 2026

Beyond the Limits: Flexible and Congestion-Aware Cluster Scheduling for the Cloud

The results show that soft SLO limits reduce corrective rescheduling actions by 49% compared to hard-limit approaches while maintaining acceptable performance guarantees, and resource-aware scheduling decreases node-level congestion and further mitigates SLO violations, demonstrating the effectiveness of incorporating...

Oliver Larsson, Thijs Metsch, Cristian Klein et al. · 0 citations

FairCache: Demystifying Cache-Induced Unfairness in Multi-Tenant Large Language Model Serving

Large language models (LLMs) increasingly rely on context caching to enhance serving efficiency. However, this optimization inadvertently compromises fairness in multi-tenant LLM serving systems. Existing fair schedulers, which account only for compute resources, are unable to handle the multi-dimensional resource dema...

Zhuo-Yan Bai, Bin Gao, Fei Xu et al. · 0 citations
Open access Sep 2026

EASE: Resource-aware Query Scheduling across Heterogeneous Cloud Compute Services

Modern cloud platforms provide diverse compute services, including virtual machines, Function-as-a-Service, and Query-as-a-Service, each offering unique trade-offs in performance, elasticity, and cost. While these services collectively cover the diverse needs of OLAP workloads, existing systems typically rely on a sing...

Wen-Bo Li, Hao-Qiong Bian, Chao Zhang et al. · 0 citations
Open access Sep 2026

Asymmetric virtual machine replacement: a multi-objective optimization approach for energy efficiency in cloud data centers

In cloud data centers, resource overcommitment is a key strategy for improving energy efficiency, yet managing it to prevent Service Level Agreement (SLA) violations remains a persistent challenge. Virtual machine replacement (VMrP)—the periodic redistribution of running VMs across servers—is central to this ongoing ma...

Hyeongbin Kang, Hyeon-Jin Yu, Heeju Kang et al. · 0 citations
#machine learning Preprint Sep 2026

Token Latency Fairness: Performance Isolation for Multi-Tenant LLM Serving

FairInference provides the novelelta-token fairness guarantee: for a well-behaved client, if a token is generated in d time units in isolation, it will be generated within d + {\delta} time units in multi-tenant execution, providing strong latency isolation guarantees for LLM serving.

Dev Bali, Soujanya Ponnapalli, Yi-Chu Wang et al. · 0 citations
Preprint Sep 2026

Gutenberg: Taming Latency-Critical Cloud Services with Near-Data-Processing

Gutenberg, a CPU+NDP for mutable, latency-critical cloud services, outperforms prior systems, reducing average and p99 latency by up to 80.4% and 85.8% and improves isolation and fairness while adapting to changing workload behaviors.

Qi Lin, Phillip B. Gibbons, Jovan Stojkovic et al. · 0 citations

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