Help is available by moving the cursor above any symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (11.63 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=native 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 (37.00%)
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% (30.11%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (36.59%)
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.41%) lower than cumulative innermost loop coverage (36.59%)
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 (%) |
---|---|---|---|---|---|---|
►87 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 9 | 30.11 | 30.51 | 16.31 |
○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 1 issues ( = indirect data accesses) costing 4 point each. | 4 | ||||
○ | [SA] Several paths (3 paths) - Simplify control structure or force the compiler to use masked instructions. There are 3 issues ( = paths) costing 1 point each. | 3 | ||||
○ | [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 | ||||
►69 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 2 | 2.03 | 0 | 10.94 |
○ | [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 | ||||
►31 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 2 | 1.89 | 33.33 | 12.5 |
○ | [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 | ||||
►29 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 21 | 1.26 | 97.3 | 97.64 |
○ | [SA] Presence of special instructions executing on a single port (SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 19 issues (= instructions) costing 1 point each. | 19 | ||||
○ | [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 | ||||
►112 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 4 | 0.68 | 0 | 12.5 |
○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 1 issues ( = indirect data accesses) costing 4 point each. | 4 | ||||
►102 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 394 | 0.34 | 17.14 | 12.32 |
○ | [SA] Too many paths (390 paths) - Simplify control structure. There are 390 issues ( = paths) costing 1 point each with a malus of 4 points. | 394 | ||||
○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
►86 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 9 | 0.27 | 0 | 12.5 |
○ | [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 2 issues ( = data accesses) costing 2 point each. | 4 | ||||
○ | [SA] Several paths (3 paths) - Simplify control structure or force the compiler to use masked instructions. There are 3 issues ( = paths) costing 1 point each. | 3 | ||||
○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 | ||||
►85 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 16 | 0.12 | 0 | 10.42 |
○ | [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 5 issues ( = data accesses) costing 2 point each. | 10 | ||||
○ | [SA] Several paths (4 paths) - Simplify control structure or force the compiler to use masked instructions. There are 4 issues ( = paths) costing 1 point each. | 4 | ||||
○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 | ||||
►115 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 4 | 0.07 | 0 | 12.5 |
○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 1 issues ( = indirect data accesses) costing 4 point each. | 4 | ||||
○28 | exec | Partial or unexisting vectorization - No issue detected | 0 | 0.05 | 0 | 12.5 |