Lightweight Robust Framework for Workload Scheduling in Clouds

Abdulazeez, Muhammed, Garncarek, Pawel, Kowalski, Dariusz R ORCID: 0000-0002-1316-7788 and Wong, Prudence WH ORCID: 0000-0001-7935-7245
(2017) Lightweight Robust Framework for Workload Scheduling in Clouds. In: 2017 IEEE International Conference on Edge Computing (EDGE), 2017-6-25 - 2017-6-30.

This is the latest version of this item.

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

Download (202kB)


Reliability, security and stability of cloud services without sacrificing too much resources have become a desired feature in the area of workload management in clouds. The paper proposes and evaluates a lightweight framework for scheduling a workload which part could be unreliable. This unreliability could be caused by various types of failures or attacks. Our 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. We show how to set up the objective function and the corresponding scanning procedure to make the system provably stable, provided it satisfies a specific stability condition. As a result, we show that our framework assures cloud stability even if naive scanning-all and scanning-none strategies are not stable. We extend the framework to decentralized scheduling and evaluate it under several popular routing procedures.

Item Type: Conference or Workshop Item (Unspecified)
Uncontrolled Keywords: cs.DC, cs.DC
Depositing User: Symplectic Admin
Date Deposited: 18 May 2017 12:13
Last Modified: 19 Jan 2023 07:04
DOI: 10.1109/IEEE.EDGE.2017.36
Related URLs:

Available Versions of this Item