Skip to main content
SpringerLink
Log in

Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance

  • Conference paper
  • First Online:
Job Scheduling Strategies for Parallel Processing (JSSPP 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1659))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Catlett and L. Smarr. Metacomputing. Communications of the ACM, 35 (6):44–52, 1992.

    Article  Google Scholar 

  2. 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.

    Google Scholar 

  3. Allen Downey. Predicting Queue Times on Space-Sharing Parallel Computers. In International Parallel Processing Symposium, 1997.

    Google Scholar 

  4. N. R. Draper and H. Smith. Applied Regression Analysis, 2nd Edition. John Wiley and Sons, 1981.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. Ian Foster and Carl Kesselman. Globus: A Metacomputing Infrastructure Toolkit. International Journal of Supercomputing Applications, 11(2):115–128, 1997.

    Google Scholar 

  7. Ian Foster and Carl Kesselman, editors. The Grid: Blueprint for a New Computing Infrastructure. Morgan Kauffmann, 1999.

    Google Scholar 

  8. 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.

    Google Scholar 

  9. David E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989.

    Google Scholar 

  10. David A. Lifka. The ANL/IBM SP Scheduling System. Lecture Notes on Computer Science, 949:295–303, 1995.

    Google Scholar 

  11. Warren Smith, Ian Foster, and Valerie Taylor. Predicting Application Run Times Using Historical Information. Lecture Notes on Computer Science, 1459:122–142, 1998.

    Google Scholar 

  12. Neil Weiss and Matthew Hassett. Introductory Statistics. Addison-Wesley, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439, Evanston, IL 60208

    Warren Smith & Ian Foster

  2. Electrical and Computer Engineering Department, Northwestern University, Evanston, IL 60208

    Valerie Taylor

Authors
  1. Warren Smith
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Valerie Taylor
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ian Foster
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, The Hebrew University of Jerusalem, 91904, Jerusalem, Israel

    Dror G. Feitelson

  2. Laboratory for Computer Science, MIT, Cambridge, MA, 02139, USA

    Larry Rudolph

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation