Abstract
On many computers, a request to run a job is not serviced immediately but instead is placed in a queue and serviced only when resources are released by preceding jobs. In this paper, we build on runtime prediction techniques that we developed in previous research to explore two problems. The first problem is to predict how long applications will wait in a queue until they receive resources. We develop runtime estimates that result in more accurate wait-time predictions than other run-time prediction techniques. The second problem we investigate is improving scheduling performance. We use run-time predictions to improve the performance of the least-work-first and backfill scheduling algorithms. We end that using our run-time predictor results in lower mean wait times for the workloads with higher offered loads and for the backfill scheduling algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C. Catlett and L. Smarr. Metacomputing. Communications of the ACM, 35 (6):44–52, 1992.
K. Czajkowski, I. Foster, N. Karonis, C. Kesselman, S. Martin, W. Smith, and S. Tuecke. A Resource Management Architecture for Metasystems. Lecture Notes on Computer Science, 1998.
Allen Downey. Predicting Queue Times on Space-Sharing Parallel Computers. In International Parallel Processing Symposium, 1997.
N. R. Draper and H. Smith. Applied Regression Analysis, 2nd Edition. John Wiley and Sons, 1981.
Dror Feitelson and Bill Nitzberg. Job Characteristics of a Production Parallel Scientific Workload on the NASA Ames iPSC/860. Lecture Notes on Computer Science,949:337–360, 1995.
Ian Foster and Carl Kesselman. Globus: A Metacomputing Infrastructure Toolkit. International Journal of Supercomputing Applications, 11(2):115–128, 1997.
Ian Foster and Carl Kesselman, editors. The Grid: Blueprint for a New Computing Infrastructure. Morgan Kauffmann, 1999.
Richard Gibbons. A Historical Application Profiler for Use by Parallel Scheculers. Lecture Notes on Computer Science, 1297:58–75, 1997. Gibbons. A Historical Profiler for Use by Parallel Schedulers. Master’s thesis, University of Toronto, 1997.
David E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989.
David A. Lifka. The ANL/IBM SP Scheduling System. Lecture Notes on Computer Science, 949:295–303, 1995.
Warren Smith, Ian Foster, and Valerie Taylor. Predicting Application Run Times Using Historical Information. Lecture Notes on Computer Science, 1459:122–142, 1998.
Neil Weiss and Matthew Hassett. Introductory Statistics. Addison-Wesley, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Smith, W., Taylor, V., Foster, I. (1999). Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance. In: Feitelson, D.G., Rudolph, L. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 1999. Lecture Notes in Computer Science, vol 1659. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47954-6_11
Download citation
DOI: https://doi.org/10.1007/3-540-47954-6_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66676-9
Online ISBN: 978-3-540-47954-3
eBook Packages: Springer Book Archive