Memory timing

Keep recently accessed data in higher levels of memory hierarchy (i.e. use better memory).

Hit or miss

Hit is when data is found in that level of memory hierarchy. Miss is the complement.

Average memory access time

$AMAT=t_{cache}+MR_{cache}[t_{MM}+MR_{MM}(t_{VM})]$

Note that if memory is not in main, it must be in virtual

Cache

Fastest, ideally predict the future to put needed stuff into the cache using spatial and temporal locality.

A cache is organized into S sets, each address mapping to exactly one set.

• Direct mapped: 1 block per set
• N-way set associative: N blocks per set
• Fully associative: all cache blocks in 1 set

The tag is used to detect misses.

Compulsory misses cannot be prevented.