Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 0 / 9 ] Compilation options are not available
Compilation options are an important optimization leverage but ONE-View is not able to analyze them.
[ 4 / 4 ] Application profile is long enough (10.69 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0 % 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
[ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (99.95%)
If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances.
[ 4 / 4 ] Loop profile is not flat
At least one loop coverage is greater than 4% (96.54%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (96.54%)
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 ] Less than 10% (0%) is spend in BLAS1 operations
It could be more efficient to inline by hand BLAS1 operations
[ 3 / 3 ] Cumulative Outermost/In between loops coverage (3.41%) lower than cumulative innermost loop coverage (96.54%)
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%) is spend in Libm/SVML (special functions)
[ 2 / 2 ] Less than 10% (0%) is spend in BLAS2 operations
BLAS2 calls usually could make a poor cache usage and could benefit from inlining.
| Loop ID | Module | Analysis | Penalty Score | Coverage (%) | Vectorization Ratio (%) | Vector Length Use (%) |
|---|---|---|---|---|---|---|
| ►4 | convf32_avx512 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 44 | 96.54 | 94.44 | 94.79 |
| ○ | [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 | ||||
| ○ | [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 6 issues ( = data accesses) costing 2 point each. | 12 | ||||
| ○ | [SA] Presence of special instructions executing on a single port (BROADCAST) - Simplify data access and try to get stride 1 access. There are 7 issues (= instructions) costing 1 point each. | 7 | ||||
| ○ | [DA] Low iteration count (7 < 10) - Perform full unroll. Use compiler pragmas. Use PGO/FDO compiler options. Force compiler to use masked instructions. This issue costs 5 points. | 5 | ||||
| ○ | [SA] Inefficient vectorization: use of shorter than available vector length - Force compiler to use proper vector length. CAUTION: use of 512 bits vectors could be more expensive than 256 bits on some processors. Use intrinsics (costly and not portable). The issue costs 2 points. | 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 | ||||
| ○ | [DA] The ratio FP/LS (floating point / memory accesses) is smaller than 0.8 (0.78) - Focus on optimizing data accesses. | 0 | ||||
| ►3 | convf32_avx512 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 12 | 2.85 | 34.78 | 42.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 4 issues ( = data accesses) costing 2 point each. | 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] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 | ||||
| ►2 | convf32_avx512 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 20 | 0.51 | 0 | 10.16 |
| ○ | [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] 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] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 | ||||
| ►1 | convf32_avx512 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 17 | 0.05 | 0 | 7.59 |
| ○ | [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 6 issues ( = data accesses) costing 2 point each. | 12 | ||||
| ○ | [SA] Several paths (3 paths) - Simplify control structure or force the compiler to use masked instructions. There are 3 issues ( = paths) costing 1 point each. | 3 | ||||
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |