By Topic

Worst case response time analysis of sporadic graph tasks with fixed priority 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
$33 $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)
Hui Xue Zhao ; ESIGETEL, Avon, France ; S. Midonnet ; L. George

This paper considers the problem of hard real-time fixed priority scheduling of sporadic graph tasks on a uniprocessor. We study feasibility conditions based on the computation of the worst case response times of the graph tasks. A sporadic graph task associated to an application is characterized by a set of subtasks under precedence constraints. We investigate the late deadline constraint. We extend already published papers established in the preemptive case to the nonpreemptive case and to the hybrid case of an application composed of preemptive and nonpreemptive subtasks.

Published in:

11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05)

Date of Conference:

17-19 Aug. 2005