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

Full description

Saved in:
Bibliographic Details
Main Authors: Lanyue Lu, Varman, P., Doshi, K.
Format: Conference Proceeding
Language:English
Subjects:
Bursty
Costs
Delay
Distributed computing
Energy storage
Network servers
Probability distribution
QoS
Resource
Resource management
Scheduling
Tail
USA Councils
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 infrastructure, 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.
ISSN:1063-6927
2575-8411
DOI:10.1109/ICDCS.2009.55