TY - GEN
T1 - Feasibility analysis of recurring branching tasks
AU - Baruah, Sanjoy K.
PY - 1998
Y1 - 1998
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/35348848599
U2 - 10.1109/EMWRTS.1998.685078
DO - 10.1109/EMWRTS.1998.685078
M3 - Conference contribution
AN - SCOPUS:35348848599
SN - 0818685034
SN - 9780818685033
T3 - Proceedings - Euromicro Conference on Real-Time Systems
SP - 138
EP - 145
BT - Proceedings - 10th Euromicro Workshop on Real-Time Systems, ECRTS 1998
T2 - 10th Euromicro Workshop on Real-Time Systems, ECRTS 1998
Y2 - 17 June 1998 through 19 June 1998
ER -