Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 0 / 9 ] Compilation options are not available
Compilation options are an important optimization leverage but ONE-View is not able to analyze them.
[ 4 / 4 ] Application profile is long enough (60.94 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 3 / 3 ] Host configuration allows retrieval of all necessary metrics.
[ 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
[ 1 / 1 ] Lstopo present. The Topology lstopo report will be generated.
[ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (62.39%)
If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances.
[ 3 / 4 ] A significant amount of threads are idle (12.70%)
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 ] CPU activity is good
CPU cores are active 99.02% of time
[ 4 / 4 ] Loop profile is not flat
At least one loop coverage is greater than 4% (61.85%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (62.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 ] Affinity is good (99.72%)
Threads are not migrating to CPU cores: probably successfully pinned
[ 3 / 3 ] Less than 10% (0.00%) is spend in BLAS1 operations
It could be more efficient to inline by hand BLAS1 operations
[ 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.74%). 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.20%) lower than cumulative innermost loop coverage (62.19%)
Having cumulative Outermost/In between loops coverage greater than cumulative innermost loop coverage will make loop optimization more complex
[ 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.02%) is spend in Libm/SVML (special functions)
| Loop ID | Analysis | Penalty Score |
|---|---|---|
| ○Loop 2159 - libggml-cpu.so | Execution Time: 61 % - Vectorization Ratio: 0.00 % - Vector Length Use: 0.00 % | |
| ○Loop 2021 - libggml-cpu.so | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 0.00 % | |
| ►Loop 61 - libggml-cpu.so | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 11.88 % | |
| ►Control Flow Issues | 18 | |
| ○ | [SA] Too many paths (12 paths) - Simplify control structure. There are 12 issues ( = paths) costing 1 point each with a malus of 4 points. | 16 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Data Access Issues | 2 | |
| ○ | [SA] More than 20% of the loads are accessing the stack - Perform loop splitting to decrease pressure on registers. This issue costs 2 points. | 2 |
| ►Vectorization Roadblocks | 18 | |
| ○ | [SA] Too many paths (12 paths) - Simplify control structure. There are 12 issues ( = paths) costing 1 point each with a malus of 4 points. | 16 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Loop 2013 - libggml-cpu.so | Execution Time: 0 % - Vectorization Ratio: 64.29 % - Vector Length Use: 31.47 % | |
| ►Loop Computation Issues | 2 | |
| ○ | [SA] Presence of a large number of scalar integer instructions - Simplify loop structure, perform loop splitting or perform unroll and jam. This issue costs 2 points. | 2 |
| ►Control Flow Issues | 2 | |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Data Access Issues | 13 | |
| ○ | [SA] Presence of constant non unit stride data access - Use array restructuring, perform loop interchange or use gather instructions to lower a bit the cost. There are 2 issues ( = data accesses) costing 2 point each. | 4 |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 1 issues ( = indirect data accesses) costing 4 point each. | 4 |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT) - Simplify data access and try to get stride 1 access. There are 3 issues (= instructions) costing 1 point each. | 3 |
| ○ | [SA] More than 20% of the loads are accessing the stack - Perform loop splitting to decrease pressure on registers. This issue costs 2 points. | 2 |
| ►Vectorization Roadblocks | 10 | |
| ○ | [SA] Presence of constant non unit stride data access - Use array restructuring, perform loop interchange or use gather instructions to lower a bit the cost. There are 2 issues ( = data accesses) costing 2 point each. | 4 |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 1 issues ( = indirect data accesses) costing 4 point each. | 4 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Inefficient Vectorization | 3 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT) - Simplify data access and try to get stride 1 access. There are 3 issues (= instructions) costing 1 point each. | 3 |
| ►Loop 78 - libggml-cpu.so | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 9.56 % | |
| ►Control Flow Issues | 1 | |
| ○ | [SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 1 issues (= calls) costing 1 point each. | 1 |
| ►Data Access Issues | 2 | |
| ○ | [SA] More than 20% of the loads are accessing the stack - Perform loop splitting to decrease pressure on registers. This issue costs 2 points. | 2 |
| ►Vectorization Roadblocks | 1001 | |
| ○ | [SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 1 issues (= calls) costing 1 point each. | 1 |
| ○ | [SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point. | 1000 |
| ○Loop 1459 - libggml-cpu.so | Execution Time: 0 % - Vectorization Ratio: 100.00 % - Vector Length Use: 75.00 % | |
| ○Loop 2012 - libggml-cpu.so | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 0.00 % | |
| ○Loop 758 - libggml-cpu.so | Execution Time: 0 % - Vectorization Ratio: 100.00 % - Vector Length Use: 66.67 % | |
| ►Loop 1446 - libggml-cpu.so | Execution Time: 0 % - Vectorization Ratio: 22.73 % - Vector Length Use: 14.74 % | |
| ►Loop Computation Issues | 2 | |
| ○ | [SA] Presence of a large number of scalar integer instructions - Simplify loop structure, perform loop splitting or perform unroll and jam. This issue costs 2 points. | 2 |
| ►Control Flow Issues | 1003 | |
| ○ | [SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 1 issues (= calls) costing 1 point each. | 1 |
| ○ | [SA] Too many paths (4897 paths) - Simplify control structure. There are 4897 issues ( = paths) costing 1 point, limited to 1000. | 1000 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Data Access Issues | 22 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BROADCAST) - Simplify data access and try to get stride 1 access. There are 20 issues (= instructions) costing 1 point each. | 20 |
| ○ | [SA] More than 20% of the loads are accessing the stack - Perform loop splitting to decrease pressure on registers. This issue costs 2 points. | 2 |
| ►Vectorization Roadblocks | 1003 | |
| ○ | [SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 1 issues (= calls) costing 1 point each. | 1 |
| ○ | [SA] Too many paths (4897 paths) - Simplify control structure. There are 4897 issues ( = paths) costing 1 point, limited to 1000. | 1000 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Inefficient Vectorization | 20 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BROADCAST) - Simplify data access and try to get stride 1 access. There are 20 issues (= instructions) costing 1 point each. | 20 |
| ►Loop 63 - libggml-cpu.so | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►Control Flow Issues | 1 | |
| ○ | [SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 1 issues (= calls) costing 1 point each. | 1 |
| ►Data Access Issues | 2 | |
| ○ | [SA] More than 20% of the loads are accessing the stack - Perform loop splitting to decrease pressure on registers. This issue costs 2 points. | 2 |
| ►Vectorization Roadblocks | 1 | |
| ○ | [SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 1 issues (= calls) costing 1 point each. | 1 |