Help is available by moving the cursor above any symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (45.11 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=armv8.2-a+sve is used
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.14 % 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 (87.55%)
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% (34.81%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (82.40%)
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 (5.15%) lower than cumulative innermost loop coverage (82.4%)
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 (%) |
---|---|---|---|---|---|---|
►764 | libgromacs_mpi.so.7 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 514 | 34.81 | 97.8 | 98.73 |
○ | [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 128 issues (= instructions) costing 4 points each. | 512 | ||||
○ | [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 | ||||
►759 | libgromacs_mpi.so.7 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 514 | 13.45 | 97.16 | 98.8 |
○ | [SA] Presence of expensive FP instructions - Perform hoisting, change algorithm, use SVML or proper numerical library or perform value profiling (count the number of distinct input values). There are 128 issues (= instructions) costing 4 points each. | 512 | ||||
○ | [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 | ||||
►771 | libgromacs_mpi.so.7 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 898 | 5.53 | 93.33 | 97.91 |
○ | [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 224 issues (= instructions) costing 4 points each. | 896 | ||||
○ | [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 | ||||
○18634 | libgromacs_mpi.so.7 | Partial or unexisting vectorization - No issue detected | 0 | 3.65 | 0 | 25 |
►769 | libgromacs_mpi.so.7 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 898 | 2.28 | 93.8 | 98.03 |
○ | [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 224 issues (= instructions) costing 4 points each. | 896 | ||||
○ | [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 | ||||
►16654 | libgromacs_mpi.so.7 | Inefficient vectorization. | 4 | 2 | 100 | 100 |
○ | [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 | ||||
○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
►765 | libgromacs_mpi.so.7 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 517 | 1.78 | 92.46 | 91.23 |
○ | [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 128 issues (= instructions) costing 4 points each. | 512 | ||||
○ | [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 | ||||
○ | [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 | ||||
►763 | libgromacs_mpi.so.7 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 517 | 1.57 | 91.34 | 90.52 |
○ | [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 128 issues (= instructions) costing 4 points each. | 512 | ||||
○ | [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 | ||||
○ | [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 | ||||
►18294 | libgromacs_mpi.so.7 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 4 | 1.53 | 93.62 | 47.87 |
○ | [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] 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 | ||||
►760 | libgromacs_mpi.so.7 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 1002 | 1.5 | 64.71 | 68.63 |
○ | [SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point. | 1000 | ||||
○ | [SA] Non innermost loop (Outermost) - Collapse loop with innermost ones. This issue costs 2 points. | 2 | ||||
○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 |