The work function algorithm for the paging problem

DOI10.1016/j.tcs.2022.07.014OpenAlexW4285806868MaRDI QIDQ2166767

Haizhen Wang, Wen-Ming Zhang, Yongxi Cheng, Huan Hu, Hong-Mei Li

Publication date: 25 August 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.07.014

zbMATH Keywords

competitive analysisonline algorithm\(k\)-server problempaging problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• A fast work function algorithm for solving the \(k\)-server problem
• A fast approximate implementation of the work function algorithm for solving the \(k\)-server problem
• Competitive snoopy caching
• On the competitive ratio of the work function algorithm for the \(k\)-server problem
• A new upper bound on the work function algorithm for the \(k\)-server problem
• Competitive paging algorithms
• On the k -server conjecture

This page was built for publication: The work function algorithm for the paging problem