ROBUS: Fair Cache Allocation for Multi-tenant Data-parallel Workloads

TL;DR

ROBUS introduces a fair cache allocation method for multi-tenant data processing systems, balancing performance improvements with fairness by employing a novel cooperative game theory-based model and randomized algorithms.

Contribution

Develops a novel fairness model incorporating core and envy-freeness for shared cache resources, with a polynomial-time approximation algorithm implemented on Spark.

Findings

Achieves near-optimal speedup while maintaining fairness.

Provides a polynomial-time approximation for the fair cache allocation problem.

Demonstrates effectiveness on industry-standard workloads.

Abstract

Systems for processing big data---e.g., Hadoop, Spark, and massively parallel databases---need to run workloads on behalf of multiple tenants simultaneously. The abundant disk-based storage in these systems is usually complemented by a smaller, but much faster, {\em cache}. Cache is a precious resource: Tenants who get to use cache can see two orders of magnitude performance improvement. Cache is also a limited and hence shared resource: Unlike a resource like a CPU core which can be used by only one tenant at a time, a cached data item can be accessed by multiple tenants at the same time. Cache, therefore, has to be shared by a multi-tenancy-aware policy across tenants, each having a unique set of priorities and workload characteristics. In this paper, we develop cache allocation strategies that speed up the overall workload while being {\em fair} to each tenant. We build a novel fairness model targeted at the shared resource setting that incorporates not only the more standard concepts of Pareto-efficiency and sharing incentive, but also define envy freeness via the notion of {\em core} from cooperative game theory. Our cache management platform, ROBUS, uses randomization over small time batches, and we develop a proportionally fair allocation mechanism that satisfies the core property in expectation. We show that this algorithm and related fair algorithms can be approximated to arbitrary precision in polynomial time. We evaluate these algorithms on a ROBUS prototype implemented on Spark with RDD store used as cache. Our evaluation on a synthetically generated industry-standard workload shows that our algorithms provide a speedup close to performance optimal algorithms while guaranteeing fairness across tenants.