04 August 2020 01:49:50 PM FFT_OPENMP C++/OpenMP version Demonstrate an implementation of the Fast Fourier Transform of a complex data vector, using OpenMP for parallel execution. Number of processors available = 8 Number of threads = 1 Accuracy check: FFT ( FFT ( X(1:N) ) ) == N * X(1:N) N NITS Error Time Time/Call MFLOPS 2 10000 7.85908e-17 1.73035e-06 5.77919 4 10000 1.20984e-16 1.50565e-06 26.5667 8 10000 6.8208e-17 2.21671e-06 54.1342 16 10000 1.43867e-16 3.27052e-06 97.8439 32 1000 1.33121e-16 4.96266e-06 161.204 64 1000 1.77654e-16 7.12643e-06 269.42 128 1000 1.92904e-16 1.06328e-05 421.338 256 1000 2.09232e-16 2.06445e-05 496.015 512 100 1.92749e-16 3.74143e-05 615.807 1024 100 2.30861e-16 8.17053e-05 626.642 2048 100 2.44762e-16 0.00016004 703.822 4096 100 2.47978e-16 0.00034628 709.716 8192 10 2.57809e-16 0.000695767 765.314 16384 10 2.73399e-16 0.00159879 717.34 32768 10 2.92301e-16 0.00329712 745.377 65536 10 2.82993e-16 0.00745745 703.039 131072 1 3.14967e-16 0.0160639 693.551 262144 1 3.2186e-16 0.0340618 692.651 524288 1 3.28137e-16 0.0715438 696.18 1048576 1 3.2859e-16 0.151114 693.898 2097152 1 3.50839e-16 0.313504 702.387 4194304 1 3.55925e-16 0.684501 674.029 8388608 1 3.71168e-16 1.32907 725.838 16777216 1 3.65293e-16 2.92012 689.447 33554432 1 3.81665e-16 5.96748 702.86 FFT_OPENMP: Normal end of execution. 04 August 2020 01:50:53 PM 04 August 2020 01:50:53 PM FFT_OPENMP C++/OpenMP version Demonstrate an implementation of the Fast Fourier Transform of a complex data vector, using OpenMP for parallel execution. Number of processors available = 8 Number of threads = 2 Accuracy check: FFT ( FFT ( X(1:N) ) ) == N * X(1:N) N NITS Error Time Time/Call MFLOPS 2 10000 7.85908e-17 1.4626e-06 6.83714 4 10000 1.20984e-16 3.10439e-06 12.885 8 10000 6.8208e-17 4.61079e-06 26.0259 16 10000 1.43867e-16 6.52625e-06 49.0328 32 1000 1.33121e-16 7.65148e-06 104.555 64 1000 1.77654e-16 1.07497e-05 178.609 128 1000 1.92904e-16 1.40767e-05 318.255 256 1000 2.09232e-16 2.14014e-05 478.473 512 100 1.92749e-16 2.97438e-05 774.615 1024 100 2.30861e-16 5.52713e-05 926.34 2048 100 2.44762e-16 9.95819e-05 1131.13 4096 100 2.47978e-16 0.000210014 1170.21 8192 10 2.57809e-16 0.00040767 1306.15 16384 10 2.73399e-16 0.000903516 1269.35 32768 10 2.92301e-16 0.00182392 1347.43 65536 10 2.82993e-16 0.00412785 1270.12 131072 1 3.14967e-16 0.00809063 1377.04 262144 1 3.2186e-16 0.0191444 1232.37 524288 1 3.28137e-16 0.0390351 1275.96 1048576 1 3.2859e-16 0.0848152 1236.31 2097152 1 3.50839e-16 0.164222 1340.87 4194304 1 3.55925e-16 0.360674 1279.2 8388608 1 3.71168e-16 0.725358 1329.95 16777216 1 3.65293e-16 1.60711 1252.72 33554432 1 3.81665e-16 3.12472 1342.3 FFT_OPENMP: Normal end of execution. 04 August 2020 01:51:34 PM 04 August 2020 01:51:34 PM FFT_OPENMP C++/OpenMP version Demonstrate an implementation of the Fast Fourier Transform of a complex data vector, using OpenMP for parallel execution. Number of processors available = 8 Number of threads = 4 Accuracy check: FFT ( FFT ( X(1:N) ) ) == N * X(1:N) N NITS Error Time Time/Call MFLOPS 2 10000 7.85908e-17 1.69433e-06 5.90204 4 10000 1.20984e-16 3.32211e-06 12.0405 8 10000 6.8208e-17 5.00352e-06 23.9831 16 10000 1.43867e-16 6.83864e-06 46.7929 32 1000 1.33121e-16 8.70168e-06 91.9363 64 1000 1.77654e-16 1.11031e-05 172.924 128 1000 1.92904e-16 1.38826e-05 322.707 256 1000 2.09232e-16 1.95166e-05 524.682 512 100 1.92749e-16 2.56568e-05 898.009 1024 100 2.30861e-16 4.33243e-05 1181.78 2048 100 2.44762e-16 6.73697e-05 1671.97 4096 100 2.47978e-16 0.00014053 1748.81 8192 10 2.57809e-16 0.000252826 2106.11 16384 10 2.73399e-16 0.000588109 1950.12 32768 10 2.92301e-16 0.00106286 2312.25 65536 10 2.82993e-16 0.00250234 2095.19 131072 1 3.14967e-16 0.00459432 2424.98 262144 1 3.2186e-16 0.0125537 1879.37 524288 1 3.28137e-16 0.0222561 2237.92 1048576 1 3.2859e-16 0.0539702 1942.88 2097152 1 3.50839e-16 0.100739 2185.85 4194304 1 3.55925e-16 0.229555 2009.86 8388608 1 3.71168e-16 0.444387 2170.83 16777216 1 3.65293e-16 0.987107 2039.56 33554432 1 3.81665e-16 2.04247 2053.54 FFT_OPENMP: Normal end of execution. 04 August 2020 01:52:04 PM 04 August 2020 01:52:04 PM FFT_OPENMP C++/OpenMP version Demonstrate an implementation of the Fast Fourier Transform of a complex data vector, using OpenMP for parallel execution. Number of processors available = 8 Number of threads = 8 Accuracy check: FFT ( FFT ( X(1:N) ) ) == N * X(1:N) N NITS Error Time Time/Call MFLOPS 2 10000 7.85908e-17 2.72397e-06 3.67112 4 10000 1.20984e-16 4.9181e-06 8.13322 8 10000 6.8208e-17 7.83832e-06 15.3094 16 10000 1.43867e-16 1.06936e-05 29.9244 32 1000 1.33121e-16 1.29734e-05 61.6645 64 1000 1.77654e-16 1.76847e-05 108.569 128 1000 1.92904e-16 2.91305e-05 153.791 256 1000 2.09232e-16 3.06777e-05 333.793 512 100 1.92749e-16 4.2536e-05 541.659 1024 100 2.30861e-16 6.42575e-05 796.795 2048 100 2.44762e-16 0.000109549 1028.22 4096 100 2.47978e-16 0.00018588 1322.15 8192 10 2.57809e-16 0.000345532 1541.04 16384 10 2.73399e-16 0.000695719 1648.48 32768 10 2.92301e-16 0.00161851 1518.43 65536 10 2.82993e-16 0.0034072 1538.76 131072 1 3.14967e-16 0.00722058 1542.97 262144 1 3.2186e-16 0.0159272 1481.3 524288 1 3.28137e-16 0.0307443 1620.05 1048576 1 3.2859e-16 0.0694368 1510.12 2097152 1 3.50839e-16 0.125222 1758.48 4194304 1 3.55925e-16 0.272082 1695.72 8388608 1 3.71168e-16 0.515636 1870.87 16777216 1 3.65293e-16 1.09831 1833.06 33554432 1 3.81665e-16 2.09074 2006.14 FFT_OPENMP: Normal end of execution. 04 August 2020 01:52:36 PM