Analysis
  • Tcomm = Ts*P*(P-1) + Tw*(M/P)*(P-1)*P*N*N/(P*M)
  • Tcomm-total= Tcomm*N*N/(P*M)
  • Tcomp =logN
    Time taken
  • one D FFT = 976
  • Transpose = 353312
  • read in data file=4880
    Future Direction

    To be more realistic, each processor should be able to handle more than one file. To achieve this goal, algorithm should be changed such that after one D FFT and those are sent to other processors, each processor will read in data again till no more data files.