Cache And How To Work For It

Why Cache Matters 

Simply put, Cache is a small amount of memory located on your CPU that is used to reduce latencies to main memory (RAM). We have no control over the cache, but programming and storing data in a cache-friendly manner is imperative to performance improvements and, in turn, a reduction in power consumption. Without realising it, you may have already used a form of Cache before when reading files from an HDD where you have loaded the file into RAM and then manipulated it there before writing back the changes, you’ve cached the file on the RAM. Although this example is slightly different and technically a buffer, the similarities are present.

How Cache Works

When your CPU requests a piece of memory it’ll go out to the RAM to fetch it. During that time the CPU is waiting while the request goes through the Memory Controller, on the CPU chip to the RAM to be served and returned. This is a waste of possible compute time and therefore a reduction in power efficiency. Cache sits between this line of communication and listens in on the requests to RAM; if it has the memory already it’ll stop the request and respond with what it has, this is referred to a Cache Hit and if it’s unable to serve the request because it doesn’t have the requested memory then it’s a Cache Miss.

There are systems in place to assure that when writing to memory, both the Cache and memory are updated, but I’ll save those for another article, as they are more important when working with a multithreaded application.

The part that we can assist

The Cache is always trying to guess what memory you’ll need to have before you request it, this prediction is called Cache Prefetching. This is why when working on an array it’s best to go through in sequential order instead of randomly jumping through, as the Cache Prefetcher will be able to guess what you’re using and have it ready before you need it. Cache loads things in groups of 64 bytes. The size is CPU-dependant and can be checked under your CPU’s specification under Cache Line size, although it’s typically 64 bytes. This means that if you have an array of integers and you grab 1 of those integers, the cache has also grabbed the Cache Line that it sits on. Grabbing the next integer stored next to it will be a Cache Hit and subsequently extremely fast. The alignment of the Cache Line will always be a multiple of the Cache Line’s size, meaning that if you fetch memory at 0x00 (0) then what will be cached is everything between 0x00 (0) and 0x40 (64) and if you fetch something at 0x4F (79) then you’ll get everything between 0x40 (64) and 0x80 (128).

Use Case

Arrays store their data sequentially, so they’re ideal for accessing in a cache-friendly way. In this example we access data going across the row before going to the next row and then in the second loop, we go across the column first and then move to the next column. Each dimension in the array contains 10,000 integers.


for (unsigned x = 0; x < ARRAY_SIZE; ++x)

for (unsigned y = 0; y < ARRAY_SIZE; ++y)

  total += array_[ y ][ x ];

for (unsigned x = 0; x < ARRAY_SIZE; ++x)

for (unsigned y = 0; y < ARRAY_SIZE; ++y)

  total += array_[ x ][ y ];


The only difference between these loops is the <tt>array_[x][y]</tt> and <tt>[y][x]</tt>, but the results between the two are extreme. On my AMD 8150, the first loop finished in 1,501ms while the second only took 281ms which is a ~5x speed increase! Simply because of the Prefetcher friendly access, although the first loop may look sequential, it’s actually extremely fragmented in its accesses. A 2D array stores its data in one large block with each row next to each other and after each row, it is the next row (Row-Major order). In the diagram below we have the access patterns of the two loops showing the order of their access and the values returned. The first loop accesses its data in a predictable way, but not a way that the Prefetcher is able to prefetch for. While the second loop accesses its memory sequentially which allows the CPU to prefetch.


Example source:


(Access) 1 2 3 4 5 6 7 8 9

(Loop 1) 1 4 7 2 5 8 3 6 9

(Loop 2) 1 2 3 4 5 6 7 8 9



One more example of an optimisation is the layout of a class, assuming that your compiler doesn’t optimise this for you.     


struct Foo{

bool value1;

char data[64];

bool value2;



Let’s say we want to check <tt>value1</tt> and <tt>value2</tt> before accessing any data inside the array. Let’s also assume that <tt>Foo</tt> is stored at 0x00 for simplicity. When we access <tt>value1</tt>, we’ll have a Cache Miss as it’s our first time accessing this piece of memory, but now we’ve got that line stored for us. We then check <tt>value2</tt>, which will also result in a Cache Miss, because data has polluted our Cache Line and pushed <tt>value2</tt> into the next line meaning we now have to wait twice. An alternative would be to store <tt>value1</tt> and <tt>value2</tt> next to each other so that we only have the first Cache Miss and a Cache Hit for the second. Assuming we don’t access <tt>data[62]</tt> and upwards then we won’t have to deal with another Cache Miss. Optimally we could store <tt>value1</tt> and <tt>value2</tt> in the same byte because we only need one bit to store a Boolean and could technically fit eight Booleans into a single byte. If we performed this optimisation and used bitwise shifting to access each byte we could squeeze another byte of the array into out cache line.

Example source:

From this, on the AMD 8150 we received 47ms for the first loop and 31ms for the second loop which is a 1.5x performance increase. Notice that we have to times the array access by * 2 to break up sequential access because there would be no performance difference between the two loops. If we always fetch 64 bytes then we’re bound to fetch more than needed for value2 and therefore cache the next object in the array unintentionally. Another interesting behaviour which shows the function of the prefetcher is if we accessed the array sequentially so the CPU could prefetch it would only take 15ms to go through the entire array instead of 31ms to go through half the array ‘randomly’.


  • Optimally, you want objects to be as small as possible to fit as many in a Cache Line as possible. You can fit two shorts in an integer and therefore 16 integers in a cache line or 32 if you use shorts.
  • Consider a pointer, first to fetch that pointer from memory is a Cache Miss and then fetching that object is a second Cache Miss is a worst case scenario.
  • Keep objects smaller than the Cache Line or divisible by it to prevent a single object spreading over two Cache Lines.
  • C++14 added the <tt>alignas</tt> keyword that will make sure that these objects are aligned in memory to the value passed which can be beneficial in stopping an object being placed in two Cache Lines.


Cache is more important than ever with the extreme speeds of CPU and relatively slow RAM, great speed improvements or power efficiency can be observed from utilising it correctly which is always welcome in the world of game creation.

For a deeper look into how to you can change your design practices for better Cache utilisation, I’d highly recommend watching this video: – Scott Meyers – Norwegian Developers Conference

One Reply to “Cache And How To Work For It”

  1. You actually make it appear so easy with your presentation however I
    to find this topic to be actually one thing which I think I would by
    no means understand. It sort of feels too complicated and extremely vast for me.
    I’m having a look forward to your subsequent put up, I’ll attempt to get the hang of

Leave a Reply

Your email address will not be published. Required fields are marked *