25 June 2010 11:22:19.987 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 = 16 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.7580E-02 0.3790E-06 26.39 4 10000 0.120984E-15 0.1550E-01 0.7752E-06 51.60 8 10000 0.682080E-16 0.2448E-01 0.1224E-05 98.06 16 10000 0.143867E-15 0.3537E-01 0.1769E-05 180.9 32 1000 0.125871E-15 0.3592E-02 0.1796E-05 445.4 64 1000 0.190069E-15 0.5708E-02 0.2854E-05 672.7 128 1000 0.195591E-15 0.9519E-02 0.4760E-05 941.3 256 1000 0.212608E-15 0.1764E-01 0.8818E-05 1161. 512 100 0.190474E-15 0.3404E-02 0.1702E-04 1354. 1024 100 0.223579E-15 0.7484E-02 0.3742E-04 1368. 2048 100 0.247030E-15 0.1550E-01 0.7751E-04 1453. 4096 100 0.249531E-15 0.3386E-01 0.1693E-03 1452. 8192 10 0.256488E-15 0.7138E-02 0.3569E-03 1492. 16384 10 0.278834E-15 0.1608E-01 0.8042E-03 1426. 32768 10 0.299085E-15 0.3306E-01 0.1653E-02 1487. 65536 10 0.289280E-15 0.6907E-01 0.3454E-02 1518. 131072 1 0.318206E-15 0.1468E-01 0.7339E-02 1518. FFT_OPEN_MP: Normal end of execution. 25 June 2010 11:22:20.370 AM 25 June 2010 11:22:20.407 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 = 16 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 0.6111E-01 0.3055E-05 3.273 4 10000 0.120984E-15 0.1215 0.6076E-05 6.583 8 10000 0.682080E-16 0.1716 0.8578E-05 13.99 16 10000 0.143867E-15 0.2349 0.1175E-04 27.24 32 1000 0.125871E-15 0.2992E-01 0.1496E-04 53.47 64 1000 0.190069E-15 0.3925E-01 0.1963E-04 97.83 128 1000 0.195591E-15 0.5027E-01 0.2513E-04 178.2 256 1000 0.212608E-15 0.6343E-01 0.3171E-04 322.9 512 100 0.190474E-15 0.7964E-02 0.3982E-04 578.6 1024 100 0.223579E-15 0.1119E-01 0.5596E-04 915.0 2048 100 0.247030E-15 0.1820E-01 0.9100E-04 1238. 4096 100 0.249531E-15 0.3077E-01 0.1539E-03 1597. 8192 10 0.256488E-15 0.5512E-02 0.2756E-03 1932. 16384 10 0.278834E-15 0.1185E-01 0.5927E-03 1935. 32768 10 0.299085E-15 0.2281E-01 0.1141E-02 2155. 65536 10 0.289280E-15 0.5085E-01 0.2542E-02 2062. 131072 1 0.318206E-15 0.9981E-02 0.4991E-02 2232. FFT_OPEN_MP: Normal end of execution. 25 June 2010 11:22:21.404 AM 25 June 2010 11:22:21.434 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 = 16 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 0.7179E-01 0.3590E-05 2.786 4 10000 0.120984E-15 0.1307 0.6536E-05 6.120 8 10000 0.682080E-16 0.2043 0.1022E-04 11.75 16 10000 0.143867E-15 0.2828 0.1414E-04 22.63 32 1000 0.125871E-15 0.3546E-01 0.1773E-04 45.12 64 1000 0.190069E-15 0.4484E-01 0.2242E-04 85.64 128 1000 0.195591E-15 0.5535E-01 0.2768E-04 161.9 256 1000 0.212608E-15 0.7096E-01 0.3548E-04 288.6 512 100 0.190474E-15 0.9015E-02 0.4507E-04 511.2 1024 100 0.223579E-15 0.1228E-01 0.6141E-04 833.7 2048 100 0.247030E-15 0.1786E-01 0.8932E-04 1261. 4096 100 0.249531E-15 0.3086E-01 0.1543E-03 1593. 8192 10 0.256488E-15 0.5550E-02 0.2775E-03 1919. 16384 10 0.278834E-15 0.1153E-01 0.5767E-03 1989. 32768 10 0.299085E-15 0.2234E-01 0.1117E-02 2200. 65536 10 0.289280E-15 0.4918E-01 0.2459E-02 2132. 131072 1 0.318206E-15 0.9659E-02 0.4830E-02 2307. FFT_OPEN_MP: Normal end of execution. 25 June 2010 11:22:22.552 AM