By Topic

Worst Case Response Time Analysis of Sporadic Graph Tasks with EDF Scheduling on a Uniprocessor

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

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

Published in:

Embedded and Real-Time Computing Systems and Applications, 2006. Proceedings. 12th IEEE International Conference on

Date of Conference:

0-0 0