Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (589.89 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 3.00 / 3 ] Optimization level option is correctly used
[ 3.00 / 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.
[ 3.00 / 3 ] Architecture specific option -march=znver4 is used
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.22 % 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 (99.62%)
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% (15.93%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (99.49%)
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.13%) lower than cumulative innermost loop coverage (99.49%)
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 (%) |
|---|---|---|---|---|---|---|
| ►226 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 52 | 15.93 | 9.26 | 13.66 |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 12 issues ( = indirect data accesses) costing 4 point each. | 48 | ||||
| ○ | [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 1 issues ( = data accesses) costing 2 point each. | 2 | ||||
| ○ | [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 | ||||
| ►74 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 12 | 7.17 | 13.79 | 14.22 |
| ○ | [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 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ►106 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 10 | 6.93 | 13.95 | 14.24 |
| ○ | [SA] Too many paths (6 paths) - Simplify control structure. There are 6 issues ( = paths) costing 1 point each with a malus of 4 points. | 10 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ►686 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 341 | 6.33 | 91.67 | 92.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 80 issues (= instructions) costing 4 points each. | 320 | ||||
| ○ | [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 7 issues ( = data accesses) costing 2 point each. | 14 | ||||
| ○ | [SA] Presence of special instructions executing on a single port (BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 3 issues (= instructions) costing 1 point each. | 3 | ||||
| ○ | [SA] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points. | 2 | ||||
| ○ | [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 | ||||
| ►98 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 10 | 5.93 | 15.38 | 14.42 |
| ○ | [SA] Too many paths (6 paths) - Simplify control structure. There are 6 issues ( = paths) costing 1 point each with a malus of 4 points. | 10 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ►66 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 12 | 5.53 | 14.29 | 14.17 |
| ○ | [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 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ►11 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 107 | 5.53 | 88.37 | 89.83 |
| ○ | [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 24 issues (= instructions) costing 4 points each. | 96 | ||||
| ○ | [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 3 issues ( = data accesses) costing 2 point each. | 6 | ||||
| ○ | [SA] More than 20% of the loads are accessing the stack - Perform loop splitting to decrease pressure on registers. This issue costs 2 points. | 2 | ||||
| ○ | [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 | ||||
| ○ | [SA] Presence of special instructions executing on a single port (BROADCAST) - Simplify data access and try to get stride 1 access. There are 1 issues (= instructions) costing 1 point each. | 1 | ||||
| ○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
| ►19 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 64 | 5.42 | 89.8 | 91.07 |
| ○ | [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 8 issues (= instructions) costing 4 points each. | 32 | ||||
| ○ | [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 13 issues ( = data accesses) costing 2 point each. | 26 | ||||
| ○ | [SA] Presence of a large number of scalar integer instructions - Simplify loop structure, perform loop splitting or perform unroll and jam. This issue costs 2 points. | 2 | ||||
| ○ | [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 | ||||
| ○ | [SA] More than 20% of the loads are accessing the stack - Perform loop splitting to decrease pressure on registers. This issue costs 2 points. | 2 | ||||
| ○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
| ►13 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 107 | 4.19 | 89.47 | 90.79 |
| ○ | [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 24 issues (= instructions) costing 4 points each. | 96 | ||||
| ○ | [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 3 issues ( = data accesses) costing 2 point each. | 6 | ||||
| ○ | [SA] More than 20% of the loads are accessing the stack - Perform loop splitting to decrease pressure on registers. This issue costs 2 points. | 2 | ||||
| ○ | [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 | ||||
| ○ | [SA] Presence of special instructions executing on a single port (BROADCAST) - Simplify data access and try to get stride 1 access. There are 1 issues (= instructions) costing 1 point each. | 1 | ||||
| ○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
| ►257 | exec | Inefficient vectorization. | 260 | 3.27 | 100 | 100 |
| ○ | [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 64 issues (= instructions) costing 4 points each. | 256 | ||||
| ○ | [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 | ||||
| ○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 |