OV - attention-avx512 - Loop 61

0x4ef0 LEA	-0x1(%RBX),%R15D

0x4ef4 VMOVSS	(%R14,%R15,4),%XMM1    [1]

0x4efa VCVTSS2SD	%XMM1,%XMM1,%XMM1

0x4efe MOV	%R11D,%R15D

0x4f01 MOV	0xe0(%RSP),%RDX    [2]

0x4f09 VMOVSS	(%RDX,%R15,4),%XMM2    [4]

0x4f0f VCVTSS2SD	%XMM2,%XMM2,%XMM2

0x4f13 VFMADD213SD	%XMM0,%XMM1,%XMM2

0x4f18 MOV	%EBX,%R15D

0x4f1b VMOVSS	(%R14,%R15,4),%XMM0    [1]

0x4f21 VCVTSS2SD	%XMM0,%XMM0,%XMM1

0x4f25 LEA	(%R13,%R11,1),%R15D

0x4f2a MOV	0xe0(%RSP),%RDX    [2]

0x4f32 VMOVSS	(%RDX,%R15,4),%XMM0    [3]

0x4f38 MOV	0xe0(%RSP),%R15    [2]

0x4f40 VCVTSS2SD	%XMM0,%XMM0,%XMM0

0x4f44 VFMADD213SD	%XMM2,%XMM1,%XMM0

0x4f49 ADD	$0x2,%R10

0x4f4d ADD	$0x2,%EBX

0x4f50 ADD	%RCX,%R11

0x4f53 CMP	%R10,%RAX

0x4f56 JNE	4ef0

/home/eoseret/Applications/llm-attention/attention.cpp: 30 - 31

--------------------------------------------------------------------------------

30:          for (unsigned int k = 0; k < K; ++k) { //vectorized

31:             sum += (double)A[i * K + k] * (double)B[k * N + j];

Coverage (%)	Name	Module
►100.00+	__libc_init_first	libc.so.6
○	__libc_start_main	libc.so.6
○	_start	attention-avx512

min	med	avg	max

Percentile Index	10	20	30	40	50	60	70	80	90	100
Value

min	med	avg	max

Percentile Index	10	20	30	40	50	60	70	80	90	100
Value

Path /

Metric	Value
CQA speedup if no scalar integer	1.00
CQA speedup if FP arith vectorized	2.00
CQA speedup if fully vectorized	14.67
CQA speedup if no inter-iteration dependency	NA
CQA speedup if next bottleneck killed	1.28
Bottlenecks
Function	main
Source	attention.cpp:30-31
Source loop unroll info	multi-versionned
Source loop unroll confidence level	NA
Unroll/vectorization loop type	NA
Unroll factor	NA
CQA cycles	8.00
CQA cycles if no scalar integer	8.00
CQA cycles if FP arith vectorized	4.00
CQA cycles if fully vectorized	0.55
Front-end cycles	6.25
P0 cycles	4.00
P1 cycles	4.00
P2 cycles	3.50
P3 cycles	3.50
P4 cycles	0.00
P5 cycles	4.00
P6 cycles	4.00
P7 cycles	0.00
DIV/SQRT cycles	0.00
Inter-iter dependencies cycles	8
FE+BE cycles (UFS)	NA
Stall cycles (UFS)	NA
Nb insns	22.00
Nb uops	25.00
Nb loads	7.00
Nb stores	0.00
Nb stack references	1.00
FLOP/cycle	0.50
Nb FLOP add-sub	0.00
Nb FLOP mul	0.00
Nb FLOP fma	2.00
Nb FLOP div	0.00
Nb FLOP rcp	0.00
Nb FLOP sqrt	0.00
Nb FLOP rsqrt	0.00
Bytes/cycle	5.00
Bytes prefetched	0.00
Bytes loaded	40.00
Bytes stored	0.00
Stride 0	1.00
Stride 1	0.00
Stride n	0.00
Stride unknown	3.00
Stride indirect	0.00
Vectorization ratio all	0.00
Vectorization ratio load	0.00
Vectorization ratio store	NA
Vectorization ratio mul	NA
Vectorization ratio add_sub	NA
Vectorization ratio fma	0.00
Vectorization ratio div_sqrt	NA
Vectorization ratio other	0.00
Vector-efficiency ratio all	7.50
Vector-efficiency ratio load	6.25
Vector-efficiency ratio store	NA
Vector-efficiency ratio mul	NA
Vector-efficiency ratio add_sub	NA
Vector-efficiency ratio fma	12.50
Vector-efficiency ratio div_sqrt	NA
Vector-efficiency ratio other	6.25

Metric	Value
CQA speedup if no scalar integer	1.00
CQA speedup if FP arith vectorized	2.00
CQA speedup if fully vectorized	14.67
CQA speedup if no inter-iteration dependency	NA
CQA speedup if next bottleneck killed	1.28
Bottlenecks
Function	main
Source	attention.cpp:30-31
Source loop unroll info	multi-versionned
Source loop unroll confidence level	NA
Unroll/vectorization loop type	NA
Unroll factor	NA
CQA cycles	8.00
CQA cycles if no scalar integer	8.00
CQA cycles if FP arith vectorized	4.00
CQA cycles if fully vectorized	0.55
Front-end cycles	6.25
P0 cycles	4.00
P1 cycles	4.00
P2 cycles	3.50
P3 cycles	3.50
P4 cycles	0.00
P5 cycles	4.00
P6 cycles	4.00
P7 cycles	0.00
DIV/SQRT cycles	0.00
Inter-iter dependencies cycles	8
FE+BE cycles (UFS)	NA
Stall cycles (UFS)	NA
Nb insns	22.00
Nb uops	25.00
Nb loads	7.00
Nb stores	0.00
Nb stack references	1.00
FLOP/cycle	0.50
Nb FLOP add-sub	0.00
Nb FLOP mul	0.00
Nb FLOP fma	2.00
Nb FLOP div	0.00
Nb FLOP rcp	0.00
Nb FLOP sqrt	0.00
Nb FLOP rsqrt	0.00
Bytes/cycle	5.00
Bytes prefetched	0.00
Bytes loaded	40.00
Bytes stored	0.00
Stride 0	1.00
Stride 1	0.00
Stride n	0.00
Stride unknown	3.00
Stride indirect	0.00
Vectorization ratio all	0.00
Vectorization ratio load	0.00
Vectorization ratio store	NA
Vectorization ratio mul	NA
Vectorization ratio add_sub	NA
Vectorization ratio fma	0.00
Vectorization ratio div_sqrt	NA
Vectorization ratio other	0.00
Vector-efficiency ratio all	7.50
Vector-efficiency ratio load	6.25
Vector-efficiency ratio store	NA
Vector-efficiency ratio mul	NA
Vector-efficiency ratio add_sub	NA
Vector-efficiency ratio fma	12.50
Vector-efficiency ratio div_sqrt	NA
Vector-efficiency ratio other	6.25

Path /

Average path: Display a virtual path defined by average values of all real paths

Function	main
Source file and lines	attention.cpp:30-31
Module	attention-avx512

The loop is defined in /home/eoseret/Applications/llm-attention/attention.cpp:30-31.

The related source loop is multi-versionned.

gain
potential
hint
expert

Vectorization

Your loop is not vectorized. Only 7% of vector register length is used (average across all SSE/AVX instructions). By vectorizing your loop, you can lower the cost of an iteration from 8.00 to 0.55 cycles (14.67x speedup).

Details

All SSE/AVX 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 ffast-math (included in Ofast) 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)
- 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)

Execution units bottlenecks

Found no such bottlenecks but see expert reports for more complex bottlenecks.

FMA

Detected 2 FMA (fused multiply-add) operations.

Complex instructions

Detected COMPLEX INSTRUCTIONS.

Details

These instructions generate more than one micro-operation and only one of them can be decoded during a cycle and the extra micro-operations increase pressure on execution units.

VCVTSS2SD: 4 occurrences►
- /home/eoseret/Applications/llm-attention/attention.cpp:31
- /home/eoseret/Applications/llm-attention/attention.cpp:31
- /home/eoseret/Applications/llm-attention/attention.cpp:31
- /home/eoseret/Applications/llm-attention/attention.cpp:31

Slow data structures access

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

Details

Constant unknown stride: 3 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)

Conversion instructions

Detected expensive conversion instructions.

Details

VCVTSS2SD (FP32 to FP64, scalar): 4 occurrences►
- /home/eoseret/Applications/llm-attention/attention.cpp:31
- /home/eoseret/Applications/llm-attention/attention.cpp:31
- /home/eoseret/Applications/llm-attention/attention.cpp:31
- /home/eoseret/Applications/llm-attention/attention.cpp:31

Workaround

Avoid mixing data with different types. In particular, check if the type of constants is the same as array elements. Use double instead of single precision only when/where needed by numerical stability and avoid mixing precision. In C/C++, FP constants are double precision by default and must be suffixed by 'f' to make them single precision.

Type of elements and instruction set

2 SSE or AVX instructions are processing arithmetic or math operations on double precision FP elements in scalar mode (one at a time).

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 is loading 40 bytes (5 double precision FP elements).

Arithmetic intensity

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

Unroll opportunity

Loop is potentially data access bound.

Workaround

Unroll your loop if trip count is significantly higher than target unroll factor and if some data references are common to consecutive iterations. This can be done manually. Or with the unroll (resp. unroll_and_jam) directive on top of the inner (resp. surrounding) loop. You can enforce an unroll factor: #pragma unroll_and_jam N, unroll_and_jam(N), unroll N or unroll(N)

General properties

nb instructions	22
nb uops	25
loop length	104
used x86 registers	10
used mmx registers	0
used xmm registers	3
used ymm registers	0
used zmm registers	0
nb stack references	1

Front-end

ASSUMED MACRO FUSION FIT IN UOP CACHE

micro-operation queue	6.25 cycles
front end	6.25 cycles

Back-end

	P0	P1	P2	P3	P4	P5	P6	P7
uops	4.00	4.00	3.50	3.50	0.00	4.00	4.00	0.00
cycles	4.00	4.00	3.50	3.50	0.00	4.00	4.00	0.00

Execution ports to units layout:

P0 (256 bits): VPU, BRU, ALU, DIV/SQRT
P1 (256 bits): ALU, VPU
P2 (512 bits): store address, load
P3 (512 bits): store address, load
P4 (512 bits): store data
P5 (512 bits): ALU, VPU
P6: ALU, BRU
P7: store address

Cycles executing div or sqrt instructions	NA
Longest recurrence chain latency (RecMII)	8.00

Cycles summary

Front-end	6.25
Dispatch	4.00
Data deps.	8.00
Overall L1	8.00

Vectorization ratios

all	0%
load	0%
store	NA (no store vectorizable/vectorized instructions)
mul	NA (no mul vectorizable/vectorized instructions)
add-sub	NA (no add-sub vectorizable/vectorized instructions)
fma	0%
div/sqrt	NA (no div/sqrt vectorizable/vectorized instructions)
other	0%

Vector efficiency ratios

all	7%
load	6%
store	NA (no store vectorizable/vectorized instructions)
mul	NA (no mul vectorizable/vectorized instructions)
add-sub	NA (no add-sub vectorizable/vectorized instructions)
fma	12%
div/sqrt	NA (no div/sqrt vectorizable/vectorized instructions)
other	6%

Cycles and memory resources usage

Assuming all data fit into the L1 cache, each iteration of the binary loop takes 8.00 cycles. At this rate:

3% of peak load performance is reached (5.00 out of 128.00 bytes loaded per cycle (GB/s @ 1GHz))

Front-end bottlenecks

Found no such bottlenecks.

ASM code

In the binary file, the address of the loop is: 4ef0

Instruction	Nb FU	P0	P1	P2	P3	P5	P6	Latency	Recip. throughput	Vectorization
LEA -0x1(%RBX),%R15D	1	0	0.50	0	0	0.50	0	1	0.50	N/A
VMOVSS (%R14,%R15,4),%XMM1	1	0	0	0.50	0.50	0	0	4-5	0.50	scal (6.3%)
VCVTSS2SD %XMM1,%XMM1,%XMM1	2	0.50	0.50	0	0	1	0	5	1	scal (6.3%)
MOV %R11D,%R15D	1	0	0	0	0	0	0	0	0.25	N/A
MOV 0xe0(%RSP),%RDX	1	0	0	0.50	0.50	0	0	4-5	0.50	N/A
VMOVSS (%RDX,%R15,4),%XMM2	1	0	0	0.50	0.50	0	0	4-5	0.50	scal (6.3%)
VCVTSS2SD %XMM2,%XMM2,%XMM2	2	0.50	0.50	0	0	1	0	5	1	scal (6.3%)
VFMADD213SD %XMM0,%XMM1,%XMM2	1	0.50	0.50	0	0	0	0	4	0.50	scal (12.5%)
MOV %EBX,%R15D	1	0	0	0	0	0	0	0	0.25	N/A
VMOVSS (%R14,%R15,4),%XMM0	1	0	0	0.50	0.50	0	0	4-5	0.50	scal (6.3%)
VCVTSS2SD %XMM0,%XMM0,%XMM1	2	0.50	0.50	0	0	1	0	5	1	scal (6.3%)
LEA (%R13,%R11,1),%R15D	1	0	0.50	0	0	0.50	0	1	0.50	N/A
MOV 0xe0(%RSP),%RDX	1	0	0	0.50	0.50	0	0	4-5	0.50	N/A
VMOVSS (%RDX,%R15,4),%XMM0	1	0	0	0.50	0.50	0	0	4-5	0.50	scal (6.3%)
MOV 0xe0(%RSP),%R15	1	0	0	0.50	0.50	0	0	4-5	0.50	N/A
VCVTSS2SD %XMM0,%XMM0,%XMM0	2	0.50	0.50	0	0	1	0	5	1	scal (6.3%)
VFMADD213SD %XMM2,%XMM1,%XMM0	1	0.50	0.50	0	0	0	0	4	0.50	scal (12.5%)
ADD $0x2,%R10	1	0.25	0.25	0	0	0.25	0.25	1	0.25	N/A
ADD $0x2,%EBX	1	0.25	0.25	0	0	0.25	0.25	1	0.25	N/A
ADD %RCX,%R11	1	0.25	0.25	0	0	0.25	0.25	1	0.25	N/A
CMP %R10,%RAX	1	0.25	0.25	0	0	0.25	0.25	1	0.25	N/A
JNE 4ef0 <main+0x1740>	1	0.50	0	0	0	0	0.50	0	0.50-1	N/A

Function	main
Source file and lines	attention.cpp:30-31
Module	attention-avx512

The loop is defined in /home/eoseret/Applications/llm-attention/attention.cpp:30-31.

The related source loop is multi-versionned.

gain
potential
hint
expert

Vectorization

Your loop is not vectorized. Only 7% of vector register length is used (average across all SSE/AVX instructions). By vectorizing your loop, you can lower the cost of an iteration from 8.00 to 0.55 cycles (14.67x speedup).

Details

All SSE/AVX 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 ffast-math (included in Ofast) 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)
- 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)

Execution units bottlenecks

Found no such bottlenecks but see expert reports for more complex bottlenecks.

FMA

Detected 2 FMA (fused multiply-add) operations.

Complex instructions

Detected COMPLEX INSTRUCTIONS.

Details

These instructions generate more than one micro-operation and only one of them can be decoded during a cycle and the extra micro-operations increase pressure on execution units.

VCVTSS2SD: 4 occurrences►
- /home/eoseret/Applications/llm-attention/attention.cpp:31
- /home/eoseret/Applications/llm-attention/attention.cpp:31
- /home/eoseret/Applications/llm-attention/attention.cpp:31
- /home/eoseret/Applications/llm-attention/attention.cpp:31

Slow data structures access

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

Details

Constant unknown stride: 3 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)

Conversion instructions

Detected expensive conversion instructions.

Details

VCVTSS2SD (FP32 to FP64, scalar): 4 occurrences►
- /home/eoseret/Applications/llm-attention/attention.cpp:31
- /home/eoseret/Applications/llm-attention/attention.cpp:31
- /home/eoseret/Applications/llm-attention/attention.cpp:31
- /home/eoseret/Applications/llm-attention/attention.cpp:31

Workaround

Avoid mixing data with different types. In particular, check if the type of constants is the same as array elements. Use double instead of single precision only when/where needed by numerical stability and avoid mixing precision. In C/C++, FP constants are double precision by default and must be suffixed by 'f' to make them single precision.

Type of elements and instruction set

2 SSE or AVX instructions are processing arithmetic or math operations on double precision FP elements in scalar mode (one at a time).

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 is loading 40 bytes (5 double precision FP elements).

Arithmetic intensity

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

Unroll opportunity

Loop is potentially data access bound.

Workaround

Unroll your loop if trip count is significantly higher than target unroll factor and if some data references are common to consecutive iterations. This can be done manually. Or with the unroll (resp. unroll_and_jam) directive on top of the inner (resp. surrounding) loop. You can enforce an unroll factor: #pragma unroll_and_jam N, unroll_and_jam(N), unroll N or unroll(N)

General properties

nb instructions	22
nb uops	25
loop length	104
used x86 registers	10
used mmx registers	0
used xmm registers	3
used ymm registers	0
used zmm registers	0
nb stack references	1

Front-end

ASSUMED MACRO FUSION FIT IN UOP CACHE

micro-operation queue	6.25 cycles
front end	6.25 cycles

Back-end

	P0	P1	P2	P3	P4	P5	P6	P7
uops	4.00	4.00	3.50	3.50	0.00	4.00	4.00	0.00
cycles	4.00	4.00	3.50	3.50	0.00	4.00	4.00	0.00

Execution ports to units layout:

P0 (256 bits): VPU, BRU, ALU, DIV/SQRT
P1 (256 bits): ALU, VPU
P2 (512 bits): store address, load
P3 (512 bits): store address, load
P4 (512 bits): store data
P5 (512 bits): ALU, VPU
P6: ALU, BRU
P7: store address

Cycles executing div or sqrt instructions	NA
Longest recurrence chain latency (RecMII)	8.00

Cycles summary

Front-end	6.25
Dispatch	4.00
Data deps.	8.00
Overall L1	8.00

Vectorization ratios

all	0%
load	0%
store	NA (no store vectorizable/vectorized instructions)
mul	NA (no mul vectorizable/vectorized instructions)
add-sub	NA (no add-sub vectorizable/vectorized instructions)
fma	0%
div/sqrt	NA (no div/sqrt vectorizable/vectorized instructions)
other	0%

Vector efficiency ratios

all	7%
load	6%
store	NA (no store vectorizable/vectorized instructions)
mul	NA (no mul vectorizable/vectorized instructions)
add-sub	NA (no add-sub vectorizable/vectorized instructions)
fma	12%
div/sqrt	NA (no div/sqrt vectorizable/vectorized instructions)
other	6%

Cycles and memory resources usage

Assuming all data fit into the L1 cache, each iteration of the binary loop takes 8.00 cycles. At this rate:

3% of peak load performance is reached (5.00 out of 128.00 bytes loaded per cycle (GB/s @ 1GHz))

Front-end bottlenecks

Found no such bottlenecks.

ASM code

In the binary file, the address of the loop is: 4ef0

Instruction	Nb FU	P0	P1	P2	P3	P5	P6	Latency	Recip. throughput	Vectorization
LEA -0x1(%RBX),%R15D	1	0	0.50	0	0	0.50	0	1	0.50	N/A
VMOVSS (%R14,%R15,4),%XMM1	1	0	0	0.50	0.50	0	0	4-5	0.50	scal (6.3%)
VCVTSS2SD %XMM1,%XMM1,%XMM1	2	0.50	0.50	0	0	1	0	5	1	scal (6.3%)
MOV %R11D,%R15D	1	0	0	0	0	0	0	0	0.25	N/A
MOV 0xe0(%RSP),%RDX	1	0	0	0.50	0.50	0	0	4-5	0.50	N/A
VMOVSS (%RDX,%R15,4),%XMM2	1	0	0	0.50	0.50	0	0	4-5	0.50	scal (6.3%)
VCVTSS2SD %XMM2,%XMM2,%XMM2	2	0.50	0.50	0	0	1	0	5	1	scal (6.3%)
VFMADD213SD %XMM0,%XMM1,%XMM2	1	0.50	0.50	0	0	0	0	4	0.50	scal (12.5%)
MOV %EBX,%R15D	1	0	0	0	0	0	0	0	0.25	N/A
VMOVSS (%R14,%R15,4),%XMM0	1	0	0	0.50	0.50	0	0	4-5	0.50	scal (6.3%)
VCVTSS2SD %XMM0,%XMM0,%XMM1	2	0.50	0.50	0	0	1	0	5	1	scal (6.3%)
LEA (%R13,%R11,1),%R15D	1	0	0.50	0	0	0.50	0	1	0.50	N/A
MOV 0xe0(%RSP),%RDX	1	0	0	0.50	0.50	0	0	4-5	0.50	N/A
VMOVSS (%RDX,%R15,4),%XMM0	1	0	0	0.50	0.50	0	0	4-5	0.50	scal (6.3%)
MOV 0xe0(%RSP),%R15	1	0	0	0.50	0.50	0	0	4-5	0.50	N/A
VCVTSS2SD %XMM0,%XMM0,%XMM0	2	0.50	0.50	0	0	1	0	5	1	scal (6.3%)
VFMADD213SD %XMM2,%XMM1,%XMM0	1	0.50	0.50	0	0	0	0	4	0.50	scal (12.5%)
ADD $0x2,%R10	1	0.25	0.25	0	0	0.25	0.25	1	0.25	N/A
ADD $0x2,%EBX	1	0.25	0.25	0	0	0.25	0.25	1	0.25	N/A
ADD %RCX,%R11	1	0.25	0.25	0	0	0.25	0.25	1	0.25	N/A
CMP %R10,%RAX	1	0.25	0.25	0	0	0.25	0.25	1	0.25	N/A
JNE 4ef0 <main+0x1740>	1	0.50	0	0	0	0	0.50	0	0.50-1	N/A

Report Configuration

Vectorization

Details

Workaround

Execution units bottlenecks

FMA

Complex instructions

Details

Slow data structures access

Details

Workaround

Conversion instructions

Details

Workaround

Type of elements and instruction set

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

Arithmetic intensity

Unroll opportunity

Workaround

General properties

Front-end

Back-end

Cycles summary

Vectorization ratios

Vector efficiency ratios

Cycles and memory resources usage

Front-end bottlenecks

ASM code

Vectorization

Details

Workaround

Execution units bottlenecks

FMA

Complex instructions

Details

Slow data structures access

Details

Workaround

Conversion instructions

Details

Workaround

Type of elements and instruction set

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

Arithmetic intensity

Unroll opportunity

Workaround

General properties

Front-end

Back-end

Cycles summary

Vectorization ratios

Vector efficiency ratios

Cycles and memory resources usage

Front-end bottlenecks

ASM code