Graduated QoS by Decomposing Bursts: Don't Let the Tail Wag Your Server

The growing popularity of hosted storage services and shared storage infrastructure in data centers is driving the recent interest in resource management and QoS in storage systems. The bursty nature of storage workloads raises significant performance and provisioning challenges, leading to increased resource, management, and energy costs. We present a novel dynamic workload shaping framework to handle bursty workloads, where the arrival stream is dynamically decomposed to isolate its bursts, and then rescheduled to exploit available slack. We show how decomposition reduces the server capacity requirements dramatically while affecting QoS guarantees minimally. We present an optimal decomposition algorithm RTT and a recombination algorithm Miser, and show the benefits of the approach by performance evaluation using several storage traces.

• Type: Conference
• Year: 2009
• Where: ICDCS
• Authors: Lanyue Lu, Peter J. Varman, Kshitij Doshi
• Keywords: Computer Science, ICDCS 2009, Optimal Decomposition Algorithm, Recombination Algorithm Miser, Storage Workloads