Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (36.78 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 0 / 3 ] Optimization level option not used
To have better performances, it is advised to help the compiler by using a proper optimization level (-O2 of higher). Warning, depending on compilers, faster optimization levels can decrease numeric accuracy.
[ 0 / 3 ] Helper debug compilation options -g and -fno-omit-frame-pointer are missing
-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.
[ 0 / 3 ] Architecture specific options are not used [AARCH64]
Architecture specific options are needed to produce efficient code for a specific processor ( -mcpu=native ).
[ 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 (92.41%)
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% (39.77%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (54.77%)
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 (37.64%) lower than cumulative innermost loop coverage (54.77%)
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 (%) |
|---|---|---|---|---|---|---|
| ○28 | exec | Partial or unexisting vectorization - No issue detected | 0 | 39.77 | 0 | 25 |
| ►27 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 4 | 37.61 | 0 | 24.22 |
| ○ | [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] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 | ||||
| ►37 | exec | The loop is fully and efficiently vectorized. | 0 | 8.13 | 100 | 100 |
| ○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
| ►41 | exec | The loop is fully and efficiently vectorized. | 0 | 4.29 | 100 | 100 |
| ○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
| ○20 | exec | Partial or unexisting vectorization - No issue detected | 0 | 2.17 | 0 | 25 |
| ►29 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 6 | 0.31 | 90.91 | 93.18 |
| ○ | [SA] Less than 10% of the FP ADD/SUB/MUL arithmetic operations are performed using FMA - Reorganize arithmetic expressions to exhibit potential for FMA. This issue costs 4 points. | 4 | ||||
| ○ | [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 | ||||
| ○743 | exec | Partial or unexisting vectorization - No issue detected | 0 | 0.06 | 0 | 25 |
| ►26 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 4 | 0.02 | 0 | 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] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 | ||||
| ○751 | exec | Partial or unexisting vectorization - No issue detected | 0 | 0.02 | 0 | 25 |
| ○755 | exec | Partial or unexisting vectorization - No issue detected | 0 | 0.01 | 0 | 25 |