Efficient Grid Scheduling Algorithm based on Priority Queues

Abstract

Computational Grids are a new trend in distributed computing systems. They allow the sharing of geographically distributed resources in an efficient way, extending the boundaries of what we perceive as distributed computing. Various sciences 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. Task scheduling is an integrated part of parallel and distributed computing. In the distributed environment every node has its own operating system, own resources, own processing speed, so the responsibility of communication between different platforms have been done by middleware. For this purpose, middleware takes the jobs from users and according to the job specification resource discovery has been done by middleware as a first step then assign the job to the particular resource, which has been discovered. So the middleware is responsible for the resource discovery, resource allocation and job will be executed successively in the grid environment. Due to this, performance of the job execution is affected. To reduce the load from the middleware, this thesis proposed the approach, which is “An efficient grid scheduling based on the priority based multiple queues”. An efficient Grid scheduling system is an essential part of the Grid. 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. This thesis propose distributed scheduling algorithm that use priority based multiple queue without much loss of performance.