| orig_default | gcc_default | icx_2 | gcc_2 | aocc_7 |
|---|---|---|---|---|
[ 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.00 / 3 ] Architecture specific option -march=native is used | [ 0 / 3 ] Compilation of some functions is not optimized for the target processor Application run on the GRANITE_RAPIDS micro-architecture while the code was specialized for graniterapids. 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) ). Application run on the GRANITE_RAPIDS micro-architecture while the code was specialized for GRANITERAPIDS. | [ 0 / 3 ] Compilation of some functions is not optimized for the target processor Application run on the GRANITE_RAPIDS micro-architecture while the code was specialized for graniterapids. 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 Application run on the GRANITE_RAPIDS micro-architecture while the code was specialized for graniterapids. Architecture specific options are needed to produce efficient code for a specific processor ( -x(target) or -ax(target) ). |
[ 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 (16.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 (16.04 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 (16.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 (15.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 (16.17 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 |
[ 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. |
| orig_default | gcc_default | icx_2 | gcc_2 | aocc_7 |
|---|---|---|---|---|
[ 4 / 4 ] CPU activity is good CPU cores are active 92.53% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 90.33% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 92.75% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 90.95% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 90.43% of time |
[ 3 / 4 ] Affinity stability is lower than 90% (88.33%) 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 core --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 (90.44%) Threads are not migrating to CPU cores: probably successfully pinned | [ 3 / 4 ] Affinity stability is lower than 90% (89.06%) 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 core --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.40%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (90.47%) 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 (14.02%). 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 (12.97%). 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 (15.76%). 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 (12.24%). 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 (13.06%). 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 (0.00%) lower than cumulative innermost loop coverage (94.99%) 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.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 (0.00%) lower than cumulative innermost loop coverage (94.01%) 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.17%) 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 (77.45%) 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 90.98% of observed threads are actually active | [ 3 / 4 ] A significant amount of threads are idle (10.48%) 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 91.03% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 90.19% of observed threads are actually active | [ 3 / 4 ] A significant amount of threads are idle (11.17%) 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. |
[ 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 (94.99%) 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.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 (94.01%) 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.17%) 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 (77.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. |
[ 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) |
[ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (28.10%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (28.99%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (27.65%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (28.96%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (28.63%), representing an hotspot for the application |
[ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (94.99%) 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.21%) 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 (94.01%) 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.17%) 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 (77.45%) 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 | Less than 10% of the FP ADD/SUB/MUL arithmetic operations are performed using FMA | 3 | 3 | 3 | 3 | 3 |
| Presence of a large number of scalar integer instructions | 2 | 0 | 2 | 0 | 0 | |
| Data Access Issues | More than 10% of the vector loads instructions are unaligned | 4 | 4 | 0 | 0 | 0 |