You are to construct a program that manages a 0.25 KB cache.
(That is,data upto 256 Bytes can be stored in the cache.)
Cache is organised in:
Direct Mapped, and
Fully associative.
The program takes address references in the range 0 .. 1023
and determines whether a given address reference is a hit or miss.
It also computes the Miss rate every time a miss is encountered
and at the end displays the overall Miss rate and the contents of the cache.
For displaying the cache contents, you may represent the memory
content at address A simply as M(A). You should assume that a cache block
holds 8 Bytes and, where necessary, employ the LRU scheme for block replacement.
This is my question.. any help or code would be greatly appreciated..
have made this start by constructing two classes neither compile Im not sure how to continue..
Thanks