Comparative Study of Various Task Scheduling Algorithms in Grid Computing

Abstract: Grid computing is used to solve various scientific or technical problems by applying many computers together to accomplish a specific task. It is an infrastructure for resource sharing and task scheduling. In recent times, many techniques have been developed to improve resource scheduling and task scheduling. The main idea to improve these aspects is to reduce makespan and improve resource utilization. Checkpointing is the aspect which can take a close check on the flow of the algorithm and remove the error as soon as it occurs. Replication is a technique which always works if any errors occur; it repeats all the above points after being assigned to other resource. This helps us to catch the error easily and quite easily and faster. The presented paper is to survey about various task scheduling algorithms which control the task scheduling of entire system. After surveying about the algorithms we compare them and the conclusion shows the best algorithm among all.

Keywords: grid computing, task management, fault tolerance, resource utilization.