On competitive on-line paging with lookahead

DOI10.1016/S0304-3975(98)00118-2zbMath0909.68023MaRDI QIDQ1276313

Dany Breslauer

Publication date: 2 February 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

on-line paging algorithms

Mathematics Subject Classification ID

Computer system organization (68M99)

Related Items (8)

Online-bounded analysis ⋮ Combining request scheduling with web caching ⋮ Competitive caching of query results in search engines ⋮ The relative worst-order ratio applied to paging ⋮ Online computation with advice ⋮ Online Bounded Analysis ⋮ Exact distributional analysis of online algorithms with lookahead ⋮ An optimal algorithm for 2-bounded delay buffer management with lookahead

Cites Work

• A strongly competitive randomized paging algorithm
• A new measure for the study of on-line algorithms
• On the influence of lookahead in competitive paging algorithms
• Competitive paging algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

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