The directly mapped cache no replacement algorithm is required.
Explanation: The position of each block is pre-determined in the direct mapped cache, hence not need for replacement.
The surroundings of the recently accessed block is called as ______
Explanation: The locality of reference is a key factor in many of the replacement algorithms.
In set associative and associative mapping there exists less flexibility.
Explanation: The above two methods of mapping the descision of which block to be removed rests with the cache controller.
THe algorithm which replaces the block which has not been referenced for awhile is called _____
Explanation: LRU stands for Least Recently Used first.
In associative mapping during LRU, the counter of the new block is set to ‘0’ and all the others are incremented by one, when _____ occurs.
Explanation: Miss usually occurs when the memory block requiered is not present in the cache.
The LRU provides very bad performance when it comes to _________
Explanation: The LRU in case of the sequential blocks as to waste its one cycle just incrementing the counters.
The algorithm which removes the recently used page first is ________
Explanation: In MRU it is assumed that the page accessed now is less likely to be accessed again.
The LRU can be improved by providing a little randomness in the access.
In LRU, the referenced blocks counter is set to’0′ and that of the previous blocks are incremented by one and others remain same, in case of ______
Explanation: If the referenced block is present in the memory it is called as hit.
The counter that keeps track of how many times a block is most likely used is _______