The Non-Optimality of the Monotonic Priority Assignments for Hard Real-Time Offset Free Systems |
| |
Authors: | Goossens J Devillers R |
| |
Affiliation: | (1) Département d'Informatique, Université Libre de Bruxelles, CP 212, Boulevard du Triomphe, 1050 Brussels, Belgium |
| |
Abstract: | In this paper, we study the problem of scheduling hard real-time periodic tasks with static priority pre-emptive algorithms. We consider tasks which are characterized by a period, a hard deadline, a computation time and an offset (the time of the first request), where the offsets may be chosen by the scheduling algorithm, hence the denomination offset free systems.We study the rate monotonic and the deadline monotonic priority assignments for this kind of system and we compare the offset free systems and the asynchronous systems in terms of priority assignment. Hence, we show that the rate and the deadline monotonic priority assignments are not optimal for offset free systems. |
| |
Keywords: | hard real-time scheduling periodic task set static priority pre-emptive algorithm synchronous system asynchronous system rate monotonic scheduler deadline monotonic scheduler feasibility interval |
本文献已被 SpringerLink 等数据库收录! |
|