Online

When page fault occurs during the program execution, operating systems use page replacement algorithms to select a victim page from primary memory and makes room for the required page.

Parameters

$n$ : number of page requests
$k$ : number of pages able to fit in cache

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Displaying 9 of 9 algorithms


Longest distance first (LDF) page replacement algorithm	2017	$O(nk)$	$O(k)$
Not recently used	1940	$O(nk)$	$O(k)$
First-in, first-out	1940	$O(nk)$	$O(k)$
Second-chance	1940	$O(nk)$	$O(k)$
Clock	1940	$O(nk)$	$O(k)$
Least recently used	1940	$O(nk)$	$O(k)$
Random	1940	$O(n)$	$O(k)$
Not frequently used (NFU)	1940	$O(nk)$	$O(k)$
Aging	1940	$O(nk)$	$O(k)$

Reductions Table

Insuffient Data to display table

Other relevant algorithms