Scheduling Algorithm for Grid Computing using Shortest Job First with Time Quantum

Abstract

One motivation of grid computing is to aggregate the power of widely distributed resources and provide non trivial services to users. To achieve this goal an efficient grid scheduling system is an essential part of the grid. The scheduling of the processes can be implemented in different ways with different scheduling algorithms. In this project we use Shortest Job First [SJF] algorithm where it assigns highest priority to shortest process. If processes are long, it suffers with a long waiting time. When shortest process continues to arrive, the longer process may never get a chance to schedule, this problem is called as Starvation. This research proposes a use of Shortest Job First with time quantum mechanism to overcome this issue. The MATLAB software is used to implement the proposed algorithm, the algorithm achieves better results than the original one in terms of delay time, resources utilization, fair treatment for all the processes and degree of starvation.