Figure E-6 Accesses Per Iteration, Example 1 - Intel ARCHITECTURE IA-32 Reference Manual

IA-32 Intel® Architecture Optimization
Now for the case T
examine the following graph. Consider the graph of accesses per
iteration in example 1, Figure E-6.

Figure E-6 Accesses per Iteration, Example 1

The prefetch scheduling distance is a step function of T
computation latency. The steady state iteration latency (il) is either
memory-bound or compute-bound depending on T
scheduled effectively.
The graph in example 2 of accesses per iteration in Figure E-7 shows
the results for prefetching multiple cache lines per iteration. The cases
shown are for 2, 4, and 6 cache lines per iteration, resulting in differing
burst latencies. (T
E-12
=18, T =8 (2 cache lines are needed per iteration)
l b
= 18, T = 8, 16, 24).
l b
, the
c
if prefetches are
c