Two distinct characteristics of grid computing systems are resource heterogeneity and availability variation. There are many welldesigned scheduling algorithms proposed for heterogeneous computing systems. However, the availability variation is seldom considered in developing scheduling ongoing applications on a grid. In this paper, a scheduling algorithm called AROF is proposed. It considers availability variation as well as resource heterogeneity while scheduling applications to the grids. An experiment has been conducted to demonstrate that AROF algorithm outperforms the well-known scheduling algorithms Modified HEFT and GS in most of the cases. © Springer-Verlag Berlin Heidelberg 2010.
CITATION STYLE
Lin, C. C., & Hsu, C. H. (2010). Adaptable scheduling algorithm for grids with resource redeployment capability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6081 LNCS, pp. 299–312). https://doi.org/10.1007/978-3-642-13119-6_27
Mendeley helps you to discover research relevant for your work.