Help is available by moving the cursor above any symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (83.33 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 (95.33%)
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 93.77% of time
[ 4 / 4 ] Threads activity is good
On average, more than 93.75% of observed threads are actually active
[ 4 / 4 ] Affinity is good (96.25%)
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.90%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (95.33%)
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 (95.33%)
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 309 - exec | Execution Time: 6 % - Vectorization Ratio: 69.23 % - Vector Length Use: 85.34 % | |
►Loop Computation Issues | 20 | |
○ | [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 |
○ | [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 | 158 | |
○ | [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 41 issues ( = data accesses) costing 2 point each. | 82 |
○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 19 issues ( = indirect data accesses) costing 4 point each. | 76 |
►Vectorization Roadblocks | 158 | |
○ | [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 41 issues ( = data accesses) costing 2 point each. | 82 |
○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 19 issues ( = indirect data accesses) costing 4 point each. | 76 |
►Loop 153 - exec | Execution Time: 5 % - Vectorization Ratio: 69.18 % - Vector Length Use: 85.32 % | |
►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 | 130 | |
○ | [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 35 issues ( = data accesses) costing 2 point each. | 70 |
○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 15 issues ( = indirect data accesses) costing 4 point each. | 60 |
►Vectorization Roadblocks | 130 | |
○ | [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 35 issues ( = data accesses) costing 2 point each. | 70 |
○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 15 issues ( = indirect data accesses) costing 4 point each. | 60 |
►Loop 307 - exec | Execution Time: 5 % - Vectorization Ratio: 72.52 % - Vector Length Use: 86.74 % | |
►Loop Computation Issues | 20 | |
○ | [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 |
○ | [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 | 122 | |
○ | [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 31 issues ( = data accesses) costing 2 point each. | 62 |
○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 15 issues ( = indirect data accesses) costing 4 point each. | 60 |
►Vectorization Roadblocks | 122 | |
○ | [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 31 issues ( = data accesses) costing 2 point each. | 62 |
○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 15 issues ( = indirect data accesses) costing 4 point each. | 60 |
►Loop 199 - exec | Execution Time: 5 % - Vectorization Ratio: 73.75 % - Vector Length Use: 90.78 % | |
►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 | 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 11 issues ( = data accesses) costing 2 point each. | 22 |
○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 6 issues ( = indirect data accesses) costing 4 point each. | 24 |
►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 11 issues ( = data accesses) costing 2 point each. | 22 |
○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 6 issues ( = indirect data accesses) costing 4 point each. | 24 |
►Loop 189 - exec | Execution Time: 4 % - Vectorization Ratio: 76.00 % - Vector Length Use: 91.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 | 40 | |
○ | [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 |
○ | [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 |
►Vectorization Roadblocks | 40 | |
○ | [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 |
○ | [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 |
►Loop 201 - exec | Execution Time: 4 % - Vectorization Ratio: 62.86 % - Vector Length Use: 84.29 % | |
►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 | 38 | |
○ | [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 9 issues ( = data accesses) costing 2 point each. | 18 |
○ | [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 |
►Vectorization Roadblocks | 38 | |
○ | [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 9 issues ( = data accesses) costing 2 point each. | 18 |
○ | [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 |
►Loop 254 - exec | Execution Time: 4 % - Vectorization Ratio: 68.57 % - Vector Length Use: 87.14 % | |
►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 | 32 | |
○ | [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 8 issues ( = data accesses) costing 2 point each. | 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 |
►Vectorization Roadblocks | 32 | |
○ | [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 8 issues ( = data accesses) costing 2 point each. | 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 |
►Loop 192 - exec | Execution Time: 4 % - Vectorization Ratio: 64.52 % - Vector Length Use: 83.87 % | |
►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 | 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 9 issues ( = data accesses) costing 2 point each. | 18 |
○ | [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 |
►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 9 issues ( = data accesses) costing 2 point each. | 18 |
○ | [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 |
►Loop 240 - exec | Execution Time: 4 % - Vectorization Ratio: 61.11 % - Vector Length Use: 81.94 % | |
►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 | 84 | |
○ | [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 20 issues ( = data accesses) costing 2 point each. | 40 |
○ | [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 |
►Vectorization Roadblocks | 84 | |
○ | [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 20 issues ( = data accesses) costing 2 point each. | 40 |
○ | [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 |
►Loop 174 - exec | Execution Time: 3 % - Vectorization Ratio: 63.79 % - Vector Length Use: 83.62 % | |
►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 | 66 | |
○ | [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 15 issues ( = data accesses) costing 2 point each. | 30 |
○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 9 issues ( = indirect data accesses) costing 4 point each. | 36 |
►Vectorization Roadblocks | 66 | |
○ | [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 15 issues ( = data accesses) costing 2 point each. | 30 |
○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 9 issues ( = indirect data accesses) costing 4 point each. | 36 |