Help is available by moving the cursor above any symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (66.9 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 3 / 3 ] Optimization level option -O3 is used
To have better performances, it is advised to help the compiler by using a proper optimization level (-O3)
[ 3 / 3 ] Helper debug compilation options -g and -fno-omit-frame-pointer are used
-g option gives access to debugging informations, such are source locations and -fno-omit-frame-pointer improve the accuracy of callchains found during the application profiling.
[ 3 / 3 ] Architecture specific option -march=native is used
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.7 % of the execution time)
To have a representative profiling, it is advised that the category "Others" represents less than 20% of the execution time in order to analyze as much as possible of the user code
[ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (66.21%)
If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances.
[ 4 / 4 ] Loop profile is not flat
At least one loop coverage is greater than 4% (24.84%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (66.02%)
If the time spent in analyzed innermost loops is less than 15%, standard innermost loop optimizations such as vectorisation will have a limited impact on application performances.
[ 3 / 3 ] Less than 10% (0.01%) is spend in BLAS1 operations
It could be more efficient to inline by hand BLAS1 operations
[ 3 / 3 ] Cumulative Outermost/In between loops coverage (0.19%) lower than cumulative innermost loop coverage (66.02%)
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%) is spend in Libm/SVML (special functions)
[ 2 / 2 ] Less than 10% (2.11%) is spend in BLAS2 operations
BLAS2 calls usually could make a poor cache usage and could benefit from inlining.
Loop ID | Module | Analysis | Penalty Score | Coverage (%) | Vectorization Ratio (%) | Vector Length Use (%) |
---|---|---|---|---|---|---|
►831 | exec | Inefficient vectorization. | 2 | 24.84 | 100 | 50 |
○ | [SA] Inefficient vectorization: use of shorter than available vector length - Force compiler to use proper vector length. CAUTION: use of 512 bits vectors could be more expensive than 256 bits on some processors. Use intrinsics (costly and not portable). The issue costs 2 points. | 2 | ||||
○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
►1167 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 48 | 18.02 | 92.54 | 46.22 |
○ | [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 4 issues (= instructions) costing 4 points each. | 16 | ||||
○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 3 issues (= instructions) costing 4 points each. | 12 | ||||
○ | [SA] Presence of special instructions executing on a single port (BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 10 issues (= instructions) costing 1 point each. | 10 | ||||
○ | [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] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points. | 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 | ||||
○ | [SA] Inefficient vectorization: use of shorter than available vector length - Force compiler to use proper vector length. CAUTION: use of 512 bits vectors could be more expensive than 256 bits on some processors. Use intrinsics (costly and not portable). The issue costs 2 points. | 2 | ||||
○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
►840 | exec | Inefficient vectorization. | 2 | 14.27 | 100 | 50 |
○ | [SA] Inefficient vectorization: use of shorter than available vector length - Force compiler to use proper vector length. CAUTION: use of 512 bits vectors could be more expensive than 256 bits on some processors. Use intrinsics (costly and not portable). The issue costs 2 points. | 2 | ||||
○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
►1469 | exec | Inefficient vectorization. | 2 | 1.05 | 100 | 50 |
○ | [SA] Inefficient vectorization: use of shorter than available vector length - Force compiler to use proper vector length. CAUTION: use of 512 bits vectors could be more expensive than 256 bits on some processors. Use intrinsics (costly and not portable). The issue costs 2 points. | 2 | ||||
○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
○833 | exec | Partial or unexisting vectorization - No issue detected | 0 | 0.96 | 0 | 12.5 |
►302 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 23 | 0.9 | 87.88 | 38.92 |
○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, COMPRESS/EXPAND, BLEND/MERGE, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 9 issues (= instructions) costing 1 point each. | 9 | ||||
○ | [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 | ||||
○ | [SA] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points. | 2 | ||||
○ | [SA] Inefficient vectorization: use of shorter than available vector length - Force compiler to use proper vector length. CAUTION: use of 512 bits vectors could be more expensive than 256 bits on some processors. Use intrinsics (costly and not portable). The issue costs 2 points. | 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 | ||||
○ | [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 | ||||
○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
►299 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 28 | 0.62 | 85.37 | 37.88 |
○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, COMPRESS/EXPAND, BLEND/MERGE, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 12 issues (= instructions) costing 1 point each. | 12 | ||||
○ | [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 | ||||
○ | [SA] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points. | 2 | ||||
○ | [SA] Inefficient vectorization: use of shorter than available vector length - Force compiler to use proper vector length. CAUTION: use of 512 bits vectors could be more expensive than 256 bits on some processors. Use intrinsics (costly and not portable). The issue costs 2 points. | 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 | ||||
○ | [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 | ||||
○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
►957 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 2 | 0.55 | 25 | 15.63 |
○ | [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 1 issues ( = data accesses) costing 2 point each. | 2 | ||||
►836 | exec | Inefficient vectorization. | 6 | 0.52 | 100 | 50 |
○ | [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 | ||||
○ | [SA] Inefficient vectorization: use of shorter than available vector length - Force compiler to use proper vector length. CAUTION: use of 512 bits vectors could be more expensive than 256 bits on some processors. Use intrinsics (costly and not portable). The issue costs 2 points. | 2 | ||||
○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
►955 | exec | Inefficient vectorization. | 2 | 0.47 | 100 | 50 |
○ | [SA] Inefficient vectorization: use of shorter than available vector length - Force compiler to use proper vector length. CAUTION: use of 512 bits vectors could be more expensive than 256 bits on some processors. Use intrinsics (costly and not portable). The issue costs 2 points. | 2 | ||||
○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 |