Research Article Open Access

A SURVEY: PARTICLE SWARM OPTIMIZATION-BASED ALGORITHMS FOR GRID COMPUTING SCHEDULING SYSTEMS

Faruku Umar Ambursa1 and Rohaya Latip1
  • 1 Universiti Putra Malaysia, Malaysia
Journal of Computer Science
Volume 9 No. 12, 2013, 1669-1679

DOI: https://doi.org/10.3844/jcssp.2013.1669.1679

Submitted On: 3 July 2013 Published On: 25 November 2013

How to Cite: 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

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 PSO-based 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.

  • 929 Views
  • 1,741 Downloads
  • 2 Citations

Download

Keywords

  • Particle Swarm Optimization (PSO)
  • Grid Computing
  • Scheduling