options

bench_aos - 2024-02-12 12:24:23 - MAQAO 2.19.0

Help is available by moving the cursor above any symbol or by checking MAQAO website.

Stylizer  

[ 0 / 4 ] Application profile is too short (7.41 s)

If the overall application profiling time is less than 10 seconds, many of the measurements at function or loop level will very likely be under the measurement quality threshold (0,1 seconds). Rerun to increase runtime duration: for example use a larger dataset or include a repetition loop.

[ 1.48 / 3 ] Some functions are compiled with a low optimization level (O0 or O1)

To have better performances, it is advised to help the compiler by using a proper optimization level (-O2 of higher). Warning, depending on compilers, faster optimization levels can decrease numeric accuracy.

[ 1.48 / 3 ] Most of time spent in analyzed modules comes from functions without compilation information

Functions without compilation information (typically not compiled with -g) cumulate 50.79% of the time spent in analyzed modules. Check that -g is present. Remark: if -g is indeed used, this can also be due to some compiler built-in functions (typically math) or statically linked libraries. This warning can be ignored in that case.

[ 1.48 / 3 ] Compilation of some functions is not optimized for the target processor

Architecture specific options are needed to produce efficient code for a specific processor ( -x(target) or -ax(target) ).

[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0 % of the execution time)

To have a representative profiling, it is advised that the category "Others" represents less than 20% of the execution time in order to analyze as much as possible of the user code

Strategizer  

[ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (50.24%)

If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances.

[ 4 / 4 ] Loop profile is not flat

At least one loop coverage is greater than 4% (22.15%), representing an hotspot for the application

[ 0 / 4 ] Too little time of the experiment time spent in analyzed innermost loops (11.09%)

If the time spent in analyzed innermost loops is less than 15%, standard innermost loop optimizations such as vectorisation will have a limited impact on application performances.

[ 3 / 3 ] Less than 10% (0%) is spend in BLAS1 operations

It could be more efficient to inline by hand BLAS1 operations

[ 0 / 3 ] Cumulative Outermost/In between loops coverage (39.15%) greater than cumulative innermost loop coverage (11.09%)

Having cumulative Outermost/In between loops coverage greater than cumulative innermost loop coverage will make loop optimization more complex

[ 2 / 2 ] Less than 10% (0%) is spend in Libm/SVML (special functions)

[ 2 / 2 ] Less than 10% (0%) is spend in BLAS2 operations

BLAS2 calls usually could make a poor cache usage and could benefit from inlining.

Optimizer

Loop IDModuleAnalysisPenalty ScoreCoverage (%)Vectorization
Ratio (%)
Vector Length
Use (%)
36libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.100322.1529.0221.22
[SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point.1000
[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
[SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 1 issues (= calls) costing 1 point each.1
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
37libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.2254.7837.9625.69
[SA] Too many paths (219 paths) - Simplify control structure. There are 219 issues ( = paths) costing 1 point each with a malus of 4 points.223
[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
106libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10034.4528.7520.91
[SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point.1000
[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
[SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 1 issues (= calls) costing 1 point each.1
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
34bench_aosInefficient vectorization.24.0610050
[SA] Inefficient vectorization: use of shorter than available vector length - Force compiler to use proper vector length. CAUTION: use of 512 bits vectors could be more expensive than 256 bits on some processors. Use intrinsics (costly and not portable). The issue costs 2 points.2
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
35libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10032.749.0913.64
[SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point.1000
[SA] Non innermost loop (Outermost) - Collapse loop with innermost ones. This issue costs 2 points.2
[SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 1 issues (= calls) costing 1 point each.1
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
41libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.42.557540.63
[SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 1 issues ( = indirect data accesses) costing 4 point each.4
40libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.132.528.1521.71
[SA] Presence of constant non unit stride data access - Use array restructuring, perform loop interchange or use gather instructions to lower a bit the cost. There are 2 issues ( = data accesses) costing 2 point each.4
[SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 1 issues ( = indirect data accesses) costing 4 point each.4
[SA] Several paths (3 paths) - Simplify control structure or force the compiler to use masked instructions. There are 3 issues ( = paths) costing 1 point each.3
[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
107libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.9711014.13
[SA] Too many paths (91 paths) - Simplify control structure. There are 91 issues ( = paths) costing 1 point each with a malus of 4 points.95
[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
112libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.110.9509.82
[SA] Too many paths (5 paths) - Simplify control structure. There are 5 issues ( = paths) costing 1 point each with a malus of 4 points.9
[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
49libqmckl.so.0.0.0Partial or unexisting vectorization - No issue detected00.8012.5
×