The subset assignment problem for data placement in caches
From MaRDI portal
Recommendations
- The subset assignment problem for data placement in caches
- Approximation Algorithms for Data Placement Problems
- The hardness of cache conscious data placement
- The hardness of cache conscious data placement
- Approximation schemes for generalized \(2\)-dimensional vector packing with application to data placement
Cites work
- A nearly linear-time PTAS for explicit fractional packing and covering linear programs
- A new polynomial-time algorithm for linear programming
- Fast Algorithms for Bipartite Network Flow
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 1445306 (Why is no real title available?)
- scientific article; zbMATH DE number 1445399 (Why is no real title available?)
- Improved Algorithms for Bipartite Network Flow
- Introduction to algorithms.
- Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks
- Network flows. Theory, algorithms, and applications.
- Probabilistic methods for web caching
Cited in
(3)
This page was built for publication: The subset assignment problem for data placement in caches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724230)