The directly mapped cache no replacement algorithm is required.
The surroundings of the recently accessed block is called as ______
1 Crore+ students have signed up on EduRev. Have you? Download the App |
In set associative and associative mapping there exists less flexibility.
THe algorithm which replaces the block which has not been referenced for awhile is called _____
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.
The LRU provides very bad performance when it comes to _________
The algorithm which removes the recently used page first is ________
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 ______
The counter that keeps track of how many times a block is most likely used is _______