Question: implement a distributed memory versions of the Mandelbrot set calculation codethe sequential version of the code is provided with this description. Note that the value
implement a distributed memory versions of the Mandelbrot set calculation codethe sequential version of the code is provided with this description. Note that the value of N should be set to 8192 and CUTOFF should be set to 10000 iterations. Develop the distributed memory version of the Mandelbrot Set code:Code formatting and indentation should be in line with Java coding conventions. Submit a short write-up detailing your workload and domain decomposition strategy by citing code snippets of your parallel code:
Domain decomposition approach discussion and implementation. Workload decomposition approach discussion and implementation. Run the code in the multicore and cluster mode with 1, 2, 4, and 8 processes. The cluster mode code should be executed on Bridge and must contain 1 MPJ Express per node. Display these results in a tabular form and explain your results (in the write-up). As mentioned earlier, N should be set to 8192 and CUTOFF should be set to 10000 iterations.
OPTIONAL: Choose a random color depending on the number of iterations being executed for a particular pixel. The chosen colorin this casewill be a function of iterations executed.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
