QWin: Enforcing Tail Latency SLO at Shared Storage Backend
Liuying Ma, Zhenqing Liu, Jin Xiong, Dejun Jiang

TL;DR
QWin is a dynamic core allocation system that enforces tail latency SLOs in shared storage backends by adaptively partitioning cores based on real-time load, significantly improving tail latency guarantees and bandwidth utilization.
Contribution
It introduces a novel SLO-to-core calculation model and an autonomous core allocation mechanism that adaptively responds to fluctuating storage backend loads.
Findings
QWin guarantees tail latency SLOs for LC tenants.
QWin increases BE tenants' bandwidth by up to 31x.
QWin outperforms existing approaches in tail latency enforcement.
Abstract
Consolidating latency-critical (LC) and best-effort (BE) tenants at storage backend helps to increase resources utilization. Even if tenants use dedicated queues and threads to achieve performance isolation, threads are still contend for CPU cores. Therefore, we argue that it is necessary to partition cores between LC and BE tenants, and meanwhile each core is dedicated to run a thread. Expect for frequently changing bursty load, fluctuated service time at storage backend also drastically changes the need of cores. In order to guarantee tail latency service level objectives (SLOs), the abrupt changing need of cores must be satisfied immediately. Otherwise, tail latency SLO violation happens. Unfortunately, partitioning-based approaches lack the ability to react the changing need of cores, resulting in extreme spikes in latency and SLO violation happens. In this paper, we present QWin, a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Storage Technologies · Cloud Computing and Resource Management · Distributed and Parallel Computing Systems
