Online algorithms for page replication in rings
From MaRDI portal
Publication:5958716
DOI10.1016/S0304-3975(00)00262-0zbMath0992.68011MaRDI QIDQ5958716
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
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