Name
Title | ||
|---|---|---|
Worst Case Response Time Analysis of Sporadic Graph Tasks with EDF Scheduling on a Uniprocessor |
Abstract | ||
|---|---|---|
This paper considers the problem of preemptive hard real-time scheduling of sporadic graph tasks on a uniprocessor with Earliest Deadline First (EDF). A sporadic graph task associated to an application is characterized by a set of subtasks under precedence constraints with deadline constraints. We study feasibility conditions based on the computation of the worst case response time of any subtask of a graph task. We investigate the late deadline constraint. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/RTCSA.2006.65 | RTCSA |
Keywords | Field | DocType |
preemptive hard real-time scheduling,late deadline constraint,deadline constraint,sporadic graph task,graph task,edf scheduling,worst case response time,feasibility condition,earliest deadline first,precedence constraint,sporadic graph tasks,graph theory,real time systems,earliest deadline first scheduling | Fixed-priority pre-emptive scheduling,Uniprocessor system,Computer science,Deadline-monotonic scheduling,Parallel computing,Real-time computing,Priority inversion,Least slack time scheduling,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-7695-2676-4 | 2 | 0.51 |
References | Authors | |
12 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hui Xue Zhao | 1 | 6 | 2.43 |
| Laurent George | 2 | 214 | 29.39 |
| Serge Midonnet | 3 | 77 | 13.13 |