To refer to this page use:
|Abstract:||Shared storage services enjoy wide adoption in commer- cial clouds. But most systems today provide weak per- formance isolation and fairness between tenants, if at all. Misbehaving or high-demand tenants can overload the shared service and disrupt other well-behaved tenants, leading to unpredictable performance and violating SLAs. This paper presents Pisces, a system for achieving datacenter-wide per-tenant performance isolation and fair- ness in shared key-value storage. Today’s approaches for multi-tenant resource allocation are based either on per- VM allocations or hard rate limits that assume uniform workloads to achieve high utilization. Pisces achieves per-tenant weighted fair shares (or minimal rates) of the aggregate resources of the shared service, even when dif- ferent tenants’ partitions are co-located and when demand for different partitions is skewed, time-varying, or bot- tlenecked by different server resources. Pisces does so by decomposing the fair sharing problem into a combina- tion of four complementary mechanisms—partition place- ment, weight allocation, replica selection, and weighted fair queuing—that operate on different time-scales and combine to provide system-wide max-min fairness. An evaluation of our Pisces storage prototype achieves nearly ideal (0.99 Min-Max Ratio) weighted fair sharing, strong performance isolation, and robustness to skew and shifts in tenant demand. These properties are achieved with minimal overhead (<3%), even when running at high utilization (more than 400,000 requests/second/server for 10B requests).|
|Citation:||Shue, David, Michael J. Freedman, and Anees Shaikh. "Performance isolation and fairness for multi-tenant cloud storage." In 10th USENIX Symposium on Operating Systems Design and Implementation (2012): pp. 349-362.|
|Pages:||349 - 362|
|Type of Material:||Conference Article|
|Journal/Proceeding Title:||10th USENIX Symposium on Operating Systems Design and Implementation|
|Version:||Final published version. This is an open access article.|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.