Verified Commit 27ac2ffd authored by Theo von Arx's avatar Theo von Arx
Browse files

Add goal of RM

parent 2a1dbc37
......@@ -151,7 +151,9 @@ Task must finish execution within its deadline and not later than the maximum st
\end{compactitem}
\end{definition}
\ownsubsection{Rate Monotonic Scheduling (6-37)}
\ownsubsection{Rate Monotonic Scheduling (RM, 6-37)}
RM is optimal, meaning that if any static-priority scheduling algorithm can meet all the deadlines, then the rate-monotonic algorithm can too.
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.
......@@ -186,7 +188,7 @@ This condition is both necessary and sufficient.
do { $R=I+C_i;$
if ($R>D_i$) return(UNSCHEDULABLE);
I= sum(j=1,...i-1) ( ceil($R/T_j$)*$C_j)$;
} while ($I+C_i>R$);
} while ($I+C_i>R$);
//while previous operation had any effect
}
return(SCHEDULABLE);
......
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