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.

[1]  Jiri Sgall,et al.  On-line scheduling --- a survey , 1997 .

[2]  Ian T. Foster,et al.  The Anatomy of the Grid: Enabling Scalable Virtual Organizations , 2001, Int. J. High Perform. Comput. Appl..

[3]  Chuliang Weng,et al.  A Cost-Based Online Scheduling Algorithm for Job Assignment on Computational Grids , 2003, APPT.

[4]  David Abramson,et al.  Economic models for resource management and scheduling in Grid computing , 2002, Concurr. Comput. Pract. Exp..

[5]  Heinrich Müller,et al.  Effiziente Methoden der geometrischen Modellierung und der wissenschaftlichen Visualisierung, Dagstuhl Seminar 1997 , 1999, Effiziente Methoden der geometrischen Modellierung und der wissenschaftlichen Visualisierung.

[6]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.

[7]  Jirí Sgall,et al.  On-line Scheduling , 1996, Online Algorithms.

[8]  Henri Casanova,et al.  Scheduling distributed applications: the SimGrid simulation framework , 2003, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings..