How to Design a Job Scheduling Algorithm
We discuss design aspects of job scheduling algorithms in parallel processing systems. Starting from the observation that in this area the impact of most research publications on real systems is negligible, we first identify three main categories with strong relevance to practical implementations: constraints, objectives, and evaluation. For each category, we describe common aspects of real systems that are presently important and then introduce some general rules that should be followed when presenting a new job scheduling algorithm for parallel processing systems. To apply these rules, we use as an example a new method for the Infrastructure-as-a-Service (IaaS) model of Cloud Computing that extends the spot instance approach of Amazon. In particular we address technical, organizational, and usage constraints based on existing concepts and research results for this example. Then we briefly describe scheduling objectives from the viewpoint of a data center offering IaaS. After presenting our algorithmic concept, we provide an evaluation with theoretical means to demonstrate that this approach can also yield meaningful results in practice.
KeywordsData Center Physical Resource Context Switching Virtual Resource Service Guarantee
The author would like to thank Carsten Franke from ABB, Switzerland for providing information on current power management problems and approaches in data centers.
- 4.Feitelson, D.G.: Looking at data. In: 22nd IEEE International Symposium on Parallel and Distributed Processing IPDPS, Miami, Florida USA, pp. 1–9. IEEE (2008)Google Scholar
- 6.Goldwasser, M.H.: Patience is a virtue: the effect of slack on competitiveness for admission control. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, Philadelphia, PA, USA, pp. 396–405. Society for Industrial and Applied Mathematics (1999)Google Scholar
- 8.Ibrahim, M., Gondipalli, S., Bhopte, S., Sammakia, B., Murray, B., Ghose, K., Iyengar, M.K., Schmidt, R.: Numerical modeling approach to dynamic data center cooling. In: 2010 12th IEEE Intersociety Conference on Thermal and Thermomechanical Phenomena in Electronic Systems (ITherm), pp. 1–7 (2010)Google Scholar
- 9.Kaplan, J.M., Forrest, W., Kindler, N.: Revolutionizing data center energy efficiency. Technical report, McKinsey & Company (2008)Google Scholar
- 14.Mars, J., Tang, L., Hundt, R., Skadron, K., Souffa, M.L.: Bubble-up: invreasing utilization in modern warehouse scale computers via sensible co-locations. In: Proceedings of the 44th Annual IEEE/ACM International Symposium on Microarchitecture, New York, NY, USA (2011)Google Scholar
- 16.Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems, 4th edn. Springer, Heidelberg (2010) Google Scholar