Homework 1
due: Fri Jan. 21 @5:30pm

Write a parallel program to generate the Mandelbrot set using two strategies
(as discussed in class)

1. predetermined data decomposition -- that is, each processor is assigned
a chunk of c's to compute at startup.

2. using a master-slave algorithm -- that is, a designated _master_ processor
doles out chunks of c's to worker processors dynamically as the processors become
available. 

Architect strategies (1) and (2) within a single code that accepts the strategy
as an input parameter.

Try to demonstrate a speedup of .9*nprocs for a reasonable size
problem on at least 1000 processors of Full Disclosure.  Also, provide
an image of the generated mandelbrot set (you can use gnuplot, matlab,
idl, etc.).