An adaptive grouping based job scheduling in grid computing

Abstract

The two major problems in grid computing applications are, resource management and job scheduling. These problems do occur due to distributed and heterogeneous nature of the resources. This paper introduces a model in job scheduling in grid computing environments. A dynamic scheduling algorithm is proposed to maximize the resource utilization and minimize processing time of the jobs. The proposed algorithm is based on job grouping. The results show that the proposed scheduling algorithm efficiently reduces the processing time of jobs.