	*************************************************
	*                                               *
	*          ONE-View report generation           *
	*                                               *
	*************************************************

[MAQAO] Info: Experiment configuration summary is available adding -dbg=1 in command line

* [MAQAO] Warning: Experiment directory /home/eoseret/qaas/qaas_runs/178-643-2345/intel/HACCmk/run/oneview_runs/compilers/gcc_1/oneview_results_1786433536 already exists and is reused.
           It can be replaced using --replace in the command line.
[MAQAO] Info: 
[MAQAO] Info: START THE APPLICATION PROFILING
[MAQAO] Info: -> RUNNING THE PROFILER...
[MAQAO] Info:   LPROF has already been run
[MAQAO] Info: STOP THE APPLICATION PROFILING
[MAQAO] Info: 
[MAQAO] Info: START FUNCTIONS AND LOOPS ANALYSIS ...
[MAQAO] Info: STOP FUNCTIONS AND LOOPS ANALYSIS ...
[MAQAO] Info: 
[MAQAO] Info: START THE REPORT GENERATION
[MAQAO] Info: -> ONE-VIEW EXPERIMENT DIRECTORY: /home/eoseret/qaas/qaas_runs/178-643-2345/intel/HACCmk/run/oneview_runs/compilers/gcc_1/oneview_results_1786433536


+====================================================================================================================+
+                                                    1  -  GLOBAL                                                    +
+====================================================================================================================+


+--------------------------------------------------------------------------------------------------------------------+
+                                             1.1  -  Experiment Summary                                             +
+--------------------------------------------------------------------------------------------------------------------+

  Application:			/home/eoseret/qaas/qaas_runs/178-643-2345/intel/HACCmk/run/binaries/gcc_1/exec
  Timestamp:			2026-08-11 07:32:16
  Universal Timestamp:		1786433536
  Experiment Type:		MPI; OpenMP; Throughput; 
  Machine:			ip-172-31-9-132.ec2.internal
  Architecture:			aarch64
  Micro Architecture:		ARM_NEOVERSE_V2
  OS Version:			Linux 6.1.170-213.321.amzn2023.aarch64 #1 SMP Thu May 14 12:18:13 UTC 2026
  Compilation Options:		
		exec: GNU C17 14.2.1 20250110 (Red Hat 14.2.1-7) -mcpu=neoverse-v2 -mlittle-endian -mabi=lp64 -g -O3 -O3 -fno-omit-frame-pointer -fopenmp -funroll-loops -ffast-math 
  Number of processes observed:	1
  Number of threads observed:	96
  MAQAO version:		2026.0.1
  MAQAO build:			Build information not available




+--------------------------------------------------------------------------------------------------------------------+
+                                               1.2  -  Global Metrics                                               +
+--------------------------------------------------------------------------------------------------------------------+

  Total Time:				20.21 s
  Max (Thread Active Time):		20.17 s
  Average Active Time:			19.51 s
  Activity Ratio:			96.6 %
  Average number of active threads:	92.682
  Affinity Stability:			99.9 %
  Time spent in analyzed loops:		95.6 %
  Time spent in analyzed innermost loops: 95.6 %
  Time spent in user code:		95.6 %
  Compilation Options Score:		100
  Array Access Efficiency:		50.0 %

   Potential Speedups
  ----------------------------------------------------
  Perfect Flow Complexity:		1.00
  Perfect OpenMP/MPI/Pthread/TBB:	1.00
  Perfect OpenMP/MPI/Pthread/TBB + Load Distribution:	1.08
  If No Scalar Integer:
      Potential Speedup:		1.00
      Nb Loops to get 80%:		1
  If FP Vectorized:
      Potential Speedup:		1.00
      Nb Loops to get 80%:		1
  If Fully Vectorized:
      Potential Speedup:		1.00
      Nb Loops to get 80%:		2
  If Only FP Arithmetic:
      Potential Speedup:		1.00
      Nb Loops to get 80%:		1




+--------------------------------------------------------------------------------------------------------------------+
+                                             1.3  -  Potential Speedups                                             +
+--------------------------------------------------------------------------------------------------------------------+

  If No Scalar Integer:
      Number of loops   | 1      | 2      | 3      | 
      Cumulated Speedup | 1.0000 | 1.0000 | 1.0000 | 
  Top 5 loops:
    exec - 2:	1
    exec - 1:	1
    exec - 4:	1

  If FP Vectorized:
      Number of loops   | 1      | 2      | 3      | 
      Cumulated Speedup | 1.0000 | 1.0000 | 1.0000 | 
  Top 5 loops:
    exec - 4:	1
    exec - 1:	1
    exec - 2:	1

  If Fully Vectorized:
      Number of loops   | 1      | 2      | 3      | 
      Cumulated Speedup | 1.0003 | 1.0004 | 1.0004 | 
  Top 5 loops:
    exec - 1:	1.0003
    exec - 2:	1.0004
    exec - 4:	1.0004

  If Only FP Arithmetic:
      Number of loops   | 1      | 2      | 3      | 
      Cumulated Speedup | 1.0001 | 1.0001 | 1.0001 | 
  Top 5 loops:
    exec - 2:	1.0001
    exec - 1:	1.0001
    exec - 4:	1.0001



+====================================================================================================================+
+                                                   2  -  SUMMARY                                                    +
+====================================================================================================================+


+--------------------------------------------------------------------------------------------------------------------+
+                                             2.1  -  EXPERIMENT QUALITY                                             +
+--------------------------------------------------------------------------------------------------------------------+

  [4 / 4] Application profile is long enough (20.17 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.

  [3 / 3] Most of time spent in analyzed modules comes from functions with source/debug info
-g option gives access to debugging informations, such are source locations.

  [3 / 3] Most of time spent in analyzed modules (100.00%) comes from functions compiled with architecture specialization option
-mcpu


  [3 / 3] Most of time spent in analyzed modules comes from functions with compilation options informations and
-fno-omit-frame-pointer is present
-fno-omit-frame-pointer improves 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.


  [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.



+--------------------------------------------------------------------------------------------------------------------+
+                                                2.2  -  CODE QUALITY                                                +
+--------------------------------------------------------------------------------------------------------------------+

  [4 / 4] Enough time of the experiment time spent in analyzed loops (95.63%)
If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on
application performances.

  [4 / 4] Threads activity is good
On average, more than 96.54% of observed threads are actually active 

  [4 / 4] CPU activity is good
CPU cores are active 96.65% of time

  [4 / 4] Loop profile is not flat
At least one loop coverage is greater than 4% (95.57%), representing an hotspot for the application

  [4 / 4] Enough time of the experiment time spent in analyzed innermost loops (95.63%)
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 (99.91%)
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 (5.74%)

  [3 / 3] Cumulative Outermost/In between loops coverage (0.00%) lower than cumulative innermost loop coverage (95.63%)
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)



+--------------------------------------------------------------------------------------------------------------------+
+                                               2.3  -  LOOPS OVERVIEW                                               +
+--------------------------------------------------------------------------------------------------------------------+

  Top 5 loops:
   + exec - 4   :
     analysis: Execution Time: 95 % - Vectorization Ratio: 91.30 % - Vector Length Use: 98.91 %
     Loop Computation Issues: 16
        [16] [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 4
            issues (= instructions) costing 4 points each.
     Data Access Issues: 8
        [8] [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 4 issues ( = data accesses) costing 2 point
            each.
     Vectorization Roadblocks: 8
        [8] [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 4 issues ( = data accesses) costing 2 point
            each.

   + exec - 1   :
     analysis: Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 26.92 %
     Data Access Issues: 16
        [16] [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost.
            There are 4 issues ( = indirect data accesses) costing 4 point each.
     Vectorization Roadblocks: 16
        [16] [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost.
            There are 4 issues ( = indirect data accesses) costing 4 point each.

   + exec - 2   :
     analysis: Execution Time: 0 % - Vectorization Ratio: 4.08 % - Vector Length Use: 33.67 %
     Loop Computation Issues: 2
        [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.
     Control Flow Issues: 1
        [1] [SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 1
            issues (= calls) costing 1 point each.
     Data Access Issues: 24
        [24] [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost.
            There are 6 issues ( = indirect data accesses) costing 4 point each.
     Vectorization Roadblocks: 25
        [1] [SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 1
            issues (= calls) costing 1 point each.
        [24] [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost.
            There are 6 issues ( = indirect data accesses) costing 4 point each.



+====================================================================================================================+
+                                                 3  -  APPLICATION                                                  +
+====================================================================================================================+


+--------------------------------------------------------------------------------------------------------------------+
+                                               3.1  -  Categorization                                               +
+--------------------------------------------------------------------------------------------------------------------+

   Category | IO     | Exe    | System  | Others  | Memory | String | MPI   | TBB   | OMP   | Pthread | Math  |
  ----------+--------+--------+---------+---------+--------+--------+-------+-------+-------+---------+-------+
   Time (%) | 0.00   | 95.63  | 0.12    | 0.00    | 0.00   | 0.00   | 0.00  | 0.00  | 4.24  | 0.00    | 0.00  |




+--------------------------------------------------------------------------------------------------------------------+
+                                          3.2  -  Function Based Profiling                                          +
+--------------------------------------------------------------------------------------------------------------------+

   Buckets                    | Nb Functions              | Coverage                  | Cumulated Coverage        |
  ----------------------------+---------------------------+---------------------------+---------------------------+
   > 8%                       | 1                         | 95.57                     | 95.57                     |
   4% to 8%                   | 1                         | 4.24                      | 99.81                     |
   2% to 4%                   | 0                         | 0.00                      | 99.81                     |
   1% to 2%                   | 0                         | 0.00                      | 99.81                     |
   0.5% to 1%                 | 0                         | 0.00                      | 99.81                     |
   0.25% to 0.5%              | 0                         | 0.00                      | 99.81                     |
   0.125% to 0.25%            | 0                         | 0.00                      | 99.81                     |
   < 0.125%                   | 31                        | 0.19                      | 100.00                    |




+--------------------------------------------------------------------------------------------------------------------+
+                                            3.3  -  Loop Based Profiling                                            +
+--------------------------------------------------------------------------------------------------------------------+

   Buckets                    | Nb Loops                  | Coverage                  | Cumulated Coverage        |
  ----------------------------+---------------------------+---------------------------+---------------------------+
   > 8%                       | 1                         | 95.57                     | 95.57                     |
   4% to 8%                   | 0                         | 0.00                      | 95.57                     |
   2% to 4%                   | 0                         | 0.00                      | 95.57                     |
   1% to 2%                   | 0                         | 0.00                      | 95.57                     |
   0.5% to 1%                 | 0                         | 0.00                      | 95.57                     |
   0.25% to 0.5%              | 0                         | 0.00                      | 95.57                     |
   0.125% to 0.25%            | 0                         | 0.00                      | 95.57                     |
   < 0.125%                   | 2                         | 0.06                      | 95.63                     |


+====================================================================================================================+
+                                                  4  -  FUNCTIONS                                                   +
+====================================================================================================================+


+--------------------------------------------------------------------------------------------------------------------+
+                                              4.1  -  Top 10 Functions                                              +
+--------------------------------------------------------------------------------------------------------------------+

   Function                                               | Module              | Coverage (%)   | Time (s)       |
  --------------------------------------------------------+---------------------+----------------+----------------+
   Step10_orig                                            | exec                | 95.57          | 18.65          |
   omp_get_num_procs                                      | libgomp.so.1.0.0    | 4.24           | 0.83           |
   queued_spin_lock_slowpath                              | kernel              | 0.09           | 0.02           |
   main                                                   | exec                | 0.04           | 0.74           |
   main._omp_fn.1                                         | exec                | 0.02           | 0.01           |
   futex_q_lock                                           | kernel              | 0.01           | 0.01           |
   arch_local_irq_restore                                 | kernel              | 0.01           | 0.11           |
   wake_q_add_safe                                        | kernel              | 0.00           | 0.02           |
   futex_wait_queue                                       | kernel              | 0.00           | 0.00           |
   __memset                                               | libastring.so       | 0.00           | 0.03           |


+====================================================================================================================+
+                                                    5  -  LOOPS                                                     +
+====================================================================================================================+


+--------------------------------------------------------------------------------------------------------------------+
+                                                5.1  -  Top 10 Loops                                                +
+--------------------------------------------------------------------------------------------------------------------+

   Loop Id        | Module              | Source Location                                        | Coverage (%)   |
  ----------------+---------------------+--------------------------------------------------------+----------------+
   4              | exec                | Step10_orig.c:19-31                                    | 95.57          |
   1              | exec                | main.c:114-119                                         | 0.04           |
   2              | exec                | main.c:145-149                                         | 0.02           |





+====================================================================================================================+
+                                                     6  -  CQA                                                      +
+====================================================================================================================+


+--------------------------------------------------------------------------------------------------------------------+
+                                                   6.1  -  Loops                                                    +
+--------------------------------------------------------------------------------------------------------------------+





      6.1.1  -  Loop 4 from exec
  ==========================================================================================================

The loop is defined in /home/eoseret/qaas/qaas_runs/178-643-2345/intel/HACCmk/build/HACCmk/src/Step10_orig.c:19-31.

The related source loop is not unrolled or unrolled with no peel/tail loop.

      6.1.1.1  -  Path 1
  ----------------------------------------------------------------------------------------------------------

8% of peak computational performance is used (2.85 out of 32.00 FLOP per cycle (GFLOPS @ 1GHz))

      6.1.1.1.1  -  Vectorization
  ----------------------------------------------------------------------------------------------------------

Your loop is highly vectorized.
98% of vector register length is used (average across all VPU instructions).


Details
91% of VPU instructions are used in vector version (process two or more data elements in vector registers):
 - 77% of VPU instructions that are not load, store, addition, subtraction nor multiply instructions are used in vector version.





      6.1.1.1.2  -  Expensive FP math instructions/calls
  ----------------------------------------------------------------------------------------------------------

Detected performance impact from expensive FP math instructions/calls.
By removing/reexpressing them, you can lower the cost of an iteration from 42.16 to 10.25 cycles (4.11x speedup).


      6.1.1.1.3  -  FMA
  ----------------------------------------------------------------------------------------------------------

Detected 40 FMA (fused multiply-add) operations.
Presence of both ADD/SUB and MUL operations.

Workaround
Try to change order in which elements are evaluated (using parentheses) in arithmetic expressions containing both ADD/SUB and MUL operations to enable your compiler to generate FMA instructions wherever possible.
For instance a + b*c is a valid FMA (MUL then ADD).
However (a+b)* c cannot be translated into an FMA (ADD then MUL).




      6.1.1.1.4  -  Slow data structures access
  ----------------------------------------------------------------------------------------------------------

Detected data structures (typically arrays) that cannot be efficiently read/written

Details
 - Constant unknown stride: 4 occurrence(s)
Non-unit stride (uncontiguous) accesses are not efficiently using data caches


Workaround
 - Try to reorganize arrays of structures to structures of arrays
 - Consider to permute loops (see vectorization gain report)



      6.1.1.1.5  -  Conversion instructions
  ----------------------------------------------------------------------------------------------------------

Detected expensive conversion instructions.

Details
 - FCVT: 6 occurrences<<list_path_1_cvt_1>>


Workaround
Avoid mixing data with different types. In particular, check if the type of constants is the same as array elements.


      6.1.1.1.6  -  Matching between your loop (in the source code) and the binary loop
  ----------------------------------------------------------------------------------------------------------

The binary loop is composed of 120 FP arithmetical operations:
 - 60: addition or subtraction (40 inside FMA instructions)
 - 52: multiply (40 inside FMA instructions)
 - 4: divide
 - 4: square root
The binary loop is loading 64 bytes.


      6.1.1.1.7  -  Arithmetic intensity
  ----------------------------------------------------------------------------------------------------------

Arithmetic intensity is 1.87 FP operations per loaded or stored byte.







      6.1.2  -  Loop 1 from exec
  ==========================================================================================================

The loop is defined in /home/eoseret/qaas/qaas_runs/178-643-2345/intel/HACCmk/build/HACCmk/src/main.c:114-119.

The related source loop is not unrolled or unrolled with no peel/tail loop.

      6.1.2.1  -  Path 1
  ----------------------------------------------------------------------------------------------------------

7% of peak computational performance is used (2.50 out of 32.00 FLOP per cycle (GFLOPS @ 1GHz))

      6.1.2.1.1  -  Vectorization
  ----------------------------------------------------------------------------------------------------------

Your loop is not vectorized.
Only 26% of vector register length is used (average across all VPU instructions).
By vectorizing your loop, you can lower the cost of an iteration from 8.00 to 2.13 cycles (3.76x speedup).

Details
All VPU instructions are used in scalar version (process only one data element in vector registers).
Since your execution units are vector units, only a vectorized loop can use their full power.


Workaround
 - Try another compiler or update/tune your current one
 - Remove inter-iterations dependences from your loop and make it unit-stride:
  * If your arrays have 2 or more dimensions, check whether elements are accessed contiguously and, otherwise, try to permute loops accordingly:
C storage order is row-major: for(i) for(j) a[j][i] = b[j][i]; (slow, non stride 1) => for(i) for(j) a[i][j] = b[i][j]; (fast, stride 1)<<image_row_maj>>
  * If your loop streams arrays of structures (AoS), try to use structures of arrays instead (SoA):
for(i) a[i].x = b[i].x; (slow, non stride 1) => for(i) a.x[i] = b.x[i]; (fast, stride 1)





      6.1.2.1.2  -  FMA
  ----------------------------------------------------------------------------------------------------------

Detected 4 FMA (fused multiply-add) operations.




      6.1.2.1.3  -  Slow data structures access
  ----------------------------------------------------------------------------------------------------------

Detected data structures (typically arrays) that cannot be efficiently read/written

Details
 - Irregular (variable stride) or indirect: 4 occurrence(s)
Non-unit stride (uncontiguous) accesses are not efficiently using data caches


Workaround
Try to remove indirect accesses. If applicable, precompute elements out of the innermost loop.


      6.1.2.1.4  -  Conversion instructions
  ----------------------------------------------------------------------------------------------------------

Detected expensive conversion instructions.

Details
 - SCVTF: 4 occurrences<<list_path_1_cvt_1>>


Workaround
Avoid mixing data with different types. In particular, check if the type of constants is the same as array elements.


      6.1.2.1.5  -  Matching between your loop (in the source code) and the binary loop
  ----------------------------------------------------------------------------------------------------------

The binary loop is composed of 20 FP arithmetical operations:
 - 16: addition or subtraction (4 inside FMA instructions)
 - 4: multiply (all inside FMA instructions)
The binary loop is storing 48 bytes.


      6.1.2.1.6  -  Arithmetic intensity
  ----------------------------------------------------------------------------------------------------------

Arithmetic intensity is 0.42 FP operations per loaded or stored byte.







      6.1.3  -  Loop 2 from exec
  ==========================================================================================================

The loop is defined in /home/eoseret/qaas/qaas_runs/178-643-2345/intel/HACCmk/build/HACCmk/src/main.c:145-149.

The related source loop is not unrolled or unrolled with no peel/tail loop.

      6.1.3.1  -  Path 1
  ----------------------------------------------------------------------------------------------------------

Warnings:
Detected a function call instruction: ignoring called function instructions.
Rerun with --follow-calls=append to include them to analysis  or with --follow-calls=inline to simulate inlining.
4% of peak computational performance is used (1.38 out of 32.00 FLOP per cycle (GFLOPS @ 1GHz))

      6.1.3.1.1  -  Code clean check
  ----------------------------------------------------------------------------------------------------------

Detected a slowdown caused by scalar integer instructions (typically used for address computation).
By removing them, you can lower the cost of an iteration from 8.67 to 7.33 cycles (1.18x speedup).

Workaround
 - Try to reorganize arrays of structures to structures of arrays
 - Consider to permute loops (see vectorization gain report)



      6.1.3.1.2  -  Vectorization
  ----------------------------------------------------------------------------------------------------------

Your loop is not vectorized.
Only 33% of vector register length is used (average across all VPU instructions).
By fully vectorizing your loop, you can lower the cost of an iteration from 8.67 to 2.50 cycles (3.47x speedup).

Details
4% of VPU instructions are used in vector version (process two or more data elements in vector registers):
 - 10% of VPU loads are used in vector version.
 - 0% of VPU stores are used in vector version.
 - 0% of VPU addition or subtraction instructions are used in vector version.
 - 0% of VPU fused multiply-add instructions are used in vector version.
 - 0% of VPU instructions that are not load, store, addition, subtraction nor multiply instructions are used in vector version.
Since your execution units are vector units, only a fully vectorized loop can use their full power.


Workaround
 - Try another compiler or update/tune your current one
 - Remove inter-iterations dependences from your loop and make it unit-stride:
  * If your arrays have 2 or more dimensions, check whether elements are accessed contiguously and, otherwise, try to permute loops accordingly:
C storage order is row-major: for(i) for(j) a[j][i] = b[j][i]; (slow, non stride 1) => for(i) for(j) a[i][j] = b[i][j]; (fast, stride 1)<<image_row_maj>>
  * If your loop streams arrays of structures (AoS), try to use structures of arrays instead (SoA):
for(i) a[i].x = b[i].x; (slow, non stride 1) => for(i) a.x[i] = b.x[i]; (fast, stride 1)





      6.1.3.1.3  -  FMA
  ----------------------------------------------------------------------------------------------------------

Detected 6 FMA (fused multiply-add) operations.




      6.1.3.1.4  -  CALL instructions
  ----------------------------------------------------------------------------------------------------------

Detected function call instructions.


Details
Calling (and then returning from) a function prevents many compiler optimizations (like vectorization), breaks control flow (which reduces pipeline performance) and executes extra instructions to save/restore the registers used inside it, which is very expensive (dozens of cycles). Consider to inline small functions.
 - Step10_orig: 2 occurrences<<list_path_1_call_1>>



      6.1.3.1.5  -  Slow data structures access
  ----------------------------------------------------------------------------------------------------------

Detected data structures (typically arrays) that cannot be efficiently read/written

Details
 - Irregular (variable stride) or indirect: 6 occurrence(s)
Non-unit stride (uncontiguous) accesses are not efficiently using data caches


Workaround
Try to remove indirect accesses. If applicable, precompute elements out of the innermost loop.


      6.1.3.1.6  -  Matching between your loop (in the source code) and the binary loop
  ----------------------------------------------------------------------------------------------------------

The binary loop is composed of 12 FP arithmetical operations:
 - 6: addition or subtraction (all inside FMA instructions)
 - 6: multiply (all inside FMA instructions)
The binary loop is loading 48 bytes.
The binary loop is storing 18 bytes.


      6.1.3.1.7  -  Arithmetic intensity
  ----------------------------------------------------------------------------------------------------------

Arithmetic intensity is 0.18 FP operations per loaded or stored byte.





[MAQAO] Info: STOP THE REPORT GENERATION
[MAQAO] Info: 
[MAQAO] Info: If your application produces files, they can be found in directory "/home/eoseret/qaas/qaas_runs/178-643-2345/intel/HACCmk/run/oneview_runs/compilers/gcc_1/oneview_run_1786433536"
[MAQAO] Info: 
