engine_NEON1M11-0001_o26_m2 | engine_NEON1M11-0001_o26_m2_ifort |
---|---|
[ 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) ). | [ 1.65 / 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) ). |
[ 0 / 3 ] Most of time spent in analyzed modules comes from functions without compilation information Functions without compilation information (typically not compiled with -g) cumulate 100.00% 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. | [ 1.65 / 3 ] Most of time spent in analyzed modules comes from functions without compilation information Functions without compilation information (typically not compiled with -g) cumulate 44.96% 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 / 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 | [ 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 |
[ 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. | [ 1.66 / 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. |
[ 4 / 4 ] Application profile is long enough (402.13 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 (425.60 s) To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds. |
engine_NEON1M11-0001_o26_m2 | engine_NEON1M11-0001_o26_m2_ifort |
---|---|
[ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (17.42%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (16.27%), representing an hotspot for the application |
[ 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 (88.07%) 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 (87.55%) 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 |
[ 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 ] Enough time of the experiment time spent in analyzed loops (90.95%) 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 (89.71%) 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 (2.88%) lower than cumulative innermost loop coverage (88.07%) 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 (2.16%) lower than cumulative innermost loop coverage (87.55%) Having cumulative Outermost/In between loops coverage greater than cumulative innermost loop coverage will make loop optimization more complex |
Analysis | r_1 | r_2 | |
---|---|---|---|
Loop Computation Issues | Less than 10% of the FP ADD/SUB/MUL arithmetic operations are performed using FMA | 5 | 6 |
Presence of a large number of scalar integer instructions | 2 | 3 | |
Control Flow Issues | Presence of calls | 1 | 1 |
Presence of 2 to 4 paths | 2 | 1 | |
Data Access Issues | Presence of constant non-unit stride data access | 2 | 2 |
Presence of indirect access | 2 | 2 | |
More than 10% of the vector loads instructions are unaligned | 2 | 0 | |
Presence of expensive instructions: scatter/gather | 0 | 1 | |
Presence of special instructions executing on a single port | 2 | 0 | |
More than 20% of the loads are accessing the stack | 3 | 3 | |
Vectorization Roadblocks | Presence of calls | 1 | 1 |
Presence of 2 to 4 paths | 2 | 1 | |
Presence of more than 4 paths | 1 | 1 | |
Presence of constant non-unit stride data access | 2 | 2 | |
Presence of indirect access | 2 | 2 | |
Inefficient Vectorization | Presence of expensive instructions: scatter/gather | 0 | 1 |
Presence of special instructions executing on a single port | 2 | 0 |