=================
 Seidel
=================

Code:

for (t=0; t<=T-1; t++)  
  for (i=1; i<=N-2; i++)  
    for (j=1; j<=N-2; j++)  
      A[i][j] = (A[i-1][j-1] + A[i-1][j] + A[i-1][j+1]
      	       + A[i][j-1] + A[i][j] + A[i][j+1]
	       	  + A[i+1][j-1] + A[i+1][j] + A[i+1][j+1])/9.0;


Total number of operations = 9*T*(N-2)*(N-2)

*********************
Sequential version
*********************


*********************
Parallel version
*********************
N = 1024
T = 1024
-------------------------------------------------------------------------------------------
 #cores  icc -fast -parallel       pluto      pluto+ancc
-------------------------------------------------------------------------------------------
seconds:
 1    13.170299    8.701026    5.994022
 2    13.114923    5.996472    3.126124
 3    13.185506    5.450877    2.168266
 4    13.155732    5.459626    1.689420    
gflops:
 1    0.73  1.11  1.61
 2    0.73  1.61  3.08
 3    0.73  1.77  4.44
 4    0.73  1.76  5.70

 T1_1 = 32
 T1_2 = 32
 T1_3 = 64
 T2_1 = 1
 T2_2 = 1
 T2_3 = 8
 U1 = 1
 U2 = 8
 U3 = 1
 Scalar Replacement
 Vectorization

