Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal Bulletin of Electrical Engineering and Informatics
Kulkarni, Shriram S.
Unknown Affiliation
Electrical & Electronics Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Task scheduling algorithm using grey wolf optimization technique in cloud computing environment Khaleelahmed, Shaik; Selvaraj, Sivakumar; Mohite, Rajendra B.; Bangare, Manoj L.; Bangare, Pushpa M.; Kulkarni, Shriram S.; Ajibade, Samuel-Soma M.; Raghuvanshi, Abhishek
Bulletin of Electrical Engineering and Informatics Vol 14, No 4: August 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v14i4.7695

Abstract

Scheduling refers to the process of allocating cloud resources to several users according to a schedule that has been established in advance. It is not possible to get acceptable performance in settings that are distributed without proper planning for simultaneous processes. When developing productive schedules in the cloud, it is necessary for work scheduling to take a variety of constraints and goals into consideration.When dealing with activities that have performance optimization limits, resource allocation is a very important aspect to consider. When it comes to cloud computing, the only way to achieve great performance, high profits, high scalability, efficient provisioning, and cost savings is with an exceptional task scheduling system. This article presents a grey wolf optimization (GWO) based framework for efficient task scheduling in cloud computing environment. The proposed algorithm is compared with particle swarm optimization (PSO) and flower pollination algorithm (FPA) and GWO is performing task scheduling in less execution time and cost in comparison with PSO and FPA techniques. Execution time taken by GWO to finish 200 task in 120.2 ms. It is less than the time taken by PSO and FPA algorithm to finish same number of tasks.
Co-Authors Ajibade, Samuel-Soma M. Bangare, Manoj L. Bangare, Pushpa M. Khaleelahmed, Shaik Mohite, Rajendra B. Raghuvanshi, Abhishek Selvaraj, Sivakumar