Limited bookmark randomized online algorithms for the paging problem

DOI10.1016/S0020-0190(00)00140-XzbMath1003.68205WikidataQ126989340 ScholiaQ126989340MaRDI QIDQ1607066

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

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)

Related Items (3)

More on randomized on-line algorithms for caching. ⋮ More on weighted servers or FIFO is better than LRU. ⋮ Knowledge state algorithms

Cites Work

• Unnamed Item
• A competitive 2-server algorithm
• HARMONIC is 3-competitive for two servers
• More on randomized on-line algorithms for caching.
• Trackless online algorithms for the server problem
• Competitive paging with locality of reference
• Competitive analysis of randomized paging algorithms

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