Improved approximation algorithms for data migration
From MaRDI portal
Recommendations
Cites work
- A Theorem on Coloring the Lines of a Network
- Algorithms - ESA 2003
- Algorithms for Data Migration with Cloning
- Algorithms for non-uniform size data placement on parallel disks
- An approximation algorithm for the generalized assignment problem
- Approximation algorithms for data placement in arbitrary networks
- Bounds on Multiprocessing Timing Anomalies
- Combinatorial algorithms for data migration to minimize average completion time
- Data migration on parallel disks: Algorithms and evaluation
- Graph theory with applications
- scientific article; zbMATH DE number 1670546 (Why is no real title available?)
- scientific article; zbMATH DE number 2079326 (Why is no real title available?)
- scientific article; zbMATH DE number 1848399 (Why is no real title available?)
- scientific article; zbMATH DE number 2119650 (Why is no real title available?)
- scientific article; zbMATH DE number 1445307 (Why is no real title available?)
- On algorithms for efficient data migration
- On two class-constrained versions of the multiple knapsack problem
- The load rebalancing problem
- Web caching using access statistics
Cited in
(10)- Combinatorial algorithms for data migration to minimize average completion time
- Data migration on parallel disks: Algorithms and evaluation
- Algorithms for data migration
- Dynamic data migration for structured AMR solvers
- On algorithms for efficient data migration
- Proactive Data Migration for Improved Storage Availability in Large-Scale Data Centers
- Improved Algorithms for Data Migration
- Algorithms for Data Migration with Cloning
- Dynamic Beats Fixed
- Automata, Languages and Programming
This page was built for publication: Improved approximation algorithms for data migration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2429330)