Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (615.25 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 1.68 % 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 (38.06%)
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% (13.74%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (36.10%)
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.96%) lower than cumulative innermost loop coverage (36.1%)
Having cumulative Outermost/In between loops coverage greater than cumulative innermost loop coverage will make loop optimization more complex
[ 0 / 2 ] More than 10% (24.19%) is spend in Libm/SVML (special functions)
The application is heavily using special math functions (powers, exp, sin etc…) proper library version have to be used. Exact accuracy needs have to be evaluated. Perform input value profiling, first count how many different input values.
[ 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 (%) |
|---|---|---|---|---|---|---|
| ►647 | libraveloPlugin.so | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 1000 | 13.74 | 20.22 | 29.07 |
| ○ | [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 | ||||
| ►673 | libraveloPlugin.so | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 1000 | 11.35 | 19.41 | 28.91 |
| ○ | [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 | ||||
| ►672 | libraveloPlugin.so | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 18 | 4.08 | 79.72 | 44.75 |
| ○ | [SA] Too many paths (12 paths) - Simplify control structure. There are 12 issues ( = paths) costing 1 point each with a malus of 4 points. | 16 | ||||
| ○ | [SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 2 issues (= calls) costing 1 point each. | 2 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ►1801 | libexanbParticleNeighborsPlugin.so | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 24 | 3.54 | 0.83 | 24.17 |
| ○ | [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 6 issues ( = data accesses) costing 2 point each. | 12 | ||||
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 | ||||
| ○ | [SA] Several paths (4 paths) - Simplify control structure or force the compiler to use masked instructions. There are 4 issues ( = paths) costing 1 point each. | 4 | ||||
| ►2339 | libexaStampAnalyticsPlugin.so | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 1005 | 0.95 | 10.07 | 25.9 |
| ○ | [SA] Too many paths (3073 paths) - Simplify control structure. There are 3073 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 5 issues (= calls) costing 1 point each. | 5 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ►646 | libraveloPlugin.so | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 4 | 0.89 | 73.96 | 42.98 |
| ○ | [SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 2 issues (= calls) costing 1 point each. | 2 | ||||
| ○ | [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 | ||||
| ►669 | libraveloPlugin.so | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 1005 | 0.62 | 29.09 | 32.1 |
| ○ | [SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point. | 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 | ||||
| ○ | [SA] Non innermost loop (Outermost) - 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 | ||||
| ►641 | libraveloPlugin.so | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 1002 | 0.44 | 10.53 | 26.45 |
| ○ | [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 (Outermost) - 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 | ||||
| ►644 | libraveloPlugin.so | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 4 | 0.42 | 0 | 25 |
| ○ | [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 | ||||
| ○ | [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 | ||||
| ►642 | libraveloPlugin.so | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 1002 | 0.33 | 7.41 | 25 |
| ○ | [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 |