On algorithms for efficient data migration

Authors:
Joseph Hall;Jason Hartline;Anna R. Karlin;Jared Saia;John Wilkes
Affiliations:
Department of Computer Science and Engineering, University of Washington, Seattle, WA;Department of Computer Science and Engineering, University of Washington, Seattle, WA;Department of Computer Science and Engineering, University of Washington, Seattle, WA;Department of Computer Science and Engineering, University of Washington, Seattle, WA;Hewlett-Packard Research Laboratories, Palo Alto, CA
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Citing 4
Cited 28

A better than “best possible” algorithm to edge color multigraphs

Journal of Algorithms
The placement optimization program: a practical solution to the disk file assignment problem

SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Dynamic file migration in distributed computer systems

Communications of the ACM
Approximation algorithms for data placement on parallel disks

SODA '00 Proceedings of the eleventh 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
An Experimental Study of Data Migration Algorithms

WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Algorithms for data migration with cloning

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Interprocessor Communication with Limited Memory

IEEE Transactions on Parallel and Distributed Systems
Efficient application migration under compiler guidance

LCTES '05 Proceedings of the 2005 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Data migration to minimize the total completion time

Journal of Algorithms
Efficient disk replacement and data migration algorithms for large disk subsystems

ACM Transactions on Storage (TOS)
Improved results for data migration and open shop scheduling

ACM Transactions on Algorithms (TALG)
On generalized gossiping and broadcasting

Journal of Algorithms
Virtual Machine Hosting for Networked Clusters: Building the Foundations for "Autonomic" Orchestration

VTDC '06 Proceedings of the 2nd International Workshop on Virtualization Technology in Distributed Computing
Adaptive local ratio

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Don't settle for less than the best: use optimization to make decisions

HOTOS'07 Proceedings of the 11th USENIX workshop on Hot topics in operating systems
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
Network-aware migration control and scheduling of differentiated virtual machine workloads

CLOUD '09 Proceedings of the 2009 ICSE Workshop on Software Engineering Challenges of Cloud Computing
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
On generalized gossiping and broadcasting

Journal of Algorithms
Adaptive Local Ratio

SIAM Journal on Computing
Walking toward moving goalposts: agile management for evolving systems

HotACI'06 Proceedings of the First international conference on Hot topics in autonomic computing
On a local protocol for concurrent file transfers

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
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
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
Use of HPC-Techniques for large-scale data migration

Euro-Par'11 Proceedings of the 2011 international conference on Parallel Processing
The Yahoo!: cloud datastore load balancer

Proceedings of the fourth international workshop on Cloud data management
A reliability optimization method for RAID-structured storage systems based on active data migration

Journal of Systems and Software
An empirical comparative study of decentralized load balancing algorithms in clustered storage environment

ICPCA/SWS'12 Proceedings of the 2012 international conference on Pervasive Computing and the Networked World
ColPack: Software for graph coloring and related problems in scientific computing

ACM Transactions on Mathematical Software (TOMS)
Editorial: Data migration: A theoretical perspective

Data & Knowledge Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The data migration problem is the problem of computing an efficient plan for moving data stored on devices in a network from one configuration to another. Load balancing or changing usage patterns could necessitate such a rearrangement of data. In this paper, we consider the case where the objects are fixed-size and the network is complete. The direct migration problem is closely related to edge-coloring. However, because there are space constraints on the devices, the problem is more complex. Our main results are polynomial time algorithms for finding a near-optimal migration plan in the presence of space constraints when a certain number of additional nodes is available as temporary storage, and a 3/2-approximation for the case where data must be migrated directly to its destination.