Name
Title | ||
|---|---|---|
Using Multicast Transfers in the Replica Migration Problem: Formulation and Scheduling Heuristics |
Abstract | ||
|---|---|---|
Performing replica migrations in the minimum possible time, also called the Replica Migration Problem (RMP), is crucial in distributed systems using replication. In this paper we tackle RMP when multicast transfers are available. We give a formal problem statement as a Mixed Integer Programming problem. It turns out that the problem is NP-hard. Therefore, we resolve to scheduling heuristics in order to find good solutions. Through simulations we identify different tradeoffs between performance and execution time and conclude on the most attractive approaches. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-03869-3_24 | Euro-Par |
Keywords | Field | DocType |
scheduling heuristics,multicast transfers,minimum possible time,execution time,attractive approach,multicast transfer,good solution,replica migration,formal problem statement,mixed integer programming problem,replica migration problem,different tradeoffs,distributed system | Replica,Steiner tree problem,Computer science,Parallel computing,Problem statement,Scheduling heuristics,Integer programming,Execution time,Multicast,Distributed computing | Conference |
Volume | ISSN | Citations |
5704 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 9 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nikos Tziritas | 1 | 230 | 21.85 |
| Thanasis Loukopoulos | 2 | 293 | 30.66 |
| Petros Lampsas | 3 | 85 | 9.10 |
| Spyros Lalis | 4 | 208 | 35.55 |