Limited bookmark randomized online algorithms for the paging problem

DOI10.1016/S0020-0190(00)00140-XMaRDI QIDQ1607066zbMATH OpenWikidataFDO

Authors Wolfgang W. Bein, Rudolf Fleischer, Lawrence L. Larmore

Publication date 25 July 2002

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

zbMATH Keywords

paging problem

Mathematics Subject Classification ID

Randomized algorithms (68W20) Theory of operating systems (68N25)

Recommendations

• \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
• OnlineMin: a fast strongly competitive randomized paging algorithm
• Improved space bounds for strongly competitive randomized paging algorithms
• A strongly competitive randomized paging algorithm
• Competitive analysis of randomized paging algorithms

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• A competitive 2-server algorithm
• Competitive analysis of randomized paging algorithms
• Competitive paging with locality of reference
• HARMONIC is 3-competitive for two servers
• More on randomized on-line algorithms for caching.
• Trackless online algorithms for the server problem

Cited in

(5)

• Improved space bounds for strongly competitive randomized paging algorithms
• Knowledge state algorithms
• More on randomized on-line algorithms for caching.
• scientific article; zbMATH DE number 2079385 (Why is no real title available?)
• More on weighted servers or FIFO is better than LRU.

This page was built for publication: Limited bookmark randomized online algorithms for the paging problem

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