Implementing Short Term Scheduler and Preemptive Algorithm in Grid Computing Scheduling

Grid Computing has emerged as an important new field focusing on resource sharing. One of the most challenging issues in Grid Computing is efficient scheduling of tasks and there is need of finding faster and cheaper solutions to solve computational problems. The deployment of Grid systems involves the efficient management of heterogeneous, geographically distributed and dynamically available resources. However, the effectiveness of a Grid environment is largely dependent on the effectiveness and efficiency of its schedulers, which act as localized resource brokers. This article provides a brief overview on grid computing and Scheduling processes, important factors considered in resource management and Scheduling, comparison of different Scheduling processes and future outlook of its resource management and Scheduling in Grid systemsby implementing short term scheduling. This paper investigates the use of short term scheduling mechanism in grid computing and implementing the Shortest Remaining Time First (SRTF) algorithm for the selection of jobs from the job pool.