options

exec - 2025-09-17 23:43:01 - MAQAO 2025.1.2

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

  • run_0

Stylizer  

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

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

[ 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 / 3 ] Optimization level option is correctly used

[ 3 / 3 ] Host configuration allows retrieval of all necessary metrics.

[ 0 / 3 ] Compilation of some functions is not optimized for the target processor

Application run on the GRANITE_RAPIDS micro-architecture while the code was specialized for graniterapids. Architecture specific options are needed to produce efficient code for a specific processor ( -x(target) or -ax(target) ).

[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.00 % 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

[ 1 / 1 ] Lstopo present. The Topology lstopo report will be generated.

Strategizer  

[ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (90.72%)

If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances.

[ 3 / 4 ] A significant amount of threads are idle (13.70%)

On average, more than 10% of observed threads are idle. Such threads are probably IO/sync waiting. Some hints: use faster filesystems to read/write data, improve parallel load balancing and/or scheduling.

[ 3 / 4 ] CPU activity is below 90% (87.01%)

CPU cores are idle more than 10% of time. Threads supposed to run on these cores are probably IO/sync waiting. Some hints: use faster filesystems to read/write data, improve parallel load balancing and/or scheduling.

[ 4 / 4 ] Loop profile is not flat

At least one loop coverage is greater than 4% (21.87%), representing an hotspot for the application

[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (86.06%)

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 / 4 ] Affinity stability is lower than 90% (87.81%)

Threads are often migrating to other CPU cores/threads. For OpenMP, typically set (OMP_PLACES=cores OMP_PROC_BIND=close) or (OMP_PLACES=threads OMP_PROC_BIND=spread). With OpenMPI + OpenMP, use --bind-to core --map-by node:PE=$OMP_NUM_THREADS --report-bindings. With IntelMPI + OpenMP, set I_MPI_PIN_DOMAIN=omp:compact or I_MPI_PIN_DOMAIN=omp:scatter and use -print-rank-map.

[ 3 / 3 ] Less than 10% (0.00%) is spend in BLAS1 operations

It could be more efficient to inline by hand BLAS1 operations

[ 3 / 3 ] Functions mostly use all threads

Functions running on a reduced number of threads (typically sequential code) cover less than 10% of application walltime (0.00%)

[ 3 / 3 ] Cumulative Outermost/In between loops coverage (4.66%) lower than cumulative innermost loop coverage (86.06%)

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.00%) is spend in BLAS2 operations

BLAS2 calls usually could make a poor cache usage and could benefit from inlining.

[ 2 / 2 ] Less than 10% (0.00%) is spend in Libm/SVML (special functions)

Optimizer

Loop IDAnalysisPenalty Score
Loop 24686 - exec+Execution Time: 21 % - Vectorization Ratio: 0.00 % - Vector Length Use: 6.25 %
Loop Computation Issues+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
Control Flow Issues+20
[SA] Too many paths (16 paths) - Simplify control structure. There are 16 issues ( = paths) costing 1 point each with a malus of 4 points.20
Vectorization Roadblocks+20
[SA] Too many paths (16 paths) - Simplify control structure. There are 16 issues ( = paths) costing 1 point each with a malus of 4 points.20
Loop 24695 - exec+Execution Time: 21 % - Vectorization Ratio: 0.00 % - Vector Length Use: 6.25 %
Control Flow Issues+20
[SA] Too many paths (16 paths) - Simplify control structure. There are 16 issues ( = paths) costing 1 point each with a malus of 4 points.20
Vectorization Roadblocks+20
[SA] Too many paths (16 paths) - Simplify control structure. There are 16 issues ( = paths) costing 1 point each with a malus of 4 points.20
Loop 24687 - exec+Execution Time: 16 % - Vectorization Ratio: 14.89 % - Vector Length Use: 9.97 %
Loop Computation Issues+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 2 issues (= instructions) costing 4 points each.8
Data Access Issues+13
[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 3 issues ( = data accesses) costing 2 point each.6
[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
[SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 3 issues (= instructions) costing 1 point each.3
Vectorization Roadblocks+10
[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 3 issues ( = data accesses) costing 2 point each.6
[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
Inefficient Vectorization+3
[SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 3 issues (= instructions) costing 1 point each.3
Loop 22579 - exec+Execution Time: 7 % - Vectorization Ratio: 0.00 % - Vector Length Use: 6.25 %
Control Flow Issues+20
[SA] Too many paths (16 paths) - Simplify control structure. There are 16 issues ( = paths) costing 1 point each with a malus of 4 points.20
Vectorization Roadblocks+20
[SA] Too many paths (16 paths) - Simplify control structure. There are 16 issues ( = paths) costing 1 point each with a malus of 4 points.20
Loop 24696 - exec+Execution Time: 6 % - Vectorization Ratio: 0.00 % - Vector Length Use: 7.66 %
Loop Computation Issues+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 2 issues (= instructions) costing 4 points each.8
Data Access Issues+10
[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
Vectorization Roadblocks+10
[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
Loop 24694 - exec+Execution Time: 1 % - Vectorization Ratio: 3.64 % - Vector Length Use: 7.95 %
Loop Computation Issues+6
[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 1 issues (= instructions) costing 4 points each.4
[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
Control Flow Issues+1002
[SA] Too many paths (1017 paths) - Simplify control structure. There are 1017 issues ( = paths) costing 1 point, limited to 1000.1000
[SA] Non innermost loop (Outermost) - Collapse loop with innermost ones. This issue costs 2 points.2
Vectorization Roadblocks+1002
[SA] Too many paths (1017 paths) - Simplify control structure. There are 1017 issues ( = paths) costing 1 point, limited to 1000.1000
[SA] Non innermost loop (Outermost) - Collapse loop with innermost ones. This issue costs 2 points.2
Loop 6524 - execExecution Time: 1 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 %
Loop 6389 - exec+Execution Time: 1 % - Vectorization Ratio: 50.00 % - Vector Length Use: 18.75 %
Loop Computation Issues+4
[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
Data Access Issues+6
[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 3 issues ( = data accesses) costing 2 point each.6
Vectorization Roadblocks+6
[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 3 issues ( = data accesses) costing 2 point each.6
Loop 24824 - exec+Execution Time: 1 % - Vectorization Ratio: 50.00 % - Vector Length Use: 14.06 %
Data Access Issues+20
[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
Vectorization Roadblocks+20
[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
Loop 6527 - execExecution Time: 1 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 %
×