Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (17.38 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 3 / 3 ] Optimization level option -O3 is used
To have better performances, it is advised to help the compiler by using a proper optimization level (-O3)
[ 3 / 3 ] Helper debug compilation options -g and -fno-omit-frame-pointer are used
-g option gives access to debugging informations, such are source locations and -fno-omit-frame-pointer improve the accuracy of callchains found during the application profiling.
[ 3 / 3 ] Architecture specific option -mcpu is used
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.28 % 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
[ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (60.26%)
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% (54.06%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (58.28%)
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
[ 3 / 3 ] Cumulative Outermost/In between loops coverage (1.98%) lower than cumulative innermost loop coverage (58.28%)
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.
| Loop ID | Module | Analysis | Penalty Score | Coverage (%) | Vectorization Ratio (%) | Vector Length Use (%) |
|---|---|---|---|---|---|---|
| ►103 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 1000 | 54.06 | 38.1 | 34.52 |
| ○ | [SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point. | 1000 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ►102 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 1002 | 1.38 | 0 | 22.92 |
| ○ | [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 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ○118 | exec | Partial or unexisting vectorization - No issue detected | 0 | 1.29 | 2.86 | 25.71 |
| ○101 | exec | Partial or unexisting vectorization - No issue detected | 0 | 1.22 | 0 | 0 |
| ○69 | exec | Partial or unexisting vectorization - No issue detected | 0 | 0.71 | 0 | 25 |
| ○114 | exec | Partial or unexisting vectorization - No issue detected | 0 | 0.71 | 0 | 25 |
| ►67 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 1003 | 0.35 | 0 | 22.19 |
| ○ | [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 | ||||
| ►117 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 14 | 0.24 | 6.98 | 26.16 |
| ○ | [SA] Too many paths (8 paths) - Simplify control structure. There are 8 issues ( = paths) costing 1 point each with a malus of 4 points. | 12 | ||||
| ○ | [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 | ||||
| ○68 | exec | Partial or unexisting vectorization - No issue detected | 0 | 0.12 | 0 | 25 |
| ○40 | exec | Partial or unexisting vectorization - No issue detected | 0 | 0.05 | 0 | 23.21 |