86.
87.
91.
Consider a fully associative cache with 8 cache blocks (numbered 0-7) and the following
sequence of memory block requests : 4, 3, 25, 8, 19, 6, 25, 8, 16, 35, 45, 22, 8, 3, 16, 25, 7 if
LRU replacement policy is used ,which cache block will have memory block 77
ங்க @ 5
© 6 o 7
Two shared resources R: and Rz are used by processes Pi and Pz. Each process has a certain
priority for accessing each resource. Let Ty d....
See more