Greedy grid scheduling algorithm in dynamic job submission environment

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.