Memory Size = 2 ^ n bytes --- here n represents
Anonymous Quiz
3%
cache address
78%
physical address
15%
block index
4%
block offset
cache size = 2 ^ n bytes --- here n represents
Anonymous Quiz
71%
cache address
6%
physical address
13%
block index
10%
block offset
block size = 2 ^ n bytes --- here n represents
Anonymous Quiz
3%
cache address
3%
physical address
28%
block index
66%
block offset
Cache replacement policies
Anonymous Quiz
2%
Random
4%
FIFO
3%
LIFO
3%
Most Recently Used (MRU)
0%
Least Recently Used (LRU)
89%
All of the above
Evicts most recently referred block
Anonymous Quiz
10%
Random
9%
FIFO
7%
LIFO
71%
Most Recently Used (MRU)
3%
Least Recently Used (LRU)
Evicts least recently referred block
Anonymous Quiz
2%
Random
2%
FIFO
3%
LIFO
2%
Most Recently Used (MRU)
91%
Least Recently Used (LRU)
Evicts blocks from the cache in their order of arrival
Anonymous Quiz
20%
Random
63%
FIFO
12%
LIFO
4%
Most Recently Used (MRU)
1%
Least Recently Used (LRU)
Evicts the most recently added block-cache behaves as a stack
Anonymous Quiz
4%
Random
4%
FIFO
87%
LIFO
4%
Most Recently Used (MRU)
1%
Least Recently Used (LRU)
works well with cyclic patterns
Anonymous Quiz
39%
Random
11%
FIFO
5%
LIFO
43%
Most Recently Used (MRU)
2%
Least Recently Used (LRU)
Exploits Temporal locality
Anonymous Quiz
15%
Random
7%
FIFO
3%
LIFO
10%
Most Recently Used (MRU)
66%
Least Recently Used (LRU)
Number of comparators =
Anonymous Quiz
17%
cache lines
15%
Cache size / Block Size
66%
Both of them
2%
Neither of them
number of lines in a set
Anonymous Quiz
11%
direct mapped
16%
fully associative
72%
K-way set associative