Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (37.37 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 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 / 3 ] Optimization level option is correctly used
[ 3 / 3 ] Host configuration allows retrieval of all necessary metrics.
[ 3.00 / 3 ] Architecture specific option -march=znver5 is used
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.00 % 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
[ 1 / 1 ] Lstopo present. The Topology lstopo report will be generated.
[ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (98.06%)
If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances.
[ 4 / 4 ] CPU activity is good
CPU cores are active 99.03% of time
[ 4 / 4 ] Threads activity is good
On average, more than 97.99% of observed threads are actually active
[ 4 / 4 ] Affinity is good (99.79%)
Threads are not migrating to CPU cores: probably successfully pinned
[ 4 / 4 ] Loop profile is not flat
At least one loop coverage is greater than 4% (6.47%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (98.06%)
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 ] Cumulative Outermost/In between loops coverage (0.00%) lower than cumulative innermost loop coverage (98.06%)
Having cumulative Outermost/In between loops coverage greater than cumulative innermost loop coverage will make loop optimization more complex
[ 3 / 3 ] Less than 10% (0.00%) is spend in BLAS1 operations
It could be more efficient to inline by hand BLAS1 operations
[ 2 / 2 ] Less than 10% (0.00%) is spend in BLAS2 operations
BLAS2 calls usually could make a poor cache usage and could benefit from inlining.
[ 2 / 2 ] Less than 10% (0.00%) is spend in Libm/SVML (special functions)
| Loop ID | Analysis | Penalty Score |
|---|---|---|
| ►Loop 263 - exec | Execution Time: 6 % - Vectorization Ratio: 36.18 % - Vector Length Use: 21.87 % | |
| ►Loop Computation Issues | 8 | |
| ○ | [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 2 issues (= instructions) costing 4 points each. | 8 |
| ►Data Access Issues | 232 | |
| ○ | [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] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 14 issues ( = indirect data accesses) costing 4 point each. | 56 |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 174 issues (= instructions) costing 1 point each. | 174 |
| ►Vectorization Roadblocks | 58 | |
| ○ | [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] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 14 issues ( = indirect data accesses) costing 4 point each. | 56 |
| ►Inefficient Vectorization | 174 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 174 issues (= instructions) costing 1 point each. | 174 |
| ►Loop 218 - exec | Execution Time: 5 % - Vectorization Ratio: 37.89 % - Vector Length Use: 22.76 % | |
| ►Loop Computation Issues | 14 | |
| ○ | [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 2 issues (= instructions) costing 4 points each. | 8 |
| ○ | [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] 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 |
| ►Data Access Issues | 51 | |
| ○ | [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] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE) - Simplify data access and try to get stride 1 access. There are 35 issues (= instructions) costing 1 point each. | 35 |
| ►Vectorization Roadblocks | 16 | |
| ○ | [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 | 35 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE) - Simplify data access and try to get stride 1 access. There are 35 issues (= instructions) costing 1 point each. | 35 |
| ►Loop 262 - exec | Execution Time: 5 % - Vectorization Ratio: 36.36 % - Vector Length Use: 21.85 % | |
| ►Loop Computation Issues | 10 | |
| ○ | [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 2 issues (= instructions) costing 4 points each. | 8 |
| ○ | [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 |
| ►Data Access Issues | 172 | |
| ○ | [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] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 11 issues ( = indirect data accesses) costing 4 point each. | 44 |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 126 issues (= instructions) costing 1 point each. | 126 |
| ►Vectorization Roadblocks | 46 | |
| ○ | [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] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 11 issues ( = indirect data accesses) costing 4 point each. | 44 |
| ►Inefficient Vectorization | 126 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 126 issues (= instructions) costing 1 point each. | 126 |
| ►Loop 128 - exec | Execution Time: 5 % - Vectorization Ratio: 30.77 % - Vector Length Use: 20.09 % | |
| ►Loop Computation Issues | 4 | |
| ○ | [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 1 issues (= instructions) costing 4 points each. | 4 |
| ►Data Access Issues | 273 | |
| ○ | [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] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 17 issues ( = indirect data accesses) costing 4 point each. | 68 |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 201 issues (= instructions) costing 1 point each. | 201 |
| ○ | [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 | 70 | |
| ○ | [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] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 17 issues ( = indirect data accesses) costing 4 point each. | 68 |
| ►Inefficient Vectorization | 201 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 201 issues (= instructions) costing 1 point each. | 201 |
| ►Loop 168 - exec | Execution Time: 4 % - Vectorization Ratio: 48.93 % - Vector Length Use: 26.25 % | |
| ►Loop Computation Issues | 10 | |
| ○ | [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 2 issues (= instructions) costing 4 points each. | 8 |
| ○ | [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 |
| ►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 | 70 | |
| ○ | [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] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 1 issues (= instructions) costing 4 points each. | 4 |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 46 issues (= instructions) costing 1 point each. | 46 |
| ►Vectorization Roadblocks | 22 | |
| ○ | [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 5 issues ( = indirect data accesses) costing 4 point each. | 20 |
| ►Inefficient Vectorization | 52 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 1 issues (= instructions) costing 4 points each. | 4 |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 46 issues (= instructions) costing 1 point each. | 46 |
| ○ | [SA] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points. | 2 |
| ►Loop 160 - exec | Execution Time: 4 % - Vectorization Ratio: 48.17 % - Vector Length Use: 25.90 % | |
| ►Loop Computation Issues | 10 | |
| ○ | [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 2 issues (= instructions) costing 4 points each. | 8 |
| ○ | [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 |
| ►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 | 70 | |
| ○ | [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] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 1 issues (= instructions) costing 4 points each. | 4 |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 46 issues (= instructions) costing 1 point each. | 46 |
| ►Vectorization Roadblocks | 22 | |
| ○ | [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 5 issues ( = indirect data accesses) costing 4 point each. | 20 |
| ►Inefficient Vectorization | 52 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 1 issues (= instructions) costing 4 points each. | 4 |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 46 issues (= instructions) costing 1 point each. | 46 |
| ○ | [SA] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points. | 2 |
| ►Loop 161 - exec | Execution Time: 4 % - Vectorization Ratio: 34.95 % - Vector Length Use: 21.00 % | |
| ►Loop Computation Issues | 6 | |
| ○ | [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 1 issues (= instructions) costing 4 points each. | 4 |
| ○ | [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 |
| ►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] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE) - Simplify data access and try to get stride 1 access. There are 41 issues (= instructions) costing 1 point each. | 41 |
| ►Vectorization Roadblocks | 16 | |
| ○ | [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 | 41 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE) - Simplify data access and try to get stride 1 access. There are 41 issues (= instructions) costing 1 point each. | 41 |
| ►Loop 169 - exec | Execution Time: 4 % - Vectorization Ratio: 35.58 % - Vector Length Use: 21.27 % | |
| ►Loop Computation Issues | 6 | |
| ○ | [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 1 issues (= instructions) costing 4 points each. | 4 |
| ○ | [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 |
| ►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] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE) - Simplify data access and try to get stride 1 access. There are 41 issues (= instructions) costing 1 point each. | 41 |
| ►Vectorization Roadblocks | 16 | |
| ○ | [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 | 41 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE) - Simplify data access and try to get stride 1 access. There are 41 issues (= instructions) costing 1 point each. | 41 |
| ►Loop 209 - exec | Execution Time: 4 % - Vectorization Ratio: 36.22 % - Vector Length Use: 21.75 % | |
| ►Loop Computation Issues | 6 | |
| ○ | [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] 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 |
| ►Data Access Issues | 116 | |
| ○ | [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] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 8 issues ( = indirect data accesses) costing 4 point each. | 32 |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 82 issues (= instructions) costing 1 point each. | 82 |
| ►Vectorization Roadblocks | 34 | |
| ○ | [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] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 8 issues ( = indirect data accesses) costing 4 point each. | 32 |
| ►Inefficient Vectorization | 82 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 82 issues (= instructions) costing 1 point each. | 82 |
| ►Loop 144 - exec | Execution Time: 3 % - Vectorization Ratio: 49.07 % - Vector Length Use: 26.89 % | |
| ►Loop Computation Issues | 26 | |
| ○ | [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 6 issues (= instructions) costing 4 points each. | 24 |
| ○ | [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 |
| ►Control Flow Issues | 20 | |
| ○ | [SA] Too many paths (16 paths) - Simplify control structure. There are 16 issues ( = paths) costing 1 point each with a malus of 4 points. | 20 |
| ►Data Access Issues | 184 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 182 issues (= instructions) costing 1 point each. | 182 |
| ○ | [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] Too many paths (16 paths) - Simplify control structure. There are 16 issues ( = paths) costing 1 point each with a malus of 4 points. | 20 |
| ►Inefficient Vectorization | 184 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 182 issues (= instructions) costing 1 point each. | 182 |
| ○ | [SA] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points. | 2 |