Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (33.69 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 3 / 3 ] Optimization level option -Ofast is used
To have better performances, it is advised to help the compiler by using a proper optimization level (-Ofast)
[ 2 / 3 ] Helper debug compilation option -fno-omit-frame-pointer is missing
-fno-omit-frame-pointer improves the accuracy of callchains found during the application profiling.
[ 0 / 3 ] Architecture specific options are not used
Architecture specific options are needed to produce efficient code for a specific processor ( -x(target) or -ax(target) ).
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.32 % 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
[ 0 / 4 ] Too little time of the experiment time spent in analyzed loops (12.43%)
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% (4.70%), representing an hotspot for the application
[ 0 / 4 ] Too little time of the experiment time spent in analyzed innermost loops (10.91%)
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 (1.52%) lower than cumulative innermost loop coverage (10.91%)
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.37%) 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 (%) |
|---|---|---|---|---|---|---|
| ►266 | libqmckl.so.0 | Inefficient vectorization. | 34 | 4.7 | 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 13 issues ( = arrays) costing 2 points each | 26 | ||||
| ○ | [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] 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] 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 | ||||
| ►231 | libqmckl.so.0 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 12 | 1.61 | 42.86 | 50 |
| ○ | [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 6 issues ( = data accesses) costing 2 point each. | 12 | ||||
| ○592 | libqmckl.so.0 | Partial or unexisting vectorization - No issue detected | 0 | 1.09 | 58.97 | 64.1 |
| ►216 | libqmckl.so.0 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 91 | 0.89 | 21.49 | 32.64 |
| ○ | [SA] Too many paths (85 paths) - Simplify control structure. There are 85 issues ( = paths) costing 1 point each with a malus of 4 points. | 89 | ||||
| ○ | [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 | ||||
| ○543 | libqmckl.so.0 | Partial or unexisting vectorization - No issue detected | 0 | 0.59 | 7.69 | 26.92 |
| ►667 | libqmckl.so.0 | Inefficient vectorization. | 17 | 0.45 | 100 | 100 |
| ○ | [DA] Ratio time (ORIG)/time (DL1) is greater than 3 (8.56) - Perform blocking. Perform array restructuring. There are 0 issues (= non unit stride or indirect memory access) costing 2 point each, with an additional malus of 9 points due to the ORIG/DL1 ratio. | 9 | ||||
| ○ | [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: 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 | ||||
| ○ | [DA] Low iteration count (27 < 30) - Perform full unroll. Use compiler pragmas. Use PGO/FDO compiler options. Force compiler to use masked instructions. | 0 | ||||
| ○ | [DA] The ratio FP/LS (floating point / memory accesses) is smaller than 0.8 (0.22) - Focus on optimizing data accesses. | 0 | ||||
| ►220 | libqmckl.so.0 | Inefficient vectorization. | 15 | 0.42 | 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 3 issues ( = arrays) costing 2 points each | 6 | ||||
| ○ | [DA] Low iteration count (1 < 10) - Perform full unroll. Use compiler pragmas. Use PGO/FDO compiler options. Force compiler to use masked instructions. This issue costs 5 points. | 5 | ||||
| ○ | [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 | ||||
| ○630 | libqmckl.so.0 | Partial or unexisting vectorization - No issue detected | 0 | 0.33 | 58.97 | 64.1 |
| ►540 | libqmckl.so.0 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 10 | 0.24 | 5.88 | 26.29 |
| ○ | [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] 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 | ||||
| ►207 | libqmckl.so.0 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 19 | 0.22 | 8.33 | 26.04 |
| ○ | [SA] Too many paths (13 paths) - Simplify control structure. There are 13 issues ( = paths) costing 1 point each with a malus of 4 points. | 17 | ||||
| ○ | [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 |