A new method for online scheduling in computational grid environments

Authors:
Chuliang Weng;Minglu Li;Xinda Lu
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, People's Republic of China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, People's Republic of China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, People's Republic of China
Venue:
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Year:
2005

Citing 4
Cited 0

The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
On-line Scheduling

Developments from a June 1996 seminar on Online algorithms: the state of the art
Scheduling Distributed Applications: the SimGrid Simulation Framework

CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
The Anatomy of the Grid: Enabling Scalable Virtual Organizations

International Journal of High Performance Computing Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.