On variants of file caching
From MaRDI portal
Recommendations
Cites work
- A General Approximation Technique for Constrained Forest Problems
- A primal-dual randomized algorithm for weighted paging
- A strongly competitive randomized paging algorithm
- A unified approach to approximating resource allocation and scheduling
- Bin packing problems with rejection penalties and their dual problems
- Bin packing with rejection revisited
- Caching documents with variable sizes and fetching costs: an LP-based approach
- Caching is hard -- even in the fault model
- Competitive algorithms for server problems
- Competitive analysis of randomized paging algorithms
- Competitive paging algorithms
- Competitive snoopy caching
- Graph coloring with rejection
- scientific article; zbMATH DE number 5485535 (Why is no real title available?)
- scientific article; zbMATH DE number 1305389 (Why is no real title available?)
- Multiprocessor Scheduling with Rejection
- New Ressults on Server Problems
- On-line file caching
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
- Online scheduling with machine cost and rejection
- Page replacement with multi-size pages and applications to web caching
- Preemptive multiprocessor scheduling with rejection
- Towards the randomized \(k\)-server conjecture, a primal-dual approach
Cited in
(5)
This page was built for publication: On variants of file caching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3012805)