By Topic

Greedy grid scheduling algorithm in dynamic job submission environment

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
$31 $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)
Singh, S. ; Dept. of Comput. Sci. & Eng., Dr. Virendra Swarup Group of Instn., Kanpur, India ; Kant, K.

Grid is a homogeneous or heterogeneous environment of resources. Grid scheduling is a technique by which resources are efficiently utilized to meet user demands. On the user perspective minimization of job turnaround time is the main challenge. Most of the minimization algorithms are implemented in homogeneous resource environment. In this paper a scheduling algorithm is presented to minimize average turnaround time in heterogeneous resource environment. This algorithm is based on greedy method which is used for totally dynamic grid environment where the jobs arrive at different time interval. The turnaround time of each job is minimized individually to minimize the average turnaround time of all submitted jobs in a time slot.

Published in:

Emerging Trends in Electrical and Computer Technology (ICETECT), 2011 International Conference on

Date of Conference:

23-24 March 2011