Question: To implement LRU, each page uses a referenced bit. If we wanted to implement a least frequently used (LFU) page removal algorithm, where the least-used
To implement LRU, each page uses a referenced bit. If we wanted to implement a least frequently used (LFU) page removal algorithm, where the least-used page would be removed from memory, what would we need to add to the tables?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
