Deadline aware virtual machine scheduler for scientific grids and cloud computing

TL;DR

This paper introduces a deadline-aware scheduling algorithm for virtual machines in scientific grids and clouds, aiming to meet job deadlines despite virtualization-induced performance penalties.

Contribution

It presents a novel real-time responsive algorithm that dynamically optimizes job scheduling to ensure deadline compliance in virtualized HPC environments.

Findings

Improved job deadline adherence in virtualized environments.

Enhanced hardware resource utilization.

Effective response to job execution delays.

Abstract

Virtualization technology has enabled applications to be decoupled from the underlying hardware providing the benefits of portability, better control over execution environment and isolation. It has been widely adopted in scientific grids and commercial clouds. Since virtualization, despite its benefits incurs a performance penalty, which could be significant for systems dealing with uncertainty such as High Performance Computing (HPC) applications where jobs have tight deadlines and have dependencies on other jobs before they could run. The major obstacle lies in bridging the gap between performance requirements of a job and performance offered by the virtualization technology if the jobs were to be executed in virtual machines. In this paper, we present a novel approach to optimize job deadlines when run in virtual machines by developing a deadline-aware algorithm that responds to job execution delays in real time, and dynamically optimizes jobs to meet their deadline obligations. Our approaches borrowed concepts both from signal processing and statistical techniques, and their comparative performance results are presented later in the paper including the impact on utilization rate of the hardware resources.