On Non-Preemptive VM Scheduling in the Cloud

07/02/2018
by   Konstantinos Psychas, et al.
0

We study the problem of scheduling VMs (Virtual Machines) in a distributed server platform, motivated by cloud computing applications. The VMs arrive dynamically over time to the system, and require a certain amount of resources (e.g. memory, CPU, etc) for the duration of their service. To avoid costly preemptions, we consider non-preemptive scheduling: Each VM has to be assigned to a server which has enough residual capacity to accommodate it, and once a VM is assigned to a server, its service cannot be disrupted (preempted). Prior approaches to this problem either have high complexity, require synchronization among the servers, or yield queue sizes/delays which are excessively large. We propose a non-preemptive scheduling algorithm that resolves these issues. In general, given an approximation algorithm to Knapsack with approximation ratio r, our scheduling algorithm can provide rβ fraction of the throughput region for β < r. In the special case of a greedy approximation algorithm to Knapsack, we further show that this condition can be relaxed to β<1. The parameters β and r can be tuned to provide a tradeoff between achievable throughput, delay, and computational complexity of the scheduling algorithm. Finally extensive simulation results using both synthetic and real traffic traces are presented to verify the performance of our algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/17/2019

Scheduling Jobs with Random Resource Requirements in Computing Clusters

We consider a natural scheduling problem which arises in many distribute...
research
04/21/2020

Scheduling with Communication Delays via LP Hierarchies and Clustering

We consider the classic problem of scheduling jobs with precedence const...
research
02/11/2018

Stochastic Non-preemptive Co-flow Scheduling with Time-Indexed Relaxation

Co-flows model a modern scheduling setting that is commonly found in a v...
research
04/01/2020

Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints

Motivated by modern parallel computing applications, we consider the pro...
research
09/23/2017

GB-PANDAS: Throughput and heavy-traffic optimality analysis for affinity scheduling

Dynamic affinity scheduling has been an open problem for nearly three de...
research
04/17/2018

Communication-Aware Scheduling of Serial Tasks for Dispersed Computing

There is a growing interest in development of in-network dispersed compu...
research
05/14/2019

QPS-r: A Cost-Effective Crossbar Scheduling Algorithm and Its Stability and Delay Analysis

Parallel iterative maximal matching algorithms (adapted for switching) h...

Please sign up or login with your details

Forgot password? Click here to reset