Jacobi 1D: Parallel Solution!
n Slice up the 2D array into sets of
columns
n Chare = computations in one set
n At the end of each iteration
Chares exchange boundaries
Determine maximum change in
computation
n Output result when threshold is reached