By Topic

Scheduling of scientific workflows using Niched Pareto GA for Grids

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shajulin Benedict ; Software Technologies group of TIFAC Core in Network Engineering, AKCE, Sirivilliputhur, India-626190. phone: +91-4653-289042; fax: +91-4563-289322; e-mail: shajubenedict@yahoo.com ; V. Vasudevan

In a grid computing environment, many resources (compute, data, I/O, instruments, etc) are involved to solve a single large problem that could not be performed on any one resource. It is possible that the job submission for the resource request by resource consumers can be large owing to wide area distribution of grid. Key services such as resource discovery, monitoring and scheduling are inherently more complicated in a grid environment. In this paper, we approach the problem of grid workload scheduling by employing a Niched Pareto based genetic algorithm (NPGA) to generate near to optimal solution. In addition, evaluation of other scheduling mechanisms like first come first serve (FCFS), earliest deadline first (EDF) are compared. The results reveal that the proposed Niched Pareto genetic algorithm performs well compared to the other scheduling mechanisms when considering the workflow completion within the deadline

Published in:

2006 IEEE International Conference on Service Operations and Logistics, and Informatics

Date of Conference:

21-23 June 2006