A survey: Particle swarm optimization-based algorithms for grid computing scheduling systems

5Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

Bio-inspired heuristics have been promising in solving complex scheduling optimization problems. Several researches have been conducted to tackle the problems of task scheduling for the heterogeneous and dynamic grid systems using different bio-inspired mechanisms such as Genetic Algorithm (GA), Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO). PSO has been proven to have a relatively more promissing performance in dealing with most of the task scheduling challenges. However, to achieve optimum performance, new models and techniques for PSO need to be developed. This study surveys PSObased scheduling algorithms for Grid systems and presents a classification for the various approaches adopted. Metatask-based and workflow-based are the main categories explored. Each scheduling algorithm is described and discussed under the suitable category. © 2013 Science Publications.

Cite

CITATION STYLE

APA

Ambursa, F. U., & Latip, R. (2013). A survey: Particle swarm optimization-based algorithms for grid computing scheduling systems. Journal of Computer Science, 9(12), 1669–1679. https://doi.org/10.3844/jcssp.2013.1669.1679

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free