options

Loops Index

Colums Filter

Level Exclusive coverage run_0 (%) Exclusive coverage o2 (%) Exclusive coverage o4 (%) Exclusive coverage o8 (%) Exclusive coverage o16 (%) Exclusive coverage o26 (%) Exclusive coverage o52 (%) Inclusive coverage run_0 (%) Inclusive coverage o2 (%) Inclusive coverage o4 (%) Inclusive coverage o8 (%) Inclusive coverage o16 (%) Inclusive coverage o26 (%) Inclusive coverage o52 (%) Max Exclusive Time Over Threads run_0 (s) Max Exclusive Time Over Threads o2 (s) Max Exclusive Time Over Threads o4 (s) Max Exclusive Time Over Threads o8 (s) Max Exclusive Time Over Threads o16 (s) Max Exclusive Time Over Threads o26 (s) Max Exclusive Time Over Threads o52 (s) Max Inclusive Time Over Threads run_0 (s) Max Inclusive Time Over Threads o2 (s) Max Inclusive Time Over Threads o4 (s) Max Inclusive Time Over Threads o8 (s) Max Inclusive Time Over Threads o16 (s) Max Inclusive Time Over Threads o26 (s) Max Inclusive Time Over Threads o52 (s) Exclusive Time w.r.t. Wall Time run_0 (s) Exclusive Time w.r.t. Wall Time o2 (s) Exclusive Time w.r.t. Wall Time o4 (s) Exclusive Time w.r.t. Wall Time o8 (s) Exclusive Time w.r.t. Wall Time o16 (s) Exclusive Time w.r.t. Wall Time o26 (s) Exclusive Time w.r.t. Wall Time o52 (s) Inclusive Time w.r.t. Wall Time run_0 (s) Inclusive Time w.r.t. Wall Time o2 (s) Inclusive Time w.r.t. Wall Time o4 (s) Inclusive Time w.r.t. Wall Time o8 (s) Inclusive Time w.r.t. Wall Time o16 (s) Inclusive Time w.r.t. Wall Time o26 (s) Inclusive Time w.r.t. Wall Time o52 (s) Nb Threads run_0 Nb Threads o2 Nb Threads o4 Nb Threads o8 Nb Threads o16 Nb Threads o26 Nb Threads o52 Vectorization Ratio (%) Vector Length Use (%) Speedup If No Scalar Integer Speedup If FP Vectorized Speedup If Fully Vectorized Speedup If Perfect Load Balancing run_0 Speedup If Perfect Load Balancing o2 Speedup If Perfect Load Balancing o4 Speedup If Perfect Load Balancing o8 Speedup If Perfect Load Balancing o16 Speedup If Perfect Load Balancing o26 Speedup If Perfect Load Balancing o52 Stride 0 Stride 1 Stride n Stride Unknown Stride Indirect (run_0) Efficiency (run_0) Potential Speed-Up (%) (o2) Efficiency (o2) Potential Speed-Up (%) (o4) Efficiency (o4) Potential Speed-Up (%) (o8) Efficiency (o8) Potential Speed-Up (%) (o16) Efficiency (o16) Potential Speed-Up (%) (o26) Efficiency (o26) Potential Speed-Up (%) (o52) Efficiency (o52) Potential Speed-Up (%)
Loop idSource LocationSource FunctionLevelExclusive coverage run_0 (%)Exclusive coverage o2 (%)Exclusive coverage o4 (%)Exclusive coverage o8 (%)Exclusive coverage o16 (%)Exclusive coverage o26 (%)Exclusive coverage o52 (%)Inclusive coverage run_0 (%)Inclusive coverage o2 (%)Inclusive coverage o4 (%)Inclusive coverage o8 (%)Inclusive coverage o16 (%)Inclusive coverage o26 (%)Inclusive coverage o52 (%)Max Exclusive Time Over Threads run_0 (s)Max Exclusive Time Over Threads o2 (s)Max Exclusive Time Over Threads o4 (s)Max Exclusive Time Over Threads o8 (s)Max Exclusive Time Over Threads o16 (s)Max Exclusive Time Over Threads o26 (s)Max Exclusive Time Over Threads o52 (s)Max Inclusive Time Over Threads run_0 (s)Max Inclusive Time Over Threads o2 (s)Max Inclusive Time Over Threads o4 (s)Max Inclusive Time Over Threads o8 (s)Max Inclusive Time Over Threads o16 (s)Max Inclusive Time Over Threads o26 (s)Max Inclusive Time Over Threads o52 (s)Exclusive Time w.r.t. Wall Time run_0 (s)Exclusive Time w.r.t. Wall Time o2 (s)Exclusive Time w.r.t. Wall Time o4 (s)Exclusive Time w.r.t. Wall Time o8 (s)Exclusive Time w.r.t. Wall Time o16 (s)Exclusive Time w.r.t. Wall Time o26 (s)Exclusive Time w.r.t. Wall Time o52 (s)Inclusive Time w.r.t. Wall Time run_0 (s)Inclusive Time w.r.t. Wall Time o2 (s)Inclusive Time w.r.t. Wall Time o4 (s)Inclusive Time w.r.t. Wall Time o8 (s)Inclusive Time w.r.t. Wall Time o16 (s)Inclusive Time w.r.t. Wall Time o26 (s)Inclusive Time w.r.t. Wall Time o52 (s)Nb Threads run_0Nb Threads o2Nb Threads o4Nb Threads o8Nb Threads o16Nb Threads o26Nb Threads o52Vectorization Ratio (%)Vector Length Use (%)Speedup If No Scalar IntegerSpeedup If FP VectorizedSpeedup If Fully VectorizedSpeedup If Perfect Load Balancing run_0Speedup If Perfect Load Balancing o2Speedup If Perfect Load Balancing o4Speedup If Perfect Load Balancing o8Speedup If Perfect Load Balancing o16Speedup If Perfect Load Balancing o26Speedup If Perfect Load Balancing o52Stride 0Stride 1Stride nStride UnknownStride Indirect(run_0) Efficiency(run_0) Potential Speed-Up (%)(o2) Efficiency(o2) Potential Speed-Up (%)(o4) Efficiency(o4) Potential Speed-Up (%)(o8) Efficiency(o8) Potential Speed-Up (%)(o16) Efficiency(o16) Potential Speed-Up (%)(o26) Efficiency(o26) Potential Speed-Up (%)(o52) Efficiency(o52) Potential Speed-Up (%)
3spmxv.exe - main.cpp:72-74spmxv(ooo_options*, ooo_input*) [clone ._omp_fn.2]Innermost95.3194.7690.4490.3891.0289.9779.6195.3194.7690.4490.3891.0289.9779.611039.56535.77277.31148.0681.9467.0327.851039.56535.77277.31148.0681.9467.0327.851039.56535.94269.63145.5882.3167.3929.601039.56535.94269.63145.5882.3167.3929.601248162652012.512.918111.041.041.041.051.0602001100.972.860.963.270.899.70.7919.170.5936.590.6825.85
1spmxv.exe - main.cpp:68-76spmxv(ooo_options*, ooo_input*) [clone ._omp_fn.2]InBetween4.224.474.624.273.822.953.7199.5399.2495.0694.6594.8492.9283.3245.9825.9513.867.163.602.361.401085.54560.21291.17155.2285.2169.0729.2345.9825.3013.766.883.462.211.381085.54561.24283.39152.4585.7669.6030.9812481626522012.51.7113.2211.031.021.071.091.131.140.52100100.910.410.840.760.840.70.830.640.80.590.641.34
2spmxv.exe - main.cpp:65-76spmxv(ooo_options*, ooo_input*) [clone ._omp_fn.2]Outermost0.020.020.020.020.020.010.0299.5599.2695.0894.6894.8592.9483.340.250.140.070.040.030.020.041085.79560.34291.24155.2784.8169.0829.240.250.140.050.040.010.010.011085.79561.37283.44152.4985.7869.6130.99124814243109.381114.411.051.471.312.232.263.6213100100.9101.3-00.8901.09-00.8900.740
91spmxv.exe - ooo_cmdline.h:83-97 [...]void load_drops_matlab_matrix<double, int>(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, int*&, int*&, double*&, int&, int&, int&)Innermost0.000.010.010.000.010.000.000.000.010.010.000.010.000.000.040.070.130.040.070.050.040.040.070.130.040.070.050.040.040.040.030.010.000.000.000.040.040.030.010.000.000.001111111011.74.71112.971111111312.500100.600.350.010.9800.6100.8500.890
81spmxv.exe - ooo_cmdline.cpp:171-173print_error_check(double*, ooo_input*, ooo_options*)Innermost0.000.000.000.000.000.000.000.000.000.000.000.000.000.000.010.010.010.010.010.000.010.010.010.010.010.010.000.010.010.010.000.000.000.000.000.010.010.000.000.000.000.001111111012.512.91811111110200110100.9901.46-00.9602.84-00.890
7spmxv.exe - main.cpp:49-52spmxv(ooo_options*, ooo_input*) [clone ._omp_fn.1]Innermost0.000.000.000.000.000.000.000.000.000.000.000.000.000.000.010.000.000.000.010.000.000.000.010.000.000.000.010.000.000.00113110050112101001104000101.97-00.6301.78-0
4spmxv.exe - main.cpp:45-52spmxv(ooo_options*, ooo_input*) [clone ._omp_fn.1]InBetween0.000.000.000.000.000.000.000.000.000.000.000.000.000.000.000.010.010.000.000.000.000.010.010.010.000.000.000.000.000.010.000.000.000.000.000.010.010.010.000.000.000.00123115118.1812.53.38112.21111111NANANANANA100.2500.3300.9800.9600.1900.890
11spmxv.exe - main.cpp:60-79 [...]spmxv(ooo_options*, ooo_input*)Single0.000.000.000.000.000.000.000.000.000.000.000.000.000.000.000.000.020.000.030.000.000.020.000.030.000.000.010.000.000.000.000.010.000.00111115022.51.7515.8911100112100010100.2500.9500.150
79spmxv.exe - ooo_cmdline.cpp:165-175print_error_check(double*, ooo_input*, ooo_options*)Outermost0.000.000.000.000.000.000.000.000.000.000.000.000.000.000.000.000.010.010.000.000.000.001117.1412.512.1512.6500010100.51100.51010
9spmxv.exe - main.cpp:32-37spmxv(ooo_options*, ooo_input*) [clone ._omp_fn.0]Outermost0.000.000.000.000.000.000.000.000.000.000.000.000.000.000.000.000.000.00118.612.54.41112.40000001NANANANANA10
80spmxv.exe - ooo_cmdline.cpp:180-181print_error_check(double*, ooo_input*, ooo_options*)Single0.000.000.000.000.000.000.000.000.000.000.000.000.000.000.000.000.000.001012.512.67800000100100010
×