Title :
Worst Case Response Time Analysis of Sporadic Task Graphs with EDF Non-preemptive Scheduling on a Uniprocessor
Author :
Zhao, HuiXue ; George, Laurent ; Midonnet, Serge
Author_Institution :
LISSI-Univ. Paris 12, Paris
Abstract :
This paper considers the problem of non-preemptive hard realtime scheduling of sporadic task graphs on a uniprocessor with earliest deadline first (EDF) scheduling. A sporadic task graph 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 times of any subtask of a task graph. We investigate the late deadline constraint.
Keywords :
graph theory; real-time systems; scheduling; EDF nonpreemptive uniprocessor scheduling; deadline constraints; earliest deadline first scheduling; precedence constraints; sporadic task graphs; worst case response time analysis; Delay; Kernel; Processor scheduling; Scheduling algorithm; EDF; feasibility analysis; non-preemptive; precedence constraint; real-time; worst case response time.;
Conference_Titel :
Autonomic and Autonomous Systems, 2007. ICAS07. Third International Conference on
Conference_Location :
Athens
Print_ISBN :
978-0-7695-2859-7
Electronic_ISBN :
978-0-7695-2859-7
DOI :
10.1109/CONIELECOMP.2007.115
