Uniform multipaging reduces to paging

DOI10.1016/S0020-0190(98)00080-5MaRDI QIDQ293296zbMATH OpenOpenAlexFDO

Authors Vincenzo Liberatore

Publication date 9 June 2016

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

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019098000805?np=y

zbMATH Keywords

online algorithmscompetitive analysispaging

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Theory of operating systems (68N25)

Recommendations

• Paging more than one page
• A strongly competitive randomized paging algorithm
• Paging more than one page
• On multi-threaded Paging
• scientific article; zbMATH DE number 1263239

Cites work

• scientific article; zbMATH DE number 1303599 (Why is no real title available?)
• A strongly competitive randomized paging algorithm
• Competitive algorithms for server problems
• Competitive paging algorithms
• Competitive snoopy caching
• Paging more than one page

Cited in

(2)

• Flexible resource allocation to interval jobs
• On multi-threaded Paging

This page was built for publication: Uniform multipaging reduces to paging

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