| orig_default | aocc_default | gcc_default | icx_2 | aocc_6 | gcc_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 / 3 ] Host configuration allows retrieval of all necessary metrics. |
[ 3.00 / 3 ] Most of time spent in analyzed modules (99.99%) comes from functions compiled with architecture specialization option -march=native | [ 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 ( -march=(target) ). | [ 3 / 3 ] Most of time spent in analyzed modules (100.00%) comes from functions compiled with architecture specialization option -march=graniterapids | [ 3.00 / 3 ] Most of time spent in analyzed modules (99.99%) comes from functions compiled with architecture specialization option -x GRANITERAPIDS | [ 3 / 3 ] Most of time spent in analyzed modules (100.00%) comes from functions compiled with architecture specialization option -march=graniterapids | [ 3 / 3 ] Most of time spent in analyzed modules (100.00%) comes from functions compiled with architecture specialization option -march=graniterapids |
[ 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. |
[ 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 |
[ 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 |
[ 4 / 4 ] Application profile is long enough (39.91 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 (131.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 (39.76 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 (39.51 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 (39.15 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 (39.23 s) To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds. |
[ 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 | aocc_default | gcc_default | icx_2 | aocc_6 | gcc_7 |
|---|---|---|---|---|---|
[ 4 / 4 ] CPU activity is good CPU cores are active 99.85% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 99.90% 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.83% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 99.71% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 99.87% of time |
[ 4 / 4 ] Affinity is good (99.93%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (99.98%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (99.92%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (99.92%) 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.93%) 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 (1.47%) | [ 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.29%) | [ 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 (1.49%) | [ 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.11%) | [ 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 (1.19%) | [ 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 (1.56%) |
[ 3 / 3 ] Cumulative Outermost/In between loops coverage (0.00%) lower than cumulative innermost loop coverage (98.37%) 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 (99.08%) 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.11%) 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.84%) 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.53%) 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.07%) 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 98.87% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 98.53% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 98.82% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 98.65% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 98.53% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 99.50% 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 (98.37%) 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 (99.08%) 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.11%) 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.84%) 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.53%) 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.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. |
[ 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% (98.33%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (99.07%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (98.08%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (97.78%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (98.49%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (97.99%), representing an hotspot for the application |
[ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (98.37%) 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 (99.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 (98.11%) 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.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 (98.53%) 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.07%) 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 | 2 |
| Less than 10% of the FP ADD/SUB/MUL arithmetic operations are performed using FMA | 0 | 1 | 0 | 2 | 0 | 0 | |
| Presence of a large number of scalar integer instructions | 1 | 0 | 0 | 1 | 1 | 1 | |
| Control Flow Issues | Presence of calls | 1 | 0 | 0 | 1 | 1 | 1 |
| Presence of 2 to 4 paths | 0 | 1 | 0 | 0 | 0 | 0 | |
| Data Access Issues | Presence of constant non-unit stride data access | 0 | 0 | 0 | 0 | 1 | 0 |
| Presence of indirect access | 1 | 0 | 0 | 0 | 0 | 0 | |
| More than 10% of the vector loads instructions are unaligned | 1 | 0 | 1 | 0 | 0 | 0 | |
| Presence of special instructions executing on a single port | 2 | 1 | 1 | 2 | 0 | 1 | |
| More than 20% of the loads are accessing the stack | 1 | 0 | 0 | 1 | 1 | 1 | |
| Vectorization Roadblocks | Presence of calls | 1 | 0 | 0 | 1 | 1 | 1 |
| Presence of 2 to 4 paths | 0 | 1 | 0 | 0 | 0 | 0 | |
| Presence of more than 4 paths | 0 | 0 | 0 | 0 | 0 | 2 | |
| Presence of constant non-unit stride data access | 0 | 0 | 0 | 0 | 1 | 0 | |
| Presence of indirect access | 1 | 0 | 0 | 0 | 0 | 0 | |
| Inefficient Vectorization | Presence of special instructions executing on a single port | 2 | 1 | 1 | 2 | 0 | 1 |
| Use of masked instructions | 1 | 0 | 1 | 1 | 1 | 1 | |