We describe a scheduling technique in which estimated job runtimes and estimated resource availability are used to efficiently distribute workloads across a homogeneous grid of resources with variable availability. The objective is to increase efficiency by minimizing job failure caused by resources becoming unavailable. Optimal scheduling will be accomplished by mapping jobs onto resources with sufficient availability. Both the scheduling technique and the implementation called PGS (Prediction based Grid Scheduling) are described in detail. Results are presented for a set of sleep jobs, and compared with a first come, first serve scheduling approach. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Verboven, S., Hellinckx, P., Broeckhove, J., & Arickx, F. (2008). Dynamic grid scheduling using job runtime requirements and variable resource availability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5168 LNCS, pp. 223–232). https://doi.org/10.1007/978-3-540-85451-7_25
Mendeley helps you to discover research relevant for your work.