Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (552.67 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 3 / 3 ] Optimization level option -O2 is used
To have better performances, it is advised to help the compiler by using a proper optimization level (-O2)
[ 3 / 3 ] Helper debug compilation options -g and -fno-omit-frame-pointer are used
-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.
[ 3 / 3 ] Architecture specific option -xHost is used
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 1.23 % 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 (88.22%)
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% (6.62%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (55.03%)
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.57%) is spend in BLAS1 operations
It could be more efficient to inline by hand BLAS1 operations
[ 3 / 3 ] Cumulative Outermost/In between loops coverage (33.19%) lower than cumulative innermost loop coverage (55.03%)
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% (3.85%) 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 (%) |
|---|---|---|---|---|---|---|
| ►94704 | cp2k.psmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 11 | 6.62 | 15.38 | 12.02 |
| ○ | [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 | 6.01 | 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 | ||||
| ►293440 | cp2k.psmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 2 | 5.34 | 0 | 7.03 |
| ○ | [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 | ||||
| ►94695 | cp2k.psmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 95 | 5.15 | 5.56 | 11.24 |
| ○ | [SA] Too many paths (86 paths) - Simplify control structure. There are 86 issues ( = paths) costing 1 point each with a malus of 4 points. | 90 | ||||
| ○ | [SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 3 issues (= calls) costing 1 point each. | 3 | ||||
| ○ | [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 | ||||
| ►94735 | cp2k.psmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 95 | 4.71 | 4.76 | 11.48 |
| ○ | [SA] Too many paths (86 paths) - Simplify control structure. There are 86 issues ( = paths) costing 1 point each with a malus of 4 points. | 90 | ||||
| ○ | [SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 3 issues (= calls) costing 1 point each. | 3 | ||||
| ○ | [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 | ||||
| ►117081 | cp2k.psmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 2 | 4.16 | 0 | 12.5 |
| ○ | [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 | ||||
| ►29435 | cp2k.psmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 6 | 3.11 | 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 | ||||
| ►110402 | cp2k.psmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 1003 | 2.76 | 1.15 | 12.61 |
| ○ | [SA] Too many paths (1297 paths) - Simplify control structure. There are 1297 issues ( = paths) costing 1 point, limited to 1000. | 1000 | ||||
| ○ | [SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 3 issues (= calls) costing 1 point each. | 3 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ○94747 | cp2k.psmp | Partial or unexisting vectorization - No issue detected | 0 | 2.37 | 0 | 12.5 |
| ►115830 | cp2k.psmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 45 | 2.08 | 0 | 8.2 |
| ○ | [SA] Too many paths (40 paths) - Simplify control structure. There are 40 issues ( = paths) costing 1 point each with a malus of 4 points. | 44 | ||||
| ○ | [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 |