Help is available by moving the cursor above any symbol or by checking MAQAO website.
[ 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 (1777.67 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.59 %)
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)
[ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (92.95%)
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% (41.90%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (86.47%)
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 (6.48%) lower than cumulative innermost loop coverage (86.47%)
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 (%) |
---|---|---|---|---|---|---|
►770 | libgromacs_mpi.so.7.0.0 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 292 | 41.9 | 95.6 | 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 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 | ||||
►774 | libgromacs_mpi.so.7.0.0 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 292 | 16.29 | 95.09 | 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 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 | ||||
►776 | libgromacs_mpi.so.7.0.0 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 564 | 6.67 | 91.17 | 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 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 | ||||
►782 | libgromacs_mpi.so.7.0.0 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 564 | 2.71 | 91.89 | 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 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 | ||||
○19173 | libgromacs_mpi.so.7.0.0 | Partial or unexisting vectorization - No issue detected | 0 | 2.26 | 0 | 25 |
►771 | libgromacs_mpi.so.7.0.0 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 295 | 2.17 | 88.81 | 93.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 | ||||
►775 | libgromacs_mpi.so.7.0.0 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 295 | 1.93 | 88.03 | 93.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 | ||||
►769 | libgromacs_mpi.so.7.0.0 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 1002 | 1.8 | 61.93 | 66.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 | ||||
►18824 | libgromacs_mpi.so.7.0.0 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 6 | 1.64 | 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 | ||||
○ | [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 | ||||
►19105 | libgromacs_mpi.so.7.0.0 | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 20 | 1.28 | 90.28 | 52.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 |