Experiments with CPU Scheduling Algorithm on a Computational Grid

The grid is an emerging technology for enabling resource sharing and coordinated problem solving in dynamic multi-institutional virtual organizations. The resource-matching problem in the grid involves assigning resources to tasks in order to satisfy task requirements and resource policies. Just as the World Wide Web has changed the way that society deals with information, researchers and educators now expect the grid to change the way that they deal with computing resources and, ultimately, how they deal with knowledge. It is important to mention that, so far, the computational grid has reached a much higher level of maturity than the other types of grid. This paper deals with the implementation of a computer program, which employs Grid Computing (GCs) technique in the quest for reducing the computational time. The program is written in Java and incorporates a grid-gain strategy for faster evolution. The factors like average turn around time, waiting time, and the execution time has been calculated for the given data set. Comparison has been made between the execution times of this algorithm with and without using grid environment and finally given the best choice for CPU scheduling algorithms (i.e. SJF (shortest job first), PRIORITY, and FCFS (first come first serve)) for given data set. In the future in order to construct large, repeatable experiments, a simulation environment designed to examine application scheduling on the grid such as Simgrid could be used.