25 June 2010 11:18:44.404 AM FFT_OPEN_MP FORTRAN77/OpenMP version Demonstrate an implementation of the Fast Fourier Transform of a complex data vector, using OpenMP for parallel execution. The number of processors = 2 The number of threads = 1 Accuracy check: FFT ( FFT ( X(1:N) ) ) == N * X(1:N) N NITS Error Time Time/Call MFLOPS 2 10000 0.785908E-16 0.3827E-01 0.1913E-05 5.226 4 10000 0.120984E-15 0.7707E-01 0.3853E-05 10.38 8 10000 0.682080E-16 0.1230 0.6150E-05 19.51 16 10000 0.103125E-15 0.2103 0.1051E-04 30.44 32 1000 0.149668E-15 0.3494E-01 0.1747E-04 45.79 64 1000 0.180275E-15 0.6319E-01 0.3160E-04 60.77 128 1000 0.184505E-15 0.1144 0.5718E-04 78.35 256 1000 0.199411E-15 0.2237 0.1118E-03 91.56 512 100 0.198864E-15 0.3787E-01 0.1893E-03 121.7 1024 100 0.242590E-15 0.8295E-01 0.4147E-03 123.4 2048 100 0.253280E-15 0.1634 0.8171E-03 137.9 4096 100 0.264572E-15 0.3631 0.1815E-02 135.4 8192 10 0.263337E-15 0.7350E-01 0.3675E-02 144.9 16384 10 0.280191E-15 0.1700 0.8499E-02 134.9 32768 10 0.301675E-15 0.3822 0.1911E-01 128.6 65536 10 0.290885E-15 0.8345 0.4172E-01 125.7 131072 1 0.315993E-15 0.1917 0.9584E-01 116.3 FFT_OPEN_MP: Normal end of execution. 25 June 2010 11:18:48.197 AM 25 June 2010 11:18:48.210 AM FFT_OPEN_MP FORTRAN77/OpenMP version Demonstrate an implementation of the Fast Fourier Transform of a complex data vector, using OpenMP for parallel execution. The number of processors = 2 The number of threads = 2 Accuracy check: FFT ( FFT ( X(1:N) ) ) == N * X(1:N) N NITS Error Time Time/Call MFLOPS 2 10000 0.785908E-16 1.433 0.7163E-04 0.1396 4 10000 0.120984E-15 2.893 0.1447E-03 0.2765 8 10000 0.682080E-16 4.348 0.2174E-03 0.5520 16 10000 0.103125E-15 5.741 0.2870E-03 1.115 32 1000 0.149668E-15 0.7307 0.3654E-03 2.190 64 1000 0.180275E-15 0.8820 0.4410E-03 4.354 128 1000 0.184505E-15 1.057 0.5284E-03 8.479 256 1000 0.199411E-15 1.289 0.6444E-03 15.89 512 100 0.198864E-15 0.1561 0.7805E-03 29.52 1024 100 0.242590E-15 0.1986 0.9932E-03 51.55 2048 100 0.253280E-15 0.2566 0.1283E-02 87.78 4096 100 0.264572E-15 0.3939 0.1969E-02 124.8 8192 10 0.263337E-15 0.6136E-01 0.3068E-02 173.6 16384 10 0.280191E-15 0.1203 0.6015E-02 190.7 32768 10 0.301675E-15 0.2327 0.1164E-01 211.2 65536 10 0.290885E-15 0.5493 0.2746E-01 190.9 131072 1 0.315993E-15 0.1047 0.5235E-01 212.8 FFT_OPEN_MP: Normal end of execution. 25 June 2010 11:19:09.145 AM 25 June 2010 11:19:09.157 AM FFT_OPEN_MP FORTRAN77/OpenMP version Demonstrate an implementation of the Fast Fourier Transform of a complex data vector, using OpenMP for parallel execution. The number of processors = 2 The number of threads = 4 Accuracy check: FFT ( FFT ( X(1:N) ) ) == N * X(1:N) N NITS Error Time Time/Call MFLOPS 2 10000 0.785908E-16 2.073 0.1036E-03 0.9648E-01 4 10000 0.120984E-15 4.169 0.2084E-03 0.1919 8 10000 0.682080E-16 6.373 0.3186E-03 0.3766 16 10000 0.103125E-15 9.098 0.4549E-03 0.7034 32 1000 0.149668E-15 1.148 0.5740E-03 1.394 64 1000 0.180275E-15 1.422 0.7108E-03 2.701 128 1000 0.184505E-15 1.585 0.7927E-03 5.651 256 1000 0.199411E-15 1.879 0.9393E-03 10.90 512 100 0.198864E-15 0.2180 0.1090E-02 21.14 1024 100 0.242590E-15 0.2826 0.1413E-02 36.23 2048 100 0.253280E-15 0.3380 0.1690E-02 66.66 4096 100 0.264572E-15 0.4684 0.2342E-02 104.9 8192 10 0.263337E-15 0.7049E-01 0.3525E-02 151.1 16384 10 0.280191E-15 0.1779 0.8897E-02 128.9 32768 10 0.301675E-15 0.2527 0.1264E-01 194.5 65536 10 0.290885E-15 0.5539 0.2769E-01 189.3 131072 1 0.315993E-15 0.1168 0.5840E-01 190.8 FFT_OPEN_MP: Normal end of execution. 25 June 2010 11:19:39.889 AM