From 1d73581b36b492973ec81e32a13d67c42ad43e3e Mon Sep 17 00:00:00 2001
From: "W. Trevor King" <wking@drexel.edu>
Date: Tue, 9 Nov 2010 10:51:05 -0500
Subject: [PATCH] Update assigment 5 for Fall 2009.

---
 .../archive/mandelbrot/index.2009.11.shtml    | 63 +++++++++++++++++++
 assignments/archive/mandelbrot/index.shtml    | 62 +++---------------
 assignments/current/5                         |  2 +-
 3 files changed, 74 insertions(+), 53 deletions(-)
 create mode 100644 assignments/archive/mandelbrot/index.2009.11.shtml

diff --git a/assignments/archive/mandelbrot/index.2009.11.shtml b/assignments/archive/mandelbrot/index.2009.11.shtml
new file mode 100644
index 0000000..6c3cdbb
--- /dev/null
+++ b/assignments/archive/mandelbrot/index.2009.11.shtml
@@ -0,0 +1,63 @@
+<!--#set var="root_directory" value="../../.." --><!--#include virtual="$root_directory/shared/header.shtml"-->
+
+<h1>Assignment #6</h1>
+<p><em>Due Friday, November 5, 2009</em></p>
+
+<h2>Purpose</h2>
+
+<p>Learn how to implement a hostless parallel algorithm.</p>
+
+<p>Note: Please identify all your work.</p>
+
+<p>This assignment consists in rewriting the code calculating the
+Mandelbrot Set in a static load balance approach using a hostless
+parallel algorithm.</p>
+
+<p>In a hostless parallel algorithm, <em>all</em> nodes are treated on
+the same basis, except possibly for a brief dialogue with the user to
+start with and some post-processing of the data at the end of the
+calculation by node 0. In general, this paradigm is simpler to code
+than a master-slave approach. But it requires to find a way to divide
+the problem in parcels of equal complexity, therefore taking
+equivalent time to compute.</p>
+
+<p>In the Mandelbrot Set adjacent lines of pixels in the image ought
+to take comparable times to compute. Therefore a static load balance
+algorithm follows by requesting the nodes (including node 0 —
+therefore a hostless algorithm) to calculate the lines in the image on
+a cyclic basis. For instance, if three (3) nodes are used, each node
+should compute the lines of pixels according to the following
+table:</p>
+
+<table>
+  <tr><th>node</th><th>lines</th></tr>
+  <tr><td>0</td>   <td>0, 3, 6, 9, ...</td></tr>
+  <tr><td>1</td>   <td>1, 4, 7, 10, ...</td></tr>
+  <tr><td>2</td>   <td>2, 5, 8, 11, ...</td></tr>
+</table>
+
+<h2>Part A</h2>
+
+<p>Write a code to</p>
+
+<ul>
+  <li>implement the hostless approach.</li>
+  <li>produce the Mandelbrot Set image by piping the data in plot
+    image.py.</li>
+  <li>reproduce the same image as the serial and master-slave versions
+    from the notes in the web pages.</li>
+  <li>handle an arbitrary number of nodes.</li>
+  <li>handle an arbitrary size for the image (default: 700x500).</li>
+</ul>
+
+<h2>Part B</h2>
+
+<p>Include timing calls in your code to prove (or disprove) the
+assumption that the approach described above really leads to a proper
+load balance. Quantify the time variations in the nodes when using
+from 2 to 16 nodes.</p>
+
+<p>You could solve this assignment
+on <code>borg0.physics.drexel.edu</code>.</p>
+
+<!--#include virtual="$root_directory/shared/footer.shtml"-->
diff --git a/assignments/archive/mandelbrot/index.shtml b/assignments/archive/mandelbrot/index.shtml
index 6c3cdbb..5423f0b 100644
--- a/assignments/archive/mandelbrot/index.shtml
+++ b/assignments/archive/mandelbrot/index.shtml
@@ -1,63 +1,21 @@
 <!--#set var="root_directory" value="../../.." --><!--#include virtual="$root_directory/shared/header.shtml"-->
 
-<h1>Assignment #6</h1>
-<p><em>Due Friday, November 5, 2009</em></p>
+<h1>Assignment #5</h1>
+<p><em>Due Friday, November 5, 2010</em></p>
 
 <h2>Purpose</h2>
 
-<p>Learn how to implement a hostless parallel algorithm.</p>
+<p>Learn how to implement a truly parallel algorithm.</p>
 
 <p>Note: Please identify all your work.</p>
 
-<p>This assignment consists in rewriting the code calculating the
-Mandelbrot Set in a static load balance approach using a hostless
-parallel algorithm.</p>
+<p>This assignment consists of rewriting
+the <a href="../../../src/mandelbrot/MS2.c">MS2.c</a> code calculating
+the Mandelbrot Set to use a Master-Slave approach.  This is equivalent
+to writing <code>MS3.c</code> from
+the <a href="../../../content/programming_strategies/#MS3">notes</a>.</p>
 
-<p>In a hostless parallel algorithm, <em>all</em> nodes are treated on
-the same basis, except possibly for a brief dialogue with the user to
-start with and some post-processing of the data at the end of the
-calculation by node 0. In general, this paradigm is simpler to code
-than a master-slave approach. But it requires to find a way to divide
-the problem in parcels of equal complexity, therefore taking
-equivalent time to compute.</p>
-
-<p>In the Mandelbrot Set adjacent lines of pixels in the image ought
-to take comparable times to compute. Therefore a static load balance
-algorithm follows by requesting the nodes (including node 0 —
-therefore a hostless algorithm) to calculate the lines in the image on
-a cyclic basis. For instance, if three (3) nodes are used, each node
-should compute the lines of pixels according to the following
-table:</p>
-
-<table>
-  <tr><th>node</th><th>lines</th></tr>
-  <tr><td>0</td>   <td>0, 3, 6, 9, ...</td></tr>
-  <tr><td>1</td>   <td>1, 4, 7, 10, ...</td></tr>
-  <tr><td>2</td>   <td>2, 5, 8, 11, ...</td></tr>
-</table>
-
-<h2>Part A</h2>
-
-<p>Write a code to</p>
-
-<ul>
-  <li>implement the hostless approach.</li>
-  <li>produce the Mandelbrot Set image by piping the data in plot
-    image.py.</li>
-  <li>reproduce the same image as the serial and master-slave versions
-    from the notes in the web pages.</li>
-  <li>handle an arbitrary number of nodes.</li>
-  <li>handle an arbitrary size for the image (default: 700x500).</li>
-</ul>
-
-<h2>Part B</h2>
-
-<p>Include timing calls in your code to prove (or disprove) the
-assumption that the approach described above really leads to a proper
-load balance. Quantify the time variations in the nodes when using
-from 2 to 16 nodes.</p>
-
-<p>You could solve this assignment
-on <code>borg0.physics.drexel.edu</code>.</p>
+<p>Write the code so as to form an image by piping the data
+into <a href="../../../src/plot_image/plot_image.py">plot_image.py</a>.</p>
 
 <!--#include virtual="$root_directory/shared/footer.shtml"-->
diff --git a/assignments/current/5 b/assignments/current/5
index 802b16c..9869977 120000
--- a/assignments/current/5
+++ b/assignments/current/5
@@ -1 +1 @@
-../archive/monte_carlo_integration/
\ No newline at end of file
+../archive/mandelbrot/
\ No newline at end of file
-- 
2.26.2