Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (14.59 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 2.86 / 3 ] Optimization level option is correctly used
[ 2.86 / 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.
[ 2.86 / 3 ] Architecture specific option -march=native is used
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0 % 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 (98.88%)
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% (7.88%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (97.51%)
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 (1.37%) lower than cumulative innermost loop coverage (97.51%)
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% (0%) 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 (%) |
|---|---|---|---|---|---|---|
| ►176 | omp-cloverleaf | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 14 | 7.88 | 23.03 | 15.38 |
| ○ | [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 6 issues ( = data accesses) costing 2 point each. | 12 | ||||
| ○ | [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 | ||||
| ►148 | omp-cloverleaf | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 26 | 7.74 | 0 | 12.5 |
| ○ | [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 | ||||
| ►235 | omp-cloverleaf | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 2 | 7.67 | 16.5 | 14.56 |
| ○ | [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 | ||||
| ►877 | omp-cloverleaf | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 15 | 7.16 | 29.23 | 16.15 |
| ○ | [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 6 issues ( = data accesses) costing 2 point each. | 12 | ||||
| ○ | [SA] Several paths (3 paths) - Simplify control structure or force the compiler to use masked instructions. There are 3 issues ( = paths) costing 1 point each. | 3 | ||||
| ►154 | omp-cloverleaf | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 28 | 6.37 | 14.52 | 14.16 |
| ○ | [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 10 issues ( = data accesses) costing 2 point each. | 20 | ||||
| ○ | [SA] Several paths (4 paths) - Simplify control structure or force the compiler to use masked instructions. There are 4 issues ( = paths) costing 1 point each. | 4 | ||||
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 1 issues ( = indirect data accesses) costing 4 point each. | 4 | ||||
| ►336 | omp-cloverleaf | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 20 | 5.93 | 43.33 | 17.92 |
| ○ | [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 10 issues ( = data accesses) costing 2 point each. | 20 | ||||
| ►187 | omp-cloverleaf | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 8 | 5.24 | 23.72 | 15.23 |
| ○ | [SA] Several paths (4 paths) - Simplify control structure or force the compiler to use masked instructions. There are 4 issues ( = paths) costing 1 point each. | 4 | ||||
| ○ | [SA] Presence of constant non unit stride data access - Use array restructuring, perform loop interchange or use gather instructions to lower a bit the cost. There are 2 issues ( = data accesses) costing 2 point each. | 4 | ||||
| ►338 | omp-cloverleaf | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 14 | 4.62 | 16 | 14.5 |
| ○ | [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 7 issues ( = data accesses) costing 2 point each. | 14 | ||||
| ►886 | omp-cloverleaf | Inefficient vectorization. | 2 | 4.49 | 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 | ||||
| ►165 | omp-cloverleaf | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 12 | 4.45 | 17.24 | 14.55 |
| ○ | [SA] Too many paths (8 paths) - Simplify control structure. There are 8 issues ( = paths) costing 1 point each with a malus of 4 points. | 12 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 |