Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (911.27 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 3 / 3 ] Optimization level option -O3 is used
To have better performances, it is advised to help the compiler by using a proper optimization level (-O3)
[ 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.
[ 0 / 3 ] Architecture specific option is not used
-march=x86-64 option is used but it is not specific enought to produce efficient code.
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.33 % 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 (62.92%)
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
No hotspot found in the application (greatest loop coverage is 3.81%), but the twenty hottest loops cumulated coverage is representative enough (43.1% > 20%)
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (36.65%)
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 (26.27%) lower than cumulative innermost loop coverage (36.65%)
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 (%) |
|---|---|---|---|---|---|---|
| ►45392 | cp2k.ssmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 203 | 3.81 | 41.64 | 33.85 |
| ○ | [SA] Too many paths (196 paths) - Simplify control structure. There are 196 issues ( = paths) costing 1 point each with a malus of 4 points. | 200 | ||||
| ○ | [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 | ||||
| ►53841 | cp2k.ssmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 136 | 3.76 | 7.85 | 26.93 |
| ○ | [SA] Too many paths (129 paths) - Simplify control structure. There are 129 issues ( = paths) costing 1 point each with a malus of 4 points. | 133 | ||||
| ○ | [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 | ||||
| ►45470 | cp2k.ssmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 2 | 3.67 | 75 | 43.75 |
| ○ | [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 | ||||
| ►45398 | cp2k.ssmp | Inefficient vectorization. | 22 | 3.39 | 100 | 50 |
| ○ | [SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 7 issues ( = arrays) costing 2 points each | 14 | ||||
| ○ | [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 | ||||
| ○ | [SA] More than 20% of the loads are accessing the stack - Perform loop splitting to decrease pressure on registers. This issue costs 2 points. | 2 | ||||
| ○ | [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 | ||||
| ►45468 | cp2k.ssmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 8 | 3.12 | 74.42 | 43.6 |
| ○ | [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 | ||||
| ►45464 | cp2k.ssmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 721 | 3.11 | 36.25 | 32.79 |
| ○ | [SA] Too many paths (714 paths) - Simplify control structure. There are 714 issues ( = paths) costing 1 point each with a malus of 4 points. | 718 | ||||
| ○ | [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 | ||||
| ►45401 | cp2k.ssmp | Inefficient vectorization. | 24 | 2.92 | 100 | 50 |
| ○ | [SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 8 issues ( = arrays) costing 2 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 | ||||
| ○ | [SA] More than 20% of the loads are accessing the stack - Perform loop splitting to decrease pressure on registers. This issue costs 2 points. | 2 | ||||
| ○ | [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 | ||||
| ►45396 | cp2k.ssmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 22 | 2.64 | 45.16 | 35.89 |
| ○ | [SA] Too many paths (16 paths) - Simplify control structure. There are 16 issues ( = paths) costing 1 point each with a malus of 4 points. | 20 | ||||
| ○ | [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 | ||||
| ►57210 | cp2k.ssmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 14 | 2.03 | 0 | 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 7 issues ( = data accesses) costing 2 point each. | 14 | ||||
| ►45467 | cp2k.ssmp | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 14 | 1.82 | 56.98 | 38.66 |
| ○ | [SA] Too many paths (8 paths) - Simplify control structure. There are 8 issues ( = paths) costing 1 point each with a malus of 4 points. | 12 | ||||
| ○ | [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 |