Dynamic scheduling of parallel real-time jobs by modelling spare capabilities in heterogeneous clusters

Ligang He; Stephen A. Jarvis; Daniel P. Spooner; Graham R. Nudd

doi:10.1109/CLUSTR.2003.1253293

Dynamic scheduling of parallel real-time jobs by modelling spare capabilities in heterogeneous clusters

Ligang He, Stephen A. Jarvis, Daniel P. Spooner, Graham R. Nudd

Engineering and Physical Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

25 Citations (Scopus)

Abstract

In this research, a scenario is assumed where periodic real-time jobs are being run on a heterogeneous cluster of computers, and new aperiodic parallel real-time jobs, modelled by Directed Acyclic Graphs (DAG), arrive at the system dynamically. In the scheduling scheme presented in this paper, a global scheduler situated within the cluster schedules new jobs onto the computers by modelling their spare capabilities left by existing periodic jobs. Admission control is introduced so that new jobs are rejected if their deadlines cannot be met under the precondition of still guaranteeing the real-time requirements of existing jobs. Each computer within the cluster houses a local scheduler, which uniformly schedules both periodic job instances and the subtasks in the parallel realtime jobs using an Early Deadline First policy. The modelling of the spare capabilities is optimal in the sense that once a new task starts running on a computer, it will utilize all the spare capability left by the periodic real-time jobs and its finish time is the earliest possible. The performance of the proposed modelling approach and scheduling scheme is evaluated by extensive simulation; results show that the system utilization is significantly enhanced, while the real-time requirements of the existing jobs remain guaranteed^∗.

Original language	English
Title of host publication	Proceedings - IEEE International Conference on Cluster Computing, CLUSTER 2003
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	2-10
Number of pages	9
ISBN (Electronic)	0769520669
DOIs	https://doi.org/10.1109/CLUSTR.2003.1253293
Publication status	Published - 2003
Event	IEEE International Conference on Cluster Computing, CLUSTER 2003 - Hong Kong, China Duration: 1 Dec 2003 → 4 Dec 2003

Publication series

Name	Proceedings - IEEE International Conference on Cluster Computing, ICCC
Volume	2003-January
ISSN (Print)	1552-5244

Conference

Conference	IEEE International Conference on Cluster Computing, CLUSTER 2003
Country/Territory	China
City	Hong Kong
Period	1/12/03 → 4/12/03

Bibliographical note

Publisher Copyright:
© 2003 IEEE.

ASJC Scopus subject areas

Software
Hardware and Architecture
Signal Processing

Access to Document

10.1109/CLUSTR.2003.1253293

Cite this

He, L., Jarvis, S. A., Spooner, D. P., & Nudd, G. R. (2003). Dynamic scheduling of parallel real-time jobs by modelling spare capabilities in heterogeneous clusters. In Proceedings - IEEE International Conference on Cluster Computing, CLUSTER 2003 (pp. 2-10). [1253293] (Proceedings - IEEE International Conference on Cluster Computing, ICCC; Vol. 2003-January). Institute of Electrical and Electronics Engineers (IEEE). https://doi.org/10.1109/CLUSTR.2003.1253293

He, Ligang ; Jarvis, Stephen A. ; Spooner, Daniel P. et al. / Dynamic scheduling of parallel real-time jobs by modelling spare capabilities in heterogeneous clusters. Proceedings - IEEE International Conference on Cluster Computing, CLUSTER 2003. Institute of Electrical and Electronics Engineers (IEEE), 2003. pp. 2-10 (Proceedings - IEEE International Conference on Cluster Computing, ICCC).

@inproceedings{3fa1fd354bdb4238879de31a94dc4b26,

title = "Dynamic scheduling of parallel real-time jobs by modelling spare capabilities in heterogeneous clusters",

abstract = "In this research, a scenario is assumed where periodic real-time jobs are being run on a heterogeneous cluster of computers, and new aperiodic parallel real-time jobs, modelled by Directed Acyclic Graphs (DAG), arrive at the system dynamically. In the scheduling scheme presented in this paper, a global scheduler situated within the cluster schedules new jobs onto the computers by modelling their spare capabilities left by existing periodic jobs. Admission control is introduced so that new jobs are rejected if their deadlines cannot be met under the precondition of still guaranteeing the real-time requirements of existing jobs. Each computer within the cluster houses a local scheduler, which uniformly schedules both periodic job instances and the subtasks in the parallel realtime jobs using an Early Deadline First policy. The modelling of the spare capabilities is optimal in the sense that once a new task starts running on a computer, it will utilize all the spare capability left by the periodic real-time jobs and its finish time is the earliest possible. The performance of the proposed modelling approach and scheduling scheme is evaluated by extensive simulation; results show that the system utilization is significantly enhanced, while the real-time requirements of the existing jobs remain guaranteed∗.",

author = "Ligang He and Jarvis, {Stephen A.} and Spooner, {Daniel P.} and Nudd, {Graham R.}",

note = "Publisher Copyright: {\textcopyright} 2003 IEEE.; IEEE International Conference on Cluster Computing, CLUSTER 2003 ; Conference date: 01-12-2003 Through 04-12-2003",

year = "2003",

doi = "10.1109/CLUSTR.2003.1253293",

language = "English",

series = "Proceedings - IEEE International Conference on Cluster Computing, ICCC",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

pages = "2--10",

booktitle = "Proceedings - IEEE International Conference on Cluster Computing, CLUSTER 2003",

}

He, L, Jarvis, SA, Spooner, DP & Nudd, GR 2003, Dynamic scheduling of parallel real-time jobs by modelling spare capabilities in heterogeneous clusters. in Proceedings - IEEE International Conference on Cluster Computing, CLUSTER 2003., 1253293, Proceedings - IEEE International Conference on Cluster Computing, ICCC, vol. 2003-January, Institute of Electrical and Electronics Engineers (IEEE), pp. 2-10, IEEE International Conference on Cluster Computing, CLUSTER 2003, Hong Kong, China, 1/12/03. https://doi.org/10.1109/CLUSTR.2003.1253293

Dynamic scheduling of parallel real-time jobs by modelling spare capabilities in heterogeneous clusters. / He, Ligang; Jarvis, Stephen A.; Spooner, Daniel P. et al.

Proceedings - IEEE International Conference on Cluster Computing, CLUSTER 2003. Institute of Electrical and Electronics Engineers (IEEE), 2003. p. 2-10 1253293 (Proceedings - IEEE International Conference on Cluster Computing, ICCC; Vol. 2003-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Dynamic scheduling of parallel real-time jobs by modelling spare capabilities in heterogeneous clusters

AU - He, Ligang

AU - Jarvis, Stephen A.

AU - Spooner, Daniel P.

AU - Nudd, Graham R.

PY - 2003

Y1 - 2003

N2 - In this research, a scenario is assumed where periodic real-time jobs are being run on a heterogeneous cluster of computers, and new aperiodic parallel real-time jobs, modelled by Directed Acyclic Graphs (DAG), arrive at the system dynamically. In the scheduling scheme presented in this paper, a global scheduler situated within the cluster schedules new jobs onto the computers by modelling their spare capabilities left by existing periodic jobs. Admission control is introduced so that new jobs are rejected if their deadlines cannot be met under the precondition of still guaranteeing the real-time requirements of existing jobs. Each computer within the cluster houses a local scheduler, which uniformly schedules both periodic job instances and the subtasks in the parallel realtime jobs using an Early Deadline First policy. The modelling of the spare capabilities is optimal in the sense that once a new task starts running on a computer, it will utilize all the spare capability left by the periodic real-time jobs and its finish time is the earliest possible. The performance of the proposed modelling approach and scheduling scheme is evaluated by extensive simulation; results show that the system utilization is significantly enhanced, while the real-time requirements of the existing jobs remain guaranteed∗.

AB - In this research, a scenario is assumed where periodic real-time jobs are being run on a heterogeneous cluster of computers, and new aperiodic parallel real-time jobs, modelled by Directed Acyclic Graphs (DAG), arrive at the system dynamically. In the scheduling scheme presented in this paper, a global scheduler situated within the cluster schedules new jobs onto the computers by modelling their spare capabilities left by existing periodic jobs. Admission control is introduced so that new jobs are rejected if their deadlines cannot be met under the precondition of still guaranteeing the real-time requirements of existing jobs. Each computer within the cluster houses a local scheduler, which uniformly schedules both periodic job instances and the subtasks in the parallel realtime jobs using an Early Deadline First policy. The modelling of the spare capabilities is optimal in the sense that once a new task starts running on a computer, it will utilize all the spare capability left by the periodic real-time jobs and its finish time is the earliest possible. The performance of the proposed modelling approach and scheduling scheme is evaluated by extensive simulation; results show that the system utilization is significantly enhanced, while the real-time requirements of the existing jobs remain guaranteed∗.

UR - http://www.scopus.com/inward/record.url?scp=84944903664&partnerID=8YFLogxK

U2 - 10.1109/CLUSTR.2003.1253293

DO - 10.1109/CLUSTR.2003.1253293

M3 - Conference contribution

AN - SCOPUS:84944903664

T3 - Proceedings - IEEE International Conference on Cluster Computing, ICCC

SP - 2

EP - 10

BT - Proceedings - IEEE International Conference on Cluster Computing, CLUSTER 2003

PB - Institute of Electrical and Electronics Engineers (IEEE)

T2 - IEEE International Conference on Cluster Computing, CLUSTER 2003

Y2 - 1 December 2003 through 4 December 2003

ER -

He L, Jarvis SA, Spooner DP, Nudd GR. Dynamic scheduling of parallel real-time jobs by modelling spare capabilities in heterogeneous clusters. In Proceedings - IEEE International Conference on Cluster Computing, CLUSTER 2003. Institute of Electrical and Electronics Engineers (IEEE). 2003. p. 2-10. 1253293. (Proceedings - IEEE International Conference on Cluster Computing, ICCC). doi: 10.1109/CLUSTR.2003.1253293

Dynamic scheduling of parallel real-time jobs by modelling spare capabilities in heterogeneous clusters

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this