Title :
Feasibility analysis of recurring branching tasks
Author :
Baruah, Sanjoy K.
Author_Institution :
Vermont Univ., Burlington, VT, USA
Abstract :
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
Keywords :
processor scheduling; real-time systems; system monitoring; conditional real-time process code; feasibility analysis; generalized multiframe task model; hard real-time task; pseudo-polynomial time; recurring branching tasks; sporadic task model; Character generation; Costs; Performance analysis; Processor scheduling; Real time systems; Scheduling algorithm; Time sharing computer systems;
Conference_Titel :
Real-Time Systems, 1998. Proceedings. 10th Euromicro Workshop on
Conference_Location :
Berlin
Print_ISBN :
0-8186-8503-4
DOI :
10.1109/EMWRTS.1998.685078