Direct mapping implementation. Miss and hit rate calculation

HINTS for Laboratory work #4

First of all, we should fill the main memory. Each item of main memory array should contain 4 blocks, holding memory addresses, in our case it can be 00c, 00m, 00y, 00k for the first item of two-dimensional array.

Cache should be empty.

Next, we should go through the loop and get every block of memory and check whether this block in cache or not. If this block in cache, we will increase the number of hits, otherwise we clean the cache and fill the cache with memory blocks. First access to the cache is always will be miss, because cache is initially empty.

Cache will be filled like that, in our case 00c will be miss and we will fill the cache with K blocks from 00c, K is the size of cache, in out case, 00c, 00m, 00y, 00k, 01c, 01m, 01y, 01k if cache size 8