Commit faf1bd5d by Jonas Künzli Committed by overleaf

### Update on Overleaf.

parent f6c68675
 ... ... @@ -141,16 +141,18 @@ Task must finish execution within its deadline and not later than the maximum st \end{tabularx} \\ \begin{definition}{Model of Periodic Tasks} \begin{compactenum} \begin{compactitem} \item $\Gamma$: denotes a set of periodic tasks \item $\tau_i$: denotes a periodic task \item $\tau_{i,j}$ \item Set $d^*_i = \min\{d_i, \min_{j}\{d^*_j-C_j: J_i \rightarrow J_j\}\}$ \item Return to 2 \end{compactenum} \item $\tau_{i,j}$ : denotes the $j$th instance of task $i$ \item $r_{i,j}, s_{i,j}, f_{i,j}, d_{i,j}$: denote the release time, start time, finishing time, absolute deadline of the $j$th instance of task $i$ \item $\Phi_i$: denotes the phase of task $i$ (release time of its first instance) \item $D_i$: denotes the relative deadline of task $i$ \item $T_i$: denotes the period of task $i$ \end{compactitem} \end{definition} \ownsubsection{Rate Monotonic Scheduling (4-23)} \ownsubsection{Rate Monotonic Scheduling (6-37)} Fixed / static priorities, independent, preemptive, deadlines equal the periods, $D_i=T_i$. Tasks can't suspend themselves, kernel overhead is assumed 0. \textbf{Algorithm:} Tasks with the higher request rates (=shorter periods) have higher priorities and interrupt tasks with lower priority. RM is optimal w.r.t. schedulability. ... ... @@ -166,7 +168,7 @@ As a sufficient and necessary test, you can simulate it or do algorithm of DM se \textbf{Critical Instant}: The time at which the release of the task will produce the largest response time. It is if that task is simultaneously released with all higher priority tasks. $\implies$ If there are no phase shifts, simulate the beginning (till all deadlines have passed). If that works, the schedule is feasible. \ownsubsection{Deadline Monotonic Scheduling (4-35)} \ownsubsection{Deadline Monotonic Scheduling (6-49)} Fixed / static priorities, independent, preemptive, deadlines can be smaller than periods, $C_i\leq D_i\leq T_i$. \textbf{Algorithm}: Tasks with smaller relative deadlines have higher priorities and interrupt tasks with lower priority. ... ...
 ... ... @@ -24,7 +24,7 @@ Nodes correspond to tasks or operations, edges correspond to relations (execut % \includegraphics[width=0.7\linewidth]{Control-data_flow_graph} \ownsubsection{Marked Graphs (MG) (10-9)} A marked graph $G=(V,A,del)$ consists of nodes $v\in V$, edges $a=(v_i,v_j) \in A$ and numbers of initial tokes on edges, $del: A \rightarrow \mathbb{N}_0$ A marked graph $G=(V,A,del)$ consists of nodes (=actors) $v\in V$, edges $a=(v_i,v_j) \in A$ and numbers of initial tokes on edges, $del: A \rightarrow \mathbb{N}_0$ \begin{center} \includegraphics[width=0.8\columnwidth]{mod4} ... ...
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment