Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Keywords |
|---|---|---|
2006 | J. Embedded Computing | priority schedulability,quality of service,higher fixed priority,classical fp analysis,fixed priority scheduling,real-time scheduling,dp scheduling,sporadic flow,dynamic priority scheduling,non-preemptive scheduling,dynamic priority,fixed priority,secondary criterion,highest dynamic priority,deterministic guarantee,processing time,worst case response time |
Field | DocType | Volume |
Priority ceiling protocol,Fixed-priority pre-emptive scheduling,Computer science,Parallel computing,Deadline-monotonic scheduling,Real-time computing,Priority inversion,Priority inheritance,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling | Journal | 2 |
Issue | Citations | PageRank |
3 | 3 | 0.86 |
References | Authors | |
6 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Steven Martin | 1 | 3 | 0.86 |
| Pascale Minet | 2 | 759 | 92.50 |
| Laurent George | 3 | 214 | 29.39 |