Implement MPI program for a 2-D finite difference algorithm on a square
domain with n × n = N points. Assume 5 points stencil (actual point and four
neighbors). Assume ghost boundary points in order to simplify the calculation
in border points (all stencils, including boundary points, are equal). Compare
the obtained results, after a specified number of iterations, on a single MPI process and on a parallel multi-core computer, e.g., with up to eight cores. Use the
performance models for calculation and communication to explain your results.
Plot the execution time as a function of the number of points N and as a function
of the number of processes p for, e.g., 104 time steps.