Many algorithms in the literature have been targeting the problem of scheduling divisible workloads (those loads that are amenable to partitioning in any number of chunks). Unfortunately, such algorithms have a number of shortcomings such as the sole reliance in their computations on CPU speed, and the assumption that a definite set of workers are available and must participate in processing the load. These constraints limit the utility of such algorithms and make them impractical for a computing platform such as the Grid. In this paper, we propose an algorithm, MRRS, that overcomes these limitations and adopts a worker selection policy that aims at minimizing the execution time. The MRRS has been evaluated against other scheduling algorithms such as UMR and LP and showed better results. © Springer-Verlag Berlin Heidelberg 2009.
CITATION STYLE
Elnaffar, S., & Loc, N. T. (2009). A dynamic grid scheduler with a resource selection policy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4879 LNCS, pp. 190–200). Springer Verlag. https://doi.org/10.1007/978-3-642-01350-8_18
Mendeley helps you to discover research relevant for your work.