tobast/phd-defense
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Suppl.: staticdeps breaking

Browse source
This commit is contained in:
Théophile Bastian 2024-12-06 18:50:53 +01:00
parent 00707e60fe
commit 8ced97c52c
1 changed files with 38 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

44
slides/85_supplementary/misc.tex
View file

@ -26,16 +26,48 @@ for(i) {
\end{minipage} \end{minipage}
\end{frame} \end{frame}
\begin{frame}{\staticdeps: lack of context}
\begin{frame}[fragile]{\staticdeps: lack of context}
\begin{minipage}[t]{0.48\textwidth} \begin{minipage}[t]{0.48\textwidth}
\begin{block}{Context-dependent stride} \begin{block}{\alert{Context-dependent stride}}
\todo{λ\lstc{F, k: F[i] += F[i+k]}} \begin{lstlisting}[language=C]
for(int i=0; i < n-k; ++i)
A[i] += A[i+k];
\end{lstlisting}
\begin{center}
$\downarrow$
\end{center}
\begin{lstlisting}[language={[x86masm]Assembler}]
loop:
mov (%rax,%rdx,4),%ecx
add %ecx,(%rax)
add $0x4,%rax
cmp %rsi,%rax
jne loop
\end{lstlisting}
\begin{center}
\textbf{No dep found!}
\end{center}
\end{block} \end{block}
\end{minipage} \end{minipage}
\hfill \hfill\vrule\hfill
\begin{minipage}[t]{0.48\textwidth} \begin{minipage}[t]{0.48\textwidth}
\begin{block}{Graphs algorithms} \begin{block}{\alert{Graphs algorithms}}
\todo{Adjacency list as pointers to vertices} \vspace{0.7em}
\begin{itemize}
\item{} Graphs: commonly represented as \eg
\begin{lstlisting}[language=C]
struct Node {
// ...
vector<Node*> siblings;
};
\end{lstlisting}
\item{} Values of \lstc{siblings} will alias \alert{on
purpose}!
\item{} \ldots{}thus breaking \staticdeps{}.
\end{itemize}
\end{block} \end{block}
\end{minipage} \end{minipage}
\end{frame} \end{frame}