Scheduling Tasks in Grid Computing Environments

Scheduling tasks on different resources spread over a grid computing system is an NP complete problem. Assorted researchers are developing adaptation scheduling algorithms for getting optimality. Hence they have proved a good result for tasks scheduling about resources selection. In this review, we study the Group-based Parallel Multi-scheduler (GPMS). It is focused on effectively utilizing the advantages of multicore systems for Grid scheduling. Two job grouping methods are implemented, viz., Execution Time Balanced and Execution Time Sorted then Balanced termed as ETB, ETSB respectively. Two machine grouping methods; Evenly Distributed (EvenDist) and Similar Together (Sim Tog). We also see the MinMin Grid scheduling algorithm. We demonstrated that by assigning different tasks to the machines into batch before scheduling, the computation time for the scheduling process improves by 85% over the ordinary MinMin algorithm. We also study a new heuristic algorithm called SortMid. It strives for maximizing the utilization and minimizing the time period. Keywords—Grid Computing, Scheduling, Parallelism.