Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (133.42 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.02 % 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 (97.81%)
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% (7.87%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (97.81%)
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 (0.00%) lower than cumulative innermost loop coverage (97.81%)
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 (%) |
|---|---|---|---|---|---|---|
| ○200 | exec | Partial or unexisting vectorization - No issue detected | 0 | 7.87 | 69.06 | 88.51 |
| ○188 | exec | Partial or unexisting vectorization - No issue detected | 0 | 7.28 | 71.64 | 88.08 |
| ○159 | exec | Partial or unexisting vectorization - No issue detected | 0 | 6.16 | 75.22 | 92.04 |
| ○367 | exec | Partial or unexisting vectorization - No issue detected | 0 | 4.8 | 79.31 | 97.41 |
| ○325 | exec | Partial or unexisting vectorization - No issue detected | 0 | 4.55 | 72.41 | 92.24 |
| ○171 | exec | Partial or unexisting vectorization - No issue detected | 0 | 4.48 | 70.97 | 91.53 |
| ►180 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 1001 | 4.44 | 5.13 | 25.64 |
| ○ | [SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point. | 1000 | ||||
| ○ | [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 | ||||
| ►167 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 1 | 4.21 | 75.76 | 88.26 |
| ○ | [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 | ||||
| ○327 | exec | Partial or unexisting vectorization - No issue detected | 0 | 4.12 | 79.17 | 98.44 |
| ►356 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 66 | 3.99 | 81.69 | 97.71 |
| ○ | [SA] Presence of expensive FP instructions - Perform hoisting, change algorithm, use SVML or proper numerical library or perform value profiling (count the number of distinct input values). There are 16 issues (= instructions) costing 4 points each. | 64 | ||||
| ○ | [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 |