options

picongpu - 2023-12-07 16:26:57 - MAQAO 2.18.0

Help is available by moving the cursor above any symbol or by checking MAQAO website.

Stylizer  

[ 4 / 4 ] Application profile is long enough (467.94 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 -x Host is used

[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.01 % 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

Strategizer  

[ 0 / 4 ] Too little time of the experiment time spent in analyzed loops (5.99%)

If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances.

[ 0 / 4 ] Loop profile is flat

No hotspot found in the application (greatest loop coverage is 0.40%), and the twenty hottest loops cumulated coverage is lower than 20% of the application profiled time (4.79%)

[ 0 / 4 ] Too little time of the experiment time spent in analyzed innermost loops (4.85%)

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 (1.14%) lower than cumulative innermost loop coverage (4.85%)

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.

Optimizer

Loop IDModuleAnalysisPenalty ScoreCoverage (%)Vectorization
Ratio (%)
Vector Length
Use (%)
768picongpuPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.20.45.5610.76
[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
778picongpuPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.20.385.5610.76
[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
258picongpuPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.550.326.6711.67
[SA] Too many paths (48 paths) - Simplify control structure. There are 48 issues ( = paths) costing 1 point each with a malus of 4 points.52
[SA] Non innermost loop (Outermost) - 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
403picongpuPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.550.316.6711.67
[SA] Too many paths (48 paths) - Simplify control structure. There are 48 issues ( = paths) costing 1 point each with a malus of 4 points.52
[SA] Non innermost loop (Outermost) - 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
402picongpuPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.40.312.510.94
[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
257picongpuPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.40.312.510.94
[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
779picongpuPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.40.296.678.33
[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
769picongpuPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.40.296.678.33
[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
770picongpuPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.550.249.0911.93
[SA] Too many paths (48 paths) - Simplify control structure. There are 48 issues ( = paths) costing 1 point each with a malus of 4 points.52
[SA] Non innermost loop (Outermost) - 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
780picongpuPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.550.249.0911.93
[SA] Too many paths (48 paths) - Simplify control structure. There are 48 issues ( = paths) costing 1 point each with a malus of 4 points.52
[SA] Non innermost loop (Outermost) - 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
×