From a5bdba73435a8496f4a675bc78fb598f772e17ad Mon Sep 17 00:00:00 2001
From: josh <josh@45c1a28c-8058-47b2-ae61-ca45b979098e>
Date: Sat, 1 Nov 2008 14:47:19 +0000
Subject: [PATCH] updated hw7.pdf

git-svn-id: svn://anubis/gvsu@224 45c1a28c-8058-47b2-ae61-ca45b979098e
---
 cs677/hw7/hw.tex | 17 +++++++++++++++++
 1 file changed, 17 insertions(+)

diff --git a/cs677/hw7/hw.tex b/cs677/hw7/hw.tex
index b79e1e4..5416898 100644
--- a/cs677/hw7/hw.tex
+++ b/cs677/hw7/hw.tex
@@ -54,6 +54,23 @@
     array.
 }
 
+\vskip 2em
+\item[3.]{
+    My OpenMP solution to Floyd's algorithm was implemented by
+    using a \texttt{\#pragma omp parallel for} on the second \texttt{for}
+    loop of the algorithm.
+    Thus, for each $k$ value, the rows are broken up for different
+    threads to process.
+    The same thread computes an entire row of the matrix.
+
+    The run times nicely grow exponentially as $n$ grows linearly.
+    On eos24, with $n >= 400$, the speedup was $\approx 3.6$.
+
+    As the number of threads increased, the run time decreased
+    exponentially until $t > 4$, where more threads did not gain
+    anything since there were only 4 processing cores.
+}
+
 \end{enumerate}
 
 \end{document}