2110732 Parallel Computing

First Semester, 2003

Write two message-passing versions of the Mandelbrot Set program in section 3.2.2. The required image size is 800*800 pixels.
The sequential code of the program is given here. To compile, use mpicc and link it with X library (gcc option -lX11).
The first one, use a static task assignment strategy that simply divides the image into n blocks, each block contains 800/n rows.
The second one, use a static task assignment strategy that gives the best speed-up.
Run the program on zeus with 1, 2, 4, and 8 processes, measure the time the whole program spends (use the 'time' command and add user and sys time together) and calculate the speed-up.
Submit the source code along with the result timing and comment about the task assignment strategies, by Friday 18 July 2003.
Introduction to the Mandelbrot Set gives a good explanation about what the Mandelbrot Set is.