Skip to main content
SpringerLink
Log in
Book cover

Workshop on Job Scheduling Strategies for Parallel Processing

JSSPP 1999: Job Scheduling Strategies for Parallel Processing pp 17–42Cite as

On the Design and Evaluation of Job Scheduling Algorithms

  • Conference paper
  • First Online:

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

Abstract

In this paper we suggest a strategy to design job scheduling systems. To this end, we first split a scheduling system into three components: Scheduling policy, objective function and scheduling algorithm. After discussing the relationship between those components we explain our strategy with the help of a simple example. The main focus of this example is the selection and the evaluation of several scheduling algorithms.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.G. Feitelson, Online Parallel Workloads Archive. Web-Archive, 1998. http://www.cs.huji.ac.il/labs/parallel/workload/.

  2. D.G. Feitelson and L. Rudolph, Parallel job scheduling: Issues and approaches. In D.G. Feitelson and L. Rudolph, editors, IPPS’95 Workshop: Job Scheduling Strategies for Parallel Processing, pages 1–18. Springer-Verlag, Lecture Notes in Computer Science LNCS 949, 1995.

    Google Scholar 

  3. D.G. Feitelson and L. Rudolph, Metrics and benchmarking for parallel job scheduling. In D.G. Feitelson and L. Rudolph, editors, IPPS’98 Workshop: Job SchedulingStrategies for Parallel Processing, pages 1–24. Springer-Verlag, Lecture Notes in Computer Science LNCS 1459, 1998.

    Chapter  Google Scholar 

  4. D.G. Feitelson and A.M. Weil, Utilization and Predictability in Scheduling the IBM SP2 with Back-lling. In Procedings of IPPS/SPDP 1998, pages 542–546. IEEE Computer Society, 1998.

    Google Scholar 

  5. A. Feldmann, J. Sgall, and S.-H. Teng, Dynamic scheduling on parallel machines. Theoretical Computer Science, 130:49–72, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  6. M. Garey and R.L. Graham, Bounds for multiprocessor scheduling with resource constraints. SIAM Journal on Computing, 4 (2):187–200, June 1975.

    Article  MATH  MathSciNet  Google Scholar 

  7. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.

    Google Scholar 

  8. J.L. Hennessy and D.A. Patterson, Computer Architecture A Quantitative Approach. Morgan Kaufmann, San Francisco, second edition, 1996.

    MATH  Google Scholar 

  9. S. Hotovy. Workload Evolution on the Cornell Theory Center IBM SP2. In D.G. Feitelson and L. Rudolph, editors, IPPS’96 Workshop: Job Scheduling Strategies for Parallel Processing, pages 27–40. Springer-Verlag, Lecture Notes in Computer Science LNCS 1162, 1996.

    Chapter  Google Scholar 

  10. D.A. Lifka, The ANL/IBM SP Scheduling System. In D.G. Feitelson and L. Rudolph, editors, IPPS’95 Workshop: Job Scheduling Strategies for Parallel Processing, pages 295–303. Springer-Verlag, Lecture Notes in Computer Science LNCS 949, 1995.

    Google Scholar 

  11. M.E. Rosenkrantz, D.J. Schneider, R. Leibensperger, M. Shore, and J. Zollweg. Requirements of the Cornell Theory Center for Resource Management and Process Scheduling. In D.G. Feitelson and L. Rudolph, editors, IPPS’95 Workshop: Job Scheduling Strategies for Parallel Processing, pages 304–318. Springer-Verlag, Lecture Notes in Computer Science LNCS 949, 1995.

    Google Scholar 

  12. W. Saphir, L.A. Tanner, and B. Traversat, Job Management Requirements for NAS Parallel Systems and Clusters. In D.G. Feitelson and L. Rudolph, editors, IPPS’95 Workshop: Job Scheduling Strategies for Parallel Processing, pages 319–337. r, Lecture Notes in Computer Science LNCS 949, 1995.

    Google Scholar 

  13. U. Schwiegelshohn. Preemptive weighted completion time scheduling of parallel jobs. In Proceedings of the 4th Annual European Symposium on Algorithms (ESA96), pages 39–51. Springer-Verlag Lecture Notes in Computer Science LNCS 1136, September 1996.

    Google Scholar 

  14. U. Schwiegelshohn, W. Ludwig, J.L. Wolf, J.J. Turek, and P. Yu, Smart SMART bounds for weighted response time scheduling. SIAM Journal on Computing, 28 (1):237–253, January 1999.

    Article  MathSciNet  Google Scholar 

  15. U. Schwiegelshohn and R. Yahyapour, Improving first-come-first-serve job scheduling by gang scheduling. In D.G. Feitelson and L. Rudolph, editors, IPPS’98 Workshop: Job Scheduling Strategies for Parallel Processing, pages 180–198. Springer-Verlag, Lecture Notes in Computer Science LNCS 1459, 1998.

    Chapter  Google Scholar 

  16. Uwe Schwiegelshohn and Ramin Yahyapour, Analysis of First-Come-First-Serve Parallel Job Scheduling. In Proceedings of the 9th SIAM Symposium on Discrete Algorithms, pages 629–638, January 1998.

    Google Scholar 

  17. Uwe Schwiegelshohn and Ramin Yahyapour, Resource Allocation and Scheduling in Metasystems. In Proceedings of the Distributed Computing and Metacomputing Workshop at HPCN Europe, April 1999. To appear in Springer-Verlag Lecture Notes in Computer Science.

    Google Scholar 

  18. D. Sleator and R.E. Tarjan, Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202–208, March 1985.

    Google Scholar 

  19. W. Smith, Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3:59–66, 1956.

    Article  MathSciNet  Google Scholar 

  20. R.E. Steuer, Multiple Criteria Optimization, Theory, Computation and Application. Wiley, New York, 1986.

    MATH  Google Scholar 

  21. J.J. Turek, U. Schwiegelshohn, J.L. Wolf, and P. Yu, Scheduling parallel tasks to minimize average response time. In Proceedings of the 5th SIAM Symposium on Discrete Algorithms, pages 112–121, January 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Engineering Institute, University Dortmund, 44221, Dortmund, Germany

    Jochen Krallmann, Uwe Schwiegelshohn & Ramin Yahyapour

Authors
  1. Jochen Krallmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Uwe Schwiegelshohn
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ramin Yahyapour
    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

Krallmann, J., Schwiegelshohn, U., Yahyapour, R. (1999). On the Design and Evaluation of Job Scheduling Algorithms. 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_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-47954-6_2

  • 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