Not frequently used (NFU) (Online Page Replacements)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(nk)$?

Space Complexity

$O(k)$ words

(Need to keep track of cache + reference counters only)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1940

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Not_frequently_used_(NFU)_(Online_Page_Replacements)&oldid=45603"