Online algorithms for page replication in rings
From MaRDI portal
Recommendations
Cites work
- Competitive algorithms for distributed data management.
- Competitive distributed file allocation
- Competitive On-Line Algorithms for Distributed Data Management
- Competitive snoopy caching
- Fast algorithms for bin packing
- scientific article; zbMATH DE number 1670537 (Why is no real title available?)
- scientific article; zbMATH DE number 1222820 (Why is no real title available?)
- scientific article; zbMATH DE number 732976 (Why is no real title available?)
- New On-Line Algorithms for the Page Replication Problem
- On the power of randomization in on-line algorithms
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(6)- Optimal algorithms for page migration in dynamic networks
- New results for online page replication
- scientific article; zbMATH DE number 1670537 (Why is no real title available?)
- New On-Line Algorithms for the Page Replication Problem
- scientific article; zbMATH DE number 2079385 (Why is no real title available?)
- New on-line algorithms for the page replication problem
This page was built for publication: Online algorithms for page replication in rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958716)