Scheduling Jobs on Computational Grids Using Fuzzy Particle Swarm Algorithm
Grid computing is a computing framework to meet the growing computational demands. This paper introduces a novel approach based on Particle Swarm Optimization (PSO) for scheduling jobs on computational grids. The representations of the position and velocity of the particles in the conventional PSO is extended from the real vectors to fuzzy matrices. The proposed approach is to dynamically generate an optimal schedule so as to complete the tasks within a minimum period of time as well as utilizing the resources in an efficient way. We evaluate the performance of the proposed PSO algorithm with Genetic Algorithm (GA) and Simulated Annealing (SA) approaches.
KeywordsGenetic Algorithm Particle Swarm Optimization Simulated Annealing Computational Grid Particle Swarm Optimization Algorithm
Unable to display preview. Download preview PDF.
- 1.Foster, I., Kesselman, C.: The Grid: Blueprint For A New Computing Infrastructure. Morgan Kaufmann, USA (2004)Google Scholar
- 4.Kennedy, J., Eberhart, R.: Swarm Intelligence. Morgan Kaufmann, San Francisco (2001)Google Scholar
- 5.Abraham, A., Buyya, R., Nath, B.: Nature’s Heuristics For Scheduling Jobs on Computational Grids. In: Proceedings of the 8th International Conference on Advanced Computing and Communications, pp. 45–52. Tata McGraw-Hill, India (2000)Google Scholar