Probability analysis of fixed priority real-time task sets
Abstract
This paper describes probabilistic analysis of periodic real-time tasks with varying execution times. The analysis provides performance guarantees for task sets with total maximum processor utilization higher than a unit while the average utilization remains less than a unit. Each task may me pre-empted by a higher priority task and it has the deadline not greater than its period. The proposed algorithm is efficient in terms of memory and time.
Published
2003-08-22
How to Cite
Dashevsky, V. (2003). Probability analysis of fixed priority real-time task sets. Information and Control Systems, (4), 15-23. Retrieved from http://proceedings.spiiras.nw.ru/index.php/ius/article/view/14350
Issue
Section
System and process modeling