| orig_default | icx_default | gcc_default | aocc_2 | icx_9 | gcc_6 |
|---|---|---|---|---|---|
[ 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. | [ 3 / 3 ] Host configuration allows retrieval of all necessary metrics. |
[ 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 |
[ 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=znver4 is used | [ 3.00 / 3 ] Architecture specific option -march=znver4 is used | [ 3.00 / 3 ] Architecture specific option -march=znver4 is used | [ 3.00 / 3 ] Architecture specific option -march=znver4 is used |
[ 3.00 / 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. | [ 3.00 / 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. | [ 3.00 / 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. | [ 3.00 / 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. | [ 3.00 / 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. | [ 3.00 / 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 (25.59 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 (27.08 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 (27.00 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 (25.28 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 (27.08 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 (26.89 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.00 % 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.00 % 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.00 % 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.00 % 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.00 % 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.00 % 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 / 3 ] Optimization level option is correctly used | [ 3 / 3 ] Optimization level option is correctly used | [ 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. | [ 1 / 1 ] Lstopo present. The Topology lstopo report will be generated. |
| orig_default | icx_default | gcc_default | aocc_2 | icx_9 | gcc_6 |
|---|---|---|---|---|---|
[ 4 / 4 ] CPU activity is good CPU cores are active 97.65% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 98.53% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 97.78% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 98.30% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 98.48% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 97.77% of time |
[ 4 / 4 ] Affinity is good (97.63%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (96.27%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (97.75%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (98.28%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (95.71%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (97.74%) 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 (9.69%) | [ 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 (2.54%) | [ 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 (5.75%) | [ 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 (9.10%) | [ 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 (2.60%) | [ 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 (5.96%) |
[ 3 / 3 ] Cumulative Outermost/In between loops coverage (0.00%) lower than cumulative innermost loop coverage (81.10%) 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 (97.02%) 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 (98.04%) 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 (81.19%) 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 (97.00%) 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 (98.05%) 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 97.20% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 98.13% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 97.49% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 97.83% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 98.08% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 97.48% 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. |
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (81.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. | [ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (97.02%) 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 (98.04%) 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 (81.19%) 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 (97.00%) 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 (98.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. |
[ 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) |
[ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (29.41%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (27.39%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (27.69%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (29.41%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (27.37%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (27.63%), representing an hotspot for the application |
[ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (81.10%) 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 (97.02%) 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 (98.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 (81.19%) 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 (97.00%) 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 (98.05%) 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 | r5 | |
|---|---|---|---|---|---|---|---|
| Loop Computation Issues | Less than 10% of the FP ADD/SUB/MUL arithmetic operations are performed using FMA | 3 | 3 | 3 | 3 | 3 | 3 |
| Presence of a large number of scalar integer instructions | 0 | 1 | 0 | 0 | 0 | 0 | |
| Data Access Issues | Presence of constant non-unit stride data access | 0 | 0 | 1 | 0 | 0 | 0 |
| More than 10% of the vector loads instructions are unaligned | 0 | 0 | 0 | 0 | 4 | 0 | |
| Vectorization Roadblocks | Presence of constant non-unit stride data access | 0 | 0 | 1 | 0 | 0 | 0 |