options

gmx_mpi - 2023-03-03 21:03:07 - MAQAO 2.16.5

Help is available by moving the cursor above any symbol or by checking MAQAO website.

Stylizer  

[ 0 / 9 ] Compilation options are not available

Compilation options are an important optimization leverage but ONE-View is not able to analyze them.

[ 4 / 4 ] Application profile is long enough (1792.61 s)

To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.

[ 0 / 2 ] Too much execution time spent in category "Others" (95.66 %)

If the category "Others" represents more than 20% of the execution time, it means that the application profile misses a representative part of the application.Examine functions details to properly identify “Others” category components.Rerun after adding most represented library names (e.g. more than 20% of coverage) to external_libraries (the names can be directly provided by ONE View)

Optimizer

Loop IDModuleAnalysisPenalty ScoreCoverage (%)Vectorization
Ratio (%)
Vector Length
Use (%)
770libgromacs_mpi.so.7.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.29241.7795.698.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 72 issues (= instructions) costing 4 points each.288
[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] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points.2
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
774libgromacs_mpi.so.7.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.29215.9795.0998.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 72 issues (= instructions) costing 4 points each.288
[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] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points.2
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
776libgromacs_mpi.so.7.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.5647.1491.1797.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 140 issues (= instructions) costing 4 points each.560
[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] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points.2
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
782libgromacs_mpi.so.7.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.5642.8391.8998.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 140 issues (= instructions) costing 4 points each.560
[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] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points.2
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
19173libgromacs_mpi.so.7.0.0Partial or unexisting vectorization - No issue detected02.26025
771libgromacs_mpi.so.7.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.2952.1388.8193.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 72 issues (= instructions) costing 4 points each.288
[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 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
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
775libgromacs_mpi.so.7.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.2951.9488.0393.25
[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 72 issues (= instructions) costing 4 points each.288
[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 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
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
769libgromacs_mpi.so.7.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10021.8961.9366.34
[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
18824libgromacs_mpi.so.7.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.61.6393.6247.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
[SA] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points.2
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
19105libgromacs_mpi.so.7.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.201.2890.2852.2
[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
[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] 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] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points.2
[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
×