An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Approximation algorithms for data placement on parallel disks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Web caching using access statistics
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On algorithms for efficient data migration
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for data placement in arbitrary networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Improved algorithms for the data placement problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Data migration to minimize the average completion time
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Polynominal time approximation schemes for class-constrained packing problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
An Experimental Study of Data Migration Algorithms
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Algorithms for Data Migration with Cloning
SIAM Journal on Computing
Graph Theory With Applications
Graph Theory With Applications
Algorithms for non-uniform size data placement on parallel disks
Journal of Algorithms
Combinatorial algorithms for data migration to minimize average completion time
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient and scalable data evolution with column oriented databases
Proceedings of the 14th International Conference on Extending Database Technology
SIAM Journal on Computing
Combinatorial algorithms for data migration to minimize average completion time
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Hi-index | 0.00 |
Our work is motivated by the need to manage data on a collection of storage devices to handle dynamically changing demand. As demand for data changes, the system needs to automatically respond to changes in demand for different data items. The problem of computing a migration plan among the storage devices is called the data migration problem. This problem was shown to be NP-hard, and an approximation algorithm achieving an approximation factor of 9.5 was presented for the half-duplex communication model in [Khuller, Kim and Wan: Algorithms for Data Migration with Cloning, SIAM J. on Computing, Vol. 33(2):448–461 (2004)]. In this paper we develop an improved approximation algorithm that gives a bound of 6.5+o(1) using various new ideas. In addition, we develop better algorithms using external disks and get an approximation factor of 4.5. We also consider the full duplex communication model and develop an improved bound of 4 +o(1) for this model, with no external disks.