	*************************************************
	*                                               *
	*          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-550-2839/intel/TeaLeaf/run/oneview_runs/defaults/gcc/oneview_results_1785504397 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-550-2839/intel/TeaLeaf/run/oneview_runs/defaults/gcc/oneview_results_1785504397


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


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

  Application:			/home/eoseret/qaas/qaas_runs/178-550-2839/intel/TeaLeaf/run/base_runs/defaults/gcc/exec
  Timestamp:			2026-07-31 13:26:37
  Universal Timestamp:		1785504397
  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 C++17 14.2.1 20250110 (Red Hat 14.2.1-7) -mlittle-endian -mabi=lp64 -mcpu=neoverse-v2+crc+sve2-aes+sve2-sha3+nossbs -g -O3 -std=c++17 -fno-omit-frame-pointer -fopenmp 
  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:				157.41 s
  Max (Thread Active Time):		156.96 s
  Average Active Time:			155.90 s
  Activity Ratio:			99.1 %
  Average number of active threads:	95.076
  Affinity Stability:			99.9 %
  Time spent in analyzed loops:		93.4 %
  Time spent in analyzed innermost loops: 93.4 %
  Time spent in user code:		93.6 %
  Compilation Options Score:		75
  Array Access Efficiency:		75.0 %

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




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

  If No Scalar Integer:
      Number of loops   | 1      | 2      | 4      | 5      | 7      | 
      Cumulated Speedup | 1.0000 | 1.0000 | 1.0000 | 1.0000 | 1.0000 | 
  Top 5 loops:
    exec - 27:	1
    exec - 18:	1
    exec - 90:	1
    exec - 86:	1
    exec - 22:	1

  If FP Vectorized:
      Number of loops   | 1      | 2      | 4      | 5      | 7      | 
      Cumulated Speedup | 1.0268 | 1.0406 | 1.0407 | 1.0407 | 1.0407 | 
  Top 5 loops:
    exec - 27:	1.0268
    exec - 22:	1.0406
    exec - 24:	1.0407
    exec - 90:	1.0407
    exec - 31:	1.0407

  If Fully Vectorized:
      Number of loops   | 1      | 2      | 4      | 5      | 7      | 
      Cumulated Speedup | 1.0268 | 1.0406 | 1.0408 | 1.0409 | 1.0409 | 
  Top 5 loops:
    exec - 27:	1.0268
    exec - 22:	1.0406
    exec - 86:	1.0407
    exec - 18:	1.0408
    exec - 90:	1.0409

  If Only FP Arithmetic:
      Number of loops   | 1      | 2      | 4      | 5      | 7      | 
      Cumulated Speedup | 1.0244 | 1.0245 | 1.0246 | 1.0246 | 1.0246 | 
  Top 5 loops:
    exec - 31:	1.0244
    exec - 90:	1.0245
    exec - 18:	1.0246
    exec - 27:	1.0246
    exec - 86:	1.0246



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


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

  [4 / 4] Application profile is long enough (156.96 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 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] Host configuration allows retrieval of all necessary metrics.


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


  [3 / 3] Optimization level option is correctly used


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


  [0 / 0] Fastmath not used
Consider to add ffast-math to compilation flags (or replace -O3 with -Ofast) to unlock potential extra speedup by
relaxing floating-point computation consistency. Warning: floating-point accuracy may be reduced and the compliance
to IEEE/ISO rules/specifications for math functions will be relaxed, typically 'errno' will no longer be set after
calling some math functions.


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

  [4 / 4] Enough time of the experiment time spent in analyzed loops (93.44%)
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 99.04% of observed threads are actually active 

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

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

  [4 / 4] Enough time of the experiment time spent in analyzed innermost loops (93.44%)
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.90%)
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 (1.95%)

  [3 / 3] Cumulative Outermost/In between loops coverage (0.00%) lower than cumulative innermost loop coverage (93.44%)
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 - 27  :
     analysis: Execution Time: 39 % - Vectorization Ratio: 75.00 % - Vector Length Use: 87.50 %
     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 - 22  :
     analysis: Execution Time: 37 % - Vectorization Ratio: 88.46 % - Vector Length Use: 94.23 %
     Data Access Issues: 20
        [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.
     Vectorization Roadblocks: 20
        [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.

   + exec - 31  :
     analysis: Execution Time: 16 % - Vectorization Ratio: 100.00 % - Vector Length Use: 100.00 %
     Data Access Issues: 4
        [4] [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 2 issues ( = data accesses) costing 2
            point each.
     Vectorization Roadblocks: 4
        [4] [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 2 issues ( = data accesses) costing 2
            point each.

   + exec - 86  :
     analysis: Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 50.00 %
     Data Access Issues: 4
        [4] [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 2 issues ( = data accesses) costing 2
            point each.
     Vectorization Roadblocks: 4
        [4] [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 2 issues ( = data accesses) costing 2
            point each.

   + exec - 18  :
     analysis: Execution Time: 0 % - Vectorization Ratio: 0.00 % - Vector Length Use: 50.00 %
     Data Access Issues: 24
        [24] [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 12 issues ( = data accesses) costing 2
            point each.
     Vectorization Roadblocks: 24
        [24] [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 12 issues ( = data accesses) costing 2
            point each.



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


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

   Category | IO     | Exe    | System  | Others | Memory | String | MPI   | TBB   | OMP   | Pthread | Math  |
  ----------+--------+--------+---------+--------+--------+--------+-------+-------+-------+---------+-------+
   Time (%) | 0.00   | 93.57  | 0.09    | 0.00   | 0.00   | 0.00   | 0.00  | 0.00  | 6.34  | 0.00    | 0.00  |




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

   Buckets                   | Nb Functions              | Coverage                  | Cumulated Coverage        |
  ---------------------------+---------------------------+---------------------------+---------------------------+
   > 8%                      | 3                         | 93.45                     | 93.45                     |
   4% to 8%                  | 1                         | 6.28                      | 99.73                     |
   2% to 4%                  | 0                         | 0.00                      | 99.73                     |
   1% to 2%                  | 0                         | 0.00                      | 99.73                     |
   0.5% to 1%                | 0                         | 0.00                      | 99.73                     |
   0.25% to 0.5%             | 0                         | 0.00                      | 99.73                     |
   0.125% to 0.25%           | 0                         | 0.00                      | 99.73                     |
   < 0.125%                  | 40                        | 0.19                      | 99.92                     |




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

   Buckets                   | Nb Loops                  | Coverage                  | Cumulated Coverage        |
  ---------------------------+---------------------------+---------------------------+---------------------------+
   > 8%                      | 3                         | 93.36                     | 93.36                     |
   4% to 8%                  | 0                         | 0.00                      | 93.36                     |
   2% to 4%                  | 0                         | 0.00                      | 93.36                     |
   1% to 2%                  | 0                         | 0.00                      | 93.36                     |
   0.5% to 1%                | 0                         | 0.00                      | 93.36                     |
   0.25% to 0.5%             | 0                         | 0.00                      | 93.36                     |
   0.125% to 0.25%           | 0                         | 0.00                      | 93.36                     |
   < 0.125%                  | 15                        | 0.08                      | 93.44                     |


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


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

   Function                                               | Module               | Coverage (%)  | Time (s)      |
  --------------------------------------------------------+----------------------+---------------+---------------+
   cg_calc_ur(int, int, int, double, double*, double*,... | exec                 | 39.18         | 61.08         |
   cg_calc_w(int, int, int, double*, double const*, do... | exec                 | 37.57         | 58.58         |
   cg_calc_p(int, int, int, double, double*, double co... | exec                 | 16.70         | 26.03         |
   omp_get_num_procs                                      | libgomp.so.1.0.0     | 6.28          | 9.79          |
   omp_fulfill_event                                      | libgomp.so.1.0.0     | 0.03          | 0.05          |
   update_left(int, int, int, int, double*, bool) [clo... | exec                 | 0.02          | 0.04          |
   omp_get_num_threads                                    | libgomp.so.1.0.0     | 0.02          | 0.04          |
   down_read_trylock                                      | kernel               | 0.02          | 0.03          |
   update_right(int, int, int, int, double*, bool) [cl... | exec                 | 0.02          | 0.03          |
   cg_init(int, int, int, int, double, double, double*... | exec                 | 0.01          | 0.03          |


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


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

   Loop Id        | Module               | Source Location                                       | Coverage (%)  |
  ----------------+----------------------+-------------------------------------------------------+---------------+
   27             | exec                 | cg.cpp:108-113                                        | 39.13         |
   22             | exec                 | cg.cpp:86-90                                          | 37.54         |
   31             | exec                 | cg.cpp:128-131                                        | 16.68         |
   86             | exec                 | local_halos.cpp:13-15                                 | 0.02          |
   18             | exec                 | cg.cpp:62-68                                          | 0.01          |
   90             | exec                 | local_halos.cpp:28-30                                 | 0.01          |
   24             | exec                 | cg.cpp:105-105                                        | 0.01          |
   143            | exec                 | solver_methods.cpp:69-72                              | 0.01          |
   95             | exec                 | local_halos.cpp:46-46                                 | 0.00          |
   4              | exec                 | cg.cpp:47-50                                          | 0.00          |





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


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





      6.1.1  -  Loop 27 from exec
  =========================================================================================================

The loop is defined in /home/eoseret/qaas/qaas_runs/178-550-2839/intel/TeaLeaf/build/TeaLeaf/src/omp/cg.cpp:108-113.

The related source loop is multi-versionned.

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

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

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

Your loop is partially vectorized.
87% 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 4.00 to 3.73 cycles (1.07x speedup).

Details
75% of VPU instructions are used in vector version (process two or more data elements in vector registers):
 - 0% of VPU addition or subtraction 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:
  * recompile with fassociative-math (included in Ofast or ffast-math) to extend loop vectorization to FP reductions.
 - 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.1.1.2  -  FMA
  ---------------------------------------------------------------------------------------------------------

Detected 4 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.3  -  Slow data structures access
  ---------------------------------------------------------------------------------------------------------

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

Details
 - Constant non-unit 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.4  -  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 (4 inside FMA instructions)
 - 6: multiply (4 inside FMA instructions)
The binary loop does not load or store any data.







      6.1.2  -  Loop 22 from exec
  =========================================================================================================

The loop is defined in /home/eoseret/qaas/qaas_runs/178-550-2839/intel/TeaLeaf/build/TeaLeaf/src/omp/cg.cpp:86-90.

The related source loop is unrolled by 3 (including vectorization).

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

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

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

Your loop is partially vectorized.
94% 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 4.00 to 3.86 cycles (1.04x speedup).

Details
88% of VPU instructions are used in vector version (process two or more data elements in vector registers):
 - 71% of VPU addition or subtraction instructions are used in vector version.
 - 50% 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.





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

Detected 6 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.2.1.3  -  Slow data structures access
  ---------------------------------------------------------------------------------------------------------

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

Details
 - Constant non-unit stride: 10 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.2.1.4  -  Matching between your loop (in the source code) and the binary loop
  ---------------------------------------------------------------------------------------------------------

The binary loop is composed of 30 FP arithmetical operations:
 - 18: addition or subtraction (6 inside FMA instructions)
 - 12: multiply (6 inside FMA instructions)
The binary loop does not load or store any data.







      6.1.3  -  Loop 31 from exec
  =========================================================================================================

The loop is defined in /home/eoseret/qaas/qaas_runs/178-550-2839/intel/TeaLeaf/build/TeaLeaf/src/omp/cg.cpp:128-131.

The related source loop is unrolled by 2 (including vectorization).

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

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

      6.1.3.1.1  -  Vectorization
  ---------------------------------------------------------------------------------------------------------

Your loop is fully vectorized, using full register length.


Details
All VPU instructions are used in vector version (process two or more data elements in vector registers).





      6.1.3.1.2  -  FMA
  ---------------------------------------------------------------------------------------------------------

Detected 2 FMA (fused multiply-add) operations.




      6.1.3.1.3  -  Slow data structures access
  ---------------------------------------------------------------------------------------------------------

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

Details
 - Constant non-unit stride: 2 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.3.1.4  -  Matching between your loop (in the source code) and the binary loop
  ---------------------------------------------------------------------------------------------------------

The binary loop is composed of 4 FP arithmetical operations:
 - 2: addition or subtraction (all inside FMA instructions)
 - 2: multiply (all inside FMA instructions)
The binary loop does not load or store any data.







      6.1.4  -  Loop 86 from exec
  =========================================================================================================

The loop is defined in /home/eoseret/qaas/qaas_runs/178-550-2839/intel/TeaLeaf/build/TeaLeaf/src/omp/local_halos.cpp:13-15.

The related source loop is multi-versionned.

      6.1.4.1  -  Path 1
  ---------------------------------------------------------------------------------------------------------

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

      6.1.4.1.1  -  Vectorization
  ---------------------------------------------------------------------------------------------------------

Your loop is not vectorized.
2 data elements could be processed at once in vector registers.
By vectorizing your loop, you can lower the cost of an iteration from 1.00 to 0.50 cycles (2.00x 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:
  * recompile with fassociative-math (included in Ofast or ffast-math) to extend loop vectorization to FP reductions.
 - 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)




No data for this section



      6.1.4.1.2  -  Slow data structures access
  ---------------------------------------------------------------------------------------------------------

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

Details
 - Constant unknown stride: 1 occurrence(s)
 - Constant non-unit stride: 1 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.4.1.3  -  Matching between your loop (in the source code) and the binary loop
  ---------------------------------------------------------------------------------------------------------

The binary loop does not contain any FP arithmetical operations.
The binary loop does not load or store any data.


      6.1.4.1.4  -  Unroll opportunity
  ---------------------------------------------------------------------------------------------------------

Loop body is too small to efficiently use resources.

Workaround
Unroll your loop if trip count is significantly higher than target unroll factor. This can be done manually. Or by recompiling with -funroll-loops and/or -floop-unroll-and-jam. Or with the unroll (resp. unroll_and_jam) directive on top of the inner (resp. surrounding) loop. You can enforce an unroll factor: #pragma GCC unroll N







      6.1.5  -  Loop 18 from exec
  =========================================================================================================

The loop is defined in /home/eoseret/qaas/qaas_runs/178-550-2839/intel/TeaLeaf/build/TeaLeaf/src/omp/cg.cpp:62-68.

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

      6.1.5.1  -  Path 1
  ---------------------------------------------------------------------------------------------------------

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

      6.1.5.1.1  -  Vectorization
  ---------------------------------------------------------------------------------------------------------

Your loop is not vectorized.
2 data elements could be processed at once in vector registers.
By vectorizing your loop, you can lower the cost of an iteration from 4.50 to 2.25 cycles (2.00x 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:
  * recompile with fassociative-math (included in Ofast or ffast-math) to extend loop vectorization to FP reductions.
 - 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.5.1.2  -  FMA
  ---------------------------------------------------------------------------------------------------------

Detected 4 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.5.1.3  -  Slow data structures access
  ---------------------------------------------------------------------------------------------------------

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

Details
 - Constant non-unit stride: 12 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.5.1.4  -  Matching between your loop (in the source code) and the binary loop
  ---------------------------------------------------------------------------------------------------------

The binary loop is composed of 16 FP arithmetical operations:
 - 10: addition or subtraction (4 inside FMA instructions)
 - 6: multiply (4 inside FMA instructions)
The binary loop does not load or store any data.







      6.1.6  -  Loop 90 from exec
  =========================================================================================================

The loop is defined in /home/eoseret/qaas/qaas_runs/178-550-2839/intel/TeaLeaf/build/TeaLeaf/src/omp/local_halos.cpp:28-30.

The related source loop is multi-versionned.

      6.1.6.1  -  Path 1
  ---------------------------------------------------------------------------------------------------------

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

      6.1.6.1.1  -  Vectorization
  ---------------------------------------------------------------------------------------------------------

Your loop is not vectorized.
2 data elements could be processed at once in vector registers.
By vectorizing your loop, you can lower the cost of an iteration from 0.83 to 0.42 cycles (2.00x 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:
  * recompile with fassociative-math (included in Ofast or ffast-math) to extend loop vectorization to FP reductions.
 - 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)




No data for this section



      6.1.6.1.2  -  Slow data structures access
  ---------------------------------------------------------------------------------------------------------

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

Details
 - Constant unknown stride: 1 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.6.1.3  -  Matching between your loop (in the source code) and the binary loop
  ---------------------------------------------------------------------------------------------------------

The binary loop does not contain any FP arithmetical operations.
The binary loop does not load or store any data.


      6.1.6.1.4  -  Unroll opportunity
  ---------------------------------------------------------------------------------------------------------

Loop body is too small to efficiently use resources.

Workaround
Unroll your loop if trip count is significantly higher than target unroll factor. This can be done manually. Or by recompiling with -funroll-loops and/or -floop-unroll-and-jam. Or with the unroll (resp. unroll_and_jam) directive on top of the inner (resp. surrounding) loop. You can enforce an unroll factor: #pragma GCC unroll N







      6.1.7  -  Loop 24 from exec
  =========================================================================================================

The loop is defined in /home/eoseret/qaas/qaas_runs/178-550-2839/intel/TeaLeaf/build/TeaLeaf/src/omp/cg.cpp:105.

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

      6.1.7.1  -  Path 1
  ---------------------------------------------------------------------------------------------------------

Warnings:
The number of fused uops of the instruction [CAS	X1, X2, [X19]] is unknown
1% of peak computational performance is used (0.50 out of 32.00 FLOP per cycle (GFLOPS @ 1GHz))

      6.1.7.1.1  -  Vectorization
  ---------------------------------------------------------------------------------------------------------

Your loop is not vectorized.
2 data elements could be processed at once in vector registers.
By vectorizing your loop, you can lower the cost of an iteration from 2.00 to 1.00 cycles (2.00x 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:
  * recompile with fassociative-math (included in Ofast or ffast-math) to extend loop vectorization to FP reductions.
 - 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)




No data for this section



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

The binary loop is composed of 1 FP arithmetical operations:
 - 1: addition or subtraction
The binary loop is loading 8 bytes.
The binary loop is storing 8 bytes.


      6.1.7.1.3  -  Arithmetic intensity
  ---------------------------------------------------------------------------------------------------------

Arithmetic intensity is 0.06 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-550-2839/intel/TeaLeaf/run/oneview_runs/defaults/gcc/oneview_run_1785504397"
[MAQAO] Info: 
