A Dynamic Grid Scheduler with a Resource Selection Policy

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 clunks). 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.