期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2014
卷号：2
期号：9
出版社：S&S Publications
摘要：A Grid environment provides computational power to solve a hard problem, which otherwise might takea very large amount of time to execute on a single machine. Since the resources are physically scattered and diverse innature, the algorithm used to assign the resources to jobs plays a significant role in the competence of the Gridscheduler. The major goal of Grid scheduler is to allocate each job to a resource, in such a way that the total time takento execute all the jobs and their makespan, flowtime, tardiness are minimized. Thereby the resource utilization in grid ismaximized. This job scheduling problem is known to be NP-Complete. This paper examines the four deterministicscheduling algorithms like Min-Min, Max-Min, Minimum Completion Time and Minimum Execution Time.
