Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (21.09 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 2.62 / 3 ] Optimization level option is correctly used
[ 2.62 / 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.62 / 3 ] Architecture specific option -xSKYLAKE 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
[ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (68.31%)
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.13%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (43.24%)
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% (4.05%) is spend in BLAS1 operations
It could be more efficient to inline by hand BLAS1 operations
[ 3 / 3 ] Cumulative Outermost/In between loops coverage (25.07%) lower than cumulative innermost loop coverage (43.24%)
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% (2.63%) 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 (%) |
|---|---|---|---|---|---|---|
| ►2887 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 29 | 10.13 | 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 | ||||
| ►2671 | exec | Inefficient vectorization. | 12 | 6.71 | 100 | 100 |
| ○ | [SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 6 issues ( = arrays) costing 2 points each | 12 | ||||
| ○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
| ○5939 | exec | Partial or unexisting vectorization - No issue detected | 0 | 3.72 | 0 | 6.25 |
| ►2650 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 40 | 3.53 | 62.96 | 66.17 |
| ○ | [SA] Too many paths (34 paths) - Simplify control structure. There are 34 issues ( = paths) costing 1 point each with a malus of 4 points. | 38 | ||||
| ○ | [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 | ||||
| ►1850 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 36 | 3.18 | 33.33 | 35.66 |
| ○ | [SA] Too many paths (30 paths) - Simplify control structure. There are 30 issues ( = paths) costing 1 point each with a malus of 4 points. | 34 | ||||
| ○ | [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 | ||||
| ►2065 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 22 | 2.85 | 22.83 | 14.88 |
| ○ | [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 | ||||
| ►1852 | exec | Inefficient vectorization. | 4 | 2.56 | 100 | 100 |
| ○ | [SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 2 issues ( = arrays) costing 2 points each | 4 | ||||
| ○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
| ►2721 | exec | Inefficient vectorization. | 12 | 2.3 | 100 | 100 |
| ○ | [SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 6 issues ( = arrays) costing 2 points each | 12 | ||||
| ○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
| ►3918 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 22 | 2.11 | 44.29 | 45.71 |
| ○ | [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 | ||||
| ►2055 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 636 | 2.02 | 35.29 | 34.07 |
| ○ | [SA] Too many paths (630 paths) - Simplify control structure. There are 630 issues ( = paths) costing 1 point each with a malus of 4 points. | 634 | ||||
| ○ | [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 |