| orig_default | icx_default | gcc_default | aocc_3 | icx_2 | gcc_10 |
|---|---|---|---|---|---|
[ 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. |
[ 3 / 3 ] Most of time spent in analyzed modules comes from functions with source/debug info -g option gives access to debugging informations, such are source locations. | [ 3 / 3 ] Most of time spent in analyzed modules comes from functions with source/debug info -g option gives access to debugging informations, such are source locations. | [ 3 / 3 ] Most of time spent in analyzed modules comes from functions with source/debug info -g option gives access to debugging informations, such are source locations. | [ 3 / 3 ] Most of time spent in analyzed modules comes from functions with source/debug info -g option gives access to debugging informations, such are source locations. | [ 3 / 3 ] Most of time spent in analyzed modules comes from functions with source/debug info -g option gives access to debugging informations, such are source locations. | [ 3 / 3 ] Most of time spent in analyzed modules comes from functions with source/debug info -g option gives access to debugging informations, such are source locations. |
[ 3 / 3 ] Most of time spent in analyzed modules comes from functions with compilation options informations and -fno-omit-frame-pointer is present -fno-omit-frame-pointer improves the accuracy of callchains found during the application profiling. | [ 3 / 3 ] Most of time spent in analyzed modules comes from functions with compilation options informations and -fno-omit-frame-pointer is present -fno-omit-frame-pointer improves the accuracy of callchains found during the application profiling. | [ 3 / 3 ] Most of time spent in analyzed modules comes from functions with compilation options informations and -fno-omit-frame-pointer is present -fno-omit-frame-pointer improves the accuracy of callchains found during the application profiling. | [ 3 / 3 ] Most of time spent in analyzed modules comes from functions with compilation options informations and -fno-omit-frame-pointer is present -fno-omit-frame-pointer improves the accuracy of callchains found during the application profiling. | [ 3 / 3 ] Most of time spent in analyzed modules comes from functions with compilation options informations and -fno-omit-frame-pointer is present -fno-omit-frame-pointer improves the accuracy of callchains found during the application profiling. | [ 3 / 3 ] Most of time spent in analyzed modules comes from functions with compilation options informations and -fno-omit-frame-pointer is present -fno-omit-frame-pointer improves the accuracy of callchains found during the application profiling. |
[ 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 | [ 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 | [ 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.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 0.12 % 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 |
[ 3.00 / 3 ] Most of time spent in analyzed modules (99.94%) comes from functions compiled with architecture specialization option -march=native | [ 2.93 / 3 ] Most of time spent in analyzed modules (97.75%) comes from functions compiled with architecture specialization option -march=native | [ 3.00 / 3 ] Most of time spent in analyzed modules (99.94%) comes from functions compiled with architecture specialization option -march=znver5 | [ 3.00 / 3 ] Most of time spent in analyzed modules (99.94%) comes from functions compiled with architecture specialization option -march=znver5 | [ 2.93 / 3 ] Most of time spent in analyzed modules (97.75%) comes from functions compiled with architecture specialization option -march=znver5 | [ 3.00 / 3 ] Most of time spent in analyzed modules (99.94%) comes from functions compiled with architecture specialization option -march=znver5 |
[ 4 / 4 ] Application profile is long enough (58.38 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 (58.07 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 (57.53 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 (63.68 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 (63.33 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 (57.54 s) To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds. |
[ 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 | [ 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 |
[ 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_3 | icx_2 | gcc_10 |
|---|---|---|---|---|---|
[ 4 / 4 ] CPU activity is good CPU cores are active 94.19% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 93.95% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 90.64% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 93.85% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 93.53% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 90.57% of time |
[ 4 / 4 ] Affinity is good (99.88%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (99.87%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (99.77%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (99.22%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (99.19%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (99.77%) Threads are not migrating to CPU cores: probably successfully pinned |
[ 0 / 3 ] Too many functions do not use all threads Functions running on a reduced number of threads (typically sequential code) cover at least 10% of application walltime (10.70%). Check both "Max Inclusive Time Over Threads" and "Nb Threads" in Functions or Loops tabs and consider parallelizing sequential regions or improving parallelization of regions running on a reduced number of threads | [ 0 / 3 ] Too many functions do not use all threads Functions running on a reduced number of threads (typically sequential code) cover at least 10% of application walltime (10.52%). Check both "Max Inclusive Time Over Threads" and "Nb Threads" in Functions or Loops tabs and consider parallelizing sequential regions or improving parallelization of regions running on a reduced number of threads | [ 0 / 3 ] Too many functions do not use all threads Functions running on a reduced number of threads (typically sequential code) cover at least 10% of application walltime (10.11%). Check both "Max Inclusive Time Over Threads" and "Nb Threads" in Functions or Loops tabs and consider parallelizing sequential regions or improving parallelization of regions running on a reduced number of threads | [ 0 / 3 ] Too many functions do not use all threads Functions running on a reduced number of threads (typically sequential code) cover at least 10% of application walltime (16.93%). Check both "Max Inclusive Time Over Threads" and "Nb Threads" in Functions or Loops tabs and consider parallelizing sequential regions or improving parallelization of regions running on a reduced number of threads | [ 0 / 3 ] Too many functions do not use all threads Functions running on a reduced number of threads (typically sequential code) cover at least 10% of application walltime (16.87%). Check both "Max Inclusive Time Over Threads" and "Nb Threads" in Functions or Loops tabs and consider parallelizing sequential regions or improving parallelization of regions running on a reduced number of threads | [ 0 / 3 ] Too many functions do not use all threads Functions running on a reduced number of threads (typically sequential code) cover at least 10% of application walltime (10.31%). Check both "Max Inclusive Time Over Threads" and "Nb Threads" in Functions or Loops tabs and consider parallelizing sequential regions or improving parallelization of regions running on a reduced number of threads |
[ 3 / 3 ] Cumulative Outermost/In between loops coverage (17.85%) lower than cumulative innermost loop coverage (70.32%) 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 (21.78%) lower than cumulative innermost loop coverage (66.06%) 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 (26.42%) lower than cumulative innermost loop coverage (66.24%) 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 (21.90%) lower than cumulative innermost loop coverage (66.18%) 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 (21.69%) lower than cumulative innermost loop coverage (66.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 (24.04%) lower than cumulative innermost loop coverage (68.66%) 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 93.59% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 93.32% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 90.36% of observed threads are actually active | [ 3 / 4 ] A significant amount of threads are idle (20.62%) 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. | [ 3 / 4 ] A significant amount of threads are idle (20.73%) 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. | [ 4 / 4 ] Threads activity is good On average, more than 90.28% 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 (70.32%) 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 (66.06%) 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 (66.24%) 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 (66.18%) 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 (66.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 (68.66%) 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% (31.98%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (24.85%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (31.49%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (15.09%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (24.89%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (33.60%), representing an hotspot for the application |
[ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (88.16%) 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 (87.84%) 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.66%) 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 (88.08%) 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 (87.71%) 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.70%) 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 | Presence of expensive FP instructions | 1 | 1 | 1 | 1 | 1 | 1 |
| Less than 10% of the FP ADD/SUB/MUL arithmetic operations are performed using FMA | 1 | 1 | 7 | 1 | 1 | 7 | |
| Presence of a large number of scalar integer instructions | 2 | 5 | 5 | 5 | 5 | 5 | |
| Low iteration count | 0 | 4 | 0 | 3 | 4 | 0 | |
| Control Flow Issues | Presence of 2 to 4 paths | 2 | 0 | 0 | 1 | 0 | 0 |
| Presence of more than 4 paths | 1 | 1 | 5 | 1 | 1 | 5 | |
| Non-innermost loop | 1 | 1 | 5 | 1 | 1 | 5 | |
| Low iteration count | 0 | 4 | 0 | 3 | 4 | 0 | |
| Data Access Issues | Presence of constant non-unit stride data access | 1 | 1 | 3 | 1 | 1 | 4 |
| Presence of indirect access | 6 | 7 | 3 | 7 | 7 | 3 | |
| More than 10% of the vector loads instructions are unaligned | 2 | 1 | 2 | 0 | 1 | 0 | |
| Presence of special instructions executing on a single port | 0 | 4 | 0 | 4 | 4 | 0 | |
| More than 20% of the loads are accessing the stack | 2 | 1 | 0 | 2 | 1 | 0 | |
| Vectorization Roadblocks | Presence of 2 to 4 paths | 2 | 0 | 0 | 1 | 0 | 0 |
| Presence of more than 4 paths | 1 | 1 | 5 | 1 | 1 | 5 | |
| Non-innermost loop | 1 | 1 | 5 | 1 | 1 | 5 | |
| Presence of constant non-unit stride data access | 1 | 1 | 3 | 1 | 1 | 4 | |
| Presence of indirect access | 6 | 7 | 3 | 7 | 7 | 3 | |
| Out of user code | 0 | 1 | 0 | 0 | 1 | 0 | |
| Inefficient Vectorization | Presence of special instructions executing on a single port | 0 | 4 | 0 | 4 | 4 | 0 |