700 Journals and 15,000,000 Readers Each Journal is getting 25,000+ ReadersThis Readership is 10 times more when compared to other Subscription Journals (Source: Google Analytics)
Research Article Open Access
A Grid environment provides computational power to solve a hard problem, which otherwise might take a very large amount of time to execute on a single machine. Since the resources are physically scattered and diverse in nature, the algorithm used to assign the resources to jobs plays a significant role in the competence of the Grid scheduler. The major goal of Grid scheduler is to allocate each job to a resource, in such a way that the total time taken to execute all the jobs and their makespan, flowtime, tardiness are minimized. Thereby the resource utilization in grid is maximized. This job scheduling problem is known to be NP-Complete. This paper examines the four deterministic scheduling algorithms like Min-Min, Max-Min, Minimum Completion Time and Minimum Execution Time.