Lightweight Framework for Reliable Job Scheduling in Heterogeneous Clouds

Abdulazeez, Muhammed, Garncarek, Pawel and Wong, Prudence WH ORCID: 0000-0001-7935-7245
(2017) Lightweight Framework for Reliable Job Scheduling in Heterogeneous Clouds. In: 2017 26th International Conference on Computer Communication and Networks (ICCCN), 2017-7-31 - 2017-8-3.

[img] Text
main.pdf - Author Accepted Manuscript
Access to this file is embargoed until Unspecified.

Download (215kB)


It is crucial to ensure reliability, security and stability of cloud services without sacrificing too much resources in the area of workload management in clouds. The paper evaluates and compares lightweight decentralized algorithms for scheduling a workload part of which could be unreliable, in the context of heterogeneous cloud data centers. This unreliability could be caused by various types of failures or attacks. The framework for robust workload scheduling efficiently combines classic fault tolerant and security tools, such as packet/job scanning, with workload scheduling, and it does not use any heavy resource consuming tools, e.g., cryptography or non-linear optimization. More specifically, the framework uses a novel objective function to allocate jobs to servers and constantly decides which job to scan based on a formula associated with the objective function. In previous work it was shown how to set up the objective function and the corresponding scanning procedure of the central job scheduler to make the system provably stable, provided a specific capacity condition is satisfied. As a result, it was shown that the framework assures cloud stability even though naive scanning-all and scanning-none strategies are not stable for both centralized and decentralized scheduling in homogeneous data centers. In this work we extend the work to heterogeneous data centers, for which we show that decentralized algorithms based on Join Shortest Queue and Join Shortest Work policies are stable for every workload within the system capacity, while the algorithms based on popular Power of Two Choices, Round Robin and Uniform Random policies are not stable for a substantial amount of workloads even within the system capacity.

Item Type: Conference or Workshop Item (Unspecified)
Depositing User: Symplectic Admin
Date Deposited: 18 May 2017 12:30
Last Modified: 19 Jan 2023 07:04
DOI: 10.1109/icccn.2017.8038506
Related URLs: