| orig_default | aocc_default | gcc_default | icx_3 | gcc_1 |
|---|---|---|---|---|
[ 3 / 3 ] Host configuration allows retrieval of all necessary metrics. | [ 3 / 3 ] Host configuration allows retrieval of all necessary metrics. | [ 3 / 3 ] Host configuration allows retrieval of all necessary metrics. | [ 3 / 3 ] Host configuration allows retrieval of all necessary metrics. | [ 3 / 3 ] Host configuration allows retrieval of all necessary metrics. |
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 | Not available for this run |
[ 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) ). | [ 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) ). | [ 0 / 3 ] Compilation of some functions is not optimized for the target processor -march=x86-64 option is used but it is not specific enough to produce efficient code. Architecture specific options are needed to produce efficient code for a specific processor ( -x(target) or -ax(target) ). | [ 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.93 / 3 ] Architecture specific option -march=znver5 is used |
[ 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. | [ 2.98 / 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. | [ 2.96 / 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. | [ 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. | [ 2.93 / 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. |
[ 4 / 4 ] Application profile is long enough (557.90 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 (558.98 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 (556.34 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 (555.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 (557.83 s) To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds. |
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.94 % 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 1.07 % 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.03 % 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.95 % 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.02 % 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. | [ 3 / 3 ] Optimization level option is correctly used | [ 3 / 3 ] Optimization level option is correctly used | [ 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. | [ 3 / 3 ] Optimization level option is correctly used |
[ 1 / 1 ] Lstopo present. The Topology lstopo report will be generated. | [ 1 / 1 ] Lstopo present. The Topology lstopo report will be generated. | [ 1 / 1 ] Lstopo present. The Topology lstopo report will be generated. | [ 1 / 1 ] Lstopo present. The Topology lstopo report will be generated. | [ 1 / 1 ] Lstopo present. The Topology lstopo report will be generated. |
| orig_default | aocc_default | gcc_default | icx_3 | gcc_1 |
|---|---|---|---|---|
[ 4 / 4 ] CPU activity is good CPU cores are active 99.53% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 99.58% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 99.77% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 99.53% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 99.77% of time |
[ 4 / 4 ] Affinity is good (99.56%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (99.69%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (99.93%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (99.61%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (99.89%) Threads are not migrating to CPU cores: probably successfully pinned |
[ 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.00%) | [ 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.00%) | [ 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.00%) | [ 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.00%) | [ 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.00%) |
[ 3 / 3 ] Cumulative Outermost/In between loops coverage (0.00%) lower than cumulative innermost loop coverage (2.45%) 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 (0.00%) lower than cumulative innermost loop coverage (1.69%) 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 (0.03%) lower than cumulative innermost loop coverage (2.68%) 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 (0.00%) lower than cumulative innermost loop coverage (2.13%) 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 (0.48%) lower than cumulative innermost loop coverage (1.68%) 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.43% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 99.47% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 99.70% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 99.44% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 99.71% 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. |
[ 0 / 4 ] Too little time of the experiment time spent in analyzed innermost loops (2.45%) 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. | [ 0 / 4 ] Too little time of the experiment time spent in analyzed innermost loops (1.69%) 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. | [ 0 / 4 ] Too little time of the experiment time spent in analyzed innermost loops (2.68%) 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. | [ 0 / 4 ] Too little time of the experiment time spent in analyzed innermost loops (2.13%) 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. | [ 0 / 4 ] Too little time of the experiment time spent in analyzed innermost loops (1.68%) 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 |
[ 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) |
[ 0 / 4 ] Loop profile is flat No hotspot found in the application (greatest loop coverage is 0.96%), and the twenty hottest loops cumulated coverage is lower than 20% of the application profiled time (2.45%) | [ 0 / 4 ] Loop profile is flat No hotspot found in the application (greatest loop coverage is 0.47%), and the twenty hottest loops cumulated coverage is lower than 20% of the application profiled time (1.69%) | [ 0 / 4 ] Loop profile is flat No hotspot found in the application (greatest loop coverage is 0.86%), and the twenty hottest loops cumulated coverage is lower than 20% of the application profiled time (2.71%) | [ 0 / 4 ] Loop profile is flat No hotspot found in the application (greatest loop coverage is 0.88%), and the twenty hottest loops cumulated coverage is lower than 20% of the application profiled time (2.13%) | [ 0 / 4 ] Loop profile is flat No hotspot found in the application (greatest loop coverage is 0.75%), and the twenty hottest loops cumulated coverage is lower than 20% of the application profiled time (2.17%) |
[ 0 / 4 ] Too little time of the experiment time spent in analyzed loops (2.45%) If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances. | [ 0 / 4 ] Too little time of the experiment time spent in analyzed loops (1.69%) If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances. | [ 0 / 4 ] Too little time of the experiment time spent in analyzed loops (2.71%) If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances. | [ 0 / 4 ] Too little time of the experiment time spent in analyzed loops (2.13%) If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances. | [ 0 / 4 ] Too little time of the experiment time spent in analyzed loops (2.17%) If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances. |
| Analysis | r0 | r1 | r2 | r3 | r4 | |
|---|---|---|---|---|---|---|
| Loop Computation Issues | Presence of expensive FP instructions | 0 | 0 | 1 | 0 | 0 |
| Less than 10% of the FP ADD/SUB/MUL arithmetic operations are performed using FMA | 3 | 4 | 5 | 2 | 2 | |
| Presence of a large number of scalar integer instructions | 2 | 2 | 1 | 1 | 1 | |
| Control Flow Issues | Presence of more than 4 paths | 1 | 1 | 2 | 1 | 2 |
| Non-innermost loop | 0 | 0 | 0 | 0 | 1 | |
| Data Access Issues | Presence of constant non-unit stride data access | 1 | 0 | 2 | 0 | 4 |
| Presence of indirect access | 0 | 0 | 0 | 3 | 0 | |
| More than 10% of the vector loads instructions are unaligned | 3 | 4 | 5 | 0 | 4 | |
| Presence of expensive instructions: scatter/gather | 0 | 0 | 0 | 3 | 0 | |
| Presence of special instructions executing on a single port | 2 | 3 | 3 | 4 | 2 | |
| More than 20% of the loads are accessing the stack | 0 | 0 | 1 | 0 | 0 | |
| Vectorization Roadblocks | Presence of more than 4 paths | 1 | 1 | 2 | 1 | 2 |
| Non-innermost loop | 0 | 0 | 0 | 0 | 1 | |
| Presence of constant non-unit stride data access | 1 | 0 | 2 | 0 | 4 | |
| Presence of indirect access | 0 | 0 | 0 | 3 | 0 | |
| Out of user code | 1 | 0 | 0 | 0 | 0 | |
| Inefficient Vectorization | Presence of expensive instructions: scatter/gather | 0 | 0 | 0 | 3 | 0 |
| Presence of special instructions executing on a single port | 2 | 3 | 3 | 4 | 2 | |