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

Standard

RADL: a resource and deadline‑aware dynamic load‑balancer for cloud tasks. / Nabi, Said; Aleem, Muhammad; Ahmed, Masroor et al.
In: Journal of Supercomputing, 31.03.2022.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

APA

Nabi, S., Aleem, M., Ahmed, M., Islam, M. A., & Iqbal, M. A. (2022). RADL: a resource and deadline‑aware dynamic load‑balancer for cloud tasks. Journal of Supercomputing. Advance online publication. https://doi.org/10.1007/s11227-022-04426-2

Vancouver

Nabi S, Aleem M, Ahmed M, Islam MA, Iqbal MA. RADL: a resource and deadline‑aware dynamic load‑balancer for cloud tasks. Journal of Supercomputing. 2022 Mar 31. Epub 2022 Mar 31. doi: 10.1007/s11227-022-04426-2

Author

Nabi, Said ; Aleem, Muhammad ; Ahmed, Masroor et al. / RADL: a resource and deadline‑aware dynamic load‑balancer for cloud tasks. In: Journal of Supercomputing. 2022.

Bibtex

@article{4fc6bd247e584b939776c6d67f566d9c,
title = "RADL: a resource and deadline‑aware dynamic load‑balancer for cloud tasks",
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.",
keywords = "Cloud · Task scheduling · Dynamic · Resource utilization · Deadline · heuristic · Resource-aware · Cost",
author = "Said Nabi and Muhammad Aleem and Masroor Ahmed and Islam, {Muhammad Arshad} and Iqbal, {Muhammad Azhar}",
note = "The final publication is available at Springer via http://dx.doi.org/[insert DOI]",
year = "2022",
month = mar,
day = "31",
doi = "10.1007/s11227-022-04426-2",
language = "English",
journal = "Journal of Supercomputing",
issn = "0920-8542",
publisher = "Springer Netherlands",

}

RIS

TY - JOUR

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

AU - Nabi, Said

AU - Aleem, Muhammad

AU - Ahmed, Masroor

AU - Islam, Muhammad Arshad

AU - Iqbal, Muhammad Azhar

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

PY - 2022/3/31

Y1 - 2022/3/31

N2 - 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.

AB - 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.

KW - Cloud · Task scheduling · Dynamic · Resource utilization · Deadline · heuristic · Resource-aware · Cost

U2 - 10.1007/s11227-022-04426-2

DO - 10.1007/s11227-022-04426-2

M3 - Journal article

JO - Journal of Supercomputing

JF - Journal of Supercomputing

SN - 0920-8542

ER -