Research Article
Flash-Aware Page Replacement Algorithm
Algorithm 1
The pseudocode for the victim page selection scheme.
Algorithm VictimPageSelection | Input: Mixed page list; Full dirty page list | Output: Victim page | (1) if (the mixed page list is not empty) | (2) for (each page within the mixed page list) | (3) victim page = The page with the biggest selecting index value; | (4) end for | (5) end if | (6) else | (7) for (each page within the full dirty page list) | (8) victim page = the full dirty page with the biggest selecting index value; | (9) end for | (10) end else |
|