A global scheduling framework for virtualization environments

Authors:
Yoav Etsion;Tal Ben-Nun;Dror G. Feitelson
Affiliations:
School of Computer Science and Engineering, The Hebrew University of Jerusalem, 91904, Israel;School of Computer Science and Engineering, The Hebrew University of Jerusalem, 91904, Israel;School of Computer Science and Engineering, The Hebrew University of Jerusalem, 91904, Israel
Venue:
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Year:
2009

Citing 0
Cited 3

Design and implementation of a generic resource sharing virtual time dispatcher

Proceedings of the 3rd Annual Haifa Experimental Systems Conference
No justified complaints: on fair sharing of multiple resources

Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
On-line fair allocations based on bottlenecks and global priorities

Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

A premier goal of resource allocators in virtualization environments is to control the relative resource consumption of the different virtual machines, and moreover, to be able to change the relative allocations at will. However, it is not clear what it means to provide a certain fraction of the machine when multiple resources are involved. We suggest that a promising interpretation is to identify the system bottleneck at each instant, and to enforce the desired allocation on that device. This in turn induces an efficient allocation of the other devices.