TST: a job scheduling algorithm in computational grid

A grid system tries to solve problems submitted by various grid users by allocating the jobs to the computing resources directed by different resource owners. An important objective of Grid scheduling is improving overall system performance by increasing system throughput, efficiency, and decreasing job completion time. Existing approaches of Grid scheduling doesn't give much emphasis on the performance of a Grid scheduler. We have specifically focused on improving Computational grid performance in terms of time. In this paper a non preemptive and dynamic scheduling strategy is proposed. This strategy toggle between Space based strategy and Time based strategy. The result of proposed scheduling strategy has been compared with existing scheduling strategies i. e. FCFS and Round Robin. Comparison takes place in terms of Execution time as a performance metrics. The proposed algorithm has been verified through the GridSim simulation toolkit and the simulation results confirm that the proposed algorithm gives better performance compare to other two strategies.