Paper Info
Title
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 pre-emptive 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. A category with the (minimum) three required fields
Year
DOI
Venue
2014
10.1145/2663761.2664236
RACS
Keywords
Field
DocType
parallelism and concurrency,experimentation,real-time scheduling,dm and edf scheduling algorithms,parallel tasks,real time,global preemptive scheduling,directed acyclic graphs
Fixed-priority pre-emptive scheduling,Multiprocessor scheduling,Fair-share scheduling,Computer science,Parallel computing,Real-time computing,Two-level scheduling,Least slack time scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling
Conference
Volume
Issue
ISSN
14
4
1559-6915
Citations 
PageRank 
References 
0
0.34
9
Authors
2
Name
Order
Citations
PageRank
Manar Qamhieh1393.27
Serge Midonnet27713.13