20251007 133152.388 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 8 Number of threads requested = 8 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.000013 0.000008 0.000008 0.000008 0.000008 8192 0.000022 0.000017 0.000016 0.000017 0.000016 16384 0.000043 0.000033 0.000058 0.000033 0.000033 32768 0.000084 0.000066 0.000066 0.000066 0.000066 65536 0.000169 0.000132 0.000132 0.000132 0.000132 131072 0.000351 0.000264 0.000264 0.000264 0.000264 262144 0.000705 0.000572 0.000572 0.000528 0.000528 524288 0.001378 0.001159 0.001066 0.001062 0.001063 Timing results: Vector Size Rep #1 Rep #2 Rep #3 Rep #4 Rep #5 4096 0.000009 0.000009 0.000009 0.000009 0.000009 8192 0.000020 0.000017 0.000017 0.000017 0.000017 16384 0.000035 0.000035 0.000034 0.000035 0.000035 32768 0.000070 0.000069 0.000069 0.000069 0.000069 65536 0.000138 0.000138 0.000138 0.000138 0.000138 131072 0.000278 0.000277 0.000276 0.000277 0.000276 262144 0.000555 0.000552 0.000552 0.000554 0.000552 524288 0.001109 0.001109 0.001106 0.001109 0.001106 Timing results: Vector Size Rep #1 Rep #2 Rep #3 Rep #4 Rep #5 4096 0.000007 0.000007 0.000008 0.000007 0.000007 8192 0.000015 0.000015 0.000015 0.000014 0.000015 16384 0.000030 0.000029 0.000029 0.000029 0.000029 32768 0.000059 0.000060 0.000059 0.000059 0.000059 65536 0.000118 0.000119 0.000117 0.000119 0.000118 131072 0.000238 0.000239 0.000235 0.000236 0.000236 262144 0.000477 0.000478 0.000473 0.000467 0.000478 524288 0.000952 0.000936 0.000955 0.000937 0.000954 Timing results: Vector Size Rep #1 Rep #2 Rep #3 Rep #4 Rep #5 4096 0.000033 0.000020 0.000020 0.000021 0.000021 8192 0.000041 0.000041 0.000041 0.000041 0.000041 16384 0.000082 0.000082 0.000085 0.000082 0.000082 32768 0.000165 0.000163 0.000164 0.000165 0.000164 65536 0.000326 0.000327 0.000331 0.000330 0.000328 131072 0.000659 0.000652 0.000655 0.000659 0.000658 262144 0.001312 0.001307 0.001315 0.001318 0.001306 524288 0.002617 0.002627 0.002625 0.002663 0.002626 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.000005 0.000005 0.000005 0.000005 0.000005 4096 0.000010 0.000010 0.000010 0.000028 0.000010 8192 0.000020 0.000020 0.000020 0.000020 0.000020 16384 0.000040 0.000040 0.000040 0.000041 0.000039 32768 0.000079 0.000081 0.000079 0.000097 0.000079 65536 0.000159 0.000159 0.000159 0.000157 0.000157 131072 0.000318 0.000318 0.000319 0.000315 0.000317 262144 0.000638 0.000641 0.000638 0.000634 0.000631 524288 0.001277 0.001278 0.001280 0.001270 0.001271 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.000000 0.000000 0.000000 0.000000 16 0.000014 0.000014 0.000014 0.000014 0.000014 64 0.000963 0.000926 0.000923 0.000935 0.000935 timer_omp_get_wtime(): Normal end of execution. 20251007 133152.603