Advertisement

On the Design and Evaluation of Job Scheduling Algorithms

  • Jochen Krallmann
  • Uwe Schwiegelshohn
  • Ramin Yahyapour
Conference paper
Part of the Lecture Notes in Computer Science book series (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.

Keywords

Schedule Algorithm Schedule Policy Average Response Time Schedule System List Schedule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D.G. Feitelson, Online Parallel Workloads Archive. Web-Archive, 1998. http://www.cs.huji.ac.il/labs/parallel/workload/.
  2. 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. 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.CrossRefGoogle Scholar
  4. 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. 5.
    A. Feldmann, J. Sgall, and S.-H. Teng, Dynamic scheduling on parallel machines. Theoretical Computer Science, 130:49–72, 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    M. Garey and R.L. Graham, Bounds for multiprocessor scheduling with resource constraints. SIAM Journal on Computing, 4 (2):187–200, June 1975.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 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. 8.
    J.L. Hennessy and D.A. Patterson, Computer Architecture A Quantitative Approach. Morgan Kaufmann, San Francisco, second edition, 1996.zbMATHGoogle Scholar
  9. 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.CrossRefGoogle Scholar
  10. 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. 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. 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. 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. 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.CrossRefMathSciNetGoogle Scholar
  15. 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.CrossRefGoogle Scholar
  16. 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. 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. 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. 19.
    W. Smith, Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3:59–66, 1956.CrossRefMathSciNetGoogle Scholar
  20. 20.
    R.E. Steuer, Multiple Criteria Optimization, Theory, Computation and Application. Wiley, New York, 1986.zbMATHGoogle Scholar
  21. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Jochen Krallmann
    • 1
  • Uwe Schwiegelshohn
    • 1
  • Ramin Yahyapour
    • 1
  1. 1.Computer Engineering InstituteUniversity DortmundDortmundGermany

Personalised recommendations