Survey on Job Scheduling Algorithms in Grid Computing

Abstract

Grid computing is a type of distributed computing that distributes the tasks to a group of network computers where computer are linked together to provide a better computational resource. Scheduling plays a vital role in gaining high consumption of resources in the field of grid computing and achieving utilization of resources in grid environments. The use of the scheduling is to increase the throughput, efficiency and decrease the average waiting time. In this paper we have been surveyed various job scheduling algorithm in grid computing that will benefit for the researchers to carry out the future work in that area and develop a better algorithm. It is found that the resource allocation and job scheduling plays a vital role to improve performance and can proficiently and efficiently allocate workloads to proper resources.

Job Scheduling on Grid Computing Using First Fit, Best Fit, and Worst Fit

“…Experimental stages in this study: (1) Setting parameters whose values fixed and changes shown in table 1; (2) Setting the flexibility parameters and usability factors, are shown in table 2; (3) Generating jobs randomly with usability factors 2 and 3, and determining the percentage of flexibility from 25% to 100%, is shown in table 3. The results of the job generation in table 3 used as input to the FCFS-LRH, FCFS-EDS method.…”

“…In general, a grid computing system is used to increase the utilization of homogeneous or heterogeneous resources so that workload management will be optimal [1][2][3] [4]. Computing resources facilitate organization formation such as servers, network nodes, storage elements [5].…”