@@ -38,7 +38,7 @@ Optimize latency, hardware cost, power and energy
...
@@ -38,7 +38,7 @@ Optimize latency, hardware cost, power and energy
The set of all Pareto-optimal solutions is the \textcolor{red}{Pareto-optimal front}.
The set of all Pareto-optimal solutions is the \textcolor{red}{Pareto-optimal front}.
\end{definition}
\end{definition}
\subsection{Classification of Scheduling Algorithms (10-32)}\oldline
\subsection{Classification of Scheduling Algorithms (10-32)}
\begin{itemize}
\begin{itemize}
\item\textcolor{red}{Unlimited} vs. \textcolor{red}{limited} resources
\item\textcolor{red}{Unlimited} vs. \textcolor{red}{limited} resources
\item\textcolor{red}{Iterative} (initial solution to architecture synthesis stepwise improved) vs. \textcolor{red}{constructive} (synthesis problem solved in one step) vs. \textcolor{red}{Transformative} (initial problem converted into classical optimization problem)
\item\textcolor{red}{Iterative} (initial solution to architecture synthesis stepwise improved) vs. \textcolor{red}{constructive} (synthesis problem solved in one step) vs. \textcolor{red}{Transformative} (initial problem converted into classical optimization problem)