options

bench_aos - 2024-02-12 15:11:15 - MAQAO 2.19.0

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

Stylizer  

[ 4 / 4 ] Application profile is long enough (11.61 s)

To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.

[ 3 / 3 ] Optimization level option is correctly used

[ 2.40 / 3 ] Most of time spent in analyzed modules comes from functions compiled with -g

-g option gives access to debugging informations, such are source locations. Add -fno-omit-frame-pointer to improve the accuracy of callchains found during the application profiling

[ 3 / 3 ] Architecture specific option -xop is used

[ 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 (44.06%)

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% (9.03%), representing an hotspot for the application

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

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 (29.12%) greater than cumulative innermost loop coverage (14.94%)

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

[ 2 / 2 ] Less than 10% (8.22%) 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 (%)
27libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10069.0316.8814.17
[SA] Too many paths (53849 paths) - Simplify control structure. There are 53849 issues ( = paths) costing 1 point, limited to 1000.1000
[SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 4 issues (= calls) costing 1 point each.4
[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
29libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.486.3443.1420.1
[SA] Too many paths (42 paths) - Simplify control structure. There are 42 issues ( = paths) costing 1 point each with a malus of 4 points.46
[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
11libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10066.1315.713.55
[SA] Too many paths (15689 paths) - Simplify control structure. There are 15689 issues ( = paths) costing 1 point, limited to 1000.1000
[SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 4 issues (= calls) costing 1 point each.4
[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
31libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.23.247540.63
[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 1 issues ( = data accesses) costing 2 point each.2
39libqmckl.so.0.0.0Partial or unexisting vectorization - No issue detected03.21012.5
13libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.182.735.1417.44
[SA] Too many paths (12 paths) - Simplify control structure. There are 12 issues ( = paths) costing 1 point each with a malus of 4 points.16
[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
22libqmckl.so.0.0.0Partial or unexisting vectorization - No issue detected02.38012.5
26libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10031.7510.7113.39
[SA] Too many paths (40389 paths) - Simplify control structure. There are 40389 issues ( = paths) costing 1 point, limited to 1000.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
42libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.41.55011.25
[SA] Several paths (2 paths) - Simplify control structure or force the compiler to use masked instructions. There are 2 issues ( = paths) costing 1 point each.2
[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 1 issues ( = data accesses) costing 2 point each.2
28libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.91.3928.5720.54
[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] 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
×