• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Stout: An Adaptive Interface to Scalable Cloud Storage

Cached

  • Download as a PDF

Download Links

  • [www.usenix.org]
  • [www.research.microsoft.com]
  • [research.microsoft.com]
  • [www.usenix.org]
  • [www.usenix.org]
  • [www.usenix.org]
  • [www.microsoft.com]
  • [www.cse.ucsd.edu]
  • [www.cs.ucsd.edu]
  • [cseweb.ucsd.edu]
  • [cseweb.ucsd.edu]
  • [cseweb.ucsd.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by John C. Mccullough , John Dunagan , Alec Wolman , Alex C. Snoeren
Citations:16 - 0 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Mccullough_stout:an,
    author = {John C. Mccullough and John Dunagan and Alec Wolman and Alex C. Snoeren},
    title = {Stout: An Adaptive Interface to Scalable Cloud Storage},
    year = {}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Many of today’s applications are delivered as scalable, multi-tier services deployed in large data centers. These services frequently leverage shared, scale-out, key-value storage layers that can deliver low latency under light workloads, but may exhibit significant queuing delay and even dropped requests under high load. Stout is a system that helps these applications adapt to variation in storage-layer performance by treating scalable key-value storage as a shared resource requiring congestion control. Under light workloads, applications using Stout send requests to the store immediately, minimizing delay. Under heavy workloads, Stout automatically batches the application’s requests together before sending them to the store, resulting in higher throughput and preventing queuing delay. We show experimentally that Stout’s adaptation algorithm converges to an appropriate batch size for workloads that require the batch size to vary by over two orders of magnitude. Compared to a non-adaptive strategy optimized for throughput, Stout delivers over 34 × lower latency under light workloads; compared to a non-adaptive strategy optimized for latency, Stout can scale to over 3 × as many requests. 1.

Keyphrases

adaptive interface    scalable cloud storage    light workload    non-adaptive strategy    appropriate batch size    scalable key-value storage    many request    heavy workload    storage-layer performance    low latency    today application    high load    key-value storage layer    congestion control    batch size    stout send request    multi-tier service    adaptation algorithm converges    large data center   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University