Academic Journals Database
Disseminating quality controlled scientific knowledge

IMPROVED JOB-GROUPING BASED PSO ALGORITHM FOR TASK SCHEDULING IN GRID COMPUTING

ADD TO MY LIST
 
Author(s): S.SELVARANI | DR.G.SUDHA SADHASIVAM

Journal: International Journal of Engineering Science and Technology
ISSN 0975-5462

Volume: 2;
Issue: 9;
Start page: 4687;
Date: 2010;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: task scheduling | Particle Swarm Optimization | grid computing

ABSTRACT
The goal of grid computing is to provide powerful computing abilities for complicated tasks by using all available and free computational resources. A suitable and efficient scheduling algorithm is needed to schedule user jobs to heterogeneous resources distributed in the grid. So scheduling is an important issue in a grid computing environment. In this paper an improved heuristic approach based on Particle Swarm Optimization (PSO) algorithm is presented to solve task scheduling problem in grid. In this proposed scheduling approach tasks are grouped and allocated in an Un-uniform manner. The percentage of the processing capability of a resource on the total processing capability of all the resources is calculated. Using this percentage, the processing capability of a resource based on the total length of all tasks to be scheduled is calculated. Due to job grouping this approach optimizes computation/communication ratio andthe utilization of resources is also increased.
Why do you need a reservation system?      Save time & money - Smart Internet Solutions