An Online Scheduling Algorithm for Assigning Jobs in the Computational Grid

Authors:
Chuliang Weng;Minglu Li;Xinda Lu
Affiliations:
The authors are with the Department of Computer Science and Engineering, Shanghai Jiao Tong University, China. E-mail: weng-cl@cs.sjtu.edu.cn;The authors are with the Department of Computer Science and Engineering, Shanghai Jiao Tong University, China. E-mail: weng-cl@cs.sjtu.edu.cn;The authors are with the Department of Computer Science and Engineering, Shanghai Jiao Tong University, China. E-mail: weng-cl@cs.sjtu.edu.cn
Venue:
IEICE - Transactions on Information and Systems
Year:
2006

Citing 0
Cited 4

The operation and administration of grid computing center in Shanghai Jiao Tong University

CHINA HPC '07 Proceedings of the 2007 Asian technology information program's (ATIP's) 3rd workshop on High performance computing in China: solution approaches to impediments for high performance computing
Optimizing availability and QoS of heterogeneous distributed system based on residual lifetime in uncertain environment

The Journal of Supercomputing
Evaluation of hierarchical desktop grid scheduling algorithms

Future Generation Computer Systems
Online algorithms for single machine schedulers to support advance reservations from grid jobs

HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The computational grid provides a promising platform for the deployment of various high-performance computing applications. Problem in implementing computational grid environments is how to effectively use various resources in the system, such as CPU cycle, memory, communication network, and data storage. There are many effective heuristic algorithms for scheduling in the computational grid, however most scheduling strategies have no theoretical guarantee at all. In this paper, a cost-based online scheduling algorithm is presented for job assignment in the grid environment with theoretical guarantee. Firstly, a scheduling framework is described, where the grid environment is characterized, and the online job model is defined. Secondly, the cost-based online scheduling algorithm is presented where costs of resources are exponential functions of their loads, and the performance of this algorithm is theoretically analyzed against the performance of the optimal offline algorithm. Finally, we implement the algorithm in the grid simulation environment, and compare the performance of the presented algorithm with the other three algorithms, and experimental results indicate that the cost-based online scheduling algorithm can outperform the other three online algorithms.