QoPS: A QoS based scheme for parallel job scheduling

23Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Islam, M., Balaji, P., Sadayappan, P., & Panda, D. K. (2003). QoPS: A QoS based scheme for parallel job scheduling. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2862, 252–268. https://doi.org/10.1007/10968987_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free