A new method for online scheduling in computational grid environments

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Weng, C., Li, M., & Lu, X. (2005). A new method for online scheduling in computational grid environments. In Lecture Notes in Computer Science (Vol. 3399, pp. 832–837). Springer Verlag. https://doi.org/10.1007/978-3-540-31849-1_79

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free