Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (27.32 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 2.63 / 3 ] Optimization level option is correctly used
[ 2.63 / 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.
[ 2.63 / 3 ] Architecture specific option -xSKYLAKE is used
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.13 % 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 (56.60%)
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% (10.05%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (41.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% (7.94%) is spend in BLAS1 operations
It could be more efficient to inline by hand BLAS1 operations
[ 3 / 3 ] Cumulative Outermost/In between loops coverage (15.51%) lower than cumulative innermost loop coverage (41.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% (7.74%) 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 (%) |
|---|---|---|---|---|---|---|
| ►3113 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 29 | 10.05 | 18.18 | 13.64 |
| ○ | [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 14 issues ( = data accesses) costing 2 point each. | 28 | ||||
| ○ | [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 | ||||
| ►2882 | exec | Inefficient vectorization. | 2 | 6.98 | 100 | 50 |
| ○ | [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 | ||||
| ►2024 | exec | Inefficient vectorization. | 2 | 3.55 | 100 | 50 |
| ○ | [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 | ||||
| ○6374 | exec | Partial or unexisting vectorization - No issue detected | 0 | 2.94 | 0 | 6.25 |
| ►2935 | exec | Inefficient vectorization. | 2 | 2.09 | 100 | 50 |
| ○ | [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 | ||||
| ►2236 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 22 | 2.05 | 7.5 | 12.89 |
| ○ | [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 | ||||
| ►2021 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 52 | 1.66 | 23.08 | 19.07 |
| ○ | [SA] Too many paths (46 paths) - Simplify control structure. There are 46 issues ( = paths) costing 1 point each with a malus of 4 points. | 50 | ||||
| ○ | [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 | ||||
| ►2860 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 23 | 1.45 | 23.44 | 15.04 |
| ○ | [SA] Too many paths (17 paths) - Simplify control structure. There are 17 issues ( = paths) costing 1 point each with a malus of 4 points. | 21 | ||||
| ○ | [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 | ||||
| ►2225 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 329 | 1.4 | 23.53 | 13.97 |
| ○ | [SA] Too many paths (323 paths) - Simplify control structure. There are 323 issues ( = paths) costing 1 point each with a malus of 4 points. | 327 | ||||
| ○ | [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 | ||||
| ►4197 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 22 | 1.16 | 29.31 | 14.87 |
| ○ | [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 |