Assume that a virtual memory is managed using a buffer pool. The buffer pool contains five buffersand each buffer stores one block of data. Memory accesses are bydiskblock ID. Assume thefollowing series of memory accesses takes place: 5 2 5 12 3 6 5 9 3 2 4 1 5 9 8 15 3 7 2 5 9 10 4 6 8 5 For each of the following buffer pool replacement strategies, show the contents of the buffer poolat the end of the series, and indicate how many times a block was found in the buffer pool (insteadof being readinto memory). Assume that the buffer pool is initially empty b.Least frequently used (with counts kept only for blocks currently in memory, counts for a pageare lost when that page is removed, and the oldest item with smallestcount is removed whenthere is a tie).
Assume that a virtual memory is managed using a buffer pool. The buffer pool contains five buffersand each buffer stores one block of data. Memory accesses are bydiskblock ID. Assume thefollowing series of memory accesses takes place:
5 2 5 12 3 6 5 9 3 2 4 1 5 9 8 15 3 7 2 5 9 10 4 6 8 5
For each of the following buffer pool replacement strategies, show the contents of the buffer poolat the end of the series, and indicate how many times a block was found in the buffer pool (insteadof being readinto memory). Assume that the buffer pool is initially empty
b.Least frequently used (with counts kept only for blocks currently in memory, counts for a pageare lost when that page is removed, and the oldest item with smallestcount is removed whenthere is a tie).
c.Least frequently used (with counts kept for all blocks, and the oldest item with the smallestcount is removed when there is a tie).
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
