Journal of the ACM (JACM)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
IEEE/ACM Transactions on Networking (TON)
On the impact of workload burstiness on disk performance
Workload characterization of emerging computer applications
Scheduling for quality of service guarantees via service curves
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Façade: Virtual Storage Devices with Performance Guarantees
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
Long-Range Dependence at the Disk Drive Level
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
pClock: an arrival curve based approach for QoS guarantees in shared storage systems
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Workload decomposition for QoS in hosted storage services
Proceedings of the 3rd workshop on Middleware for service oriented computing
PARDA: proportional allocation of resources for distributed storage access
FAST '09 Proccedings of the 7th conference on File and storage technologies
Graduated QoS by Decomposing Bursts: Don't Let the Tail Wag Your Server
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Everest: scaling down peak loads through I/O off-loading
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
mClock: handling throughput variability for hypervisor IO scheduling
OSDI'10 Proceedings of the 9th USENIX conference on Operating systems design and implementation
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
DMVL: An I/O bandwidth dynamic allocation method for virtual networks
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Cloud-based storage and computing are growing in popularity due to economies of using a centralized infrastructure that can be leased at low cost. The increased use of virtual-machine-based server consolidation in such data centers introduces new challenges for resource management, capacity provisioning, and guaranteeing application performance. The bursty nature of workloads means that the peak capacity required to handle short-duration bursts may be an order of magnitude or more than the long-term average requirement. Providing capacity based on the peak rate can result in significant over-provisioning and low utilization, leading to higher infrastructure and energy costs. In this paper we present an efficient method for multiplexing multiple concurrent bursty workloads on a shared storage server. Such a situation is common in Virtual Machine (VM) environments where the hypervisor needs to dynamically allocate IO bandwidth among multiple VMs sharing a SAN array. We consider the problem of dynamically scheduling the IO among competing VMs to meet QoS requirements. Our solution employs two strategies together: systematically decomposing bursts to provide each workload with a graduated Quality of Service (QoS) and flexibly scheduling the decomposed portions of all the workloads.