On-line algorithms for locating checkpoints

DOI10.1007/BF01294262zbMath0784.68031OpenAlexW2056696025MaRDI QIDQ1312186

Daniel H. Greene, Marshall W. Bern, Arvind U. Raghunathan

Publication date: 19 January 1994

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01294262

zbMATH Keywords

data compressioninformation retrievalcompetitive ratioservers

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (3)

Online Checkpointing with Improved Worst-Case Guarantees ⋮ Approximately uniform online checkpointing with bounded memory ⋮ Tight Bounds on Online Checkpointing Algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Competitive snoopy caching
• Random walks on weighted graphs and applications to on-line algorithms
• An Optimal On-Line Algorithm for K Servers on Trees
• New Ressults on Server Problems
• Competitive algorithms for server problems
• Sequencing Problems in Two-Server Systems

This page was built for publication: On-line algorithms for locating checkpoints