Home > Research > Publications & Outputs > RADL: a resource and deadline‑aware dynamic loa...

Electronic data

  • RADL

    Rights statement: The final publication is available at Springer via http://dx.doi.org/[insert DOI]

    Accepted author manuscript, 3.81 MB, PDF document

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Links

Text available via DOI:

View graph of relations

RADL: a resource and deadline‑aware dynamic load‑balancer for cloud tasks

Research output: Contribution to Journal/MagazineJournal articlepeer-review

E-pub ahead of print
Close
<mark>Journal publication date</mark>31/03/2022
<mark>Journal</mark>Journal of Supercomputing
Number of pages35
Publication StatusE-pub ahead of print
Early online date31/03/22
<mark>Original language</mark>English

Abstract

Cloud service providers acquire the computing resources and allocate them to their clients. To effectively utilize the resources and achieve higher user satisfaction, efficient task scheduling algorithms play a very pivotal role. A number of task scheduling technique have been proposed in the literature. However, majority of these scheduling algorithms fail to achieve efficient resource utilization that causes them to miss tasks deadlines. This is because these algorithms are not resource and deadline-aware. In this research, a Resource and deadline Aware Dynamic Load-balancer (RADL) for Cloud, tasks have been presented. The proposed scheduling scheme evenly distribute the incoming workload of compute-intensive and independent tasks at run-time. In addition, RADL approach has the capability to accommodate the newly arrived tasks (with shorter deadlines) efficiently and reduce task rejection. The proposed scheduler monitors/updates the task and VM status at run-time. Experimental results show that the proposed technique has attained up to 67.74%, 303.57%, 259.2%, 146.13%, 405.06%, and 259.14% improvement for average resource utilization, meeting tasks deadlines, lower makespan, task response time, penalty cost, and task execution cost respectively as compared to the state-of-the-art tasks scheduling heuristics using three benchmark datasets.

Bibliographic note

The final publication is available at Springer via http://dx.doi.org/[insert DOI]