PriorityMeister: Tail latency QoS for shared networked storage
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.
Files
-
Metadata
Work Title PriorityMeister: Tail latency QoS for shared networked storage Access Creators - Timothy Zhu
- Alexey Tumanov
- Michael A. Kozuch
- Mor Harchol-Balter
- Gregory R. Ganger
License In Copyright (Rights Reserved) Work Type Conference Proceeding Publication Date November 3, 2014 Publisher Identifier (DOI) - https://doi.org/10.1145/2670979.2671008
Source - SOCC '14: Proceedings of the ACM Symposium on Cloud Computing
Deposited August 03, 2023 Versions
Analytics
Collections
This resource is currently not in any collection.
Work History
Version 1
published-
Created
-
Added
PriorityMeister.pdf -
Added Creator Timothy Zhu
-
Added Creator Alexey Tumanov
-
Added Creator Michael A. Kozuch
-
Added Creator Mor Harchol-Balter
-
Added Creator Gregory R. Ganger
-
Published
-
Updated Source Show ChangesSource
- SOCC '14: Proceedings of the ACM Symposium on Cloud Computing
-
Updated