Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (117.47 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 3.00 / 3 ] Optimization level option is correctly used
[ 3.00 / 3 ] Most of time spent in analyzed modules comes from functions compiled with -g and -fno-omit-frame-pointer
-g option gives access to debugging informations, such are source locations. -fno-omit-frame-pointer improve the accuracy of callchains found during the application profiling.
[ 3.00 / 3 ] Architecture specific option -march=haswell is used
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 2.75 % 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 (67.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 ] Loop profile is not flat
At least one loop coverage is greater than 4% (22.24%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (66.86%)
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%) 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.18%) lower than cumulative innermost loop coverage (66.86%)
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.24%) 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 (%) |
|---|---|---|---|---|---|---|
| ►676 | libqmcwfs.so | Inefficient vectorization. | 2 | 22.24 | 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 | ||||
| ►678 | libqmcwfs.so | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 2 | 19.92 | 27.66 | 17.55 |
| ○ | [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 | ||||
| ○440 | libqmcparticle_omptarget.so | Partial or unexisting vectorization - No issue detected | 0 | 8.76 | 12.24 | 14.03 |
| ►184 | libqmcparticle_omptarget.so | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 30 | 6.03 | 27.27 | 15.91 |
| ○ | [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 13 issues ( = data accesses) costing 2 point each. | 26 | ||||
| ○ | [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 | ||||
| ○479 | libqmcparticle_omptarget.so | Partial or unexisting vectorization - No issue detected | 0 | 1.78 | 73.13 | 39.93 |
| ►558 | libqmcwfs.so | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 1000 | 1.62 | 0 | 10 |
| ○ | [SA] Too many paths (6561 paths) - Simplify control structure. There are 6561 issues ( = paths) costing 1 point, limited to 1000. | 1000 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ○677 | libqmcwfs.so | Partial or unexisting vectorization - No issue detected | 0 | 1 | 0 | 12.5 |
| ►682 | libqmcwfs.so | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 10 | 0.87 | 11.11 | 13.89 |
| ○ | [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 5 issues ( = data accesses) costing 2 point each. | 10 | ||||
| ►489 | libqmcwfs.so | Inefficient vectorization. | 14 | 0.69 | 100 | 50 |
| ○ | [SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 6 issues ( = arrays) costing 2 points each | 12 | ||||
| ○ | [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 | ||||
| ►727 | libqmcwfs.so | Inefficient vectorization. | 32 | 0.48 | 100 | 44.74 |
| ○ | [SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, SHUFFLE/PERM, Other_packing) - Simplify data access and try to get stride 1 access. There are 26 issues (= instructions) costing 1 point each. | 26 | ||||
| ○ | [SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 2 issues ( = arrays) costing 2 points each | 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 |