Offline: Difference between revisions
Jump to navigation
Jump to search
(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...") |
No edit summary |
||
| Line 24: | Line 24: | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:Page Replacements - Offline - Time.png|1000px]] | [[File:Page Replacements - Offline - Time.png|1000px]] | ||
== Space Complexity | == Space Complexity Graph == | ||
[[File:Page Replacements - Offline - Space.png|1000px]] | [[File:Page Replacements - Offline - Space.png|1000px]] | ||
== Pareto | == Pareto Frontier Improvements Graph == | ||
[[File:Page Replacements - Offline - Pareto Frontier.png|1000px]] | [[File:Page Replacements - Offline - Pareto Frontier.png|1000px]] | ||
Revision as of 14:05, 15 February 2023
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
Space Complexity Graph
Pareto Frontier Improvements Graph
