Offline (Page Replacements)

From Algorithm Wiki
Revision as of 11:26, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Offline (Page Replacements)}} == Description == 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. == Related Problems == Related: Online == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Ap...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Description

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.

Related Problems

Related: Online

Parameters

No parameters found.

Table of Algorithms

Name Year Time Space Approximation Factor Model Reference
The theoretically optimal page replacement algorithm 1940 $O(n^{2})$ $O(k)$ Exact Deterministic

Time Complexity graph

Page Replacements - Offline - Time.png

Space Complexity graph

Page Replacements - Offline - Space.png

Pareto Decades graph

Page Replacements - Offline - Pareto Frontier.png