QoPS: A QoS Based Scheme for Parallel Job Scheduling | Zendy

M. Kamrul Islam | Zendy; Pavan Balaji | Zendy; P. Sadayappan | Zendy; D.K. Panda | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

QoPS: A QoS Based Scheme for Parallel Job Scheduling

Author(s) -

M. Kamrul Islam,

Pavan Balaji,

P. Sadayappan,

D.K. Panda

Publication year - 2003

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

DOI - 10.1007/10968987_13

Subject(s) - computer science , scheduling (production processes) , scheme (mathematics) , quality of service , distributed computing , job scheduler , admission control , parallel computing , computer network , mathematical optimization , mathematical analysis , mathematics , queue

Although job scheduling has been much studied, the is- sue 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 guaran- tees in the completion time to submitted independent paral- lel jobs. To the best of our knowledge, this scheme is the first one to implement admission control and guarantee dead- lines for admitted parallel jobs.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research