An efficient job scheduling algorithm for grid computing

The emerging computational grid infrastructure consists of heterogeneous resource in widely distributed autonomous domain, which makes resources scheduling even more challenging. The most common objective function of task scheduling problem is makespan. In this paper, I have proposed an efficient Job scheduling algorithm for the grid environment so that the jobs are executed in minimum time and also all nodes of grid execute equal load relative to their executing power. This technique fetches the jobs from the job queue that is ready to execute and assign these jobs to the best nodes of the grid.