Conservative Scheduling, Using Predicted Variance to Improve Scheduling Decisions in Dynamic Environments

In heterogeneous and dynamic environments, efficient execution of parallel computations can reEuire mappings of tasks to processors with performance that is both irregular (due to heterogeneity) and timeKvarying (due to dynamicity). While adaptive domain decomposition techniEues have been used to address heterogeneous resource capabilities, temporal variations in those capabilities have seldom been considered. We propose a conservative scheduling policy that uses information about expected future variance in resource capabilities to produce more efficient data mapping decisions. We first present techniEues, based on time series predictors that we developed in previous work, for predicting CPU load at some future time point, average CPU load for some future time interval, and variation of CPU load over some future time interval. We then present a family of stochastic scheduling algorithms that exploit such predictions of future availability and variability when making data mapping decisions. Finally, we describe experiments in which we apply our techniEues to an astrophysics application. The results of these experiments demonstrate that conservative scheduling can produce execution times that are significantly faster and less variable than other techniEues.