Help is available by moving the cursor above any symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (25.71 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 3 / 3 ] Optimization level option is correctly used
[ 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 ] 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.86 % 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.
[ 0 / 0 ] Fastmath not used
Consider to add ffast-math to compilation flags (or replace -O3 with -Ofast) to unlock potential extra speedup by relaxing floating-point computation consistency. Warning: floating-point accuracy may be reduced and the compliance to IEEE/ISO rules/specifications for math functions will be relaxed, typically 'errno' will no longer be set after calling some math functions.
[ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (92.50%)
If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances.
[ 3 / 4 ] CPU activity is below 90% (75.33%)
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.
[ 3 / 4 ] A significant amount of threads are idle (26.13%)
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 (99.84%)
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% (69.99%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (77.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 (15.44%) lower than cumulative innermost loop coverage (77.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.01%) is spend in Libm/SVML (special functions)
Loop ID | Analysis | Penalty Score |
---|---|---|
►Loop 94 - exec | Execution Time: 69 % - Vectorization Ratio: 6.06 % - Vector Length Use: 13.26 % | |
►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 |
►Control Flow Issues | 13 | |
○ | [SA] Too many paths (9 paths) - Simplify control structure. There are 9 issues ( = paths) costing 1 point each with a malus of 4 points. | 13 |
►Vectorization Roadblocks | 13 | |
○ | [SA] Too many paths (9 paths) - Simplify control structure. There are 9 issues ( = paths) costing 1 point each with a malus of 4 points. | 13 |
►Loop 93 - exec | Execution Time: 12 % - Vectorization Ratio: 9.72 % - Vector Length Use: 13.45 % | |
►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 |
►Control Flow Issues | 126 | |
○ | [SA] Too many paths (120 paths) - Simplify control structure. There are 120 issues ( = paths) costing 1 point each with a malus of 4 points. | 124 |
○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
►Vectorization Roadblocks | 126 | |
○ | [SA] Too many paths (120 paths) - Simplify control structure. There are 120 issues ( = paths) costing 1 point each with a malus of 4 points. | 124 |
○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
►Loop 89 - exec | Execution Time: 4 % - 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 105 - exec | Execution Time: 2 % - Vectorization Ratio: 24.49 % - Vector Length Use: 30.53 % | |
►Control Flow Issues | 157 | |
○ | [SA] Too many paths (151 paths) - Simplify control structure. There are 151 issues ( = paths) costing 1 point each with a malus of 4 points. | 155 |
○ | [SA] Non innermost loop (Outermost) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
►Data Access Issues | 0 | |
○ | [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 |
►Vectorization Roadblocks | 157 | |
○ | [SA] Too many paths (151 paths) - Simplify control structure. There are 151 issues ( = paths) costing 1 point each with a malus of 4 points. | 155 |
○ | [SA] Non innermost loop (Outermost) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
►Loop 104 - exec | Execution Time: 1 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
►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 | 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 84 - exec | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 10.00 % | |
►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 |
►Control Flow Issues | 32 | |
○ | [SA] Too many paths (28 paths) - Simplify control structure. There are 28 issues ( = paths) costing 1 point each with a malus of 4 points. | 32 |
►Vectorization Roadblocks | 32 | |
○ | [SA] Too many paths (28 paths) - Simplify control structure. There are 28 issues ( = paths) costing 1 point each with a malus of 4 points. | 32 |
►Loop 61 - exec | Execution Time: 0 % - Vectorization Ratio: 21.15 % - Vector Length Use: 13.74 % | |
►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 | 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 special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE) - Simplify data access and try to get stride 1 access. There are 32 issues (= instructions) costing 1 point each. | 32 |
►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 |
►Inefficient Vectorization | 32 | |
○ | [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 32 issues (= instructions) costing 1 point each. | 32 |
►Loop 103 - exec | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.32 % | |
►Loop Computation Issues | 12 | |
○ | [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 3 issues (= instructions) costing 4 points each. | 12 |
►Control Flow Issues | 14 | |
○ | [SA] Too many paths (8 paths) - Simplify control structure. There are 8 issues ( = paths) costing 1 point each with a malus of 4 points. | 12 |
○ | [SA] Non innermost loop (Outermost) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
►Vectorization Roadblocks | 14 | |
○ | [SA] Too many paths (8 paths) - Simplify control structure. There are 8 issues ( = paths) costing 1 point each with a malus of 4 points. | 12 |
○ | [SA] Non innermost loop (Outermost) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
►Loop 91 - exec | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 7.19 % | |
►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 | 1002 | |
○ | [SA] Too many paths (4457 paths) - Simplify control structure. There are 4457 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 |
►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 (4457 paths) - Simplify control structure. There are 4457 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 110 - exec | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
►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 | 6 | |
○ | [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 3 issues ( = data accesses) costing 2 point each. | 6 |
►Vectorization Roadblocks | 6 | |
○ | [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 3 issues ( = data accesses) costing 2 point each. | 6 |