Abstract
In heterogeneous and dynamic environments, efficient execution of parallel computations can require mappings of tasks to processors with performance that is both irregular and time varying. 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 two techniques to estimate future load and variance, one based on normal distributions and another using tendency-based prediction methodologies. We then present a family of stochastic scheduling algorithms that exploit such predictions when making data mapping decisions. We describe experiments in which we apply our techniques 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 techniques.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science+Business Media New York
About this chapter
Cite this chapter
Schopf, J.M., Yang, L. (2004). Using Predicted Variance for Conservative Scheduling on Shared Resources. In: Nabrzyski, J., Schopf, J.M., Węglarz, J. (eds) Grid Resource Management. International Series in Operations Research & Management Science, vol 64. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0509-9_15
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0509-9_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5112-2
Online ISBN: 978-1-4615-0509-9
eBook Packages: Springer Book Archive