PriorityMeister: Tail latency QoS for shared networked storage

Timothy Zhu, Alexey Tumanov, Michael A. Kozuch, Mor Harchol-Balter, Gregory R. Ganger

Research output: Chapter in Book/Report/Conference proceedingConference contribution

76 Citations (SciVal)

Abstract

Meeting service level objectives (SLOs) for tail latency is an important and challenging open problem in cloud computing infrastructures. The challenges are exacerbated by burstiness in the workloads. This paper describes PriorityMeister - a system that employs a combination of per-workload priorities and rate limits to provide tail latency QoS for shared networked storage, even with bursty workloads. PriorityMeister automatically and proactively configures workload priorities and rate limits across multiple stages (e.g., a shared storage stage followed by a shared network stage) to meet end-to-end tail latency SLOs. In real system experiments and under production trace workloads, PriorityMeister outperforms most recent reactive request scheduling approaches, with more workloads satisfying latency SLOs at higher latency percentiles. PriorityMeister is also robust to mis-estimation of underlying storage device performance and contains the effect of misbehaving workloads.

Original languageEnglish (US)
Title of host publicationProceedings of the 5th ACM Symposium on Cloud Computing, SOCC 2014
PublisherAssociation for Computing Machinery
ISBN (Electronic)1595930361, 9781450332521
DOIs
StatePublished - Nov 3 2014
Event5th ACM Symposium on Cloud Computing, SOCC 2014 - Seattle, United States
Duration: Nov 3 2014Nov 5 2014

Publication series

NameProceedings of the 5th ACM Symposium on Cloud Computing, SOCC 2014

Conference

Conference5th ACM Symposium on Cloud Computing, SOCC 2014
Country/TerritoryUnited States
CitySeattle
Period11/3/1411/5/14

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint

Dive into the research topics of 'PriorityMeister: Tail latency QoS for shared networked storage'. Together they form a unique fingerprint.

Cite this