Static-priority scheduling of multiframe tasks

Exact scheduling analysis of non-accumulatively monotonic multiframe tasks

“…3, 4, 6, 7, 8, 6, 8 10 high τ 2 5, 6, 7, 10 40 medium τ 3 1, 2, 3 60 low Table 7. System Example Firstly, we present all possible response times of τ 3 assuming there is no RJ for any tasks in the system.…”

“…3, 4, 6, 8, 7, 5 10 high τ 2 5, 6, 10, 7 40 medium τ 3 1, 2, 3 60 low Table 3. System Example Without the critical frame concept, we have to evaluate the response time of τ 3 over all possible frames of the higher priority tasks τ 1 and τ 2 ; which means we had to do 24 evaluations.…”

“…Baruah et al [2] used the response time analysis to give a tractable but sufficient schedulability test for a system of MF tasks. They merged the execution time sequences of the MF tasks taking into account the maximum amount of interference that higher priority MF tasks provide.…”

System-Level Modelling and Design Space Exploration for Multiprocessor Embedded System-on-Chip Architectures

“…Hence, the online scheduling problem on uniprocessors is completely solved, we can always schedule using EDF. On the other hand, analysis of static priority scheduling yields two problems [8]:…”

Sufficient Real-Time Analysis for an Engine Control Unit with Constant Angular Velocities

“…Among them are the multiframe task model [1], its generalized form [2], the recurring real-time task model [3], and the currently most general model, the digraph task model [4]. The digraph task model describes a task with a directed graph.…”