A new method for online scheduling in computational grid environments

Chuliang Weng; Minglu Li; Xinda Lu

doi:10.1007/978-3-540-31849-1_79

A new method for online scheduling in computational grid environments

Chuliang Weng^*
, Minglu Li
, Xinda Lu

^*Corresponding author for this work

Shanghai Jiao Tong University

Research output: Contribution to journal › Conference article › peer-review

1 Scopus citations

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.

Original language	English
Pages (from-to)	832-837
Number of pages	6
Journal	Lecture Notes in Computer Science
Volume	3399
DOIs	https://doi.org/10.1007/978-3-540-31849-1_79
State	Published - 2005
Externally published	Yes
Event	7th Asia-Pacific Web Conference on Web Technologies Research and Development - APWeb 2005 - Shanghai, China Duration: 29 Mar 2005 → 1 Apr 2005

Access to Document

10.1007/978-3-540-31849-1_79

Cite this

@article{85817f6c217e4171b8ee217fcbd3b8e2,

title = "A new method for online scheduling in computational grid environments",

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.",

author = "Chuliang Weng and Minglu Li and Xinda Lu",

year = "2005",

doi = "10.1007/978-3-540-31849-1\_79",

language = "英语",

volume = "3399",

pages = "832--837",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

note = "7th Asia-Pacific Web Conference on Web Technologies Research and Development - APWeb 2005 ; Conference date: 29-03-2005 Through 01-04-2005",

}

TY - JOUR

T1 - A new method for online scheduling in computational grid environments

AU - Weng, Chuliang

AU - Li, Minglu

AU - Lu, Xinda

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/24144476615

U2 - 10.1007/978-3-540-31849-1_79

DO - 10.1007/978-3-540-31849-1_79

M3 - 会议文章

AN - SCOPUS:24144476615

SN - 0302-9743

VL - 3399

SP - 832

EP - 837

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - 7th Asia-Pacific Web Conference on Web Technologies Research and Development - APWeb 2005

Y2 - 29 March 2005 through 1 April 2005

ER -

A new method for online scheduling in computational grid environments

Abstract

Access to Document

Other files and links

Fingerprint

Cite this