Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (317.91 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 0 / 3 ] Some functions are compiled with a low optimization level (O0 or O1)
To have better performances, it is advised to help the compiler by using a proper optimization level (-O2 of higher). Warning, depending on compilers, faster optimization levels can decrease numeric accuracy.
[ 0 / 3 ] Most of time spent in analyzed modules comes from functions without compilation information
Functions without compilation information (typically not compiled with -g) cumulate 100.00% of the time spent in analyzed modules. Check that -g is present. Remark: if -g is indeed used, this can also be due to some compiler built-in functions (typically math) or statically linked libraries. This warning can be ignored in that case.
[ 0 / 3 ] Compilation of some functions is not optimized for the target processor
Architecture specific options are needed to produce efficient code for a specific processor ( -mcpu=native ).
[ 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 (53.88%)
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% (10.83%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (53.73%)
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 (0.15%) lower than cumulative innermost loop coverage (53.73%)
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 (%) |
|---|---|---|---|---|---|---|
| ►853 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 2 | 10.83 | 98.08 | 99.04 |
| ○ | [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 | ||||
| ○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
| ►842 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 6 | 5.94 | 89.47 | 94.74 |
| ○ | [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] Bottleneck in the front end - If loop size is very small (rare occurrences), perform unroll and jam. If loop size is large, perform loop splitting. This 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 | ||||
| ○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
| ►841 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 6 | 5.91 | 89.47 | 94.74 |
| ○ | [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] Bottleneck in the front end - If loop size is very small (rare occurrences), perform unroll and jam. If loop size is large, perform loop splitting. This 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 | ||||
| ○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
| ►839 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 6 | 5.89 | 89.47 | 94.74 |
| ○ | [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] Bottleneck in the front end - If loop size is very small (rare occurrences), perform unroll and jam. If loop size is large, perform loop splitting. This 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 | ||||
| ○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
| ►840 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 6 | 5.87 | 89.47 | 94.74 |
| ○ | [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] Bottleneck in the front end - If loop size is very small (rare occurrences), perform unroll and jam. If loop size is large, perform loop splitting. This 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 | ||||
| ○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
| ○1888 | exec | Partial or unexisting vectorization - No issue detected | 0 | 5.85 | 0 | 50 |
| ►2148 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 10 | 3.2 | 98.08 | 99.04 |
| ○ | [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 | ||||
| ○ | [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 | ||||
| ○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
| ►1335 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 10 | 2.43 | 88.68 | 93.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 2 issues (= instructions) costing 4 points each. | 8 | ||||
| ○ | [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 | ||||
| ○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
| ►370 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 4 | 1.13 | 0 | 43.75 |
| ○ | [SA] Several paths (4 paths) - Simplify control structure or force the compiler to use masked instructions. There are 4 issues ( = paths) costing 1 point each. | 4 | ||||
| ○832 | exec | Partial or unexisting vectorization - No issue detected | 0 | 0.84 | 9.09 | 52.27 |