By Topic

Feasibility analysis of recurring branching tasks

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

1 Author(s)
S. K. Baruah ; Vermont Univ., Burlington, VT, USA

A new model for hard-real-time tasks-the recurring branching task model-is introduced, which is capable of modelling some restricted forms of conditional real-time process code. This model generalizes earlier models such as the sporadic task model and the generalized multiframe task model. It is shown that feasibility analysis in this model-determining whether a system of several recurring branching tasks that share a processor can all be scheduled to always meet all deadlines-can be performed efficiently, in pseudo-polynomial time

Published in:

Real-Time Systems, 1998. Proceedings. 10th Euromicro Workshop on

Date of Conference:

17-19 Jun 1998