Evaluation of nine heuristic algorithms with data-intensive jobs and computing-intensive jobs in a dynamic environment

This study focuses on a dynamic environment where data-intensive jobs and computing-intensive jobs are submitted to a grid at the same time. The authors analyse nine heuristic algorithms in a grid and give a comparison of them in a simulation environment. The nine heuristics are: (i) min-min, (ii) max-min, (iii) duplex, (iv) sufferage, (v) minimum execution time (MET), (vi) opportunistic load balancing (OLB), (vii) fast-fit, (viii) best-fit and (ix) adaptive scoring job scheduling (ASJS). In the simulation, different ratios between the data-intensive jobs and computing-intensive jobs are used to investigate for the performance of the nine heuristics under different arrival rates. Five parameters are used to estimate the performance of those methods. Those parameters include average execution time, average waiting time, the number of finished jobs (FB), the sum of file size that has been submitted to the grid (SFS) and the total number of instructions of all finished jobs (SINI). Simulation results show that four out of the nine heuristics have relative good performance in the job scheduling in the grid systems. They are best-fit, MET, ASJS and OLB.