41 lines
1.2 KiB
TeX
41 lines
1.2 KiB
TeX
\section{Misc supplementary material}
|
|
|
|
\begin{frame}[fragile]{\cesasme{} and control flow}
|
|
\begin{center}
|
|
\textbf{Straight-line code:} hypothesis of code analysers, but
|
|
also\ldots{}
|
|
\end{center}
|
|
|
|
\begin{minipage}[c]{0.35\textwidth}
|
|
\begin{lstlisting}[language=C]
|
|
for(i) {
|
|
if(A[i] % 2 == 0)
|
|
A[i] *= 2;
|
|
A[i] += B[i];
|
|
}
|
|
\end{lstlisting}
|
|
\end{minipage}
|
|
\hfill
|
|
\begin{minipage}[c]{0.60\textwidth}
|
|
\begin{itemize}
|
|
\item If not taken: map
|
|
\item If taken: \alert{dependency} in \lstc{A[i]}!
|
|
\item Performance varies depending on branch
|
|
\item Performance \alert{strongly depends} on \alert{input data}
|
|
\end{itemize}
|
|
\end{minipage}
|
|
\end{frame}
|
|
|
|
\begin{frame}{\staticdeps: lack of context}
|
|
\begin{minipage}[t]{0.48\textwidth}
|
|
\begin{block}{Context-dependent stride}
|
|
\todo{λ\lstc{F, k: F[i] += F[i+k]}}
|
|
\end{block}
|
|
\end{minipage}
|
|
\hfill
|
|
\begin{minipage}[t]{0.48\textwidth}
|
|
\begin{block}{Graphs algorithms}
|
|
\todo{Adjacency list as pointers to vertices}
|
|
\end{block}
|
|
\end{minipage}
|
|
\end{frame}
|