Help is available by moving the cursor above any
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (215.76 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 0 / 3 ] Some functions are compiled with a low optimization level (O0 or O1)
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 ] Most of time spent in analyzed modules comes from functions without compilation information
Functions without compilation information (typically not compiled with -g and -grecord-gcc-switches) cumulate 100.00% of the time spent in analyzed modules. Check that -g and -grecord-gcc-switches are present. Remark: if -g and -grecord-gcc-switches are indeed used, this can also be due to some compiler built-in functions (typically math) or statically linked libraries. This warning can be ignored in that case.
[ 0 / 3 ] Security settings from the host restrict profiling. Some metrics will be missing or incomplete.
Current value for kernel.perf_event_paranoid is 3. If possible, set it to 1 or check with your system administrator which flag can be used to achieve this.
[ 0 / 3 ] Compilation of some functions is not optimized for the target processor
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 0.32 % 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
[ 1 / 1 ] Lstopo present. The Topology lstopo report will be generated.
[ 0 / 0 ] Fastmath not used
Consider to add ffast-math to compilation flags (or replace -O3 with -Ofast) to unlock potential extra speedup by relaxing floating-point computation consistency. Warning: floating-point accuracy may be reduced and the compliance to IEEE/ISO rules/specifications for math functions will be relaxed, typically 'errno' will no longer be set after calling some math functions.
[ 0 / 4 ] Too little time of the experiment time spent in analyzed loops (14.41%)
If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances.
[ 0 / 4 ] A significant amount of threads are idle (89.45%)
On average, more than 10% of observed threads are idle. Such threads are probably IO/sync waiting. Some hints: use faster filesystems to read/write data, improve parallel load balancing and/or scheduling.
[ 0 / 4 ] CPU activity is below 90% (23.89%)
CPU cores are idle more than 10% of time. Threads supposed to run on these cores are probably IO/sync waiting. Some hints: use faster filesystems to read/write data, improve parallel load balancing and/or scheduling.
[ 4 / 4 ] Loop profile is not flat
At least one loop coverage is greater than 4% (4.35%), representing an hotspot for the application
[ 0 / 4 ] Too little time of the experiment time spent in analyzed innermost loops (10.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.
[ 1 / 4 ] Affinity stability is lower than 90% (37.94%)
Threads are often migrating to other CPU cores/threads. For OpenMP, typically set (OMP_PLACES=cores OMP_PROC_BIND=close) or (OMP_PLACES=threads OMP_PROC_BIND=spread). With OpenMPI + OpenMP, use --bind-to core --map-by node:PE=$OMP_NUM_THREADS --report-bindings. With IntelMPI + OpenMP, set I_MPI_PIN_DOMAIN=omp:compact or I_MPI_PIN_DOMAIN=omp:scatter and use -print-rank-map.
[ 3 / 3 ] Less than 10% (0.00%) is spend in BLAS1 operations
It could be more efficient to inline by hand BLAS1 operations
[ 3 / 3 ] Functions mostly use all threads
Functions running on a reduced number of threads (typically sequential code) cover less than 10% of application walltime (0.38%)
[ 3 / 3 ] Cumulative Outermost/In between loops coverage (3.56%) lower than cumulative innermost loop coverage (10.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.00%) is spend in BLAS2 operations
BLAS2 calls usually could make a poor cache usage and could benefit from inlining.
[ 2 / 2 ] Less than 10% (0.08%) is spend in Libm/SVML (special functions)
| Loop ID | Analysis | Penalty Score |
|---|---|---|
| ►Loop 5950 - vlasiator | Execution Time: 4 % - Vectorization Ratio: 53.30 % - Vector Length Use: 43.89 % | |
| ►Loop Computation Issues | 52 | |
| ○ | [SA] Presence of expensive FP instructions - Perform hoisting, change algorithm, use SVML or proper numerical library or perform value profiling (count the number of distinct input values). There are 13 issues (= instructions) costing 4 points each. | 52 |
| ►Control Flow Issues | 517 | |
| ○ | [SA] Too many paths (513 paths) - Simplify control structure. There are 513 issues ( = paths) costing 1 point each with a malus of 4 points. | 517 |
| ►Data Access Issues | 80 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 80 issues (= instructions) costing 1 point each. | 80 |
| ►Vectorization Roadblocks | 517 | |
| ○ | [SA] Too many paths (513 paths) - Simplify control structure. There are 513 issues ( = paths) costing 1 point each with a malus of 4 points. | 517 |
| ►Inefficient Vectorization | 82 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 80 issues (= instructions) costing 1 point each. | 80 |
| ○ | [SA] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points. | 2 |
| ►Loop 5906 - vlasiator | Execution Time: 1 % - Vectorization Ratio: 57.60 % - Vector Length Use: 60.25 % | |
| ►Loop Computation Issues | 2 | |
| ○ | [SA] Presence of a large number of scalar integer instructions - Simplify loop structure, perform loop splitting or perform unroll and jam. This issue costs 2 points. | 2 |
| ►Control Flow Issues | 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 |
| ►Data Access Issues | 26 | |
| ○ | [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 |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 1 issues ( = indirect data accesses) costing 4 point each. | 4 |
| ○ | [SA] Presence of special instructions executing on a single port (COMPRESS/EXPAND, BROADCAST) - Simplify data access and try to get stride 1 access. There are 18 issues (= instructions) costing 1 point each. | 18 |
| ○ | [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 |
| ►Vectorization Roadblocks | 8 | |
| ○ | [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 |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 1 issues ( = indirect data accesses) costing 4 point each. | 4 |
| ►Inefficient Vectorization | 20 | |
| ○ | [SA] Presence of special instructions executing on a single port (COMPRESS/EXPAND, BROADCAST) - Simplify data access and try to get stride 1 access. There are 18 issues (= instructions) costing 1 point each. | 18 |
| ○ | [SA] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points. | 2 |
| ►Loop 5905 - vlasiator | Execution Time: 0 % - Vectorization Ratio: 86.81 % - Vector Length Use: 83.86 % | |
| ►Loop Computation Issues | 12 | |
| ○ | [SA] Presence of expensive FP instructions - Perform hoisting, change algorithm, use SVML or proper numerical library or perform value profiling (count the number of distinct input values). There are 3 issues (= instructions) costing 4 points each. | 12 |
| ►Control Flow Issues | 199 | |
| ○ | [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 |
| ○ | [SA] Too many paths (192 paths) - Simplify control structure. There are 192 issues ( = paths) costing 1 point each with a malus of 4 points. | 196 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Data Access Issues | 31 | |
| ○ | [SA] Presence of special instructions executing on a single port (COMPRESS/EXPAND, BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 29 issues (= instructions) costing 1 point each. | 29 |
| ○ | [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 |
| ►Vectorization Roadblocks | 199 | |
| ○ | [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 |
| ○ | [SA] Too many paths (192 paths) - Simplify control structure. There are 192 issues ( = paths) costing 1 point each with a malus of 4 points. | 196 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Inefficient Vectorization | 31 | |
| ○ | [SA] Presence of special instructions executing on a single port (COMPRESS/EXPAND, BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 29 issues (= instructions) costing 1 point each. | 29 |
| ○ | [SA] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points. | 2 |
| ►Loop 5974 - vlasiator | Execution Time: 0 % - Vectorization Ratio: 70.63 % - Vector Length Use: 47.33 % | |
| ►Control Flow Issues | 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 |
| ►Data Access Issues | 20 | |
| ○ | [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 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 4 issues (= instructions) costing 4 points each. | 16 |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT) - Simplify data access and try to get stride 1 access. There are 2 issues (= instructions) costing 1 point each. | 2 |
| ►Vectorization Roadblocks | 4 | |
| ○ | [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 |
| ►Inefficient Vectorization | 18 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 4 issues (= instructions) costing 4 points each. | 16 |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT) - Simplify data access and try to get stride 1 access. There are 2 issues (= instructions) costing 1 point each. | 2 |
| ►Loop 5975 - vlasiator | Execution Time: 0 % - Vectorization Ratio: 5.26 % - Vector Length Use: 7.65 % | |
| ►Control Flow Issues | 29 | |
| ○ | [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 |
| ○ | [SA] Too many paths (24 paths) - Simplify control structure. There are 24 issues ( = paths) costing 1 point each with a malus of 4 points. | 28 |
| ►Data Access Issues | 2 | |
| ○ | [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 |
| ►Vectorization Roadblocks | 29 | |
| ○ | [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 |
| ○ | [SA] Too many paths (24 paths) - Simplify control structure. There are 24 issues ( = paths) costing 1 point each with a malus of 4 points. | 28 |
| ►Loop 5907 - vlasiator | Execution Time: 0 % - Vectorization Ratio: 6.67 % - Vector Length Use: 10.63 % | |
| ►Control Flow Issues | 11 | |
| ○ | [SA] Too many paths (7 paths) - Simplify control structure. There are 7 issues ( = paths) costing 1 point each with a malus of 4 points. | 11 |
| ►Data Access Issues | 3 | |
| ○ | [SA] Presence of special instructions executing on a single port (COMPRESS/EXPAND, BROADCAST) - Simplify data access and try to get stride 1 access. There are 3 issues (= instructions) costing 1 point each. | 3 |
| ►Vectorization Roadblocks | 11 | |
| ○ | [SA] Too many paths (7 paths) - Simplify control structure. There are 7 issues ( = paths) costing 1 point each with a malus of 4 points. | 11 |
| ►Inefficient Vectorization | 5 | |
| ○ | [SA] Presence of special instructions executing on a single port (COMPRESS/EXPAND, BROADCAST) - Simplify data access and try to get stride 1 access. There are 3 issues (= instructions) costing 1 point each. | 3 |
| ○ | [SA] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points. | 2 |
| ►Loop 3058 - vlasiator | Execution Time: 0 % - Vectorization Ratio: 38.71 % - Vector Length Use: 17.54 % | |
| ►Loop Computation Issues | 4 | |
| ○ | [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 |
| ►Data Access Issues | 12 | |
| ○ | [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 |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 10 issues (= instructions) costing 1 point each. | 10 |
| ►Vectorization Roadblocks | 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 |
| ►Inefficient Vectorization | 10 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 10 issues (= instructions) costing 1 point each. | 10 |
| ►Loop 4645 - vlasiator | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 10.94 % | |
| ►Control Flow Issues | 99 | |
| ○ | [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] Too many paths (90 paths) - Simplify control structure. There are 90 issues ( = paths) costing 1 point each with a malus of 4 points. | 94 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Data Access Issues | 2 | |
| ○ | [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 |
| ►Vectorization Roadblocks | 99 | |
| ○ | [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] Too many paths (90 paths) - Simplify control structure. There are 90 issues ( = paths) costing 1 point each with a malus of 4 points. | 94 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Loop 5972 - vlasiator | Execution Time: 0 % - Vectorization Ratio: 38.46 % - Vector Length Use: 21.69 % | |
| ►Loop Computation Issues | 2 | |
| ○ | [SA] Presence of a large number of scalar integer instructions - Simplify loop structure, perform loop splitting or perform unroll and jam. This issue costs 2 points. | 2 |
| ►Control Flow Issues | 30 | |
| ○ | [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 |
| ○ | [SA] Too many paths (25 paths) - Simplify control structure. There are 25 issues ( = paths) costing 1 point each with a malus of 4 points. | 29 |
| ►Vectorization Roadblocks | 30 | |
| ○ | [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 |
| ○ | [SA] Too many paths (25 paths) - Simplify control structure. There are 25 issues ( = paths) costing 1 point each with a malus of 4 points. | 29 |
| ►Loop 3079 - vlasiator | Execution Time: 0 % - Vectorization Ratio: 41.56 % - Vector Length Use: 17.61 % | |
| ►Control Flow Issues | 19 | |
| ○ | [SA] Too many paths (13 paths) - Simplify control structure. There are 13 issues ( = paths) costing 1 point each with a malus of 4 points. | 17 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Data Access Issues | 27 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 27 issues (= instructions) costing 1 point each. | 27 |
| ►Vectorization Roadblocks | 19 | |
| ○ | [SA] Too many paths (13 paths) - Simplify control structure. There are 13 issues ( = paths) costing 1 point each with a malus of 4 points. | 17 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Inefficient Vectorization | 27 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 27 issues (= instructions) costing 1 point each. | 27 |