Approximation algorithms for data placement on parallel disks
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1445307
- Approximation schemes for generalized two-dimensional vector packing with application to data placement
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Algorithms for non-uniform size data placement on parallel disks
- Approximation algorithms for data placement in arbitrary networks
Cited in
(13)- Improved approximation algorithms for solving the squared metric k-facility location problem
- An improved approximation algorithm for squared metric \(k\)-facility location
- Data migration on parallel disks: Algorithms and evaluation
- New approximation results for resource replication problems
- General store placement for response time minimization in parallel disks
- scientific article; zbMATH DE number 2011855 (Why is no real title available?)
- The subset assignment problem for data placement in caches
- scientific article; zbMATH DE number 1445307 (Why is no real title available?)
- The hardness of cache conscious data placement
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Database Theory - ICDT 2005
- Algorithms for non-uniform size data placement on parallel disks
- Approximation schemes for generalized \(2\)-dimensional vector packing with application to data placement
This page was built for publication: Approximation algorithms for data placement on parallel disks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2930259)