20231213 210235.056 timer_omp_get_wtime Fortran77 version Test omp_get_wtime(). omp_get_wtime ( ) is an OpenMP function. It returns elapsed wall clock time in seconds. Number of processors is 16 Number of threads requested = 16 TEST03 Time the following operations: y(1:n) = x(1:n) y(1:n) = PI * x(1:n) ) y(1:n) = sqrt ( x(1:n) ) y(1:n) = exp ( x(1:n) ) Data vectors will be of minimum size 4096 Data vectors will be of maximum size 524288 Number of repetitions of the operation: 5 Timing results: Vector Size Rep #1 Rep #2 Rep #3 Rep #4 Rep #5 4096 0.000011 0.000005 0.000005 0.000005 0.000005 8192 0.000016 0.000010 0.000010 0.000010 0.000010 16384 0.000061 0.000020 0.000020 0.000020 0.000020 32768 0.000094 0.000039 0.000038 0.000039 0.000039 65536 0.000181 0.000079 0.000077 0.000079 0.000079 131072 0.000383 0.000158 0.000157 0.000157 0.000157 262144 0.000791 0.000319 0.000332 0.000338 0.000325 524288 0.001608 0.000665 0.000654 0.000649 0.000652 Timing results: Vector Size Rep #1 Rep #2 Rep #3 Rep #4 Rep #5 4096 0.000006 0.000006 0.000013 0.000009 0.000009 8192 0.000011 0.000011 0.000011 0.000022 0.000011 16384 0.000023 0.000023 0.000023 0.000023 0.000048 32768 0.000046 0.000045 0.000046 0.000046 0.000046 65536 0.000091 0.000091 0.000091 0.000091 0.000091 131072 0.000183 0.000187 0.000182 0.000182 0.000182 262144 0.000383 0.000372 0.000378 0.000368 0.000382 524288 0.000761 0.000743 0.000996 0.000743 0.000735 Timing results: Vector Size Rep #1 Rep #2 Rep #3 Rep #4 Rep #5 4096 0.000006 0.000006 0.000006 0.000006 0.000006 8192 0.000011 0.000011 0.000011 0.000011 0.000011 16384 0.000022 0.000023 0.000022 0.000022 0.000023 32768 0.000045 0.000045 0.000045 0.000045 0.000045 65536 0.000090 0.000090 0.000090 0.000090 0.000090 131072 0.000183 0.000179 0.000187 0.000179 0.000179 262144 0.000360 0.000360 0.000359 0.000359 0.000360 524288 0.000720 0.000719 0.000719 0.000719 0.000720 Timing results: Vector Size Rep #1 Rep #2 Rep #3 Rep #4 Rep #5 4096 0.000030 0.000018 0.000018 0.000018 0.000018 8192 0.000036 0.000046 0.000036 0.000036 0.000036 16384 0.000072 0.000072 0.000072 0.000072 0.000072 32768 0.000145 0.000145 0.000143 0.000145 0.000145 65536 0.000287 0.000289 0.000286 0.000289 0.000287 131072 0.000573 0.000578 0.000582 0.000573 0.000576 262144 0.001157 0.001157 0.001156 0.001149 0.001153 524288 0.002313 0.002309 0.002320 0.002316 0.002338 TEST04 Time the 2D nearest neighbor problem. Given X(2,N) and Y(2), find X(2,*) closest to Y(2). do i = 1, n if distance ( x(2,i), y ) < minimum so far x_min = x(2,i) end do Data vectors will be of minimum size 1024 Data vectors will be of maximum size 524288 Number of repetitions of the operation: 5 Timing results: Vector Size Rep #1 Rep #2 Rep #3 Rep #4 Rep #5 1024 0.000003 0.000003 0.000003 0.000003 0.000003 2048 0.000006 0.000005 0.000005 0.000005 0.000005 4096 0.000011 0.000010 0.000010 0.000010 0.000010 8192 0.000021 0.000019 0.000019 0.000019 0.000019 16384 0.000040 0.000038 0.000038 0.000038 0.000038 32768 0.000077 0.000077 0.000077 0.000077 0.000077 65536 0.000153 0.000153 0.000153 0.000153 0.000153 131072 0.000305 0.000305 0.000305 0.000305 0.000306 262144 0.000611 0.000605 0.000611 0.000611 0.000610 524288 0.001221 0.001221 0.001223 0.001221 0.001203 TEST05 Time the matrix multiplication problem. Compute C = A * B where A is an L by M matrix, B is an M by N matrix, and so C is an L by N matrix. Minimum value of L = M = N = 4 Maximum value of L = M = N = 256 Number of repetitions of the operation: 5 Use nested DO loops for matrix multiplication. Timing results using nested DO loops: Vector Size Rep #1 Rep #2 Rep #3 Rep #4 Rep #5 4 0.000001 0.000001 0.000000 0.000000 0.000000 16 0.000020 0.000018 0.000020 0.000019 0.000020 64 0.001023 0.001048 0.001032 0.001034 0.001039 timer_omp_get_wtime(): Normal end of execution. 20231213 210235.299