The work function algorithm for the paging problem

The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults in a two-level store. It is a special case of the famous k-server problem. In this paper, we firstly show that WFA is kM/m-competitive for the k-server problem where the d...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 930; s. 100 - 105
Hlavní autoři: Zhang, Wenming, Hu, Huan, Cheng, Yongxi, Li, Hongmei, Wang, Haizhen
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 21.09.2022
Témata:
Competitive analysis
k-server problem
Online algorithm
Paging problem
Online algorithm
k-server problem
Competitive analysis
Paging problem
ISSN:0304-3975, 1879-2294
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults in a two-level store. It is a special case of the famous k-server problem. In this paper, we firstly show that WFA is kM/m-competitive for the k-server problem where the distances between two points are all in [m,M] (0<m≤M), and thus WFA is k-competitive for the paging problem. And we further show that the well known FIFO for the paging problem is just a special case of WFA.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2022.07.014