@inproceedings{19e8acac335b40bda2ebb91963430847,
title = "BRB: BetteR batch scheduling to reduce tail latencies in cloud data stores",
abstract = "A common pattern in the architectures of modern interactive web-services is that of large request fan-outs, where even a single end-user request (task) arriving at an application server triggers tens to thousands of data accesses (sub-tasks) to different stateful backend servers. The overall response time of each task is bottlenecked by the completion time of the slowest sub-task, making such workloads highly sensitive to the tail of latency distribution of the backend tier. The large number of decentralized application servers and skewed workload patterns exacerbate the challenge in ad- dressing this problem. We address these challenges through BetteR Batch (BRB). By carefully scheduling requests in a decentralized and task- Aware manner, BRB enables low-latency distributed storage systems to deliver predictable performance in the presence of large request fan-outs. Our preliminary simulation results based on production workloads show that our proposed design is at the 99th percentile latency within 38% of an ideal system model while offering latency improvements over the state-of-the-art by a factor of 2.",
author = "Waleed Reda and Lalith Suresh and Marco Canini and Sean Braithwaite",
note = "Publisher Copyright: {\textcopyright} 2015 ACM.; ACM Conference on Special Interest Group on Data Communication, SIGCOMM 2015 ; Conference date: 17-08-2015 Through 21-08-2015",
year = "2015",
month = aug,
day = "17",
doi = "10.1145/2785956.2790023",
language = "English (US)",
series = "SIGCOMM 2015 - Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication",
publisher = "Association for Computing Machinery, Inc",
pages = "607--608",
booktitle = "SIGCOMM 2015 - Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication",
}