Graduated QoS by Decomposing Bursts: Don't Let the Tail Wag Your Server
Graduated QoS by Decomposing Bursts: Don't Let the Tail Wag Your Server
复制标题
DOI：
10.1109/icdcs.2009.55
复制
发表时间：
2009-06
期刊：
影响因子：
--
通讯作者：
Lanyue Lu;P. Varman;K. Doshi
中科院分区：
文献类型：
--
作者：
Lanyue Lu;P. Varman;K. Doshi
数据中心中托管存储服务和共享存储基础设施的日益普及，推动了最近对存储系统中的资源管理和QoS的兴趣。存储工作负载的突发性带来了巨大的性能和资源调配挑战，导致基础架构、管理和能源成本增加。我们提出了一种新的动态工作负载整形框架来处理突发性工作负载，到达流被动态分解以隔离其突发，然后重新调度以利用可用的松弛。我们展示了如何分解降低服务器的容量需求显着，同时影响QoS保证最低。我们提出了一个最佳的分解算法RTT和一个重组算法Miser，并通过使用几个存储轨迹的性能评估显示该方法的好处。
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.