Grid Scheduling Algorithm based on Dynamic Time Quantum

Abstract

Computational Grid is the next generation of distributed computing systems. They allow the sharing of geographically distributed resources in an efficient way, extending the boundaries of what is perceived as distributed computing. Various science applications can benefit from the use of grids to solve CPU-intensive problems, creating potential benefits to the entire society. With further development of grid technology, it is very likely that corporations, universities and public institutions will exploit grids to enhance their computing infrastructure. In recent years there has been a large increase in grid technologies research, which has produced some reference grid implementations. Grid Computing has progressed a lot, still the areas like resource management, resource scheduling, load balancing and security have many challenges that need to be addressed. Scheduling is an integral part of Grid computing. Even though middleware support for grid computing has been the subject of extensive research, scheduling policies for the grid context have not been much studied. In addition to processor utilization, it is important to consider the waiting time, throughput, and response times of jobs in evaluating the performance of grid scheduling strategies. In this thesis a distributed scheduling algorithm has been proposed and designed that is based on the Dynamic time Quantum technique. Dynamic time Quantum technique improves the performance in terms of time delays. The algorithm has been implemented in Java and further validated in Condor scheduler. The experimental results depict the efficiency of the algorithm based on Dynamic Time Quantum technique.