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žené v:
Podrobná bibliografia
Vydané v:Theoretical computer science Ročník 930; s. 100 - 105
Hlavní autori: Zhang, Wenming, Hu, Huan, Cheng, Yongxi, Li, Hongmei, Wang, Haizhen
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 21.09.2022
Predmet:
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 prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract 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.
AbstractList 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.
Author Wang, Haizhen
Zhang, Wenming
Hu, Huan
Cheng, Yongxi
Li, Hongmei
Author_xml – sequence: 1
  givenname: Wenming
  surname: Zhang
  fullname: Zhang, Wenming
  email: wenming@nwu.edu.cn
  organization: School of Economics & Management, Northwest University, Xi'an, 710127, China
– sequence: 2
  givenname: Huan
  surname: Hu
  fullname: Hu, Huan
  email: 849882640@qq.com
  organization: School of Economics & Management, Northwest University, Xi'an, 710127, China
– sequence: 3
  givenname: Yongxi
  surname: Cheng
  fullname: Cheng, Yongxi
  email: chengyx@mail.xjtu.edu.cn
  organization: School of Management, Xi'an Jiaotong University, Xi'an, 710049, China
– sequence: 4
  givenname: Hongmei
  surname: Li
  fullname: Li, Hongmei
  email: hmli@nwu.edu.cn
  organization: School of Economics & Management, Northwest University, Xi'an, 710127, China
– sequence: 5
  givenname: Haizhen
  surname: Wang
  fullname: Wang, Haizhen
  email: wanghaizhen@xisu.edu.cn
  organization: School of Business, Xi'an International Studies University, Xi'an, 710028, China
BookMark eNp9j8tOwzAQRS1UJNrCB7DLDySMH_FDrFDFS6rEpqwt1xm3Lm1c2QHE35OqrJnNXYzO1T0zMulTj4TcUmgoUHm3awZfGgaMNaAaoOKCTKlWpmbMiAmZAgdRc6PaKzIrZQfjtUpOCVttsfpO-aMKn70fYuort9-kHIftoQopV8P4P7pN7DfVMaf1Hg_X5DK4fcGbv5yT96fH1eKlXr49vy4elrVnwgx1oC6g0F3gqFnLpOxEh5IHo5zUILVA5EDXhvOOaS_XmlJHDSoDBlvdMj4n9NzrcyolY7DHHA8u_1gK9iRtd3aUtidpC8qO0iNzf2ZwHPYVMdviI_Yeu5jRD7ZL8R_6F_IEYGU
Cites_doi 10.1145/2786.2793
10.1016/j.tcs.2004.06.001
10.1007/s10878-019-00493-z
10.1007/s10100-014-0349-4
10.1145/210118.210128
10.1007/BF01762111
10.2498/cit.1001922
10.1147/sj.52.0078
10.1007/s10100-011-0222-7
10.1016/0196-6774(91)90041-V
ContentType Journal Article
Copyright 2022 Elsevier B.V.
Copyright_xml – notice: 2022 Elsevier B.V.
DBID AAYXX
CITATION
DOI 10.1016/j.tcs.2022.07.014
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1879-2294
EndPage 105
ExternalDocumentID 10_1016_j_tcs_2022_07_014
S0304397522004327
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
123
1B1
1RT
1~.
1~5
4.4
457
4G.
5VS
7-5
71M
8P~
9JN
AABNK
AACTN
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAXUO
AAYFN
ABAOU
ABBOA
ABJNI
ABMAC
ABYKQ
ACAZW
ACDAQ
ACGFS
ACRLP
ACZNC
ADBBV
ADEZE
AEBSH
AEKER
AENEX
AFKWA
AFTJW
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ARUGR
AXJTR
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HVGLF
IHE
IXB
J1W
KOM
LG9
M26
M41
MHUIS
MO0
N9A
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
ROL
RPZ
SCC
SDF
SDG
SES
SPC
SPCBC
SSV
SSW
T5K
TN5
WH7
YNT
ZMT
~G-
29Q
9DU
AAEDT
AAQXK
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABEFU
ABFNM
ABWVN
ABXDB
ACLOT
ACNNM
ACRPL
ACVFH
ADCNI
ADMUD
ADNMO
ADVLN
AEIPS
AEUPX
AEXQZ
AFJKZ
AFPUW
AGHFR
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
ASPBG
AVWKF
AZFZN
CITATION
EFKBS
EJD
FGOYB
G-2
HZ~
R2-
SEW
SSZ
TAE
WUQ
ZY4
~HD
ID FETCH-LOGICAL-c249t-f1afe48df3e825266d4de63f97a680684ee301b933d28c6b811a19e7909e58523
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000862840900009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0304-3975
IngestDate Sat Nov 29 07:24:34 EST 2025
Fri Feb 23 02:38:40 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Online algorithm
k-server problem
Competitive analysis
Paging problem
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c249t-f1afe48df3e825266d4de63f97a680684ee301b933d28c6b811a19e7909e58523
PageCount 6
ParticipantIDs crossref_primary_10_1016_j_tcs_2022_07_014
elsevier_sciencedirect_doi_10_1016_j_tcs_2022_07_014
PublicationCentury 2000
PublicationDate 2022-09-21
PublicationDateYYYYMMDD 2022-09-21
PublicationDate_xml – month: 09
  year: 2022
  text: 2022-09-21
  day: 21
PublicationDecade 2020
PublicationTitle Theoretical computer science
PublicationYear 2022
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Karlin, Manasse, Rudolph, Sleator (br0020) 1988; 3
Irani (br0030) June 1996
Fiat, Karp, Luby, McGeoch, Sleator, Young (br0040) 1991; 12
Zhang, Cheng (br0080) 2020; 39
Rudec, Manger (br0110) 2015; 23
Sleator, Tarjan (br0010) 1985; 28
Koutsoupias, Papadimitriou (br0050) 1995; 42
Belady (br0120) 1966; 5
Rudec, Baumgartner, Manger (br0100) 2013; 21
Rudec, Baumgartner, Manger (br0090) 2010; 18
Chrobak, Larmore (br0060) 1992; vol. 7
Bartal, Koutsoupias (br0070) 2004; 324
Karlin (10.1016/j.tcs.2022.07.014_br0020) 1988; 3
Koutsoupias (10.1016/j.tcs.2022.07.014_br0050) 1995; 42
Belady (10.1016/j.tcs.2022.07.014_br0120) 1966; 5
Rudec (10.1016/j.tcs.2022.07.014_br0090) 2010; 18
Rudec (10.1016/j.tcs.2022.07.014_br0100) 2013; 21
Sleator (10.1016/j.tcs.2022.07.014_br0010) 1985; 28
Rudec (10.1016/j.tcs.2022.07.014_br0110) 2015; 23
Irani (10.1016/j.tcs.2022.07.014_br0030) 1996
Bartal (10.1016/j.tcs.2022.07.014_br0070) 2004; 324
Zhang (10.1016/j.tcs.2022.07.014_br0080) 2020; 39
Fiat (10.1016/j.tcs.2022.07.014_br0040) 1991; 12
Chrobak (10.1016/j.tcs.2022.07.014_br0060) 1992; vol. 7
References_xml – volume: 18
  start-page: 361
  year: 2010
  end-page: 367
  ident: br0090
  article-title: Measuring true performance of the work function algorithm for solving the on-line k-server problem
  publication-title: CIT, J. Comput. Inf. Technol.
– volume: vol. 7
  year: 1992
  ident: br0060
  article-title: The server problem and on-line games
  publication-title: On-Line Algorithms
– volume: 39
  start-page: 509
  year: 2020
  end-page: 518
  ident: br0080
  article-title: A new upper bound on the work function algorithm for the k-server problem
  publication-title: J. Comb. Optim.
– volume: 324
  start-page: 337
  year: 2004
  end-page: 345
  ident: br0070
  article-title: On the competitive ratio of the work function algorithm for the k-server problem
  publication-title: Theor. Comput. Sci.
– volume: 21
  start-page: 187
  year: 2013
  end-page: 205
  ident: br0100
  article-title: A fast work function algorithm for solving the k-server problem
  publication-title: Cent. Eur. J. Oper. Res.
– year: June 1996
  ident: br0030
  article-title: Competitive analysis of paging: a survey
  publication-title: Proc. of the Dagstuhl Seminar on Online Algorithms
– volume: 12
  start-page: 685
  year: 1991
  end-page: 699
  ident: br0040
  article-title: Competitive paging algorithms
  publication-title: J. Algorithms
– volume: 28
  start-page: 202
  year: 1985
  end-page: 208
  ident: br0010
  article-title: Amortized efficiency of list update and paging rules
  publication-title: Commun. ACM
– volume: 23
  start-page: 699
  year: 2015
  end-page: 722
  ident: br0110
  article-title: A fast approximate implementation of the work function algorithm for solving the k-server problem
  publication-title: Cent. Eur. J. Oper. Res.
– volume: 5
  start-page: 78
  year: 1966
  end-page: 101
  ident: br0120
  article-title: A study of replacement algorithms for a virtual-storage computer
  publication-title: IBM Syst. J.
– volume: 3
  start-page: 79
  year: 1988
  end-page: 119
  ident: br0020
  article-title: Competitive snoopy caching
  publication-title: Algorithmica
– volume: 42
  start-page: 971
  year: 1995
  end-page: 983
  ident: br0050
  article-title: On the k-server conjecture
  publication-title: J. ACM
– volume: 28
  start-page: 202
  issue: 2
  year: 1985
  ident: 10.1016/j.tcs.2022.07.014_br0010
  article-title: Amortized efficiency of list update and paging rules
  publication-title: Commun. ACM
  doi: 10.1145/2786.2793
– volume: 324
  start-page: 337
  issue: 2–3
  year: 2004
  ident: 10.1016/j.tcs.2022.07.014_br0070
  article-title: On the competitive ratio of the work function algorithm for the k-server problem
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2004.06.001
– volume: 39
  start-page: 509
  issue: 2
  year: 2020
  ident: 10.1016/j.tcs.2022.07.014_br0080
  article-title: A new upper bound on the work function algorithm for the k-server problem
  publication-title: J. Comb. Optim.
  doi: 10.1007/s10878-019-00493-z
– volume: 23
  start-page: 699
  issue: 3
  year: 2015
  ident: 10.1016/j.tcs.2022.07.014_br0110
  article-title: A fast approximate implementation of the work function algorithm for solving the k-server problem
  publication-title: Cent. Eur. J. Oper. Res.
  doi: 10.1007/s10100-014-0349-4
– volume: 42
  start-page: 971
  issue: 5
  year: 1995
  ident: 10.1016/j.tcs.2022.07.014_br0050
  article-title: On the k-server conjecture
  publication-title: J. ACM
  doi: 10.1145/210118.210128
– volume: 3
  start-page: 79
  issue: 1–4
  year: 1988
  ident: 10.1016/j.tcs.2022.07.014_br0020
  article-title: Competitive snoopy caching
  publication-title: Algorithmica
  doi: 10.1007/BF01762111
– year: 1996
  ident: 10.1016/j.tcs.2022.07.014_br0030
  article-title: Competitive analysis of paging: a survey
– volume: vol. 7
  year: 1992
  ident: 10.1016/j.tcs.2022.07.014_br0060
  article-title: The server problem and on-line games
– volume: 18
  start-page: 361
  issue: 4
  year: 2010
  ident: 10.1016/j.tcs.2022.07.014_br0090
  article-title: Measuring true performance of the work function algorithm for solving the on-line k-server problem
  publication-title: CIT, J. Comput. Inf. Technol.
  doi: 10.2498/cit.1001922
– volume: 5
  start-page: 78
  issue: 2
  year: 1966
  ident: 10.1016/j.tcs.2022.07.014_br0120
  article-title: A study of replacement algorithms for a virtual-storage computer
  publication-title: IBM Syst. J.
  doi: 10.1147/sj.52.0078
– volume: 21
  start-page: 187
  issue: 1
  year: 2013
  ident: 10.1016/j.tcs.2022.07.014_br0100
  article-title: A fast work function algorithm for solving the k-server problem
  publication-title: Cent. Eur. J. Oper. Res.
  doi: 10.1007/s10100-011-0222-7
– volume: 12
  start-page: 685
  issue: 4
  year: 1991
  ident: 10.1016/j.tcs.2022.07.014_br0040
  article-title: Competitive paging algorithms
  publication-title: J. Algorithms
  doi: 10.1016/0196-6774(91)90041-V
SSID ssj0000576
Score 2.3598504
Snippet 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...
SourceID crossref
elsevier
SourceType Index Database
Publisher
StartPage 100
SubjectTerms Competitive analysis
k-server problem
Online algorithm
Paging problem
Title The work function algorithm for the paging problem
URI https://dx.doi.org/10.1016/j.tcs.2022.07.014
Volume 930
WOSCitedRecordID wos000862840900009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1879-2294
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000576
  issn: 0304-3975
  databaseCode: AIEXJ
  dateStart: 20211213
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LbxMxELYg5QAHHgVEW0A-cKLaau192D5WVasWlQqJAOG0cpxxm4psomRb5eczXtvJqgEJkLisImudWJ4v8_B45iPknTbACpPZxOpUJnnp_nOW8UQJK_RQgTVtRvfrubi4kIOB-hSqSxYtnYCoa7lcqtl_FTWOobBd6exfiHv1pTiAn1Ho-ESx4_OPBe9uW-07k-V5wH9cTufj5mqyulM489xEgU2m66D2O4WNJjA-7AczuXHI_A3qSTR9LTRaQ3azBtzRFfg3v0_ry-U4Dp97qmwcm8C4e-6AIatLxazPHTYLYnwRlku0KE-GcgBep0qBM7nnMo5KV4VsjFebLE07Fpi1hdibyt2fM1wfNMb1Wee87brqS1Dv9Mz-7NbhlsF523NQ3CdbXBRK9sjW4dnx4MPaWBfCp7PDumPiu70CeOeHfu26dNyR_lPyOMQR9NDL_xm5B_U2eRI5OmhQ2dvk0cdVX97Fc8JRvNSBg0Zw0BU4KIKD4rvUg4MGcLwgX06O-0enSWDNSAyG0k1imbaQy5HNAKN_9L9G-QjKzCqhS5mWMgdApT5UWTbi0pRDyZhmCoRKFWDsyLOXpFdPa3hFqABA_9IWXIssL1WhhRimTBumMUjASTvkfdyQauabo1Tx1uB1hbtXud2rUlHh7u2QPG5ZFWDrvbYK5fv7abv_Nm2PPFyD9jXpNfMbeEMemNtmvJi_DSj4CSfJcJk
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=The+work+function+algorithm+for+the+paging+problem&rft.jtitle=Theoretical+computer+science&rft.au=Zhang%2C+Wenming&rft.au=Hu%2C+Huan&rft.au=Cheng%2C+Yongxi&rft.au=Li%2C+Hongmei&rft.date=2022-09-21&rft.pub=Elsevier+B.V&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=930&rft.spage=100&rft.epage=105&rft_id=info:doi/10.1016%2Fj.tcs.2022.07.014&rft.externalDocID=S0304397522004327
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon