scispace - formally typeset
Open AccessProceedings ArticleDOI

Performance isolation and fairness for multi-tenant cloud storage

Reads0
Chats0
TLDR
Pisces achieves per-tenant weighted fair shares of the aggregate resources of the shared service, even when different tenants' partitions are co-located and when demand for different partitions is skewed, time-varying, or bottlenecked by different server resources.
Abstract
Shared storage services enjoy wide adoption in commercial clouds. But most systems today provide weak performance 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 fairness 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 different tenants' partitions are co-located and when demand for different partitions is skewed, time-varying, or bottlenecked by different server resources. Pisces does so by decomposing the fair sharing problem into a combination of four complementary mechanisms--partition placement, 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 (

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Network Slicing in 5G: Survey and Challenges

TL;DR: The state of the art in 5G network slicing is reviewed and a framework for bringing together and discussing existing work in a holistic manner is presented, to evaluate the maturity of current proposals and identify a number of open research questions.
Proceedings ArticleDOI

Sparrow: distributed, low latency scheduling

TL;DR: It is demonstrated that a decentralized, randomized sampling approach provides near-optimal performance while avoiding the throughput and availability limitations of a centralized design.
Journal ArticleDOI

Managing Performance Overhead of Virtual Machines in Cloud Computing: A Survey, State of the Art, and Future Directions

TL;DR: The causes of VM performance overhead are unveiled by illustrating representative scenarios, the performance modeling methods with a particular focus on their accuracy and cost are discussed, and the overhead mitigation techniques are compared by identifying their effectiveness and implementation complexity.
Journal ArticleDOI

A Game-Theoretical Approach for User Allocation in Edge Computing Environment

TL;DR: This work proposes EUAGame, a game-theoretic approach that formulates the EUA problem as a potential game and designs a novel decentralized algorithm for finding a Nash equilibrium in the game as a solution to theEUA problem.
Proceedings ArticleDOI

Reconciling high server utilization and sub-millisecond quality-of-service

TL;DR: It is demonstrated that some latency-critical workloads can be aggressively co-located with other workloads, achieve good QoS, and that such co-location can improve a datacenter's effective throughput per TCO-$ by up to 52%.
References
More filters
Journal ArticleDOI

A scalable, commodity data center network architecture

TL;DR: This paper shows how to leverage largely commodity Ethernet switches to support the full aggregate bandwidth of clusters consisting of tens of thousands of elements and argues that appropriately architected and interconnected commodity switches may deliver more performance at less cost than available from today's higher-end solutions.
Proceedings ArticleDOI

Benchmarking cloud serving systems with YCSB

TL;DR: This work presents the "Yahoo! Cloud Serving Benchmark" (YCSB) framework, with the goal of facilitating performance comparisons of the new generation of cloud data serving systems, and defines a core set of benchmarks and reports results for four widely used systems.
Proceedings ArticleDOI

Improving MapReduce performance in heterogeneous environments

TL;DR: A new scheduling algorithm, Longest Approximate Time to End (LATE), that is highly robust to heterogeneity and can improve Hadoop response times by a factor of 2 in clusters of 200 virtual machines on EC2.
Proceedings ArticleDOI

Mesos: a platform for fine-grained resource sharing in the data center

TL;DR: The results show that Mesos can achieve near-optimal data locality when sharing the cluster among diverse frameworks, can scale to 50,000 (emulated) nodes, and is resilient to failures.
Journal ArticleDOI

A tutorial on decomposition methods for network utility maximization

TL;DR: This tutorial paper first reviews the basics of convexity, Lagrange duality, distributed subgradient method, Jacobi and Gauss-Seidel iterations, and implication of different time scales of variable updates, and introduces primal, dual, indirect, partial, and hierarchical decompositions, focusing on network utility maximization problem formulations.
Related Papers (5)