Skip to Main Content
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.
Date of Conference: 19-25 June 2007