Adaptive scheduling for QoS virtual machines under different resource allocation - Performance effects and predictability

4Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Virtual machines have become an important approach to provide performance isolation and performance guarantees (QoS) on cluster servers and on many-core SMP servers. Many-core CPUs are a current trend in CPU design and require jobs to be parallel for exploitation of the performance potential. Very promising for batch job scheduling with virtual machines on both cluster servers and many-core SMP servers is adaptive scheduling which can adjust sizes of parallel jobs to consider different load situations and different resource availability. Then, the resource allocation and resource partitioning can be determined at virtual-machine level and be propagated down to the job sizes. The paper investigates job re-sizing and virtual-machine resizing, and the effects which the efficiency curve of the jobs has on the resulting performance. Additionally, the paper presents a simple, yet effective queuing-model approach for predicting performance under different resource allocation. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Sodan, A. C. (2009). Adaptive scheduling for QoS virtual machines under different resource allocation - Performance effects and predictability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5798 LNCS, pp. 259–279). https://doi.org/10.1007/978-3-642-04633-9_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free