Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (15304.64 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 0 / 3 ] Optimization level option not used
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 ] Helper debug compilation options -g and -fno-omit-frame-pointer are missing
-g option gives access to debugging informations, such are source locations and -fno-omit-frame-pointer improve the accuracy of callchains found during the application profiling.
[ 0 / 3 ] Architecture specific options are not used
Architecture specific options are needed to produce efficient code for a specific processor ( -x(target) or -ax(target) ).
[ 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 (90.75%)
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% (11.09%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (41.01%)
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.59%) is spend in BLAS1 operations
It could be more efficient to inline by hand BLAS1 operations
[ 0 / 3 ] Cumulative Outermost/In between loops coverage (49.74%) greater than cumulative innermost loop coverage (41.01%)
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% (5.48%) 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 (%) |
|---|---|---|---|---|---|---|
| ►94715 | cp2k.psmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 6 | 11.09 | 0 | 11.25 |
| ○ | [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 | ||||
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 | ||||
| ►94757 | cp2k.psmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 7 | 9.69 | 0 | 8.01 |
| ○ | [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] 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] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 | ||||
| ►94706 | cp2k.psmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 11 | 9.31 | 0 | 9.82 |
| ○ | [SA] Too many paths (5 paths) - Simplify control structure. There are 5 issues ( = paths) costing 1 point each with a malus of 4 points. | 9 | ||||
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ►94746 | cp2k.psmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 11 | 8 | 7.69 | 10.58 |
| ○ | [SA] Too many paths (5 paths) - Simplify control structure. There are 5 issues ( = paths) costing 1 point each with a malus of 4 points. | 9 | ||||
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ►110422 | cp2k.psmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 1 | 5.09 | 25 | 15 |
| ○ | [SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 1 issues (= calls) costing 1 point each. | 1 | ||||
| ►94758 | cp2k.psmp | Inefficient vectorization. | 7 | 4.11 | 100 | 50 |
| ○ | [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] Inefficient vectorization: use of masked instructions - Simplify control structure. 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 | ||||
| ○ | [SA] Presence of special instructions executing on a single port (BLEND/MERGE) - Simplify data access and try to get stride 1 access. There are 1 issues (= instructions) costing 1 point each. | 1 | ||||
| ○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
| ►94716 | cp2k.psmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 30 | 2.89 | 11.11 | 11.81 |
| ○ | [SA] Too many paths (25 paths) - Simplify control structure. There are 25 issues ( = paths) costing 1 point each with a malus of 4 points. | 29 | ||||
| ○ | [SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 1 issues (= calls) costing 1 point each. | 1 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ►29435 | cp2k.psmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 6 | 2.49 | 28.57 | 16.07 |
| ○ | [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 | ||||
| ►94713 | cp2k.psmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 32 | 2.48 | 11.11 | 11.81 |
| ○ | [SA] Too many paths (25 paths) - Simplify control structure. There are 25 issues ( = paths) costing 1 point each with a malus of 4 points. | 29 | ||||
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 | ||||
| ○ | [SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 1 issues (= calls) costing 1 point each. | 1 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ►94753 | cp2k.psmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 6 | 2.28 | 0 | 11.25 |
| ○ | [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 | ||||
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |