On the 1.1 edge-coloring of multigraphs
SIAM Journal on Discrete Mathematics
Set to set broadcasting in communication networks
Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Optimal sequential gossiping by short messages
Discrete Applied Mathematics
Approximation algorithms for data placement on parallel disks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance
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
Fast Gossiping by Short Messages
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Graph Theory With Applications
Graph Theory With Applications
Efficient disk replacement and data migration algorithms for large disk subsystems
ACM Transactions on Storage (TOS)
Workload-based generation of administrator hints for optimizing database storage utilization
ACM Transactions on Storage (TOS)
Formal Model and Scheduling Heuristics for the Replica Migration Problem
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Self-tuning management of update-intensive multidimensional data in clusters of workstations
The VLDB Journal — The International Journal on Very Large Data Bases
Using Multicast Transfers in the Replica Migration Problem: Formulation and Scheduling Heuristics
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
FDTM: block level data migration policy in tiered storage system
NPC'10 Proceedings of the 2010 IFIP international conference on Network and parallel computing
Differentiated storage services
ACM SIGOPS Operating Systems Review
Efficient and scalable data evolution with column oriented databases
Proceedings of the 14th International Conference on Extending Database Technology
On a local protocol for concurrent file transfers
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Differentiated storage services
SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
Minimal cost reconfiguration of data placement in storage area network
WAOA'09 Proceedings of the 7th international conference on Approximation and Online 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
Mobile learning support with statistical inference-based cache management
ICWL'07 Proceedings of the 6th international conference on Advances in web based learning
Minimal cost reconfiguration of data placement in a storage area network
Theoretical Computer Science
A reliability optimization method for RAID-structured storage systems based on active data migration
Journal of Systems and Software
| 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 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. We also compare the algorithm to several heuristics for this problem.