Consider a small two-way set-associative cache memory, consisting of four blocks. For choosing the block to be replaced, use the least recently used (LRU) scheme. The number of cache misses for the following sequence of block addresses is
$8, 12, 0, 12, 8$

2

No worries! We‘ve got your back. Try BYJU‘S free classes today!

4

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

5

No worries! We‘ve got your back. Try BYJU‘S free classes today!

3

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is B $4$
$S e q u e n c e 8, 12, 0, 12, 8$

$A p p l y t h e L R U a s f o l l o w s$

$P a g e F r a m e$

$T o t a l n u m b e r o f m i s s = 4$

Suggest Corrections

Similar questions

A n a c c e s s s e q u e n c e o f c a c h e b l o c k a d d r e s s

o f l e n g t h N a n d c o n t a i n s n u n i q u e b l o c k

a d d r e s s e s . T h e n u m b e r o f u n i q u e b l o c k

a d d r e s s e s b e t w e e n t w o c o n s e c u t i v e a c c e s s e s

t o t h e s a m e b l o c k a d d r e s s i s b o u n d e d a b o v e

b y k . W h a t i s t h e m i s s r a t i o i f t h e a c c e s s

s e q u e n c e i s p a s s e d t h r o u g h a c a c h e o f

a s s o c i a t i v i t y A \geq k e x e r c i s i n g l e a s t -

r e c e n t l y u s e d r e p l a c e m e n t p o l i c y ?

32 K B

32

C P U

32

Join BYJU'S Learning Program