Offline: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 32: | Line 32: | ||
[[File:Page Replacements - Offline - Space.png|1000px]] | [[File:Page Replacements - Offline - Space.png|1000px]] | ||
== | == Time-Space Tradeoff == | ||
[[File:Page Replacements - Offline - Pareto Frontier.png|1000px]] | [[File:Page Replacements - Offline - Pareto Frontier.png|1000px]] | ||
Revision as of 14:48, 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
Time-Space Tradeoff
