Online algorithms for page replication in rings

DOI10.1016/S0304-3975(00)00262-0zbMath0992.68011MaRDI QIDQ5958716

Włodzimierz Głazek

Publication date: 3 March 2002

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

zbMATH Keywords

competitive analysisonline algorithmsanalysis of algorithmsmemory management

Mathematics Subject Classification ID

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

Related Items (2)

New results for online page replication ⋮ Optimal algorithms for page migration in dynamic networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Competitive algorithms for distributed data management.
• Competitive snoopy caching
• On the power of randomization in on-line algorithms
• Fast algorithms for bin packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• New On-Line Algorithms for the Page Replication Problem
• Competitive On-Line Algorithms for Distributed Data Management
• Competitive distributed file allocation

This page was built for publication: Online algorithms for page replication in rings