mClock: Handling Throughput Variability for Hypervisor IO Scheduling

USENIX Symposium on Operating Systems Design and Implementation (OSDI), October 2010

  mClock: Handling Throughput Variability for Hypervisor IO Scheduling

19,419 views   |  
(2 votes)
  |     |  
Tags: , , , ,

Abstract

This paper introduces a novel algorithm for IO resource allocation in a hypervisor. Our algorithm, mClock, supports proportional-share fairness subject to minimum reservations and maximum limits on the IO allocations for VMs. We present the design of mClock and a prototype implementation inside the VMware ESX server hypervisor. Our results indicate that these rich QoS controls are quite effective in isolating VM performance and providing better application latency. We also show an adaptation of mClock (called dmClock) for a distributed storage environment, where storage is jointly provided by multiple nodes.

Authors

Ajay Gulati, Arif Merchant, Peter J. Varman

Comments

  1. Fred Peterson says:

    My comment is that the comment field wasn't marked with an asterisk so as to be required :P

Leave a Reply

Your email address will not be published. Required fields are marked *

*

*

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>