Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (12.00 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 0 / 3 ] Most of time spent in analyzed modules comes from functions without compilation information
Functions without compilation information (typically not compiled with -g) cumulate 100.00% 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.
[ 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 ] Host configuration allows retrieval of all necessary metrics.
[ 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) ).
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.08 % 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 (98.58%)
If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances.
[ 4 / 4 ] Threads activity is good
On average, more than 99.73% of observed threads are actually active
[ 4 / 4 ] CPU activity is good
CPU cores are active 99.73% of time
[ 4 / 4 ] Loop profile is not flat
At least one loop coverage is greater than 4% (49.87%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (88.00%)
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.88%)
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 (0.00%)
[ 3 / 3 ] Cumulative Outermost/In between loops coverage (10.58%) lower than cumulative innermost loop coverage (88.00%)
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.00%) is spend in Libm/SVML (special functions)
| Loop ID | Analysis | Penalty Score |
|---|---|---|
| ►Loop 39 - libqmckl.so.0.0.0 | Execution Time: 49 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►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 | 85 | |
| ○ | [SA] Too many paths (81 paths) - Simplify control structure. There are 81 issues ( = paths) costing 1 point each with a malus of 4 points. | 85 |
| ►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 | 85 | |
| ○ | [SA] Too many paths (81 paths) - Simplify control structure. There are 81 issues ( = paths) costing 1 point each with a malus of 4 points. | 85 |
| ►Loop 24 - libqmckl.so.0.0.0 | Execution Time: 20 % - Vectorization Ratio: 100.00 % - Vector Length Use: 40.00 % | |
| ►Data Access Issues | 24 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 3 issues ( = indirect data accesses) costing 4 point each. | 12 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 3 issues (= instructions) costing 4 points each. | 12 |
| ►Vectorization Roadblocks | 12 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 3 issues ( = indirect data accesses) costing 4 point each. | 12 |
| ►Inefficient Vectorization | 12 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 3 issues (= instructions) costing 4 points each. | 12 |
| ►Loop 18 - libqmckl.so.0.0.0 | Execution Time: 9 % - Vectorization Ratio: 40.48 % - Vector Length Use: 17.41 % | |
| ►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 | 435 | |
| ○ | [SA] Too many paths (429 paths) - Simplify control structure. There are 429 issues ( = paths) costing 1 point each with a malus of 4 points. | 433 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Data Access Issues | 38 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 36 issues (= instructions) costing 1 point each. | 36 |
| ○ | [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 | 435 | |
| ○ | [SA] Too many paths (429 paths) - Simplify control structure. There are 429 issues ( = paths) costing 1 point each with a malus of 4 points. | 433 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Inefficient Vectorization | 36 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 36 issues (= instructions) costing 1 point each. | 36 |
| ○Loop 26 - libqmckl.so.0.0.0 | Execution Time: 4 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % | |
| ►Loop 20 - libqmckl.so.0.0.0 | Execution Time: 3 % - Vectorization Ratio: 100.00 % - Vector Length Use: 40.91 % | |
| ►Data Access Issues | 16 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Vectorization Roadblocks | 8 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ►Inefficient Vectorization | 8 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Loop 28 - libqmckl.so.0.0.0 | Execution Time: 2 % - Vectorization Ratio: 100.00 % - Vector Length Use: 40.91 % | |
| ►Data Access Issues | 16 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Vectorization Roadblocks | 8 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ►Inefficient Vectorization | 8 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Loop 23 - libqmckl.so.0.0.0 | Execution Time: 1 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►Loop Computation Issues | 7 | |
| ○ | [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 |
| ○ | [SA] Peel/tail loop, considered having a low iteration count - Perform full unroll. Force compiler to use masked instructions. This issue costs 5 points. | 5 |
| ►Control Flow Issues | 5 | |
| ○ | [SA] Peel/tail loop, considered having a low iteration count - Perform full unroll. Force compiler to use masked instructions. This issue costs 5 points. | 5 |
| ►Vectorization Roadblocks | 1000 | |
| ○ | [SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point. | 1000 |
| ►Loop 302 - libqmckl.so.0.0.0 | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►Loop Computation Issues | 4 | |
| ○ | [SA] Less than 10% of the FP ADD/SUB/MUL arithmetic operations are performed using FMA - Reorganize arithmetic expressions to exhibit potential for FMA. This issue costs 4 points. | 4 |
| ►Loop 37 - libqmckl.so.0.0.0 | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 11.03 % | |
| ►Control Flow Issues | 334 | |
| ○ | [SA] Too many paths (328 paths) - Simplify control structure. There are 328 issues ( = paths) costing 1 point each with a malus of 4 points. | 332 |
| ○ | [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 | 334 | |
| ○ | [SA] Too many paths (328 paths) - Simplify control structure. There are 328 issues ( = paths) costing 1 point each with a malus of 4 points. | 332 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ○Loop 30 - libqmckl.so.0.0.0 | Execution Time: 0 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % |
[ 4 / 4 ] Application profile is long enough (12.05 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 0 / 3 ] Most of time spent in analyzed modules comes from functions without compilation information
Functions without compilation information (typically not compiled with -g) cumulate 100.00% 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.
[ 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 ] Host configuration allows retrieval of all necessary metrics.
[ 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) ).
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.08 % 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 (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 ] Threads activity is good
On average, more than 99.77% of observed threads are actually active
[ 4 / 4 ] CPU activity is good
CPU cores are active 99.77% of time
[ 4 / 4 ] Loop profile is not flat
At least one loop coverage is greater than 4% (51.12%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (87.34%)
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.91%)
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 (0.00%)
[ 3 / 3 ] Cumulative Outermost/In between loops coverage (10.83%) lower than cumulative innermost loop coverage (87.34%)
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.00%) is spend in Libm/SVML (special functions)
| Loop ID | Analysis | Penalty Score |
|---|---|---|
| ►Loop 39 - libqmckl.so.0.0.0 | Execution Time: 51 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►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 | 85 | |
| ○ | [SA] Too many paths (81 paths) - Simplify control structure. There are 81 issues ( = paths) costing 1 point each with a malus of 4 points. | 85 |
| ►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 | 85 | |
| ○ | [SA] Too many paths (81 paths) - Simplify control structure. There are 81 issues ( = paths) costing 1 point each with a malus of 4 points. | 85 |
| ►Loop 24 - libqmckl.so.0.0.0 | Execution Time: 19 % - Vectorization Ratio: 100.00 % - Vector Length Use: 40.00 % | |
| ►Data Access Issues | 24 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 3 issues ( = indirect data accesses) costing 4 point each. | 12 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 3 issues (= instructions) costing 4 points each. | 12 |
| ►Vectorization Roadblocks | 12 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 3 issues ( = indirect data accesses) costing 4 point each. | 12 |
| ►Inefficient Vectorization | 12 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 3 issues (= instructions) costing 4 points each. | 12 |
| ►Loop 18 - libqmckl.so.0.0.0 | Execution Time: 10 % - Vectorization Ratio: 40.48 % - Vector Length Use: 17.41 % | |
| ►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 | 435 | |
| ○ | [SA] Too many paths (429 paths) - Simplify control structure. There are 429 issues ( = paths) costing 1 point each with a malus of 4 points. | 433 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Data Access Issues | 38 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 36 issues (= instructions) costing 1 point each. | 36 |
| ○ | [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 | 435 | |
| ○ | [SA] Too many paths (429 paths) - Simplify control structure. There are 429 issues ( = paths) costing 1 point each with a malus of 4 points. | 433 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Inefficient Vectorization | 36 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 36 issues (= instructions) costing 1 point each. | 36 |
| ○Loop 26 - libqmckl.so.0.0.0 | Execution Time: 5 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % | |
| ►Loop 28 - libqmckl.so.0.0.0 | Execution Time: 3 % - Vectorization Ratio: 100.00 % - Vector Length Use: 40.91 % | |
| ►Data Access Issues | 16 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Vectorization Roadblocks | 8 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ►Inefficient Vectorization | 8 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Loop 20 - libqmckl.so.0.0.0 | Execution Time: 2 % - Vectorization Ratio: 100.00 % - Vector Length Use: 40.91 % | |
| ►Data Access Issues | 16 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Vectorization Roadblocks | 8 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ►Inefficient Vectorization | 8 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Loop 23 - libqmckl.so.0.0.0 | Execution Time: 1 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►Loop Computation Issues | 7 | |
| ○ | [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 |
| ○ | [SA] Peel/tail loop, considered having a low iteration count - Perform full unroll. Force compiler to use masked instructions. This issue costs 5 points. | 5 |
| ►Control Flow Issues | 5 | |
| ○ | [SA] Peel/tail loop, considered having a low iteration count - Perform full unroll. Force compiler to use masked instructions. This issue costs 5 points. | 5 |
| ►Vectorization Roadblocks | 1000 | |
| ○ | [SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point. | 1000 |
| ►Loop 302 - libqmckl.so.0.0.0 | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►Loop Computation Issues | 4 | |
| ○ | [SA] Less than 10% of the FP ADD/SUB/MUL arithmetic operations are performed using FMA - Reorganize arithmetic expressions to exhibit potential for FMA. This issue costs 4 points. | 4 |
| ►Loop 1049 - libqmckl.so.0.0.0 | Execution Time: 0 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.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 |
| ○Loop 30 - libqmckl.so.0.0.0 | Execution Time: 0 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % |
[ 4 / 4 ] Application profile is long enough (11.99 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 0 / 3 ] Most of time spent in analyzed modules comes from functions without compilation information
Functions without compilation information (typically not compiled with -g) cumulate 100.00% 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.
[ 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 ] Host configuration allows retrieval of all necessary metrics.
[ 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) ).
[ 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
[ 1 / 1 ] Lstopo present. The Topology lstopo report will be generated.
[ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (98.04%)
If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances.
[ 4 / 4 ] Threads activity is good
On average, more than 99.77% of observed threads are actually active
[ 4 / 4 ] CPU activity is good
CPU cores are active 99.77% of time
[ 4 / 4 ] Loop profile is not flat
At least one loop coverage is greater than 4% (50.88%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (88.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 ] Affinity is good (99.91%)
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 (0.00%)
[ 3 / 3 ] Cumulative Outermost/In between loops coverage (9.92%) lower than cumulative innermost loop coverage (88.11%)
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.00%) is spend in Libm/SVML (special functions)
| Loop ID | Analysis | Penalty Score |
|---|---|---|
| ►Loop 39 - libqmckl.so.0.0.0 | Execution Time: 50 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►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 | 85 | |
| ○ | [SA] Too many paths (81 paths) - Simplify control structure. There are 81 issues ( = paths) costing 1 point each with a malus of 4 points. | 85 |
| ►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 | 85 | |
| ○ | [SA] Too many paths (81 paths) - Simplify control structure. There are 81 issues ( = paths) costing 1 point each with a malus of 4 points. | 85 |
| ►Loop 24 - libqmckl.so.0.0.0 | Execution Time: 19 % - Vectorization Ratio: 100.00 % - Vector Length Use: 40.00 % | |
| ►Data Access Issues | 24 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 3 issues ( = indirect data accesses) costing 4 point each. | 12 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 3 issues (= instructions) costing 4 points each. | 12 |
| ►Vectorization Roadblocks | 12 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 3 issues ( = indirect data accesses) costing 4 point each. | 12 |
| ►Inefficient Vectorization | 12 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 3 issues (= instructions) costing 4 points each. | 12 |
| ►Loop 18 - libqmckl.so.0.0.0 | Execution Time: 9 % - Vectorization Ratio: 40.48 % - Vector Length Use: 17.41 % | |
| ►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 | 435 | |
| ○ | [SA] Too many paths (429 paths) - Simplify control structure. There are 429 issues ( = paths) costing 1 point each with a malus of 4 points. | 433 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Data Access Issues | 38 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 36 issues (= instructions) costing 1 point each. | 36 |
| ○ | [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 | 435 | |
| ○ | [SA] Too many paths (429 paths) - Simplify control structure. There are 429 issues ( = paths) costing 1 point each with a malus of 4 points. | 433 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Inefficient Vectorization | 36 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 36 issues (= instructions) costing 1 point each. | 36 |
| ○Loop 26 - libqmckl.so.0.0.0 | Execution Time: 5 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % | |
| ►Loop 28 - libqmckl.so.0.0.0 | Execution Time: 3 % - Vectorization Ratio: 100.00 % - Vector Length Use: 40.91 % | |
| ►Data Access Issues | 16 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Vectorization Roadblocks | 8 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ►Inefficient Vectorization | 8 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Loop 20 - libqmckl.so.0.0.0 | Execution Time: 3 % - Vectorization Ratio: 100.00 % - Vector Length Use: 40.91 % | |
| ►Data Access Issues | 16 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Vectorization Roadblocks | 8 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ►Inefficient Vectorization | 8 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Loop 302 - libqmckl.so.0.0.0 | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►Loop Computation Issues | 4 | |
| ○ | [SA] Less than 10% of the FP ADD/SUB/MUL arithmetic operations are performed using FMA - Reorganize arithmetic expressions to exhibit potential for FMA. This issue costs 4 points. | 4 |
| ►Loop 23 - libqmckl.so.0.0.0 | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►Loop Computation Issues | 7 | |
| ○ | [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 |
| ○ | [SA] Peel/tail loop, considered having a low iteration count - Perform full unroll. Force compiler to use masked instructions. This issue costs 5 points. | 5 |
| ►Control Flow Issues | 5 | |
| ○ | [SA] Peel/tail loop, considered having a low iteration count - Perform full unroll. Force compiler to use masked instructions. This issue costs 5 points. | 5 |
| ►Vectorization Roadblocks | 1000 | |
| ○ | [SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point. | 1000 |
| ►Loop 37 - libqmckl.so.0.0.0 | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 11.03 % | |
| ►Control Flow Issues | 334 | |
| ○ | [SA] Too many paths (328 paths) - Simplify control structure. There are 328 issues ( = paths) costing 1 point each with a malus of 4 points. | 332 |
| ○ | [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 | 334 | |
| ○ | [SA] Too many paths (328 paths) - Simplify control structure. There are 328 issues ( = paths) costing 1 point each with a malus of 4 points. | 332 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ○Loop 30 - libqmckl.so.0.0.0 | Execution Time: 0 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % |
[ 4 / 4 ] Application profile is long enough (12.15 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 0 / 3 ] Most of time spent in analyzed modules comes from functions without compilation information
Functions without compilation information (typically not compiled with -g) cumulate 100.00% 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.
[ 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 ] Host configuration allows retrieval of all necessary metrics.
[ 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) ).
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.04 % 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 (98.48%)
If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances.
[ 4 / 4 ] Threads activity is good
On average, more than 99.81% of observed threads are actually active
[ 4 / 4 ] CPU activity is good
CPU cores are active 99.81% of time
[ 4 / 4 ] Loop profile is not flat
At least one loop coverage is greater than 4% (50.21%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (87.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.
[ 4 / 4 ] Affinity is good (99.93%)
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 (0.00%)
[ 3 / 3 ] Cumulative Outermost/In between loops coverage (11.03%) lower than cumulative innermost loop coverage (87.45%)
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.00%) is spend in Libm/SVML (special functions)
| Loop ID | Analysis | Penalty Score |
|---|---|---|
| ►Loop 39 - libqmckl.so.0.0.0 | Execution Time: 50 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►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 | 85 | |
| ○ | [SA] Too many paths (81 paths) - Simplify control structure. There are 81 issues ( = paths) costing 1 point each with a malus of 4 points. | 85 |
| ►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 | 85 | |
| ○ | [SA] Too many paths (81 paths) - Simplify control structure. There are 81 issues ( = paths) costing 1 point each with a malus of 4 points. | 85 |
| ►Loop 24 - libqmckl.so.0.0.0 | Execution Time: 21 % - Vectorization Ratio: 100.00 % - Vector Length Use: 40.00 % | |
| ►Data Access Issues | 24 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 3 issues ( = indirect data accesses) costing 4 point each. | 12 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 3 issues (= instructions) costing 4 points each. | 12 |
| ►Vectorization Roadblocks | 12 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 3 issues ( = indirect data accesses) costing 4 point each. | 12 |
| ►Inefficient Vectorization | 12 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 3 issues (= instructions) costing 4 points each. | 12 |
| ►Loop 18 - libqmckl.so.0.0.0 | Execution Time: 10 % - Vectorization Ratio: 40.48 % - Vector Length Use: 17.41 % | |
| ►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 | 435 | |
| ○ | [SA] Too many paths (429 paths) - Simplify control structure. There are 429 issues ( = paths) costing 1 point each with a malus of 4 points. | 433 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Data Access Issues | 38 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 36 issues (= instructions) costing 1 point each. | 36 |
| ○ | [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 | 435 | |
| ○ | [SA] Too many paths (429 paths) - Simplify control structure. There are 429 issues ( = paths) costing 1 point each with a malus of 4 points. | 433 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Inefficient Vectorization | 36 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 36 issues (= instructions) costing 1 point each. | 36 |
| ○Loop 26 - libqmckl.so.0.0.0 | Execution Time: 4 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % | |
| ►Loop 28 - libqmckl.so.0.0.0 | Execution Time: 3 % - Vectorization Ratio: 100.00 % - Vector Length Use: 40.91 % | |
| ►Data Access Issues | 16 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Vectorization Roadblocks | 8 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ►Inefficient Vectorization | 8 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Loop 20 - libqmckl.so.0.0.0 | Execution Time: 2 % - Vectorization Ratio: 100.00 % - Vector Length Use: 40.91 % | |
| ►Data Access Issues | 16 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Vectorization Roadblocks | 8 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ►Inefficient Vectorization | 8 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Loop 302 - libqmckl.so.0.0.0 | Execution Time: 1 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►Loop Computation Issues | 4 | |
| ○ | [SA] Less than 10% of the FP ADD/SUB/MUL arithmetic operations are performed using FMA - Reorganize arithmetic expressions to exhibit potential for FMA. This issue costs 4 points. | 4 |
| ►Loop 23 - libqmckl.so.0.0.0 | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►Loop Computation Issues | 7 | |
| ○ | [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 |
| ○ | [SA] Peel/tail loop, considered having a low iteration count - Perform full unroll. Force compiler to use masked instructions. This issue costs 5 points. | 5 |
| ►Control Flow Issues | 5 | |
| ○ | [SA] Peel/tail loop, considered having a low iteration count - Perform full unroll. Force compiler to use masked instructions. This issue costs 5 points. | 5 |
| ►Vectorization Roadblocks | 1000 | |
| ○ | [SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point. | 1000 |
| ►Loop 37 - libqmckl.so.0.0.0 | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 11.03 % | |
| ►Control Flow Issues | 334 | |
| ○ | [SA] Too many paths (328 paths) - Simplify control structure. There are 328 issues ( = paths) costing 1 point each with a malus of 4 points. | 332 |
| ○ | [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 | 334 | |
| ○ | [SA] Too many paths (328 paths) - Simplify control structure. There are 328 issues ( = paths) costing 1 point each with a malus of 4 points. | 332 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Loop 1060 - libqmckl.so.0.0.0 | Execution Time: 0 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % | |
| ►Loop Computation Issues | 32 | |
| ○ | [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 8 issues (= instructions) costing 4 points each. | 32 |
[ 4 / 4 ] Application profile is long enough (12.15 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 0 / 3 ] Most of time spent in analyzed modules comes from functions without compilation information
Functions without compilation information (typically not compiled with -g) cumulate 100.00% 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.
[ 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 ] Host configuration allows retrieval of all necessary metrics.
[ 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) ).
[ 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
[ 1 / 1 ] Lstopo present. The Topology lstopo report will be generated.
[ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (98.15%)
If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances.
[ 4 / 4 ] Threads activity is good
On average, more than 99.80% of observed threads are actually active
[ 4 / 4 ] CPU activity is good
CPU cores are active 99.80% of time
[ 4 / 4 ] Loop profile is not flat
At least one loop coverage is greater than 4% (49.22%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (87.41%)
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.94%)
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 (0.00%)
[ 3 / 3 ] Cumulative Outermost/In between loops coverage (10.74%) lower than cumulative innermost loop coverage (87.41%)
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.00%) is spend in Libm/SVML (special functions)
| Loop ID | Analysis | Penalty Score |
|---|---|---|
| ►Loop 39 - libqmckl.so.0.0.0 | Execution Time: 49 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►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 | 85 | |
| ○ | [SA] Too many paths (81 paths) - Simplify control structure. There are 81 issues ( = paths) costing 1 point each with a malus of 4 points. | 85 |
| ►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 | 85 | |
| ○ | [SA] Too many paths (81 paths) - Simplify control structure. There are 81 issues ( = paths) costing 1 point each with a malus of 4 points. | 85 |
| ►Loop 24 - libqmckl.so.0.0.0 | Execution Time: 21 % - Vectorization Ratio: 100.00 % - Vector Length Use: 40.00 % | |
| ►Data Access Issues | 24 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 3 issues ( = indirect data accesses) costing 4 point each. | 12 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 3 issues (= instructions) costing 4 points each. | 12 |
| ►Vectorization Roadblocks | 12 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 3 issues ( = indirect data accesses) costing 4 point each. | 12 |
| ►Inefficient Vectorization | 12 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 3 issues (= instructions) costing 4 points each. | 12 |
| ►Loop 18 - libqmckl.so.0.0.0 | Execution Time: 10 % - Vectorization Ratio: 40.48 % - Vector Length Use: 17.41 % | |
| ►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 | 435 | |
| ○ | [SA] Too many paths (429 paths) - Simplify control structure. There are 429 issues ( = paths) costing 1 point each with a malus of 4 points. | 433 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Data Access Issues | 38 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 36 issues (= instructions) costing 1 point each. | 36 |
| ○ | [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 | 435 | |
| ○ | [SA] Too many paths (429 paths) - Simplify control structure. There are 429 issues ( = paths) costing 1 point each with a malus of 4 points. | 433 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Inefficient Vectorization | 36 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 36 issues (= instructions) costing 1 point each. | 36 |
| ○Loop 26 - libqmckl.so.0.0.0 | Execution Time: 4 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % | |
| ►Loop 28 - libqmckl.so.0.0.0 | Execution Time: 3 % - Vectorization Ratio: 100.00 % - Vector Length Use: 40.91 % | |
| ►Data Access Issues | 16 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Vectorization Roadblocks | 8 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ►Inefficient Vectorization | 8 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Loop 20 - libqmckl.so.0.0.0 | Execution Time: 2 % - Vectorization Ratio: 100.00 % - Vector Length Use: 40.91 % | |
| ►Data Access Issues | 16 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Vectorization Roadblocks | 8 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ►Inefficient Vectorization | 8 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Loop 23 - libqmckl.so.0.0.0 | Execution Time: 1 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►Loop Computation Issues | 7 | |
| ○ | [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 |
| ○ | [SA] Peel/tail loop, considered having a low iteration count - Perform full unroll. Force compiler to use masked instructions. This issue costs 5 points. | 5 |
| ►Control Flow Issues | 5 | |
| ○ | [SA] Peel/tail loop, considered having a low iteration count - Perform full unroll. Force compiler to use masked instructions. This issue costs 5 points. | 5 |
| ►Vectorization Roadblocks | 1000 | |
| ○ | [SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point. | 1000 |
| ►Loop 302 - libqmckl.so.0.0.0 | Execution Time: 1 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►Loop Computation Issues | 4 | |
| ○ | [SA] Less than 10% of the FP ADD/SUB/MUL arithmetic operations are performed using FMA - Reorganize arithmetic expressions to exhibit potential for FMA. This issue costs 4 points. | 4 |
| ○Loop 30 - libqmckl.so.0.0.0 | Execution Time: 0 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % | |
| ►Loop 1061 - libqmckl.so.0.0.0 | Execution Time: 0 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % | |
| ►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 |
[ 4 / 4 ] Application profile is long enough (12.40 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 0 / 3 ] Most of time spent in analyzed modules comes from functions without compilation information
Functions without compilation information (typically not compiled with -g) cumulate 100.00% 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.
[ 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 ] Host configuration allows retrieval of all necessary metrics.
[ 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) ).
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.04 % 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 (98.47%)
If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances.
[ 4 / 4 ] Threads activity is good
On average, more than 99.77% of observed threads are actually active
[ 4 / 4 ] CPU activity is good
CPU cores are active 99.77% of time
[ 4 / 4 ] Loop profile is not flat
At least one loop coverage is greater than 4% (49.58%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (86.04%)
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.90%)
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 (0.00%)
[ 3 / 3 ] Cumulative Outermost/In between loops coverage (12.42%) lower than cumulative innermost loop coverage (86.04%)
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.00%) is spend in Libm/SVML (special functions)
| Loop ID | Analysis | Penalty Score |
|---|---|---|
| ►Loop 39 - libqmckl.so.0.0.0 | Execution Time: 49 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►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 | 85 | |
| ○ | [SA] Too many paths (81 paths) - Simplify control structure. There are 81 issues ( = paths) costing 1 point each with a malus of 4 points. | 85 |
| ►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 | 85 | |
| ○ | [SA] Too many paths (81 paths) - Simplify control structure. There are 81 issues ( = paths) costing 1 point each with a malus of 4 points. | 85 |
| ►Loop 24 - libqmckl.so.0.0.0 | Execution Time: 20 % - Vectorization Ratio: 100.00 % - Vector Length Use: 40.00 % | |
| ►Data Access Issues | 24 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 3 issues ( = indirect data accesses) costing 4 point each. | 12 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 3 issues (= instructions) costing 4 points each. | 12 |
| ►Vectorization Roadblocks | 12 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 3 issues ( = indirect data accesses) costing 4 point each. | 12 |
| ►Inefficient Vectorization | 12 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 3 issues (= instructions) costing 4 points each. | 12 |
| ►Loop 18 - libqmckl.so.0.0.0 | Execution Time: 11 % - Vectorization Ratio: 40.48 % - Vector Length Use: 17.41 % | |
| ►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 | 435 | |
| ○ | [SA] Too many paths (429 paths) - Simplify control structure. There are 429 issues ( = paths) costing 1 point each with a malus of 4 points. | 433 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Data Access Issues | 38 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 36 issues (= instructions) costing 1 point each. | 36 |
| ○ | [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 | 435 | |
| ○ | [SA] Too many paths (429 paths) - Simplify control structure. There are 429 issues ( = paths) costing 1 point each with a malus of 4 points. | 433 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Inefficient Vectorization | 36 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 36 issues (= instructions) costing 1 point each. | 36 |
| ○Loop 26 - libqmckl.so.0.0.0 | Execution Time: 5 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % | |
| ►Loop 28 - libqmckl.so.0.0.0 | Execution Time: 2 % - Vectorization Ratio: 100.00 % - Vector Length Use: 40.91 % | |
| ►Data Access Issues | 16 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Vectorization Roadblocks | 8 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ►Inefficient Vectorization | 8 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Loop 20 - libqmckl.so.0.0.0 | Execution Time: 2 % - Vectorization Ratio: 100.00 % - Vector Length Use: 40.91 % | |
| ►Data Access Issues | 16 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Vectorization Roadblocks | 8 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ►Inefficient Vectorization | 8 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Loop 302 - libqmckl.so.0.0.0 | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►Loop Computation Issues | 4 | |
| ○ | [SA] Less than 10% of the FP ADD/SUB/MUL arithmetic operations are performed using FMA - Reorganize arithmetic expressions to exhibit potential for FMA. This issue costs 4 points. | 4 |
| ►Loop 23 - libqmckl.so.0.0.0 | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►Loop Computation Issues | 7 | |
| ○ | [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 |
| ○ | [SA] Peel/tail loop, considered having a low iteration count - Perform full unroll. Force compiler to use masked instructions. This issue costs 5 points. | 5 |
| ►Control Flow Issues | 5 | |
| ○ | [SA] Peel/tail loop, considered having a low iteration count - Perform full unroll. Force compiler to use masked instructions. This issue costs 5 points. | 5 |
| ►Vectorization Roadblocks | 1000 | |
| ○ | [SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point. | 1000 |
| ►Loop 37 - libqmckl.so.0.0.0 | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 11.03 % | |
| ►Control Flow Issues | 334 | |
| ○ | [SA] Too many paths (328 paths) - Simplify control structure. There are 328 issues ( = paths) costing 1 point each with a malus of 4 points. | 332 |
| ○ | [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 | 334 | |
| ○ | [SA] Too many paths (328 paths) - Simplify control structure. There are 328 issues ( = paths) costing 1 point each with a malus of 4 points. | 332 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ○Loop 30 - libqmckl.so.0.0.0 | Execution Time: 0 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % |
[ 4 / 4 ] Application profile is long enough (12.43 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 0 / 3 ] Most of time spent in analyzed modules comes from functions without compilation information
Functions without compilation information (typically not compiled with -g) cumulate 100.00% 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.
[ 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 ] Host configuration allows retrieval of all necessary metrics.
[ 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) ).
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.04 % 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 (98.27%)
If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances.
[ 4 / 4 ] Threads activity is good
On average, more than 99.54% of observed threads are actually active
[ 4 / 4 ] CPU activity is good
CPU cores are active 99.54% of time
[ 4 / 4 ] Loop profile is not flat
At least one loop coverage is greater than 4% (49.38%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (85.75%)
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.93%)
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 (0.00%)
[ 3 / 3 ] Cumulative Outermost/In between loops coverage (12.52%) lower than cumulative innermost loop coverage (85.75%)
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.00%) is spend in Libm/SVML (special functions)
| Loop ID | Analysis | Penalty Score |
|---|---|---|
| ►Loop 39 - libqmckl.so.0.0.0 | Execution Time: 49 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►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 | 85 | |
| ○ | [SA] Too many paths (81 paths) - Simplify control structure. There are 81 issues ( = paths) costing 1 point each with a malus of 4 points. | 85 |
| ►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 | 85 | |
| ○ | [SA] Too many paths (81 paths) - Simplify control structure. There are 81 issues ( = paths) costing 1 point each with a malus of 4 points. | 85 |
| ►Loop 24 - libqmckl.so.0.0.0 | Execution Time: 20 % - Vectorization Ratio: 100.00 % - Vector Length Use: 40.00 % | |
| ►Data Access Issues | 24 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 3 issues ( = indirect data accesses) costing 4 point each. | 12 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 3 issues (= instructions) costing 4 points each. | 12 |
| ►Vectorization Roadblocks | 12 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 3 issues ( = indirect data accesses) costing 4 point each. | 12 |
| ►Inefficient Vectorization | 12 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 3 issues (= instructions) costing 4 points each. | 12 |
| ►Loop 18 - libqmckl.so.0.0.0 | Execution Time: 11 % - Vectorization Ratio: 40.48 % - Vector Length Use: 17.41 % | |
| ►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 | 435 | |
| ○ | [SA] Too many paths (429 paths) - Simplify control structure. There are 429 issues ( = paths) costing 1 point each with a malus of 4 points. | 433 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Data Access Issues | 38 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 36 issues (= instructions) costing 1 point each. | 36 |
| ○ | [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 | 435 | |
| ○ | [SA] Too many paths (429 paths) - Simplify control structure. There are 429 issues ( = paths) costing 1 point each with a malus of 4 points. | 433 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Inefficient Vectorization | 36 | |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 36 issues (= instructions) costing 1 point each. | 36 |
| ○Loop 26 - libqmckl.so.0.0.0 | Execution Time: 4 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % | |
| ►Loop 20 - libqmckl.so.0.0.0 | Execution Time: 3 % - Vectorization Ratio: 100.00 % - Vector Length Use: 40.91 % | |
| ►Data Access Issues | 16 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Vectorization Roadblocks | 8 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ►Inefficient Vectorization | 8 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Loop 28 - libqmckl.so.0.0.0 | Execution Time: 2 % - Vectorization Ratio: 100.00 % - Vector Length Use: 40.91 % | |
| ►Data Access Issues | 16 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Vectorization Roadblocks | 8 | |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 |
| ►Inefficient Vectorization | 8 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 2 issues (= instructions) costing 4 points each. | 8 |
| ►Loop 23 - libqmckl.so.0.0.0 | Execution Time: 1 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►Loop Computation Issues | 7 | |
| ○ | [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 |
| ○ | [SA] Peel/tail loop, considered having a low iteration count - Perform full unroll. Force compiler to use masked instructions. This issue costs 5 points. | 5 |
| ►Control Flow Issues | 5 | |
| ○ | [SA] Peel/tail loop, considered having a low iteration count - Perform full unroll. Force compiler to use masked instructions. This issue costs 5 points. | 5 |
| ►Vectorization Roadblocks | 1000 | |
| ○ | [SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point. | 1000 |
| ►Loop 302 - libqmckl.so.0.0.0 | Execution Time: 1 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►Loop Computation Issues | 4 | |
| ○ | [SA] Less than 10% of the FP ADD/SUB/MUL arithmetic operations are performed using FMA - Reorganize arithmetic expressions to exhibit potential for FMA. This issue costs 4 points. | 4 |
| ►Loop 37 - libqmckl.so.0.0.0 | Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 11.03 % | |
| ►Control Flow Issues | 334 | |
| ○ | [SA] Too many paths (328 paths) - Simplify control structure. There are 328 issues ( = paths) costing 1 point each with a malus of 4 points. | 332 |
| ○ | [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 | 334 | |
| ○ | [SA] Too many paths (328 paths) - Simplify control structure. There are 328 issues ( = paths) costing 1 point each with a malus of 4 points. | 332 |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ○Loop 30 - libqmckl.so.0.0.0 | Execution Time: 0 % - Vectorization Ratio: 100.00 % - Vector Length Use: 50.00 % |