@inproceedings{7b8063613c974d31a1083e70242c5fbe,
title = "A dynamic grid scheduler with a resource selection policy",
abstract = "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.",
keywords = "Divisible load, Resource selection, Task scheduling",
author = "Said Elnaffar and Loc, {Nguyen The}",
year = "2009",
doi = "10.1007/978-3-642-01350-8_18",
language = "English",
isbn = "364201349X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "190--200",
booktitle = "Advanced Internet Based Systems and Applications - Second International Conference on Signal-Image Technology and Internet-Based Systems, SITIS 2006, Revised Selected Papers",
note = "2nd International Conference on Signal-Image Technology and Internet-Based Systems, SITIS 2006 ; Conference date: 17-12-2006 Through 21-12-2006",
}