Offline: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
 
Line 29: Line 29:


[[File:Page Replacements - Offline - Time.png|1000px]]
[[File:Page Replacements - Offline - Time.png|1000px]]
== Space Complexity Graph ==
[[File:Page Replacements - Offline - Space.png|1000px]]
== Time-Space Tradeoff ==
[[File:Page Replacements - Offline - Pareto Frontier.png|1000px]]

Latest revision as of 10:12, 28 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

Page Replacements - Offline - Time.png