Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-85451-7_33 | Euro-Par |
Keywords | Field | DocType |
scheduling heuristics,formal model,data provision system,xoldto xnewin,access time,object popularity change,replica placement scheme,replica transfer,different scenario,replica migration problem,replica placement schemes xoldand,shortest time | Replica,Access time,Computer science,Parallel computing,Popularity,Theoretical computer science,Heuristics,Scheduling heuristics,Distributed computing | Conference |
Volume | ISSN | Citations |
5168 | 0302-9743 | 1 |
PageRank | References | Authors |
0.37 | 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 |