Graphic cache elimination algorithm 3-FIFO

1. Conceptual Analysis

FIFO (first in first out), that is, first in first out. the first data to enter is the first data to enter. A simple algorithm. you only need to use the queue data structure. the concept behind the FIFO elimination algorithm is"Recently, the access is more likely in the future.". After reading these three algorithms, I think we have gained a lot of insight into our understanding of elimination, based on an estimation of future possibilities.

2. Principle Analysis

The FIFO elimination process is similar to the conveyor belt method. Data first placed on the conveyor belt will be first eliminated, as shown in.

 

3. Optimization Analysis

【Hit rate]

Low hit rate, not recommended.

【Complexity]

Very simple.

【Storage cost]

Very low.

【Defects]

The speed is fast, but there is no practical value.

4. Implementation

The implementation method is very simple. You can use the queue to complete the process. I will not repeat it here. Of course, this elimination algorithm is too simple and is not the focus. We will discuss the transformation algorithm based on FIFO.

Finally, please advise me if any of the following is incorrect.