Commit 83928d63 authored by homsm's avatar homsm Committed by overleaf
Browse files

Update on Overleaf.

parent 26b9c12e
......@@ -261,3 +261,35 @@ execution time of the request and $U_s $ the server utilization factor
sufficient).\newline
The worst case finishing time of an aperiodic task is the calculated deadline.
\ownsubsection{Comparison RM,TT,EDF}
\textbf{Time Triggered Cyclic Executive:}
\begin{itemize}
\item No RTOs necessary
\item Preemption $\rightarrow$ No context switch overhead
\item few scheduling overhead
\item slow, cheap processor can be used
\item implementation difficult for many tasks
\item inflexible (new tasks can't be added easily)
\end{itemize}
\textbf{Rate Monotonic:}
\begin{itemize}
\item implementation not complex
\item few scheduling overhead
\item needs RTOS
\item context switch overhead
\item needs faster and more expensive processor than TT
\item flexible (few changes (in priority list) needed if a new task is added)
\item
\end{itemize}
\textbf{Earliest Deadline First:}
\begin{itemize}
\item implementation effort minimal
\item a lot scheduling overhead
\item needs RTOS
\item context switch overhead
\item needs faster and more expensive processor than TT and RM
\item very flexible (no changes are needed if a new task is added)
\item new task set can have utilization $U_new=1-U_old$ in that way processor is completely busy (ausgelastet)
\end{itemize}
\ No newline at end of file
......@@ -119,7 +119,7 @@ $$\forall v_i \in V_C\setminus\{v_0\}: \quad \tau(v_i) = -\infty$$
\item Algorithm schedules one time step after the other
\item Heuristic Algorithm
\item Doesn't minimize the latency in general. In the special case, that the
dependency graph is a tree, minimal latency is guaranteed (sufficient
dependency graph is a tree and all tasks have the same execution time, minimal latency is guaranteed (sufficient
but not necessary).
\end{compactitem}
~
......
Markdown is supported
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