Offline: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 10: | Line 10: | ||
== Parameters == | == Parameters == | ||
$n$: number of page requests | |||
$k$: number of pages able to fit in cache | |||
== Table of Algorithms == | == Table of Algorithms == | ||
Revision as of 08:53, 10 April 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
$n$: number of page requests
$k$: number of pages able to fit in cache
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
