An optimality proof of the LRU-K page replacement algorithm.
This paper analyzes a recently published algorithm for page replacement in hierarchical paged memory systems [O'Neil et al. 1993]. The algorithm is called the LRU-K method, and reduces to the well-known LRU (Least Recently Used) method for K = 1. Previous work [O'Neil et al. 1993; Weikum e...
| Argitaratua izan da: | Journal of the ACM 46, 1 (1999). |
|---|---|
| Egile nagusia: | |
| Formatua: | Artikulua |
| Hizkuntza: | English |
| Gaiak: |