I'm studying for my Computer Architecture exam next week, and I'm having problems understanding how a set associative cache works and how to solve related problems like this one :A set-associative cache memory uses a set of 8 words. A replacement procedure based on FIFO algorithm is implemented by means of 3-bit counter associated with each word in the set. A value in the range 0-7 is thus recorded for each word. When a hit occurs, the counter associated with the referenced word is set to 1; those with values originally lower than the referenced one are put in its place and put all others in reverse order. If a miss occurs the algorithm implemented the new word put in its place, show that this procedure works with this message start ABCDEFGHIJKABCDEFLMNGHD end. Start with initial 8 words. then compute the miss ratio.here is what I've tried so far ... I've inserted the first 8 letters into the cache, and then checked the following 15 letters for hits and misses whenever there is a miss I remove the oldest letter in the cache and replace it with the new one... not sure if my solution is correct to this point or not and I can't figure out the part about the counter and the part about the reverse order I greatly appreciate any time taken to explain this to me as I don't understand the wording of the problem, and need a general guideline on how to solve such problem.Thank you very much in advance.
Need help with a set-associative cache memory problem
computer architecture;cpu cache