Scheduling in HPC Resource Management Systems: Queuing vs. Planning

M. Hovestadt, O. Kao, A. Keller, A. Streit, in:, Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP), Berlin / Heidelberg, 2003, pp. 1–20.

Download
No fulltext has been uploaded.
Conference Paper | Published | English
Author
; ; ;
Abstract
Nearly all existing HPC systems are operated by resource management systems based on the queuing approach. With the increasing acceptance of grid middleware like Globus, new requirements for the underlying local resource management systems arise. Features like advanced reservation or quality of service are needed to implement high level functions like co-allocation. However it is difficult to realize these features with a resource management system based on the queuing concept since it considers only the present resource usage. In this paper we present an approach which closes this gap. By assigning start times to each resource request, a complete schedule is planned. Advanced reservations are now easily possible. Based on this planning approach functions like diffuse requests, automatic duration extension, or service level agreements are described. We think they are useful to increase the usability, acceptance and performance of HPC machines. In the second part of this paper we present a planning based resource management system which already covers some of the mentioned features.
Publishing Year
Proceedings Title
Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP)
Volume
2862
Page
1-20
LibreCat-ID

Cite this

Hovestadt M, Kao O, Keller A, Streit A. Scheduling in HPC Resource Management Systems: Queuing vs. Planning. In: Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP).Vol 2862. Lecture Notes in Computer Science. Berlin / Heidelberg; 2003:1-20. doi:10.1007/10968987_1.
Hovestadt, M., Kao, O., Keller, A., & Streit, A. (2003). Scheduling in HPC Resource Management Systems: Queuing vs. Planning. In Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP) (Vol. 2862, pp. 1–20). Berlin / Heidelberg. http://doi.org/10.1007/10968987_1
@inbook{Hovestadt_Kao_Keller_Streit_2003, place={Berlin / Heidelberg}, series={Lecture Notes in Computer Science}, title={Scheduling in HPC Resource Management Systems: Queuing vs. Planning}, volume={2862}, DOI={10.1007/10968987_1}, booktitle={Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP)}, author={Hovestadt, Matthias and Kao, Odej and Keller, Axel and Streit, Achim}, year={2003}, pages={1–20}, collection={Lecture Notes in Computer Science}}
Hovestadt, Matthias, Odej Kao, Axel Keller, and Achim Streit. “Scheduling in HPC Resource Management Systems: Queuing vs. Planning.” In Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP), 2862:1–20. Lecture Notes in Computer Science. Berlin / Heidelberg, 2003. doi:10.1007/10968987_1.
M. Hovestadt, O. Kao, A. Keller, and A. Streit, “Scheduling in HPC Resource Management Systems: Queuing vs. Planning,” in Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP), 2003, vol. 2862, pp. 1–20.
Hovestadt, Matthias et al. “Scheduling in HPC Resource Management Systems: Queuing vs. Planning.” Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP). Vol. 2862. Berlin / Heidelberg: N.p., 2003. 1–20. Web. Lecture Notes in Computer Science.

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar