Commit 001b5879 by theova

 ... ... @@ -51,7 +51,8 @@ Optimize latency, hardware cost, power and energy \item or if there is a dedicated resource for each operation \end{compactitem} \textbf{As Soon As Possible Algorithm (ASAP)}: Guarantees minimal latency. Constructive, greedy from the beginning \subsubsection{As Soon As Possible Algorithm (ASAP)} Guarantees minimal latency. Constructive, greedy from the beginning \begin{python} ASAP(G_S(V_S,E_S),w) { tau(v_0)=1; ... ... @@ -63,7 +64,8 @@ Optimize latency, hardware cost, power and energy } \end{python} \textbf{As Late As Possible Algorithm (ALAP)} Heuristic, not optimal. Constructive, greedy from the end \subsubsection{As Late As Possible Algorithm (ALAP)} Heuristic, not optimal. Constructive, greedy from the end \begin{python} ALAP(G_S(V_S,E_S),w,L_max) { tau(v_n) = L_max + 1; ... ... @@ -78,7 +80,7 @@ If $L_{max}$ is not given, it is taken from the LIST Schedule because it guarantees that a feasible schedule exists for this latency. \bigskip \textbf{Scheduling with Timing Constraints} \newline \subsubsection{Scheduling with Timing Constraints} \begin{compactitem} \item Deadlines: Latest finishing time \item Release Times: Earliest starting time ... ... @@ -113,8 +115,7 @@ $$\forall v_i \in V_C\setminus\{v_0\}: \quad \tau(v_i) = -\infty$$ % \end{equation*} % where $L_{max}$ is an upper bound on the latency. \textcolor{red}{\textbf{List Scheduling} (10-45)} (widely used heuristic) \subsubsection{List scheduling} \subsubsection{List Scheduling (10-45) (widely used heuristic)} \begin{compactitem} ... ... @@ -150,7 +151,7 @@ $$\forall v_i \in V_C\setminus\{v_0\}: \quad \tau(v_i) = -\infty$$ Produces the following Ablaufplan (indep. of priorities)\\ \includegraphics[width=0.3\linewidth]{list_scheduling} \textcolor{red}{\textbf{Integer Linear Programming (10-50)}} \subsubsection{Integer Linear Programming (10-50)} \begin{compactitem} \item Yields optimal solution \item Solves scheduling, binding and allocation simultaneously ... ...