Analysis of hard real-time communications
Real-Time Systems
Exact admission control for networks with a bounded delay service
IEEE/ACM Transactions on Networking (TON)
Prevention of task overruns in real-time non-preemptive multiprogramming systems
PERFORMANCE '80 Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation
Response Time Analysis for Tasks Scheduled under EDF within Fixed Priorities
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
| Hi-index | 0.00 |
In this paper, we focus on a non-preemptive scheduling, combining fixed priorities and dynamic priorities on a uniprocessor. This scheduling is called FP/DP. Results presented in this paper can be applied indifferently to tasks and flows. With any flow are associated a fixed priority denoting the importance degree of the flow and a temporal parameter, used to compute the dynamic priority. A packet can be transmitted only if there is no packet having a higher fixed priority and if this packet has the highest dynamic priority among all packets having its fixed priority. We are interested in the worst case response time of a sporadic flow set scheduled FP/DP and establish new results improving the classical FP analysis. Two examples of FP/DP scheduling are considered: FP/FIFO and FP/EDF. We show that FP/EDF dominates FP/FIFO when packets sharing the same fixed priority have the same processing time.