An extendible approach for analyzing fixed priority hard real-time tasks
Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Scheduling of Offset Free Systems
Real-Time Systems
Minimal schedulability interval for real-time systems of periodic tasks with offsets
Theoretical Computer Science
Journal of Systems Architecture: the EUROMICRO Journal
General Response Time Computation for the Deadline Driven Scheduling of Periodic Tasks
Fundamenta Informaticae
Feasibility interval for the transactional event handlers of P-FRP
Journal of Computer and System Sciences
Best-case response times and jitter analysis of real-time tasks with arbitrary deadlines
Proceedings of the 21st International conference on Real-Time Networks and Systems
Hi-index | 0.00 |
In this paper, we study the problem of scheduling hardreal-time periodic tasks with static priority pre-emptive algorithms.We consider tasks which are characterized by a period, a harddeadline, a computation time and an offset (the time of the firstrequest), where the offsets may be chosen by the scheduling algorithm,hence the denomination offset free systems. We study the ratemonotonic and the deadline monotonic priority assignments forthis kind of system and we compare the offset free systems andthe asynchronous systems in terms of priority assignment. Hence,we show that the rate and the deadline monotonic priority assignmentsare not optimal for offset free systems.