options

kripke.exe - 2026-07-03 13:31:36 - MAQAO 2026.0.1

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

  • run_0

▼Code Quality  

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

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

[ 0 / 4 ] A significant amount of threads are idle (76.84%)

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.

[ 0 / 4 ] CPU activity is below 90% (23.39%)

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% (65.87%), representing an hotspot for the application

[ 0 / 4 ] Too little time of the experiment time spent in analyzed innermost loops (7.98%)

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.

[ 4 / 4 ] Affinity is good (97.35%)

Threads are not migrating to CPU cores: probably successfully pinned

[ 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 (4.29%)

[ 0 / 3 ] Cumulative Outermost/In between loops coverage (66.42%) greater than cumulative innermost loop coverage (7.98%)

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)

▼Loops Overview

Loop IDAnalysisPenalty Score
►Loop 2207 - kripke.exe+Execution Time: 65 % - Vectorization Ratio: 6.67 % - Vector Length Use: 13.13 %
►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+22
○[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
○[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
►Vectorization Roadblocks+22
○[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
○[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
○Loop 1862 - kripke.exeExecution Time: 3 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 %
○Loop 1984 - kripke.exeExecution Time: 3 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 %
►Loop 2422 - kripke.exe+Execution Time: 1 % - Vectorization Ratio: 7.27 % - Vector Length Use: 13.41 %
►Loop Computation Issues+32
○[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 8 issues (= instructions) costing 4 points each.32
►Data Access Issues+26
○[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
►Vectorization Roadblocks+26
○[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
►Loop 2208 - kripke.exe+Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 %
►Control Flow Issues+22
○[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
○[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
►Data Access Issues+2
○[SA] More than 20% of the loads are accessing the stack - Perform loop splitting to decrease pressure on registers. This issue costs 2 points.2
►Vectorization Roadblocks+22
○[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
○[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
○Loop 2107 - kripke.exeExecution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 %
►Loop 2421 - kripke.exe+Execution Time: 0 % - Vectorization Ratio: 5.23 % - Vector Length Use: 13.15 %
►Loop Computation Issues+24
○[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 6 issues (= instructions) costing 4 points each.24
►Control Flow Issues+6
○[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] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
►Data Access Issues+2
○[SA] More than 20% of the loads are accessing the stack - Perform loop splitting to decrease pressure on registers. This issue costs 2 points.2
►Vectorization Roadblocks+6
○[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] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
►Loop 1982 - kripke.exe+Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.35 %
►Control Flow Issues+22
○[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
○[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
►Vectorization Roadblocks+22
○[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
○[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
►Loop 1860 - kripke.exe+Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.35 %
►Control Flow Issues+22
○[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
○[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
►Vectorization Roadblocks+22
○[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
○[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
×