Title :
Worst Case Response Time Analysis of Sporadic Graph Tasks with EDF Scheduling on a Uniprocessor
Author :
Zhao, Hui Xue ; George, Laurent ; Midonnet, Serge
Author_Institution :
ESIGETEL, Avon
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
Keywords :
graph theory; processor scheduling; real-time systems; earliest deadline first scheduling; preemptive hard real-time scheduling; sporadic graph task scheduling; uniprocessor scheduling; worst case response time analysis; Computer aided software engineering; Delay; Processor scheduling; Scheduling algorithm;
Conference_Titel :
Embedded and Real-Time Computing Systems and Applications, 2006. Proceedings. 12th IEEE International Conference on
Conference_Location :
Sydney, Qld.
Print_ISBN :
0-7695-2676-4
DOI :
10.1109/RTCSA.2006.65
