An Experimental Analysis of DAG Scheduling Methods in Hard Real-time Multiprocessor Systems

Abstract : The scheduling of real-time parallel tasks on multiprocessor systems is more complicated than the one of independent sequential tasks, specially for the Directed Acyclic Graph (DAG) parallel model. The complexity is due to the structure of the DAG tasks and the precedence constraints between their subtasks. The trivial DAG scheduling method is to apply directly common real-time scheduling algorithms despite their lack of compatibility with the parallel model. Another scheduling method called the stretching method is summarized as converting each parallel DAG task in the set into a collection of independent sequential threads that are easier to be scheduled. In this paper, we are interested in analyzing global preemptive scheduling of DAGs using both methods by showing that both methods are not comparable in the case of using Deadline Monotonic (DM) and Earliest Deadline First (EDF) scheduling algorithms. Then we use extensive simulations to compare and analyze their performance.
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-01056134
Contributor : Manar Qamhieh <>
Submitted on : Wednesday, December 3, 2014 - 5:35:27 PM
Last modification on : Wednesday, July 4, 2018 - 4:38:02 PM
Long-term archiving on : Tuesday, April 11, 2017 - 7:39:22 PM

File

Qamhieh_RACS2014.pdf
Files produced by the author(s)

Identifiers

Citation

Manar Qamhieh, Serge Midonnet. An Experimental Analysis of DAG Scheduling Methods in Hard Real-time Multiprocessor Systems. Research in Adaptive and Convergent Systems, RACS '14; ACM, Oct 2014, Towson, Maryland, United States. pp.284-290, ⟨10.1145/2663761.2664236⟩. ⟨hal-01056134⟩

Share

Metrics

Record views

407

Files downloads

438