Abstract
Although job scheduling has been much studied, the issue of providing deadline guarantees in this context has not been addressed. In this paper, we propose a new scheme, termed as QoPS to provide Quality of Service (QoS) in the response time given to the end user in the form of guarantees in the completion time to submitted independent parallel jobs. To the best of our knowledge, this scheme is the first one to implement admission control and guarantee deadlines for admitted parallel jobs.
This research was supported in part by NSF grants #CCR-0204429 and #EIA- 9986052
This is a preview of subscription content, log in via an institution to check access.
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
NERSC, http://hpcf.nersc.gov/accounts/priority_charging.html
Chiang, S.-H., Vernon, M.K.: Production Job Scheduling for Parallel Shared Memory Systems. In: the Proceedings of the IEEE International Parallel and Distributed Processing Symposium (April 2001)
Cirne, W., Berman, F.: Adaptive Selection of Partition Size of Supercomputer Requests. In: the Proceedings of 6th workshop on Job Scheduling Strategies for Parallel Processing (April 2000)
Feitelson, D., Rudolph, L., Schwiegelshohn, U., Sevcik, K.C., Wong, P.: 1997. In: The Proceedings of IEEE Workshop on Job Scheduling Strategies for Parallel Processing (1997)
Feitelson, D.G.: Parallel Workloads Archive, http://www.cs.huji.ac.il/labs/parallel/workload/
Holenarsipur, P., Yarmolenko, V., Duato, J., Panda, D.K., Sadayappan, P.: Characterization and Enhancement of Static Mapping Heuristics for Heterogeneous Systems. In: Prasanna, V.K., Vajapeyam, S., Valero, M. (eds.) HiPC 2000. LNCS, vol. 1970, p. 37. Springer, Heidelberg (2000)
Islam, M., Balaji, P., Sadayappan, P., Panda, D.K.: QoPS: A QoS based scheme for Parallel Job Scheduling. Technical report, The Ohio State University, Columbus, OH (April 2003)
Jackson, B., Haymore, B., Facelli, J., Snell, Q.O.: Improving Cluster Utilization Through Set Based Allocation Policies. In: IEEE Workshop on Scheduling and Resource Management for Cluster Computing (September 2001)
Keleher, P., Zotkin, D., Perkovic, D.: Attacking the Bottlenecks in Backfilling Schedulers. In: Cluster Computing: The Journal of Networks, Software Tools and Applications (March 2000)
Mok, A.K.: Fundamental design problems of distributed systems for the hard realtime environment. PhD thesis, Massachussetts Institute of Technology, Cambridge, MA (May 1983)
Mok, A.K.: The design of real-time programming systems based on process models. In: The Proceedings of IEEE Real Time Systems Symposium (December 1984)
Mok, A.K., Dertouzos, M.L.: Multi-Processor Scheduling in a Hard Real-Time Environment. In: The Proceedings of the Seventh Texas Conference on Computing Systems (November 1978)
Mualem, A.W., Feitelson, D.G.: Utilization, Predictability, Workloads and User Estimated Runtime Esti mates in Scheduling the IBM SP2 with Backfilling. IEEE Transactions on Parallel and Distributed Systems 12(6) (June 2001)
Perkovic, D., Keleher, P.: Randomization, Speculation and Adaptation in Batch Schedulers. In: The Proceedings of the IEEE International Conference on Super-computing (November 2000)
Ramamritham, K., Stankovic, J.A., Shiah, P.-F.: Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems. IEEE Transactions on Parallel and Distributed Systems 1(2) (April 1990)
Talby, D., Feitelson, D.G.: Supporting Priorities and Improving Utilization of the IBM SP2 scheduler using Slack Based Backfilling. In: The Proceedings of the 13th Intl. Parallel Processing Symposium, pp. 513-51 (April 1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Islam, M., Balaji, P., Sadayappan, P., Panda, D.K. (2003). QoPS: A QoS Based Scheme for Parallel Job Scheduling. In: Feitelson, D., Rudolph, L., Schwiegelshohn, U. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 2003. Lecture Notes in Computer Science, vol 2862. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10968987_13
Download citation
DOI: https://doi.org/10.1007/10968987_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20405-3
Online ISBN: 978-3-540-39727-4
eBook Packages: Springer Book Archive