Longest distance first (LDF) page replacement algorithm (Online Page Replacements)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(nk)$?

Space Complexity

$O(k)$ words

(Need to keep track of cache + information related to position of pages)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2017

Reference

https://www.researchgate.net/profile/Gyanendra-Kumar-3/publication/319467661_A_Novel_Longest_Distance_First_Page_Replacement_Algorithm/links/59b209f1aca2728472d14684/A-Novel-Longest-Distance-First-Page-Replacement-Algorithm.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Longest_distance_first_(LDF)_page_replacement_algorithm_(Online_Page_Replacements)&oldid=45606"