Trackless online algorithms for the server problem

DOI10.1016/S0020-0190(00)00034-XzbMath1003.68197OpenAlexW1973477950MaRDI QIDQ1607049

Wolfgang W. Bein, Lawrence L. Larmore

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00034-x

zbMATH Keywords

online algorithms\(k\)-server problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (4)

More on randomized on-line algorithms for caching. ⋮ More on weighted servers or FIFO is better than LRU. ⋮ Knowledge state algorithms ⋮ Limited bookmark randomized online algorithms for the paging problem

Cites Work

• Unnamed Item
• Unnamed Item
• A better lower bound on the competitive ratio of the randomized 2-server problem
• A strongly competitive randomized paging algorithm
• A competitive 2-server algorithm
• HARMONIC is 3-competitive for two servers
• Competitive paging with locality of reference
• An Optimal On-Line Algorithm for K Servers on Trees
• On fast algorithms for two servers
• Competitive paging algorithms
• On the k -server conjecture
• Competitive analysis of randomized paging algorithms

This page was built for publication: Trackless online algorithms for the server problem