Bring in this Fall's assigment 7 (from last year's logistic map assigment).

[parallel_computing.git] / assignments / archive / logistic_cuda / index.shtml.itex2MML

diff --git a/assignments/archive/logistic_cuda/index.shtml.itex2MML b/assignments/archive/logistic_cuda/index.shtml.itex2MML
index 705eeb7f67c5429b32b1c2fb27c734de7d1246e8..beaf339936fb446b973e6e8cb39b6213d2c6a23f 100644 (file)
--- a/assignments/archive/logistic_cuda/index.shtml.itex2MML
+++ b/assignments/archive/logistic_cuda/index.shtml.itex2MML
@@ -56,9 +56,10 @@ block size tiles. The content of $M$ and $N$ within the tiles can then
 be transfered into the share memory for speed.</p>
 
 <p>See the <a href="../../../content/GPUs/#learn">Learning CUDA</a>
-section of the course notes and the skeleton code <a
-href="src/matmult_skeleton.cu">matmult_skeleton.cu</a>. See also the
-in-class exercise on array reversal.</p>
+section of the course notes and the skeleton
+code <a href="../../../src/matmult_skeleton.cu">matmult_skeleton.cu</a>. See
+also the in-class exercise on <a href="../../../content/GPUs/#example">array
+reversal</a>.</p>
 
 <h2 id="B">Part B — Logistic Map</h2>