skip to main content
poster

BRB: BetteR Batch Scheduling to Reduce Tail Latencies in Cloud Data Stores

Published:17 August 2015Publication History
Skip Abstract Section

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 addressing 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.

References

  1. B. Atikoglu, Y. Xu, E. Frachtenberg, S. Jiang, and M. Paleczny. Workload Analysis of a Large-scale Key-value Store. In SIGMETRICS, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Chowdhury, Y. Zhong, and I. Stoica. Efficient Coflow Scheduling with Varys. In SIGCOMM, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J. Dean and L. A. Barroso. The Tail At Scale. Communications of the ACM, 56(2):74--80, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. D. Shue, M. J. Freedman, and A. Shaikh. Performance Isolation and Fairness for Multi-tenant Cloud Storage. In OSDI, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. L. Suresh, M. Canini, S. Schmid, and A. Feldmann. C3: Cutting Tail Latency in Cloud Data Stores via Adaptive Replica Selection. In NSDI, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. BRB: BetteR Batch Scheduling to Reduce Tail Latencies in Cloud Data Stores

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM SIGCOMM Computer Communication Review
        ACM SIGCOMM Computer Communication Review  Volume 45, Issue 4
        SIGCOMM'15
        October 2015
        659 pages
        ISSN:0146-4833
        DOI:10.1145/2829988
        Issue’s Table of Contents
        • cover image ACM Conferences
          SIGCOMM '15: Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication
          August 2015
          684 pages
          ISBN:9781450335423
          DOI:10.1145/2785956

        Copyright © 2015 Owner/Author

        Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 17 August 2015

        Check for updates

        Qualifiers

        • poster

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader