g++ | g++ fast-math | icpx | icpx no-gather | icpx no-gather 128b | icpx no-vec | clang++ | clang++ fast-math |
---|---|---|---|---|---|---|---|
[ 3 / 3 ] Architecture specific option -march=skylake is used | [ 3 / 3 ] Architecture specific option -march=skylake is used | [ 3.00 / 3 ] Architecture specific option -march=native is used | [ 3.00 / 3 ] Architecture specific option -march=native is used | [ 3.00 / 3 ] Architecture specific option -march=native is used | [ 3.00 / 3 ] Architecture specific option -march=native is used | [ 3 / 3 ] Architecture specific option -march=native is used | [ 3 / 3 ] Architecture specific option -march=native is used |
[ 2.40 / 3 ] Most of time spent in analyzed modules comes from functions compiled with -g -g option gives access to debugging informations, such are source locations. Add -fno-omit-frame-pointer to improve the accuracy of callchains found during the application profiling | [ 2.40 / 3 ] Most of time spent in analyzed modules comes from functions compiled with -g -g option gives access to debugging informations, such are source locations. Add -fno-omit-frame-pointer to improve the accuracy of callchains found during the application profiling | [ 2.40 / 3 ] Most of time spent in analyzed modules comes from functions without compilation information Functions without compilation information (typically not compiled with -g) cumulate 0.01% of the time spent in analyzed modules. Check that -g is present. Remark: if -g is 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. | [ 2.40 / 3 ] Most of time spent in analyzed modules comes from functions without compilation information Functions without compilation information (typically not compiled with -g) cumulate 0.02% of the time spent in analyzed modules. Check that -g is present. Remark: if -g is 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. | [ 2.40 / 3 ] Most of time spent in analyzed modules comes from functions without compilation information Functions without compilation information (typically not compiled with -g) cumulate 0.04% of the time spent in analyzed modules. Check that -g is present. Remark: if -g is 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. | [ 2.40 / 3 ] Most of time spent in analyzed modules comes from functions without compilation information Functions without compilation information (typically not compiled with -g) cumulate 0.02% of the time spent in analyzed modules. Check that -g is present. Remark: if -g is 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. | [ 2.40 / 3 ] Most of time spent in analyzed modules comes from functions compiled with -g -g option gives access to debugging informations, such are source locations. Add -fno-omit-frame-pointer to improve the accuracy of callchains found during the application profiling | [ 2.40 / 3 ] Most of time spent in analyzed modules comes from functions compiled with -g -g option gives access to debugging informations, such are source locations. Add -fno-omit-frame-pointer to improve the accuracy of callchains found during the application profiling |
[ 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. | Not available for this run | Not available for this run | Not available for this run | Not available for this run | Not available for this run | [ 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. | Not available for this run |
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 5.44 % 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 | [ 2 / 2 ] Application is correctly profiled ("Others" category represents 4.99 % 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 | [ 2 / 2 ] Application is correctly profiled ("Others" category represents 2.21 % 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 | [ 2 / 2 ] Application is correctly profiled ("Others" category represents 5.11 % 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 | [ 2 / 2 ] Application is correctly profiled ("Others" category represents 4.71 % 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 | [ 2 / 2 ] Application is correctly profiled ("Others" category represents 5.06 % 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 | [ 2 / 2 ] Application is correctly profiled ("Others" category represents 5.46 % 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 | [ 2 / 2 ] Application is correctly profiled ("Others" category represents 4.84 % 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 |
[ 3 / 3 ] Optimization level option is correctly used | [ 3 / 3 ] Optimization level option is correctly used | [ 3 / 3 ] Optimization level option is correctly used | [ 3.00 / 3 ] Optimization level option is correctly used | [ 3.00 / 3 ] Optimization level option is correctly used | [ 3.00 / 3 ] Optimization level option is correctly used | [ 3 / 3 ] Optimization level option is correctly used | [ 3 / 3 ] Optimization level option is correctly used |
[ 4 / 4 ] Application profile is long enough (30.26 s) To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds. | [ 4 / 4 ] Application profile is long enough (30.77 s) To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds. | [ 4 / 4 ] Application profile is long enough (68.05 s) To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds. | [ 4 / 4 ] Application profile is long enough (29.23 s) To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds. | [ 4 / 4 ] Application profile is long enough (30.66 s) To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds. | [ 4 / 4 ] Application profile is long enough (31.16 s) To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds. | [ 4 / 4 ] Application profile is long enough (30.43 s) To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds. | [ 4 / 4 ] Application profile is long enough (30.70 s) To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds. |
g++ | g++ fast-math | icpx | icpx no-gather | icpx no-gather 128b | icpx no-vec | clang++ | clang++ fast-math |
---|---|---|---|---|---|---|---|
[ 4 / 4 ] CPU activity is good CPU cores are active 99.64% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 99.57% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 99.75% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 99.42% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 99.64% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 99.51% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 99.71% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 99.46% of time |
[ 2 / 4 ] Affinity stability is lower than 90% (53.34%) 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 cores --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. | [ 4 / 4 ] Affinity is good (91.79%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (96.28%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (91.21%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (91.67%) Threads are not migrating to CPU cores: probably successfully pinned | [ 1 / 4 ] Affinity stability is lower than 90% (40.81%) 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 cores --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. | [ 4 / 4 ] Affinity is good (91.64%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (91.75%) Threads are not migrating to CPU cores: probably successfully pinned |
[ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (92.04%) If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances. | [ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (92.09%) If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances. | [ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (96.46%) If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances. | [ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (91.79%) If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances. | [ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (92.07%) If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances. | [ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (71.32%) If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances. | [ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (92.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 ] Enough time of the experiment time spent in analyzed loops (92.13%) If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances. |
[ 3 / 3 ] Cumulative Outermost/In between loops coverage (4.15%) lower than cumulative innermost loop coverage (87.89%) Having cumulative Outermost/In between loops coverage greater than cumulative innermost loop coverage will make loop optimization more complex | [ 0 / 3 ] Cumulative Outermost/In between loops coverage (62.88%) greater than cumulative innermost loop coverage (29.21%) Having cumulative Outermost/In between loops coverage greater than cumulative innermost loop coverage will make loop optimization more complex | [ 3 / 3 ] Cumulative Outermost/In between loops coverage (16.55%) lower than cumulative innermost loop coverage (79.90%) Having cumulative Outermost/In between loops coverage greater than cumulative innermost loop coverage will make loop optimization more complex | [ 3 / 3 ] Cumulative Outermost/In between loops coverage (24.73%) lower than cumulative innermost loop coverage (67.05%) Having cumulative Outermost/In between loops coverage greater than cumulative innermost loop coverage will make loop optimization more complex | [ 3 / 3 ] Cumulative Outermost/In between loops coverage (23.81%) lower than cumulative innermost loop coverage (68.26%) Having cumulative Outermost/In between loops coverage greater than cumulative innermost loop coverage will make loop optimization more complex | [ 3 / 3 ] Cumulative Outermost/In between loops coverage (11.88%) lower than cumulative innermost loop coverage (59.44%) Having cumulative Outermost/In between loops coverage greater than cumulative innermost loop coverage will make loop optimization more complex | [ 3 / 3 ] Cumulative Outermost/In between loops coverage (9.86%) lower than cumulative innermost loop coverage (82.21%) Having cumulative Outermost/In between loops coverage greater than cumulative innermost loop coverage will make loop optimization more complex | [ 3 / 3 ] Cumulative Outermost/In between loops coverage (7.70%) lower than cumulative innermost loop coverage (84.43%) Having cumulative Outermost/In between loops coverage greater than cumulative innermost loop coverage will make loop optimization more complex |
[ 4 / 4 ] Threads activity is good On average, more than 99.64% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 99.57% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 99.75% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 99.42% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 99.64% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 99.51% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 99.71% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 99.46% of observed threads are actually active |
[ 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.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.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.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.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.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.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.00%) is spend in BLAS2 operations BLAS2 calls usually could make a poor cache usage and could benefit from inlining. |
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (87.89%) 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. | [ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (29.21%) 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. | [ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (79.90%) 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. | [ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (67.05%) 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. | [ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (68.26%) 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. | [ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (59.44%) 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. | [ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (82.21%) 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. | [ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (84.43%) 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.00%) is spend in BLAS1 operations It could be more efficient to inline by hand BLAS1 operations | [ 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 ] Less than 10% (0.00%) is spend in BLAS1 operations It could be more efficient to inline by hand BLAS1 operations | [ 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 ] Less than 10% (0.00%) is spend in BLAS1 operations It could be more efficient to inline by hand BLAS1 operations | [ 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 ] Less than 10% (0.00%) is spend in BLAS1 operations It could be more efficient to inline by hand BLAS1 operations | [ 3 / 3 ] Less than 10% (0.00%) is spend in BLAS1 operations It could be more efficient to inline by hand BLAS1 operations |
[ 2 / 2 ] Less than 10% (0.00%) is spend in Libm/SVML (special functions) | [ 2 / 2 ] Less than 10% (0.00%) is spend in Libm/SVML (special functions) | [ 2 / 2 ] Less than 10% (0.00%) is spend in Libm/SVML (special functions) | [ 2 / 2 ] Less than 10% (0.00%) is spend in Libm/SVML (special functions) | [ 2 / 2 ] Less than 10% (0.00%) is spend in Libm/SVML (special functions) | [ 2 / 2 ] Less than 10% (0.00%) is spend in Libm/SVML (special functions) | [ 2 / 2 ] Less than 10% (0.00%) is spend in Libm/SVML (special functions) | [ 2 / 2 ] Less than 10% (0.00%) is spend in Libm/SVML (special functions) |
[ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (87.74%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (62.85%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (70.82%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (45.55%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (48.97%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (59.27%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (49.79%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (84.28%), representing an hotspot for the application |
Analysis | r_1 | r_2 | r_3 | r_4 | r_5 | r_6 | r_7 | r_8 | |
---|---|---|---|---|---|---|---|---|---|
Loop Computation Issues | Less than 10% of the FP ADD/SUB/MUL arithmetic operations are performed using FMA | 0 | 0 | 1 | 2 | 1 | 0 | 0 | 2 |
Presence of a large number of scalar integer instructions | 3 | 4 | 2 | 3 | 2 | 2 | 3 | 4 | |
Low iteration count | 0 | 0 | 1 | 1 | 1 | 0 | 2 | 1 | |
Control Flow Issues | Presence of calls | 1 | 2 | 1 | 2 | 1 | 1 | 1 | 2 |
Presence of 2 to 4 paths | 3 | 1 | 2 | 2 | 2 | 1 | 1 | 2 | |
Presence of more than 4 paths | 1 | 3 | 0 | 1 | 0 | 0 | 2 | 1 | |
Non-innermost loop | 3 | 3 | 1 | 2 | 1 | 1 | 2 | 2 | |
Low iteration count | 0 | 0 | 1 | 1 | 1 | 0 | 2 | 1 | |
Data Access Issues | Presence of constant non-unit stride data access | 3 | 1 | 1 | 1 | 3 | 1 | 1 | 1 |
Presence of indirect access | 4 | 1 | 3 | 2 | 1 | 2 | 4 | 1 | |
More than 10% of the vector loads instructions are unaligned | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | |
Presence of expensive instructions: scatter/gather | 0 | 0 | 2 | 0 | 0 | 0 | 0 | 0 | |
Presence of special instructions executing on a single port | 0 | 3 | 1 | 3 | 3 | 0 | 0 | 2 | |
More than 20% of the loads are accessing the stack | 2 | 2 | 2 | 3 | 2 | 2 | 2 | 2 | |
Vectorization Roadblocks | Presence of calls | 1 | 2 | 1 | 2 | 1 | 1 | 1 | 2 |
Presence of 2 to 4 paths | 3 | 1 | 2 | 2 | 2 | 1 | 1 | 2 | |
Presence of more than 4 paths | 1 | 3 | 0 | 1 | 0 | 1 | 2 | 1 | |
Non-innermost loop | 3 | 3 | 1 | 2 | 1 | 1 | 2 | 2 | |
Presence of constant non-unit stride data access | 3 | 1 | 1 | 1 | 3 | 1 | 1 | 1 | |
Presence of indirect access | 4 | 1 | 3 | 2 | 1 | 2 | 4 | 1 | |
Inefficient Vectorization | Presence of expensive instructions: scatter/gather | 0 | 0 | 2 | 0 | 0 | 0 | 0 | 0 |
Presence of special instructions executing on a single port | 0 | 3 | 1 | 3 | 3 | 0 | 0 | 2 |