Prioritized User Demand Approach for Scheduling Meta Tasks on Heterogeneous Grid Environment

Due to the rapid evolution of grid computing, which deals with the effective utilization of the globally distributed computer resources to solve massive problems, grid scheduling is the major focus. Efficient scheduling algorithms are the need of the hour to achieve efficient utilization of the unus...

Full description

Saved in:
Bibliographic Details
Published in:International journal of computer applications 2011-01, Vol.23 (1), p.6-12
Main Authors: Suresh, P, Balasubramanie, P, Keerthika, P
Format: Article
Language:English
Subjects:
Algorithms
Computational grids
Demand
Evolution
Marketing
Scheduling
User satisfaction
Utilization
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Due to the rapid evolution of grid computing, which deals with the effective utilization of the globally distributed computer resources to solve massive problems, grid scheduling is the major focus. Efficient scheduling algorithms are the need of the hour to achieve efficient utilization of the unused CPU cycles distributed geographically in various locations. The existing job scheduling algorithms in grid computing had mainly concentrated on the system performance rather than the user satisfaction. In this paper we have presented a new prioritized user demand algorithm that mainly focuses on better meeting the deadlines of the statically available jobs as expected by the users. This algorithm also concentrates on the better utilization of the available heterogeneous resources. The performance analysis shows that the prioritized user demand algorithm performs better than the other heuristic scheduling algorithms in terms of makespan and resource utilization rate.
ISSN:0975-8887
0975-8887
DOI:10.5120/2856-3670