This tutorial style review provides an in-depth assessment of priority assignment techniques for hard real-time systems scheduled using fixed priorities.
Most of the exceptions have programmable priority, and a few have fixed priority.
In this paper, we consider the standby-sparing technique for fixed-priority periodic real-time tasks.
Some of the exceptions (reset, NMI, and hard fault) have fixed priority levels.
In this paper we present a new heuristic for adversary simulators specifically designed for fixed-priority zero-laxity (FPZL) scheduling.
The ASAP algorithm executes tasks as soon as possible, and it is equal to the scheduling of fixed-priority preemption.
Three sporadic servers are discussed in this chapter: a naive server Φ0s, a fixed-priority server Φsf, and a dynamic-priority server Φsd.
Our evaluation results show that a finer-grained, thread-level fixed-priority assignment, when properly assigned, significantly improves schedulability, compared to a coarser-grained, task-level assignment.
This paper presents an extension to the Palladio Component Model (PCM), together with a new performance analysis infrastructure that supports the fixed-priority preemptive scheduling policy.
Chandarli et al. [23] proposed an ALAP scheduling algorithm, and it was a fixed-priority scheduling policy that delayed the executions of jobs as long as possible.
