Greedy Grid Scheduling Algorithm in Static Environment

Abstract

Grid scheduling is a technique by which the user demands are met and the resources are efficiently utilized. The scheduling algorithms are used to minimize the jobs waiting time and completion time. Most of the minimization algorithms are implemented in homogeneous resource environment. In this paper the presented algorithm minimize average turnaround time in heterogeneous resource environment. This algorithm is based on greedy approach which is used in static job submission environment where all the jobs are submitted at same time. Taken all jobs independent the turn around time of each job is minimized to minimize the average turnaround time of all submitted jobs.