On competitive on-line paging with lookahead

DOI10.1007/3-540-60922-9_48MaRDI QIDQ4593963zbMATH OpenOpenAlexFDO

Authors Dany Breslauer

Publication date 16 November 2017

Published in STACS 96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60922-9_48

Mathematics Subject Classification ID

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

Recommendations

• On competitive on-line paging with lookahead
• On the influence of lookahead in competitive paging algorithms
• A new measure for the study of on-line algorithms
• Competitive paging algorithms
• A competitive analysis of the list update problem with lookahead

Cited in

(6)

• A competitive analysis of the list update problem with lookahead
• A competitive analysis of the list update problem with lookahead
• Tight bounds for prefetching and buffer management algorithms for parallel I/O systems
• On the influence of lookahead in competitive paging algorithms
• A new measure for the study of on-line algorithms
• Analysis of simple randomized buffer management for parallel I/O

This page was built for publication: On competitive on-line paging with lookahead

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