| oneapi2025_m1-192_o1 | oneapi2025_m1-192_o2 | oneapi2025_m1-192_o3_march | oneapi2025_m1-192_o3_march_funroll | oneapi2025_m1-192_o3_march_ffast | oneapi2025_m1-192_base |
|---|---|---|---|---|---|
[ 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. |
[ 1.04 / 3 ] Only 35.24% of time spent in analyzed modules comes from functions compiled with processor specialization flags -march=native Architecture specific options are needed to produce efficient code for a specific processor ( -march=(target) ). | [ 1.50 / 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) ). | [ 1.53 / 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) ). | [ 1.93 / 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) ). | [ 1.92 / 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) ). | [ 1.90 / 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) ). |
[ 0 / 3 ] Most of time spent in analyzed modules comes from functions without source/debug info Functions without source/debug info (typically not compiled with -g) cumulate 64.76% 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. | [ 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. |
[ 2.40 / 3 ] Most of time spent in analyzed modules comes from functions with compilation options informations but -fno-omit-frame-pointer is missing -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. |
[ 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 | [ 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.06 % 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.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.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.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.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.13 % 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 (87.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 (54.82 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 (51.84 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 (46.45 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 (46.40 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 (46.42 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. |
| oneapi2025_m1-192_o1 | oneapi2025_m1-192_o2 | oneapi2025_m1-192_o3_march | oneapi2025_m1-192_o3_march_funroll | oneapi2025_m1-192_o3_march_ffast | oneapi2025_m1-192_base |
|---|---|---|---|---|---|
[ 4 / 4 ] CPU activity is good CPU cores are active 99.76% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 99.66% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 99.64% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 99.49% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 99.62% of time | [ 4 / 4 ] CPU activity is good CPU cores are active 99.64% of time |
[ 4 / 4 ] Affinity is good (99.98%) 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.97%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (99.88%) Threads are not migrating to CPU cores: probably successfully pinned | [ 4 / 4 ] Affinity is good (99.97%) 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 |
[ 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 ] 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%) |
[ 0 / 3 ] Cumulative Outermost/In between loops coverage (20.50%) greater than cumulative innermost loop coverage (8.22%) 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 (15.12%) lower than cumulative innermost loop coverage (23.90%) Having cumulative Outermost/In between loops coverage greater than cumulative innermost loop coverage will make loop optimization more complex | [ 0 / 3 ] Cumulative Outermost/In between loops coverage (49.39%) greater than cumulative innermost loop coverage (1.20%) Having cumulative Outermost/In between loops coverage greater than cumulative innermost loop coverage will make loop optimization more complex | [ 0 / 3 ] Cumulative Outermost/In between loops coverage (62.33%) greater than cumulative innermost loop coverage (1.16%) Having cumulative Outermost/In between loops coverage greater than cumulative innermost loop coverage will make loop optimization more complex | [ 0 / 3 ] Cumulative Outermost/In between loops coverage (62.13%) greater than cumulative innermost loop coverage (1.28%) Having cumulative Outermost/In between loops coverage greater than cumulative innermost loop coverage will make loop optimization more complex | [ 0 / 3 ] Cumulative Outermost/In between loops coverage (61.52%) greater than cumulative innermost loop coverage (1.11%) 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.76% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 99.66% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 99.64% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 99.49% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 99.62% of observed threads are actually active | [ 4 / 4 ] Threads activity is good On average, more than 99.64% 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. |
[ 0 / 4 ] Too little time of the experiment time spent in analyzed innermost loops (8.22%) 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 (23.90%) 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.20%) 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.16%) 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.28%) 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.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. |
[ 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% (12.46%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (22.74%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (30.54%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (40.69%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (40.42%), representing an hotspot for the application | [ 4 / 4 ] Loop profile is not flat At least one loop coverage is greater than 4% (41.11%), representing an hotspot for the application |
[ 0 / 4 ] Too little time of the experiment time spent in analyzed loops (28.72%) 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 (39.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 (50.59%) 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 (63.49%) 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 (63.42%) 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 (62.63%) 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 | 0 | 1 | 1 | 2 | 2 | 2 |
| Less than 10% of the FP ADD/SUB/MUL arithmetic operations are performed using FMA | 2 | 2 | 0 | 1 | 1 | 1 | |
| Presence of a large number of scalar integer instructions | 4 | 5 | 4 | 5 | 5 | 5 | |
| Control Flow Issues | Presence of calls | 1 | 0 | 1 | 1 | 1 | 1 |
| Presence of 2 to 4 paths | 3 | 4 | 3 | 4 | 4 | 4 | |
| Presence of more than 4 paths | 1 | 0 | 1 | 1 | 1 | 1 | |
| Non-innermost loop | 4 | 3 | 4 | 5 | 5 | 5 | |
| Data Access Issues | Presence of constant non-unit stride data access | 0 | 5 | 5 | 5 | 5 | 4 |
| Presence of special instructions executing on a single port | 0 | 4 | 4 | 5 | 5 | 5 | |
| More than 20% of the loads are accessing the stack | 5 | 4 | 4 | 5 | 5 | 5 | |
| Vectorization Roadblocks | Presence of calls | 1 | 0 | 1 | 1 | 1 | 1 |
| Presence of 2 to 4 paths | 3 | 4 | 3 | 4 | 4 | 4 | |
| Presence of more than 4 paths | 1 | 0 | 1 | 1 | 1 | 1 | |
| Non-innermost loop | 4 | 3 | 4 | 5 | 5 | 5 | |
| Presence of constant non-unit stride data access | 0 | 5 | 5 | 5 | 5 | 4 | |
| Out of user code | 0 | 0 | 1 | 0 | 1 | 0 | |
| Inefficient Vectorization | Presence of special instructions executing on a single port | 0 | 4 | 4 | 5 | 5 | 5 |
| Use of masked instructions | 1 | 5 | 8 | 8 | 8 | 9 | |