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 (57.55 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 (59.00%)
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 (13.46%)
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.46% of time
[ 4 / 4 ] Loop profile is not flat
At least one loop coverage is greater than 4% (58.45%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (58.89%)
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.64%)
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
[ 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 (3.87%)
[ 3 / 3 ] Cumulative Outermost/In between loops coverage (0.11%) lower than cumulative innermost loop coverage (58.89%)
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 1989 - libggml-cpu.so | Execution Time: 58 % - Vectorization Ratio: 0.00 % - Vector Length Use: 0.00 % | |
| ○Loop 1618 - libggml-cpu.so | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 0.00 % | |
| ○Loop 1626 - libggml-cpu.so | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 0.00 % | |
| ►Loop 63 - libggml-cpu.so | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 11.84 % | |
| ►Control Flow Issues | 24 | |
| ○ | [SA] Too many paths (18 paths) - Simplify control structure. There are 18 issues ( = paths) costing 1 point each with a malus of 4 points. | 22 |
| ○ | [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 | 24 | |
| ○ | [SA] Too many paths (18 paths) - Simplify control structure. There are 18 issues ( = paths) costing 1 point each with a malus of 4 points. | 22 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Loop 71 - libggml-cpu.so | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 9.38 % | |
| ►Control Flow Issues | 4 | |
| ○ | [SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 4 issues (= calls) costing 1 point each. | 4 |
| ►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 | 1004 | |
| ○ | [SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 4 issues (= calls) costing 1 point each. | 4 |
| ○ | [SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point. | 1000 |
| ►Loop 722 - libggml-cpu.so | Execution Time: 0 % - Vectorization Ratio: 100.00 % - Vector Length Use: 66.67 % | |
| ►Data Access Issues | 8 | |
| ○ | [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 4 issues ( = data accesses) costing 2 point each. | 8 |
| ►Vectorization Roadblocks | 8 | |
| ○ | [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 4 issues ( = data accesses) costing 2 point each. | 8 |
| ►Loop 1433 - libggml-cpu.so | Execution Time: 0 % - Vectorization Ratio: 100.00 % - Vector Length Use: 70.00 % | |
| ►Data Access Issues | 6 | |
| ○ | [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 3 issues ( = data accesses) costing 2 point each. | 6 |
| ►Vectorization Roadblocks | 6 | |
| ○ | [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 3 issues ( = data accesses) costing 2 point each. | 6 |
| ►Loop 1982 - libggml-cpu.so | Execution Time: 0 % - Vectorization Ratio: 66.67 % - Vector Length Use: 31.25 % | |
| ►Loop Computation Issues | 8 | |
| ○ | [SA] Presence of expensive FP instructions - Perform hoisting, change algorithm, use SVML or proper numerical library or perform value profiling (count the number of distinct input values). There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Control Flow Issues | 10 | |
| ○ | [SA] Too many paths (6 paths) - Simplify control structure. There are 6 issues ( = paths) costing 1 point each with a malus of 4 points. | 10 |
| ►Data Access Issues | 5 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 5 issues (= instructions) costing 1 point each. | 5 |
| ►Vectorization Roadblocks | 10 | |
| ○ | [SA] Too many paths (6 paths) - Simplify control structure. There are 6 issues ( = paths) costing 1 point each with a malus of 4 points. | 10 |
| ►Inefficient Vectorization | 5 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 5 issues (= instructions) costing 1 point each. | 5 |
| ►Loop 759 - libggml-cpu.so | Execution Time: 0 % - Vectorization Ratio: 19.23 % - Vector Length Use: 9.74 % | |
| ►Loop Computation Issues | 14 | |
| ○ | [SA] Presence of expensive FP instructions - Perform hoisting, change algorithm, use SVML or proper numerical library or perform value profiling (count the number of distinct input values). There are 3 issues (= instructions) costing 4 points each. | 12 |
| ○ | [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 | 13 | |
| ○ | [SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 2 issues (= calls) costing 1 point each. | 2 |
| ○ | [SA] Too many paths (7 paths) - Simplify control structure. There are 7 issues ( = paths) costing 1 point each with a malus of 4 points. | 11 |
| ►Data Access Issues | 4 | |
| ○ | [SA] Presence of special instructions executing on a single port (BLEND/MERGE) - Simplify data access and try to get stride 1 access. There are 2 issues (= instructions) costing 1 point each. | 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 | 13 | |
| ○ | [SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 2 issues (= calls) costing 1 point each. | 2 |
| ○ | [SA] Too many paths (7 paths) - Simplify control structure. There are 7 issues ( = paths) costing 1 point each with a malus of 4 points. | 11 |
| ►Inefficient Vectorization | 2 | |
| ○ | [SA] Presence of special instructions executing on a single port (BLEND/MERGE) - Simplify data access and try to get stride 1 access. There are 2 issues (= instructions) costing 1 point each. | 2 |
| ►Loop 726 - libggml-cpu.so | Execution Time: 0 % - Vectorization Ratio: 100.00 % - Vector Length Use: 100.00 % | |
| ►Loop Computation Issues | 4 | |
| ○ | [SA] Presence of expensive FP instructions - Perform hoisting, change algorithm, use SVML or proper numerical library or perform value profiling (count the number of distinct input values). There are 1 issues (= instructions) costing 4 points each. | 4 |
| ►Control Flow Issues | 2 | |
| ○ | [SA] Several paths (2 paths) - Simplify control structure or force the compiler to use masked instructions. There are 2 issues ( = paths) costing 1 point each. | 2 |
| ►Data Access Issues | 1 | |
| ○ | [SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 0 issues ( = arrays) costing 2 points each | 0 |
| ○ | [SA] Presence of special instructions executing on a single port (BLEND/MERGE) - Simplify data access and try to get stride 1 access. There are 1 issues (= instructions) costing 1 point each. | 1 |
| ►Vectorization Roadblocks | 2 | |
| ○ | [SA] Several paths (2 paths) - Simplify control structure or force the compiler to use masked instructions. There are 2 issues ( = paths) costing 1 point each. | 2 |
| ►Inefficient Vectorization | 3 | |
| ○ | [SA] Presence of special instructions executing on a single port (BLEND/MERGE) - Simplify data access and try to get stride 1 access. There are 1 issues (= instructions) costing 1 point each. | 1 |
| ○ | [SA] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points. | 2 |