Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (76.55 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 0 / 3 ] Some functions are compiled with a low optimization level (O0 or O1)
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 ] Most of time spent in analyzed modules comes from functions without compilation information
Functions without compilation information (typically not compiled with -g) cumulate 100.00% of the time spent in analyzed modules. Check that -g is present. Remark: if -g is indeed used, this can also be due to some compiler built-in functions (typically math) or statically linked libraries. This warning can be ignored in that case.
[ 0 / 3 ] Compilation of some functions is not optimized for the target processor
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 % 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 (96.99%)
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% (6.69%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (96.97%)
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.02%) lower than cumulative innermost loop coverage (96.97%)
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 | Analysis | Penalty Score |
|---|---|---|
| ►Loop 114 - exec | Execution Time: 6 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % | |
| ►Loop Computation Issues | 32 | |
| ○ | [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 |
| ►Data Access Issues | 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 10 issues ( = data accesses) costing 2 point each. | 20 |
| ○ | [SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 14 issues ( = arrays) costing 2 points each | 28 |
| ○ | [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 |
| ►Vectorization Roadblocks | 20 | |
| ○ | [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 10 issues ( = data accesses) costing 2 point each. | 20 |
| ►Loop 111 - exec | Execution Time: 5 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % | |
| ►Loop Computation Issues | 32 | |
| ○ | [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 |
| ►Data Access Issues | 38 | |
| ○ | [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 |
| ○ | [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 |
| ►Vectorization Roadblocks | 12 | |
| ○ | [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 |
| ►Loop 330 - exec | Execution Time: 5 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % | |
| ►Loop Computation Issues | 36 | |
| ○ | [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] 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 |
| ►Data Access Issues | 8 | |
| ○ | [SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 4 issues ( = arrays) costing 2 points each | 8 |
| ►Loop 120 - exec | Execution Time: 5 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % | |
| ►Loop Computation Issues | 16 | |
| ○ | [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 4 issues (= instructions) costing 4 points each. | 16 |
| ►Data Access Issues | 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 7 issues ( = data accesses) costing 2 point each. | 14 |
| ○ | [SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 14 issues ( = arrays) costing 2 points each | 28 |
| ►Vectorization Roadblocks | 14 | |
| ○ | [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 |
| ►Loop 172 - exec | Execution Time: 4 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % | |
| ►Loop Computation Issues | 16 | |
| ○ | [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 4 issues (= instructions) costing 4 points each. | 16 |
| ►Data Access Issues | 10 | |
| ○ | [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] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 4 issues ( = arrays) costing 2 points each | 8 |
| ►Vectorization Roadblocks | 2 | |
| ○ | [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 |
| ►Loop 182 - exec | Execution Time: 4 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % | |
| ►Loop Computation Issues | 16 | |
| ○ | [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 4 issues (= instructions) costing 4 points each. | 16 |
| ►Data Access Issues | 10 | |
| ○ | [SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 5 issues ( = arrays) costing 2 points each | 10 |
| ►Loop 272 - exec | Execution Time: 4 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % | |
| ►Loop Computation Issues | 4 | |
| ○ | [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 |
| ►Data Access Issues | 24 | |
| ○ | [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] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 10 issues ( = arrays) costing 2 points each | 20 |
| ►Vectorization Roadblocks | 4 | |
| ○ | [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 |
| ►Loop 184 - exec | Execution Time: 4 % - Vectorization Ratio: 91.61 % - Vector Length Use: 41.89 % | |
| ►Loop Computation Issues | 36 | |
| ○ | [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 9 issues (= instructions) costing 4 points each. | 36 |
| ►Control Flow Issues | 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 |
| ►Data Access Issues | 57 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 4 issues ( = indirect data accesses) costing 4 point each. | 16 |
| ○ | [SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 6.5 issues ( = arrays) costing 2 points each | 14 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 5 issues (= instructions) costing 4 points each. | 20 |
| ○ | [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 7 issues (= instructions) costing 1 point each. | 7 |
| ►Vectorization Roadblocks | 18 | |
| ○ | [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] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 4 issues ( = indirect data accesses) costing 4 point each. | 16 |
| ►Inefficient Vectorization | 29 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 5 issues (= instructions) costing 4 points each. | 20 |
| ○ | [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 7 issues (= instructions) costing 1 point each. | 7 |
| ○ | [SA] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points. | 2 |
| ►Loop 175 - exec | Execution Time: 3 % - Vectorization Ratio: 98.15 % - Vector Length Use: 41.78 % | |
| ►Loop Computation Issues | 48 | |
| ○ | [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 12 issues (= instructions) costing 4 points each. | 48 |
| ►Data Access Issues | 59 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 5 issues ( = indirect data accesses) costing 4 point each. | 20 |
| ○ | [SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 8 issues ( = arrays) costing 2 points each | 16 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 5 issues (= instructions) costing 4 points each. | 20 |
| ○ | [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 |
| ►Vectorization Roadblocks | 20 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 5 issues ( = indirect data accesses) costing 4 point each. | 20 |
| ►Inefficient Vectorization | 25 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 5 issues (= instructions) costing 4 points each. | 20 |
| ○ | [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 |
| ►Loop 136 - exec | Execution Time: 3 % - Vectorization Ratio: 99.12 % - Vector Length Use: 45.94 % | |
| ►Loop Computation Issues | 48 | |
| ○ | [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 12 issues (= instructions) costing 4 points each. | 48 |
| ►Data Access Issues | 75 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 5 issues ( = indirect data accesses) costing 4 point each. | 20 |
| ○ | [SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 9 issues ( = arrays) costing 2 points each | 18 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 8 issues (= instructions) costing 4 points each. | 32 |
| ○ | [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 5 issues (= instructions) costing 1 point each. | 5 |
| ►Vectorization Roadblocks | 20 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 5 issues ( = indirect data accesses) costing 4 point each. | 20 |
| ►Inefficient Vectorization | 39 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 8 issues (= instructions) costing 4 points each. | 32 |
| ○ | [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 5 issues (= instructions) costing 1 point each. | 5 |
| ○ | [SA] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points. | 2 |