Towards provision of quality of service guarantees in job scheduling

Authors:
M. Islam;P. Balaji;P. Sadayappan;D. K. Panda
Affiliations:
Comput. Sci. & Eng., Ohio State Univ., Columbus, OH, USA;Comput. Sci. & Eng., Ohio State Univ., Columbus, OH, USA;Comput. Sci. & Eng., Ohio State Univ., Columbus, OH, USA;Comput. Sci. & Eng., Ohio State Univ., Columbus, OH, USA
Venue:
CLUSTER '04 Proceedings of the 2004 IEEE International Conference on Cluster Computing
Year:
2004

Citing 0
Cited 3

SLA-based admission control for a Software-as-a-Service provider in Cloud computing environments

Journal of Computer and System Sciences
Reward-based allocation of cluster and grid resources for imprecise computation model-based applications

International Journal of Web and Grid Services
Solidifying the foundations of the cloud for the next generation Software Engineering

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Considerable research has focused on the problem of scheduling dynamically arriving independent parallel jobs on a given set of resources. There has also been some recent work in the direction of providing differentiated service to different classes of jobs using statically or dynamically calculated priorities assigned to the jobs. However, the potential and usability of a quality of service based scheme has not been much studied. In This work, we extend a previously proposed scheme (QoPS) to provide quality of service to submitted jobs; we propose extensions to the algorithm in multiple aspects: (i) studying the effect of user tolerance towards missed deadlines on the overall profit attainable by the supercomputer center, (it) providing artificial slack to some jobs to maximize the overall profit and (hi) utilizing a kill-and-restart mechanism to further improve the profit attainable.