Improved results for data migration and open shop scheduling
ACM Transactions on Algorithms (TALG)
On generalized gossiping and broadcasting
Journal of Algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
On generalized gossiping and broadcasting
Journal of Algorithms
An efficient strategy for storing and searching binary trees in WORM external memory
Journal of Information Science
SIAM Journal on Computing
Improved algorithms for data migration
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
Energy-efficient data redistribution in sensor networks
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such high-demand storage servers are used as Web servers or as multimedia servers for handling high demand for data. As the system is running, it needs to dynamically respond to changes in demand for different data items. In this work we study the data migration problem, which arises when we need to quickly change one storage configuration into another. We show that this problem is NP-hard. In addition, we develop polynomial-time approximation algorithms for this problem and prove a worst-case bound of 9.5 on the approximation factor achieved by our algorithm.