LAPSE:2023.5091
Published Article

LAPSE:2023.5091
Alts: An Adaptive Load Balanced Task Scheduling Approach for Cloud Computing
February 23, 2023
Abstract
According to the research, many task scheduling approaches have been proposed like GA, ACO, etc., which have improved the performance of the cloud data centers concerning various scheduling parameters. The task scheduling problem is NP-hard, as the key reason is the number of solutions/combinations grows exponentially with the problem size, e.g., the number of tasks and the number of computing resources. Thus, it is always challenging to have complete optimal scheduling of the user tasks. In this research, we proposed an adaptive load-balanced task scheduling (ALTS) approach for cloud computing. The proposed task scheduling algorithm maps all incoming tasks to the available VMs in a load-balanced way to reduce the makespan, maximize resource utilization, and adaptively minimize the SLA violation. The performance of the proposed task scheduling algorithm is evaluated and compared with the state-of-the-art task scheduling ACO, GA, and GAACO approaches concerning average resource utilization (ARUR), Makespan, and SLA violation. The proposed approach has revealed significant improvements concerning the makespan, SLA violation, and resource utilization against the compared approaches.
According to the research, many task scheduling approaches have been proposed like GA, ACO, etc., which have improved the performance of the cloud data centers concerning various scheduling parameters. The task scheduling problem is NP-hard, as the key reason is the number of solutions/combinations grows exponentially with the problem size, e.g., the number of tasks and the number of computing resources. Thus, it is always challenging to have complete optimal scheduling of the user tasks. In this research, we proposed an adaptive load-balanced task scheduling (ALTS) approach for cloud computing. The proposed task scheduling algorithm maps all incoming tasks to the available VMs in a load-balanced way to reduce the makespan, maximize resource utilization, and adaptively minimize the SLA violation. The performance of the proposed task scheduling algorithm is evaluated and compared with the state-of-the-art task scheduling ACO, GA, and GAACO approaches concerning average resource utilization (ARUR), Makespan, and SLA violation. The proposed approach has revealed significant improvements concerning the makespan, SLA violation, and resource utilization against the compared approaches.
Record ID
Keywords
cloud computing, CloudSim, resource utilization, SLA, task scheduling
Subject
Suggested Citation
Mubeen A, Ibrahim M, Bibi N, Baz M, Hamam H, Cheikhrouhou O. Alts: An Adaptive Load Balanced Task Scheduling Approach for Cloud Computing. (2023). LAPSE:2023.5091
Author Affiliations
Mubeen A: Department of Computer Science, Fatima Jinnah Women University, Rawalpindi 46000, Pakistan
Ibrahim M: Department of Information Technology, University of Haripur, Haripur 22621, Pakistan; Big Data Research Center, Jeju National University, Jeju 63243, Korea [ORCID]
Bibi N: Department of Computer Science, Fatima Jinnah Women University, Rawalpindi 46000, Pakistan [ORCID]
Baz M: Department of Computer Engineering, College of Computer and Information Technology, Taif University, P.O. Box. 11099, Taif 21994, Saudi Arabia [ORCID]
Hamam H: Faculty of Engineering, Université de Moncton, Edmundston, NB E1A3E9, Canada; School of Elect. Eng. and Electronic Eng., University of Johannesburg, Auckland Park, Johannesburg 2092, South Africa [ORCID]
Cheikhrouhou O: CES Laboratory, National School of Engineers of Sfax, University of Sfax, Sfax 3038, Tunisia [ORCID]
Ibrahim M: Department of Information Technology, University of Haripur, Haripur 22621, Pakistan; Big Data Research Center, Jeju National University, Jeju 63243, Korea [ORCID]
Bibi N: Department of Computer Science, Fatima Jinnah Women University, Rawalpindi 46000, Pakistan [ORCID]
Baz M: Department of Computer Engineering, College of Computer and Information Technology, Taif University, P.O. Box. 11099, Taif 21994, Saudi Arabia [ORCID]
Hamam H: Faculty of Engineering, Université de Moncton, Edmundston, NB E1A3E9, Canada; School of Elect. Eng. and Electronic Eng., University of Johannesburg, Auckland Park, Johannesburg 2092, South Africa [ORCID]
Cheikhrouhou O: CES Laboratory, National School of Engineers of Sfax, University of Sfax, Sfax 3038, Tunisia [ORCID]
Journal Name
Processes
Volume
9
Issue
9
First Page
1514
Year
2021
Publication Date
2021-08-26
ISSN
2227-9717
Version Comments
Original Submission
Other Meta
PII: pr9091514, Publication Type: Journal Article
Record Map
Published Article

LAPSE:2023.5091
This Record
External Link

https://doi.org/10.3390/pr9091514
Publisher Version
Download
Meta
Record Statistics
Record Views
198
Version History
[v1] (Original Submission)
Feb 23, 2023
Verified by curator on
Feb 23, 2023
This Version Number
v1
Citations
Most Recent
This Version
URL Here
https://psecommunity.org/LAPSE:2023.5091
Record Owner
Auto Uploader for LAPSE
Links to Related Works
