Formal Model and Scheduling Heuristics for the Replica Migration Problem

Authors:
Nikos Tziritas;Thanasis Loukopoulos;Petros Lampsas;Spyros Lalis
Affiliations:
Dept. of Computer and Communication Engineering, University of Thessaly, Volos, Greece 38221;Dept. of Computer and Communication Engineering, University of Thessaly, Volos, Greece 38221;Dept. of Informatics and Computer Technology, Technological Educational Institute (TEI) of Lamia, Lamia, Greece 35100;Dept. of Computer and Communication Engineering, University of Thessaly, Volos, Greece 38221
Venue:
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Year:
2008

Citing 5
Cited 1

On algorithms for efficient data migration

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for data migration with cloning

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Brief announcement: the overlay network content distribution problem

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Continuous Replica Placement schemes in distributed systems

Proceedings of the 19th annual international conference on Supercomputing
Distributed Selfish Replication

IEEE Transactions on Parallel and Distributed Systems

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Replication of the most popular objects is often used in distributed data provision systems to reduce access time and improve availability. In fact, a given replica placement scheme may have to be redefined as object popularity changes. Given two replica placement schemes Xoldand Xnew, the Replica Migration Problem (RMP) is to compute a schedule of replica transfers and deletions that lead from Xoldto Xnewin the shortest time possible. In this paper, we provide a rigorous problem formulation and prove that even for trivial cases RMP is intractable. We also propose a set of heuristics and evaluate them for different scenarios using simulations.