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.
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
D.G. Feitelson, Online Parallel Workloads Archive. Web-Archive, 1998. http://www.cs.huji.ac.il/labs/parallel/workload/.
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.
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.
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.
A. Feldmann, J. Sgall, and S.-H. Teng, Dynamic scheduling on parallel machines. Theoretical Computer Science, 130:49–72, 1994.
M. Garey and R.L. Graham, Bounds for multiprocessor scheduling with resource constraints. SIAM Journal on Computing, 4 (2):187–200, June 1975.
M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
J.L. Hennessy and D.A. Patterson, Computer Architecture A Quantitative Approach. Morgan Kaufmann, San Francisco, second edition, 1996.
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.
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.
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.
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.
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.
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.
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.
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.
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.
D. Sleator and R.E. Tarjan, Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202–208, March 1985.
W. Smith, Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3:59–66, 1956.
R.E. Steuer, Multiple Criteria Optimization, Theory, Computation and Application. Wiley, New York, 1986.
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.
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
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