Conference proceeding
Using run-time uncertainty to robustly schedule parallel computation
Parallel Computing Technologies: 4th International Conference, Vol.1277, pp.13-24
Lecture Notes in Computer Science
1997
DOI: 10.1007/3-540-63371-5_3
Abstract
Increasingly, feedback of measured run-time information is being used in the optimization of computation execution. Because of this, the need for a model relating the static view of a computation to its runtime variance is becoming more important. Recently, we have described such a model which uses the notion of uncertainty to provide bounds on key scheduling parameters of the run-time computation. In this paper, we demonstrate how our model provides a foundation for robust parallel scheduling, i.e., scheduling that optimizes for computation execution in the presence of run-time variance. While this work was inspired by our previous study of uncertainty due to measurement intrusion, the scheduling paradigm presented here represents a broader, more general application of the uncertainty concept.
Details
- Title: Subtitle
- Using run-time uncertainty to robustly schedule parallel computation
- Creators
- R. D Dietz - University of IowaT. L Casavant - University of IowaT. E Scheetz - University of IowaT. A Braun - University of IowaM. S Andersland - University of Iowa
- Resource Type
- Conference proceeding
- Publication Details
- Parallel Computing Technologies: 4th International Conference, Vol.1277, pp.13-24
- Publisher
- Springer Berlin Heidelberg; Berlin, Heidelberg
- Series
- Lecture Notes in Computer Science
- DOI
- 10.1007/3-540-63371-5_3
- eISSN
- 1611-3349
- ISSN
- 0302-9743
- Language
- English
- Date published
- 1997
- Academic Unit
- Electrical and Computer Engineering; Roy J. Carver Department of Biomedical Engineering; Ophthalmology and Visual Sciences
- Record Identifier
- 9984196977302771
Metrics
16 Record Views