Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (16.08 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
[ 2 / 3 ] Security settings from the host restrict profiling. Some metrics will be missing or incomplete.
Current value for kernel.perf_event_paranoid is 2. If possible, set it to 1 or check with your system administrator which flag can be used to achieve this.
[ 3.00 / 3 ] Architecture specific option -mcpu 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.49%)
If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances.
[ 0 / 4 ] CPU activity is below 90% (29.29%)
CPU cores are idle more than 10% of time. Threads supposed to run on these cores are probably IO/sync waiting. Some hints: use faster filesystems to read/write data, improve parallel load balancing and/or scheduling.
[ 0 / 4 ] A significant amount of threads are idle (70.73%)
On average, more than 10% of observed threads are idle. Such threads are probably IO/sync waiting. Some hints: use faster filesystems to read/write data, improve parallel load balancing and/or scheduling.
[ 4 / 4 ] Affinity is good (91.74%)
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% (28.52%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (55.67%)
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 (42.82%) lower than cumulative innermost loop coverage (55.67%)
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 2689 - exec | Execution Time: 28 % - Vectorization Ratio: 100.00 % - Vector Length Use: 100.00 % | |
| ►Data Access Issues | 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 |
| ►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 |
| ►Loop 2687 - exec | Execution Time: 23 % - Vectorization Ratio: 44.63 % - Vector Length Use: 72.42 % | |
| ►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 |
| ►Control Flow Issues | 1002 | |
| ○ | [SA] Too many paths (1601 paths) - Simplify control structure. There are 1601 issues ( = paths) costing 1 point, limited to 1000. | 1000 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Vectorization Roadblocks | 1002 | |
| ○ | [SA] Too many paths (1601 paths) - Simplify control structure. There are 1601 issues ( = paths) costing 1 point, limited to 1000. | 1000 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Loop 3962 - exec | Execution Time: 7 % - Vectorization Ratio: 100.00 % - Vector Length Use: 100.00 % | |
| ►Data Access Issues | 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 |
| ►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 |
| ►Loop 3945 - exec | Execution Time: 6 % - Vectorization Ratio: 100.00 % - Vector Length Use: 100.00 % | |
| ►Data Access Issues | 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 |
| ►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 |
| ►Loop 3961 - exec | Execution Time: 5 % - Vectorization Ratio: 40.91 % - Vector Length Use: 70.55 % | |
| ►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 |
| ►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 (Outermost) - 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 (Outermost) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Loop 3944 - exec | Execution Time: 5 % - Vectorization Ratio: 42.86 % - Vector Length Use: 71.53 % | |
| ►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 |
| ►Control Flow Issues | 2 | |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Vectorization Roadblocks | 1002 | |
| ○ | [SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point. | 1000 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Loop 4026 - exec | Execution Time: 1 % - Vectorization Ratio: 100.00 % - Vector Length Use: 100.00 % | |
| ►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 2685 - exec | Execution Time: 1 % - Vectorization Ratio: 100.00 % - Vector Length Use: 100.00 % | |
| ►Data Access Issues | 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 4 issues ( = data accesses) costing 2 point each. | 8 |
| ►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 4 issues ( = data accesses) costing 2 point each. | 8 |
| ►Loop 3953 - exec | Execution Time: 1 % - Vectorization Ratio: 40.91 % - Vector Length Use: 70.55 % | |
| ►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 |
| ►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 (Outermost) - 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 (Outermost) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Loop 4029 - exec | Execution Time: 0 % - Vectorization Ratio: 100.00 % - Vector Length Use: 100.00 % | |
| ►Data Access Issues | 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 |
| ►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 |