options

exec - 2024-02-22 16:46:23 - MAQAO 2.19.1

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

Stylizer  

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

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

[ 3.00 / 3 ] Optimization level option is correctly used

[ 3.00 / 3 ] Most of time spent in analyzed modules comes from functions compiled with -g and -fno-omit-frame-pointer

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

[ 3.00 / 3 ] Architecture specific option -march=znver4 is used

[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.81 % 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 (96.36%)

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

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

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

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 (%)
1084libkripke.soPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.2290.796.6713.33
[SA] Too many paths (16 paths) - Simplify control structure. There are 16 issues ( = paths) costing 1 point each with a malus of 4 points.20
[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
902libkripke.soPartial or unexisting vectorization - No issue detected02.58012.5
1022libkripke.soPartial or unexisting vectorization - No issue detected02.51012.5
1038libkripke.soPartial or unexisting vectorization - No issue detected00.22012.5
1121libkripke.soPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10.08012.5
[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
1085libkripke.soPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.220.07012.5
[SA] Too many paths (16 paths) - Simplify control structure. There are 16 issues ( = paths) costing 1 point each with a malus of 4 points.20
[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
1122libkripke.soPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.140.01011.79
[SA] Too many paths (7 paths) - Simplify control structure. There are 7 issues ( = paths) costing 1 point each with a malus of 4 points.11
[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
×