recategorized by
733 views
1 votes
1 votes

Consider a $4$-way set associative cache mapping, in which the cache blocks are grouped into sets and each set has $4$ blocks. There are $16$ cache blocks in total. The following memory block requests arrive in order when the cache memory is empty: $$ 8,4,8,3,0,7,12,64,216,8 $$ If a set is full, the Least Recently Used (LRU) policy is used to replace a block in that set to make room for the present request.

  1. Show the cache configuration (along with intermediate configurations) on meeting the above memory requirements.
  2. What is the hit ratio?
recategorized by

1 Answer

1 votes
1 votes
0.1 hitrate and

memory blocks: (64,216,8,12} S0

                           {} S1

                           {}S2

                           {3,7}S3  are avaliable at the end of these requests.

Related questions

0 votes
0 votes
2 answers
3
admin asked Aug 8, 2022
535 views
Let $G$ be a simple undirected graph having $n$ vertices with the property that the average of the degrees of the vertices in $G$ is at least $4.$ Consider the following ...