Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 0 / 4 ] Application profile is too short (0.00 s)
If the overall application profiling time is less than 10 seconds, many of the measurements at function or loop level will very likely be under the measurement quality threshold (0,1 seconds). Rerun to increase runtime duration: for example use a larger dataset or include a repetition loop.
[ 2.35 / 3 ] Most of time spent in analyzed modules comes from functions without compilation information
Functions without compilation information (typically not compiled with -g) cumulate 2.11% 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.
[ 3 / 3 ] Optimization level option is correctly used
[ 3 / 3 ] Host configuration allows retrieval of all necessary metrics.
[ 2.94 / 3 ] Architecture specific option -axCORE is used
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 2.66 % 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 / 1 ] Lstopo was not found on the host (either not installed or not loaded). The Topology lstopo report will not be generated.
[ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (57.02%)
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 97.55% of time
[ 4 / 4 ] Threads activity is good
On average, more than 97.48% of observed threads are actually active
[ 4 / 4 ] Affinity is good (95.89%)
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% (42.26%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (51.01%)
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 (6.01%) lower than cumulative innermost loop coverage (51.01%)
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 7157 - AVBP_V7.16.0.KRAKEN | Execution Time: 42 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►Control Flow Issues | 4 | |
| ○ | [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 |
| ►Data Access Issues | 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 |
| ►Vectorization Roadblocks | 6 | |
| ○ | [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] 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 4845 - AVBP_V7.16.0.KRAKEN | Execution Time: 1 % - Vectorization Ratio: 0.00 % - Vector Length Use: 18.75 % | |
| ►Control Flow Issues | 46 | |
| ○ | [SA] Too many paths (40 paths) - Simplify control structure. There are 40 issues ( = paths) costing 1 point each with a malus of 4 points. | 44 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Vectorization Roadblocks | 46 | |
| ○ | [SA] Too many paths (40 paths) - Simplify control structure. There are 40 issues ( = paths) costing 1 point each with a malus of 4 points. | 44 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Loop 15079 - AVBP_V7.16.0.KRAKEN | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 20.63 % | |
| ►Control Flow Issues | 1002 | |
| ○ | [SA] Too many paths (1003 paths) - Simplify control structure. There are 1003 issues ( = paths) costing 1 point, limited to 1000. | 1000 |
| ○ | [SA] Non innermost loop (Outermost) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Data Access Issues | 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 |
| ►Vectorization Roadblocks | 1002 | |
| ○ | [SA] Too many paths (1003 paths) - Simplify control structure. There are 1003 issues ( = paths) costing 1 point, limited to 1000. | 1000 |
| ○ | [SA] Non innermost loop (Outermost) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Loop 4847 - AVBP_V7.16.0.KRAKEN | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 22.50 % | |
| ►Loop Computation Issues | 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 |
| ►Data Access Issues | 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 |
| ►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 15254 - AVBP_V7.16.0.KRAKEN | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►Control Flow Issues | 4 | |
| ○ | [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 |
| ►Data Access Issues | 4 | |
| ○ | [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 |
| ►Vectorization Roadblocks | 8 | |
| ○ | [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] 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 |
| ►Loop 4846 - AVBP_V7.16.0.KRAKEN | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 22.50 % | |
| ►Loop Computation Issues | 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 |
| ►Data Access Issues | 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 |
| ►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 15644 - AVBP_V7.16.0.KRAKEN | Execution Time: 0 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % | |
| ►Loop 21746 - AVBP_V7.16.0.KRAKEN | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 15.83 % | |
| ►Control Flow Issues | 47 | |
| ○ | [SA] Too many paths (41 paths) - Simplify control structure. There are 41 issues ( = paths) costing 1 point each with a malus of 4 points. | 45 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Data Access Issues | 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 |
| ►Vectorization Roadblocks | 47 | |
| ○ | [SA] Too many paths (41 paths) - Simplify control structure. There are 41 issues ( = paths) costing 1 point each with a malus of 4 points. | 45 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Loop 21754 - AVBP_V7.16.0.KRAKEN | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►Loop Computation Issues | 5 | |
| ○ | [SA] Peel/tail loop, considered having a low iteration count - Perform full unroll. Force compiler to use masked instructions. This issue costs 5 points. | 5 |
| ►Control Flow Issues | 5 | |
| ○ | [SA] Peel/tail loop, considered having a low iteration count - Perform full unroll. Force compiler to use masked instructions. This issue costs 5 points. | 5 |
| ►Loop 15634 - AVBP_V7.16.0.KRAKEN | Execution Time: 0 % - Vectorization Ratio: 61.90 % - Vector Length Use: 35.71 % | |
| ►Loop Computation Issues | 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 |
| ►Data Access Issues | 13 | |
| ○ | [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] 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] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, SHUFFLE/PERM) - Simplify data access and try to get stride 1 access. There are 5 issues (= instructions) costing 1 point each. | 5 |
| ►Vectorization Roadblocks | 8 | |
| ○ | [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] 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 |
| ►Inefficient Vectorization | 5 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, SHUFFLE/PERM) - Simplify data access and try to get stride 1 access. There are 5 issues (= instructions) costing 1 point each. | 5 |