From 647c625bc668af62d9957eb36c2a4220fb7aebe6 Mon Sep 17 00:00:00 2001
From: Francis Russell <francis@unchartedbackwaters.co.uk>
Date: Fri, 22 Feb 2013 18:26:24 +0000
Subject: [PATCH] Add conclusion slide.

---
 presentation.tex | 26 +++++++++++++++++++++++---
 1 file changed, 23 insertions(+), 3 deletions(-)

diff --git a/presentation.tex b/presentation.tex
index d95b64e..3dc4d48 100644
--- a/presentation.tex
+++ b/presentation.tex
@@ -578,16 +578,16 @@ It depends whether we do it on an odd or even number of points.
 \frametitle{Resampling choices for {\tt integrals\_locpot}}
 
 \resizebox{0.48\textwidth}{!}{
-\begin{minipage}{1.2\textwidth}
+\begin{minipage}{1.4\textwidth}
 \begin{alltt}
 \input{code/integrals_locpot_resampling_1.txt}
 \end{alltt}
 \end{minipage}
 }
 \resizebox{0.48\textwidth}{!}{
-\begin{minipage}{1.2\textwidth}
+\begin{minipage}{1.4\textwidth}
 \begin{alltt}
-\input{code/integrals_locpot_resampling_1.txt}
+\input{code/integrals_locpot_resampling_2.txt}
 \end{alltt}
 \end{minipage}
 }
@@ -598,6 +598,26 @@ We just need to filter out the valid ones!
 
 }
 
+\frame{
+
+\frametitle{Conclusion}
+
+\begin{itemize}
+
+\item Identifying the domain of variability in ONETEP that we wish to exploit
+  has been difficult.
+
+\item We are currently targeting the sparsity we have observed in many Fourier
+  transforms as a candidate for code generation to improve ONETEP's performance.
+
+\item Generating optimised code for FFTs is an extensively studied problem. We
+intent to expoit existing research on FFTW (``Fastest Fourier Transform
+in the West'') and SPIRAL to determine our strategy for code generation.
+
+\end{itemize}
+
+}
+
 \end{document}
 
 
-- 
2.47.3