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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bharadwaj, V., Ghose, D., Mani, V., Robertazzi, T.G.: Scheduling Divisible Loads in Parallel and Distributed Systems. IEEE Computer Society Press, Los Alamitos (1996)
Foster, I., Kesselman, C.: Grid2: Blueprint for a New Computing Infrastructure, 2nd edn. Morgan Kaufmann Publisher, San Francisco (2003)
Beaumont, O., Casanova, H., Legrand, A., Robert, Y., Yang, Y.: Scheduling Divisible Loads on Star and Tree Networks: Results and Open Problems. IEEE Transactions on Parallel and Distributed Systems 16(3), 207–218 (2005)
Yang, Y., Raart, K.V., Casanova, H.: Multiround Algorithms for Scheduling Divisible Loads. IEEE Transaction on Parallel and Distributed Systems 16(11), 1092–1104 (2005)
Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Athena Scientific, Belmont (1996)
Martello, S., Toth, P.: Knapsack problems: algorithms and computer implementations. Wiley, Chichester (1990)
Casanova, H.: Simgrid: a Toolkit for the Simulation of Application Scheduling. In: Proc. of the IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2001), Australia, pp. 430–437 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Elnaffar, S., The Loc, N. (2009). A Dynamic Grid Scheduler with a Resource Selection Policy. In: Damiani, E., Yetongnon, K., Chbeir, R., Dipanda, A. (eds) Advanced Internet Based Systems and Applications. SITIS 2006. Lecture Notes in Computer Science, vol 4879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01350-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-01350-8_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01349-2
Online ISBN: 978-3-642-01350-8
eBook Packages: Computer ScienceComputer Science (R0)