✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Assume a full associative cache which can allocate up to 4 blocks. The next sequence of block references are generated by the processor:
Block references -->314, 1004, 530, 665, 2220, 1004, 530, 1546, 1004, 125
After the fourth reference, the state of the cache is:
cache block content block 0 --> block 314 of MM block 1 --> block 1004 of MM block 2 --> block 530 of MM block 3 --> block 665 of MM
What block of MM will be in the block 1 of the cache after the last reference (125) if the processor uses the LRU algorithm for replacement?
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!