Help is available by moving the cursor above any symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (81.70 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 3 / 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 improves 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 / 3 ] Architecture specific option -march=native 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 (89.00%)
If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances.
[ 4 / 4 ] Threads activity is good
On average, more than 97.52% of observed threads are actually active
[ 4 / 4 ] CPU activity is good
CPU cores are active 97.88% of time
[ 4 / 4 ] Loop profile is not flat
At least one loop coverage is greater than 4% (26.14%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (86.85%)
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.
[ 4 / 4 ] Affinity is good (98.03%)
Threads are not migrating to CPU cores: probably successfully pinned
[ 3 / 3 ] Less than 10% (0.00%) is spend in BLAS1 operations
It could be more efficient to inline by hand BLAS1 operations
[ 3 / 3 ] Functions mostly use all threads
Functions running on a reduced number of threads (typically sequential code) cover less than 10% of application walltime (0.00%)
[ 3 / 3 ] Cumulative Outermost/In between loops coverage (2.15%) lower than cumulative innermost loop coverage (86.85%)
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.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 30479 - exec | Execution Time: 26 % - Vectorization Ratio: 32.50 % - Vector Length Use: 12.03 % | |
►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] 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 | 18 | |
○ | [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 3 issues ( = indirect data accesses) costing 4 point each. | 12 |
○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BROADCAST) - Simplify data access and try to get stride 1 access. There are 2 issues (= instructions) costing 1 point each. | 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 | 16 | |
○ | [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 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 3 issues ( = indirect data accesses) costing 4 point each. | 12 |
►Inefficient Vectorization | 2 | |
○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BROADCAST) - Simplify data access and try to get stride 1 access. There are 2 issues (= instructions) costing 1 point each. | 2 |
►Loop 30493 - exec | Execution Time: 24 % - Vectorization Ratio: 29.17 % - Vector Length Use: 11.37 % | |
►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] 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 | 7 | |
○ | [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 1 issues ( = indirect data accesses) costing 4 point each. | 4 |
○ | [SA] Presence of special instructions executing on a single port (BROADCAST) - Simplify data access and try to get stride 1 access. There are 1 issues (= instructions) costing 1 point each. | 1 |
►Vectorization Roadblocks | 8 | |
○ | [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 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 1 issues ( = indirect data accesses) costing 4 point each. | 4 |
►Inefficient Vectorization | 1 | |
○ | [SA] Presence of special instructions executing on a single port (BROADCAST) - Simplify data access and try to get stride 1 access. There are 1 issues (= instructions) costing 1 point each. | 1 |
►Loop 30478 - exec | Execution Time: 15 % - Vectorization Ratio: 13.64 % - Vector Length Use: 9.09 % | |
►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 | 6 | |
○ | [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, BROADCAST) - Simplify data access and try to get stride 1 access. There are 2 issues (= instructions) costing 1 point each. | 2 |
►Vectorization Roadblocks | 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 | 2 | |
○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BROADCAST) - Simplify data access and try to get stride 1 access. There are 2 issues (= instructions) costing 1 point each. | 2 |
►Loop 30492 - exec | Execution Time: 6 % - Vectorization Ratio: 0.00 % - Vector Length Use: 7.42 % | |
►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 | 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 | 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 26314 - exec | Execution Time: 2 % - Vectorization Ratio: 83.33 % - Vector Length Use: 85.42 % | |
►Data Access Issues | 1 | |
○ | [SA] Presence of special instructions executing on a single port (BROADCAST) - Simplify data access and try to get stride 1 access. There are 1 issues (= instructions) costing 1 point each. | 1 |
►Inefficient Vectorization | 1 | |
○ | [SA] Presence of special instructions executing on a single port (BROADCAST) - Simplify data access and try to get stride 1 access. There are 1 issues (= instructions) costing 1 point each. | 1 |
►Loop 30423 - exec | Execution Time: 1 % - Vectorization Ratio: 40.00 % - Vector Length Use: 13.75 % | |
►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 26323 - exec | Execution Time: 1 % - Vectorization Ratio: 100.00 % - Vector Length Use: 100.00 % | |
►Loop 24767 - exec | Execution Time: 1 % - Vectorization Ratio: 100.00 % - Vector Length Use: 96.43 % | |
►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 | 21 | |
○ | [SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 0 issues ( = arrays) costing 2 points each | 0 |
○ | [SA] Presence of special instructions executing on a single port (SHUFFLE/PERM) - Simplify data access and try to get stride 1 access. There are 21 issues (= instructions) costing 1 point each. | 21 |
►Inefficient Vectorization | 21 | |
○ | [SA] Presence of special instructions executing on a single port (SHUFFLE/PERM) - Simplify data access and try to get stride 1 access. There are 21 issues (= instructions) costing 1 point each. | 21 |
►Loop 27792 - exec | Execution Time: 1 % - Vectorization Ratio: 48.39 % - Vector Length Use: 25.81 % | |
►Data Access Issues | 23 | |
○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, COMPRESS/EXPAND) - Simplify data access and try to get stride 1 access. There are 15 issues (= instructions) costing 1 point each. | 15 |
►Vectorization Roadblocks | 8 | |
○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
►Inefficient Vectorization | 17 | |
○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, COMPRESS/EXPAND) - Simplify data access and try to get stride 1 access. There are 15 issues (= instructions) costing 1 point each. | 15 |
○ | [SA] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points. | 2 |
►Loop 27796 - exec | Execution Time: 1 % - Vectorization Ratio: 0.00 % - Vector Length Use: 6.25 % | |
►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 |