Cache prefetching

Hardware vs. software cache prefetching

Cache prefetching can be accomplished either by hardware or by software.

• Hardware based prefetching is typically accomplished by having a dedicated hardware mechanism in the processor that watches the stream of instructions or data being requested by the executing program, recognizes the next few elements that the program might need based on this stream and prefetches into the processor's cache.
• Software based prefetching is typically accomplished by having the compiler analyze the code and insert additional "prefetch" instructions in the program during compilation itself.

Methods of hardware prefetching

Stream buffers

• Stream buffers were developed based on the concept of "one block lookahead (OBL) scheme" proposed by Alan Jay Smith.
• Stream buffers are one of the most common hardware based prefetching techniques in use. This technique was originally proposed by Norman Jouppi in 1990 and many variations of this method have been developed since. The basic idea is that the cache miss address (and ${\displaystyle k}$ subsequent addresses) are fetched into a separate buffer of depth ${\displaystyle k}$. This buffer is called a stream buffer and is separate from the cache. The processor then consumes data/instructions from the stream buffer if the address associated with the prefetched blocks match the requested address generated by the program executing on the processor. The figure below illustrates this setup:

• Whenever the prefetch mechanism detects a miss on a memory block, say A, it allocates a stream to begin prefetching successive blocks from the missed block onward. If the stream buffer can hold 4 blocks, then the processor would prefetch A+1, A+2, A+3, A+4 and hold those in the allocated stream buffer. If the processor consumes A+1 next, then it shall be moved "up" from the stream buffer to the processor's cache. The first entry of the stream buffer would now be A+2 and so on. This pattern of prefetching successive blocks is called Sequential Prefetching. It is mainly used when contiguous locations are to be prefetched. For example, it is used when prefetching instructions.
• This mechanism can be scaled up by adding multiple such 'stream buffers' - each of which would maintain a separate prefetch stream. For each new miss, there would be a new stream buffer allocated and it would operate in a similar way as described above.
• The ideal depth of the stream buffer is something that is subject to experimentation against various benchmarks and depends on the rest of the microarchitecture involved.

Strided prefetching

This type of prefetching monitors the delta between the addresses of the memory accesses and looks for patterns within it.

Regular strides

In this pattern, consecutive memory accesses are made to blocks that are ${\displaystyle s}$ addresses apart. In this case, the prefetcher calculates the ${\displaystyle s}$ and uses it to compute the memory address for prefetching. E.g.: If the ${\displaystyle s}$ is 4, the address to be prefetched would A+4.

Irregular spatial strides

In this case, the delta between the addresses of consecutive memory accesses is variable but still follows a pattern. Some prefetchers designs exploit this property to predict and prefetch for future accesses.

Irregular temporal prefetching

This class of prefetchers look for memory access streams that repeat over time. E.g. In this stream of memory accesses: N, A, B, C, E, G, H, A, B, C, I, J, K, A, B, C, L, M, N, O, A, B, C, ...; the stream A,B,C is repeating over time. Other design variation have tried to provide more efficient, performant implementations.

Collaborative prefetching

Computer applications generate a variety of access patterns. The processor and memory subsystem architectures used to execute these applications further disambiguate the memory access patterns they generate. Hence, the effectiveness and efficiency of prefetching schemes often depend on the application and the architectures used to execute them. Recent research has focused on building collaborative mechanisms to synergistically use multiple prefetching schemes for better prefetching coverage and accuracy.

Methods of software prefetching

Compiler directed prefetching

Compiler directed prefetching is widely used within loops with a large number of iterations. In this technique, the compiler predicts future cache misses and inserts a prefetch instruction based on the miss penalty and execution time of the instructions.

These prefetches are non-blocking memory operations, i.e. these memory accesses do not interfere with actual memory accesses. They do not change the state of the processor or cause page faults.

One main advantage of software prefetching is that it reduces the number of compulsory cache misses.

The following example shows how a prefetch instruction would be added into code to improve cache performance.

Consider a for loop as shown below:

<span id="mwgA"></span><span class="k" id="mwgQ">for</span><span class="w" id="mwgg"> </span><span class="p" id="mwgw">(</span><span class="kt" id="mwhA">int</span><span class="w" id="mwhQ"> </span><span class="n" id="mwhg">i</span><span class="o" id="mwhw">=</span><span class="mi" id="mwiA">0</span><span class="p" id="mwiQ">;</span><span class="w" id="mwig"> </span><span class="n" id="mwiw">i</span><span class="o" id="mwjA"><</span><span class="mi" id="mwjQ">1024</span><span class="p" id="mwjg">;</span><span class="w" id="mwjw"> </span><span class="n" id="mwkA">i</span><span class="o" id="mwkQ">++</span><span class="p" id="mwkg">)</span><span class="w" id="mwkw"> </span><span class="p" id="mwlA">{</span> <span class="w" id="mwlQ"> </span><span class="n" id="mwlg">array1</span><span class="p" id="mwlw">[</span><span class="n" id="mwmA">i</span><span class="p" id="mwmQ">]</span><span class="w" id="mwmg"> </span><span class="o" id="mwmw">=</span><span class="w" id="mwnA"> </span><span class="mi" id="mwnQ">2</span><span class="w" id="mwng"> </span><span class="o" id="mwnw">*</span><span class="w" id="mwoA"> </span><span class="n" id="mwoQ">array1</span><span class="p" id="mwog">[</span><span class="n" id="mwow">i</span><span class="p" id="mwpA">];</span> <span class="p" id="mwpQ">}</span>

At each iteration, the i^th element of the array "array1" is accessed. Therefore, the system can prefetch the elements that are going to be accessed in future iterations by inserting a "prefetch" instruction as shown below:

<span id="mwqg"></span><span class="k" id="mwqw">for</span><span class="w" id="mwrA"> </span><span class="p" id="mwrQ">(</span><span class="kt" id="mwrg">int</span><span class="w" id="mwrw"> </span><span class="n" id="mwsA">i</span><span class="o" id="mwsQ">=</span><span class="mi" id="mwsg">0</span><span class="p" id="mwsw">;</span><span class="w" id="mwtA"> </span><span class="n" id="mwtQ">i</span><span class="o" id="mwtg"><</span><span class="mi" id="mwtw">1024</span><span class="p" id="mwuA">;</span><span class="w" id="mwuQ"> </span><span class="n" id="mwug">i</span><span class="o" id="mwuw">++</span><span class="p" id="mwvA">)</span><span class="w" id="mwvQ"> </span><span class="p" id="mwvg">{</span> <span class="w" id="mwvw"> </span><span class="n" id="mwwA">prefetch</span><span class="w" id="mwwQ"> </span><span class="p" id="mwwg">(</span><span class="n" id="mwww">array1</span><span class="w" id="mwxA"> </span><span class="p" id="mwxQ">[</span><span class="n" id="mwxg">i</span><span class="w" id="mwxw"> </span><span class="o" id="mwyA">+</span><span class="w" id="mwyQ"> </span><span class="n" id="mwyg">k</span><span class="p" id="mwyw">]);</span> <span class="w" id="mwzA"> </span><span class="n" id="mwzQ">array1</span><span class="p" id="mwzg">[</span><span class="n" id="mwzw">i</span><span class="p" id="mw0A">]</span><span class="w" id="mw0Q"> </span><span class="o" id="mw0g">=</span><span class="w" id="mw0w"> </span><span class="mi" id="mw1A">2</span><span class="w" id="mw1Q"> </span><span class="o" id="mw1g">*</span><span class="w" id="mw1w"> </span><span class="n" id="mw2A">array1</span><span class="p" id="mw2Q">[</span><span class="n" id="mw2g">i</span><span class="p" id="mw2w">];</span> <span class="p" id="mw3A">}</span>

Here, the prefetch stride, ${\displaystyle k}$ depends on two factors, the cache miss penalty and the time it takes to execute a single iteration of the for loop. For instance, if one iteration of the loop takes 7 cycles to execute, and the cache miss penalty is 49 cycles then there should be ${\displaystyle k=49/7=7}$ - which means that the system should prefetch 7 elements ahead. With the first iteration, i will be 0, so the system prefetches the 7th element. Now, with this arrangement, the first 7 accesses (i=0->6) will still be misses (under the simplifying assumption that each element of array1 is in a separate cache line of its own).

Comparison of hardware and software prefetching

• While software prefetching requires programmer or compiler intervention, hardware prefetching requires special hardware mechanisms.
• Software prefetching works well only with loops where there is regular array access as the programmer has to hand code the prefetch instructions, whereas hardware prefetchers work dynamically based on the program's behavior at runtime.
• Hardware prefetching also has less CPU overhead when compared to software prefetching. However, software prefetching can mitigate certain constraints of hardware prefetching, leading to improvements in performance.

Metrics of cache prefetching

There are three main metrics to judge cache prefetching

Coverage

Coverage is the fraction of total misses that are eliminated because of prefetching, i.e.

${\displaystyle Coverage=\frac{\text{Cache Misses eliminated by Prefetching}}{\text{Total Cache Misses}}}$,

where, ${\displaystyle \text{Total Cache Misses}=(\text{Cache misses eliminated by prefetching})+(\text{Cache misses not eliminated by prefetching})}$

Accuracy

Accuracy is the fraction of total prefetches that were useful - i.e. the ratio of the number of memory addresses prefetched were actually referenced by the program to the total prefetches done.

${\displaystyle \text{Prefetch Accuracy}=\frac{\text{Cache Misses eliminated by prefetching}}{(\text{Useless Cache Prefetches})+(\text{Cache Misses eliminated by prefetching})}}$

While it appears that having perfect accuracy might imply that there are no misses, this is not the case. The prefetches themselves might result in new misses if the prefetched blocks are placed directly into the cache. Although these may be a small fraction of the total number of misses observed without any prefetching, this is a non-zero number of misses.

Timeliness

The qualitative definition of timeliness is how early a block is prefetched versus when it is actually referenced. An example to further explain timeliness is as follows:

Consider a for loop where each iteration takes 3 cycles to execute and the 'prefetch' operation takes 12 cycles. This implies that for the prefetched data to be useful, the system must start the prefetch ${\displaystyle 12/3=4}$ iterations prior to its usage to maintain timeliness.