TY - JOUR
T1 - An In-Depth Empirical Investigation of State-of-the-Art Scheduling Approaches for Cloud Computing
AU - Ibrahim, Muhammad
AU - Nabi, Said
AU - Baz, Abdullah
AU - Alhakami, Hosam
AU - Summair Raza, Muhammad
AU - Hussain, Altaf
AU - Salah, Khaled
AU - Djemame, Karim
N1 - Funding Information:
This work was supported by the Deanship of Scientific Research at Umm Al-Qura University under Grant 19-COM-1-01-0015.
Funding Information:
The authors would like to thanks the Deanship of Scientific Research at Umm Al-Qura University for supporting this work by Grant code 19-COM-1-01-0015.
Publisher Copyright:
© 2013 IEEE.
PY - 2020
Y1 - 2020
N2 - Recently, Cloud computing has emerged as one of the widely used platforms to provide compute, storage and analytics services to end-users and organizations on a pay-as-you-use basis, with high agility, availability, scalability, and resiliency. This enables individuals and organizations to have access to a large pool of high processing resources without the need for establishing a high-performance computing (HPC) platform. From the past few years, task scheduling in Cloud computing is reckoned as eminent recourse for researchers. However, task scheduling is considered an NP-hard problem. In this research work, we investigate and empirically compare some of the most prominent state-of-the-art scheduling heuristics in terms of Makespan, Average resource utilization (ARUR), Throughput, and Energy consumption. The comparison is then extended by evaluating the approaches in terms of individual VM level load imbalance. After extensive simulation, the comparative analysis has revealed that Task Aware Scheduling Algorithm (TASA) and Proactive Simulation-based Scheduling and Load Balancing (PSSLB) outperformed as compared to the rest of the approaches and seems to be optimal choice keeping in view the trade-of between the complexities involved and the performance achieved concerning Makespan, Throughput, resource utilization, and Energy consumption.
AB - Recently, Cloud computing has emerged as one of the widely used platforms to provide compute, storage and analytics services to end-users and organizations on a pay-as-you-use basis, with high agility, availability, scalability, and resiliency. This enables individuals and organizations to have access to a large pool of high processing resources without the need for establishing a high-performance computing (HPC) platform. From the past few years, task scheduling in Cloud computing is reckoned as eminent recourse for researchers. However, task scheduling is considered an NP-hard problem. In this research work, we investigate and empirically compare some of the most prominent state-of-the-art scheduling heuristics in terms of Makespan, Average resource utilization (ARUR), Throughput, and Energy consumption. The comparison is then extended by evaluating the approaches in terms of individual VM level load imbalance. After extensive simulation, the comparative analysis has revealed that Task Aware Scheduling Algorithm (TASA) and Proactive Simulation-based Scheduling and Load Balancing (PSSLB) outperformed as compared to the rest of the approaches and seems to be optimal choice keeping in view the trade-of between the complexities involved and the performance achieved concerning Makespan, Throughput, resource utilization, and Energy consumption.
KW - Cloud computing
KW - load balancing
KW - load imbalance
KW - performance evaluation
KW - resource allocation
KW - scheduling algorithms
KW - task scheduling
UR - http://www.scopus.com/inward/record.url?scp=85089543005&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2020.3007201
DO - 10.1109/ACCESS.2020.3007201
M3 - Article
AN - SCOPUS:85089543005
SN - 2169-3536
VL - 8
SP - 128282
EP - 128294
JO - IEEE Access
JF - IEEE Access
M1 - 9133407
ER -