A new method for online scheduling in computational grid environments

A crucial issue for the efficient deployment of distributed applications on the grid is that of scheduling. In this paper, a modified cost-based online scheduling algorithm is presented for computational grids with theoretical guarantee. Firstly, a scheduling framework is described, where the grid environment is characterized, and the online job model is defined. Secondly, the modified cost-based online scheduling algorithm is presented where costs of resources are exponential functions of their loads. Finally, we test the algorithm in the grid simulation environment, and compare the performance of the presented algorithm with the greedy algorithm.