AAWAS: An Application and Workload-Aware Scheduling Technique for Efficient Task Allocation in Cloud Computing Environments

One interesting aspect of distributed systems is cloud computing. It offers its services on an as-needed, pay-per-use basis. Research challenges in cloud computing include the scheduling and balance of tasks. Scheduling tasks entails assigning them to available resources (Virtual Machines), whereas load balancing is spreading out the work over multiple available resources. We offer a job scheduling technique that takes into account anticipated demands on compute nodes. We begin by investigating the reasons for the disparity in workloads and the viability of redistributing computing resources. All of the complex simulations are run in clouds. The process consisted of two distinct parts. The simulation begins with a randomly generated workload. Second, we combine the workload prediction model with an application and workload-aware scheduling algorithm (AAWAS) [14]. We present a parallel job scheduling approach using computational node workload prediction AAWAS to simplify the AAWAS algorithm. Experimental results reveal that AAWA is superior to other algorithms in terms of minimizing makespan and optimizing resource utilization, and the proposed method is compared to FCFS, SJF, Min-Min, and EDF. To make Task scheduling in compute clouds faces various challenges due to the highly dynamic environment, such as availability, access policies, security, and reliability of computing resources. Furthermore, the collaborative nature of cloud computing projects on the internet adds complexity to task scheduling. From simulation results, it is evident that our proposed scheduler AAWAS outperforms A2C, DQN, and PPO across the board by 4.1%, 2.6%, and 3.4%, respectively. Because AAWS relies on policy for learning rather than Q-value, its superiority can be defended. Several environmental factors affect AAWAS and contribute to its consistent learning process and the high chance of accurate predictions. As a result, AAWASC may learn from experiences independently of target networks, and this helps to better generalize the network.

Authors

Institutions

Publication Details

Published
2024-11-21
DOI
https://doi.org/10.1109/akgec62572.2024.10868295
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

AAWAS: An Application and Workload-Aware Scheduling Technique for Efficient Task Allocation in Cloud Computing Environments

H. Anwar Basha, Vidhyasagar BS, M. Arvindhan, J. Arunnehru
Distributed and Parallel Computing Systems
article

AAWAS: An Application and Workload-Aware Scheduling Technique for Efficient Task Allocation in Cloud Computing Environments

H. Anwar Basha, Vidhyasagar BS, M. Arvindhan, J. Arunnehru
article en

Abstract

One interesting aspect of distributed systems is cloud computing. It offers its services on an as-needed, pay-per-use basis. Research challenges in cloud computing include the scheduling and balance of tasks. Scheduling tasks entails assigning them to available resources (Virtual Machines), whereas load balancing is spreading out the work over multiple available resources. We offer a job scheduling technique that takes into account anticipated demands on compute nodes. We begin by investigating the reasons for the disparity in workloads and the viability of redistributing computing resources. All of the complex simulations are run in clouds. The process consisted of two distinct parts. The simulation begins with a randomly generated workload. Second, we combine the workload prediction model with an application and workload-aware scheduling algorithm (AAWAS) [14]. We present a parallel job scheduling approach using computational node workload prediction AAWAS to simplify the AAWAS algorithm. Experimental results reveal that AAWA is superior to other algorithms in terms of minimizing makespan and optimizing resource utilization, and the proposed method is compared to FCFS, SJF, Min-Min, and EDF. To make Task scheduling in compute clouds faces various challenges due to the highly dynamic environment, such as availability, access policies, security, and reliability of computing resources. Furthermore, the collaborative nature of cloud computing projects on the internet adds complexity to task scheduling. From simulation results, it is evident that our proposed scheduler AAWAS outperforms A2C, DQN, and PPO across the board by 4.1%, 2.6%, and 3.4%, respectively. Because AAWS relies on policy for learning rather than Q-value, its superiority can be defended. Several environmental factors affect AAWAS and contribute to its consistent learning process and the high chance of accurate predictions. As a result, AAWASC may learn from experiences independently of target networks, and this helps to better generalize the network.

Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology (IN), SRM Institute of Science and Technology (IN)
Openalex Percentile: Top 68%
Distributed and Parallel Computing Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.