Grouping Based User Demand Aware Job Scheduling Approach for Computational Grid
Grid Computing is a high performance computing that solves complicated tasks and provides powerful computing abilities. Scheduler is very much responsible for effective utilization of resources and less processing time. Most of the scheduling algorithms failed to consider user satisfaction and resource utilization. This paper introduces a new grouping based scheduling algorithm that takes user satisfaction into account. In this approach, grouping of fine grained jobs to coarse grained jobs and scheduling those coarse grained jobs based on the deadline is done. The simulation is done using GridSim toolkit and the results have been compared with the user demand aware scheduling Algorithm and the results show the user satisfaction is more and achieves better hit rate, processing time and makespan.