This paper presents an adaptive scheduling method, which can be used for parallel applications whose total workload is unknown a priori. This method can deal with the unpredictable execution conditions commonly encountered on grids. To address this scheduling problem, parameters which quantify the dynamic nature of the execution conditions had to be denned. The proposed scheduling method is based on an online algorithm so as to be adaptable to the varying execution conditions, but avoids the idle periods inherent to this on-line algorithm. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Boutammine, S. S., Millot, D., & Parrot, C. (2006). An adaptive scheduling method for grid computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4128 LNCS, pp. 188–197). Springer Verlag. https://doi.org/10.1007/11823285_20
Mendeley helps you to discover research relevant for your work.