Trackless online algorithms for the server problem

DOI10.1016/S0020-0190(00)00034-XMaRDI QIDQ1607049zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the k -server conjecture
• New Ressults on Server Problems
• A competitive 2-server algorithm
• scientific article; zbMATH DE number 7204466
• The \(k\)-server problem

Cites work

• scientific article; zbMATH DE number 65695 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• A better lower bound on the competitive ratio of the randomized 2-server problem
• A competitive 2-server algorithm
• A strongly competitive randomized paging algorithm
• An Optimal On-Line Algorithm for K Servers on Trees
• Competitive analysis of randomized paging algorithms
• Competitive paging algorithms
• Competitive paging with locality of reference
• HARMONIC is 3-competitive for two servers
• On fast algorithms for two servers
• On the k -server conjecture

Cited in

(6)

• More on randomized on-line algorithms for caching.
• On the online track assignment problem
• An Optimal Algorithm for Online Freeze-tag
• Knowledge state algorithms
• More on weighted servers or FIFO is better than LRU.
• Limited bookmark randomized online algorithms for the paging problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607049)