Asset Details
Do you wish to reserve the book?
Task scheduling in cloud computing using particle swarm optimization with time varying inertia weight strategies
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Task scheduling in cloud computing using particle swarm optimization with time varying inertia weight strategies
Do you wish to request the book?
Task scheduling in cloud computing using particle swarm optimization with time varying inertia weight strategies
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Task scheduling in cloud computing using particle swarm optimization with time varying inertia weight strategies
2020
Overview
Cloud computing is an efficient technology to serve the requirement of big data applications. Minimizing the makespan of the cloud system while increasing resource utilization is important to reduce costs. In this case, task scheduling is a challenging task to meet the requirement because it requires both effectiveness and efficiency. This article proposes a task scheduler with several discrete variants of the particle swarm optimization (PSO) algorithm for task scheduling in cloud computing. In order to evaluate the performance, these approaches were compared with three well-known heuristic algorithms on task scheduling problems. Experiment results demonstrate the efficiency and effectiveness of the proposed approaches. For the proposed PSO-based scheduler, an appropriate choice is to use the logarithm decreasing strategy to provide an optimal scheduling scheme. The average makespan of the proposed PSO-based scheduler that adopts logarithm decreasing strategy is reduced by 19.12%, 21.42% and 15.14% relative to the compared gravitational search algorithm, artificial bee colony algorithm and dragonfly algorithm respectively.
Publisher
Springer US,Springer Nature B.V
Subject
