An Analysis of MIPS Group Based Job Scheduling Algorithm with other Algorithms in Grid Computing
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 utilizes resources at its best and reduces the processing time of jobs.
Keywords: Grid computing; Job grouping; Job scheduling; Dynamic scheduling; First come first served (FCFS ) algorithm
Download Full-Text
ABOUT THE AUTHOR
S.Gomathi
Associate Professor, Francis Xavier Engineering college, Tirunelveli, Tamilnadu,India
S.Gomathi
Associate Professor, Francis Xavier Engineering college, Tirunelveli, Tamilnadu,India
