Online companion caching

DOI10.1016/j.tcs.2004.05.015zbMath1073.68020OpenAlexW2154469910MaRDI QIDQ1887084

Steven S. Seiden, Manor Mendel

Publication date: 23 November 2004

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.05.015

zbMATH Keywords

Online algorithmsCachingPaging

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Competitive clustering of stochastic communication patterns on a ring ⋮ Calculating lower bounds for caching problems ⋮ Online file caching with rejection penalties

Cites Work

• Unnamed Item
• A strongly competitive randomized paging algorithm
• Competitive snoopy caching
• Competitive analysis of randomized paging algorithms
• On-line restricted caching
• Competitive paging algorithms

This page was built for publication: Online companion caching