Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (531.93 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 3.00 / 3 ] Optimization level option is correctly used
[ 3.00 / 3 ] Most of time spent in analyzed modules comes from functions compiled with -g and -fno-omit-frame-pointer
-g option gives access to debugging informations, such are source locations. -fno-omit-frame-pointer improve the accuracy of callchains found during the application profiling.
[ 3.00 / 3 ] Architecture specific option -xop is used
[ 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 (59.26%)
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% (7.39%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (48.38%)
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 (10.88%) lower than cumulative innermost loop coverage (48.38%)
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 (%) |
|---|---|---|---|---|---|---|
| ►3379 | picongpu | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 2 | 7.39 | 12.22 | 8.54 |
| ○ | [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 | ||||
| ►3391 | picongpu | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 2 | 7.33 | 12.22 | 8.54 |
| ○ | [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 | ||||
| ►3392 | picongpu | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 2 | 5.65 | 12.22 | 8.54 |
| ○ | [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 | ||||
| ►3380 | picongpu | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 2 | 5.6 | 12.22 | 8.54 |
| ○ | [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 | ||||
| ►1336 | picongpu | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 1002 | 5.5 | 14.97 | 9.18 |
| ○ | [SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point. | 1000 | ||||
| ○ | [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 | ||||
| ►847 | picongpu | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 1002 | 5.27 | 14.94 | 9.18 |
| ○ | [SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point. | 1000 | ||||
| ○ | [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 | ||||
| ►1343 | picongpu | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 22 | 3.49 | 7.78 | 7.71 |
| ○ | [SA] Too many paths (18 paths) - Simplify control structure. There are 18 issues ( = paths) costing 1 point each with a malus of 4 points. | 22 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ►1341 | picongpu | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 1000 | 3.39 | 8.14 | 7.78 |
| ○ | [SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point. | 1000 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ►1345 | picongpu | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 22 | 3.05 | 7.87 | 7.72 |
| ○ | [SA] Too many paths (18 paths) - Simplify control structure. There are 18 issues ( = paths) costing 1 point each with a malus of 4 points. | 22 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ►856 | picongpu | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 22 | 3.02 | 7.87 | 7.72 |
| ○ | [SA] Too many paths (18 paths) - Simplify control structure. There are 18 issues ( = paths) costing 1 point each with a malus of 4 points. | 22 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 |