The theoretically optimal page replacement algorithm (Offline Page Replacements)
Jump to navigation
Jump to search
Time Complexity
$O(n^{2})$
Space Complexity
$O(k)$ words
(Need to keep track of cache; linear scan for searching for page not being used for the longest only requires O(1) auxiliary space)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1940