Implementing Historical Algorithms
This lesson analyzes the method of adding hardware support to implement historical algorithms.
We'll cover the following...
As you can see, an algorithm such as LRU can generally do a better job than simpler policies like FIFO or Random, which may throw out important pages. Unfortunately, historical policies present us with a new challenge: how do we implement them?
Requirements for implementation
Let’s take, for example, LRU. To implement it perfectly, we need to do a lot of work. Specifically, upon each page access (i.e., each memory access, whether an ...