TY - JOUR
T1 - Optimal algorithms for page migration in dynamic networks
AU - Bienkowski, M.
AU - Byrka, J.
AU - Korzeniowski, M.
AU - Meyer auf der Heide, F.
PY - 2009
Y1 - 2009
N2 - We present an extension of a classical data management subproblem, the page migration. The problem is investigated in dynamic networks, where costs of communication between different nodes may change with time. We construct asymptotically optimal online algorithms for this problem, both in deterministic and randomized scenarios.
AB - We present an extension of a classical data management subproblem, the page migration. The problem is investigated in dynamic networks, where costs of communication between different nodes may change with time. We construct asymptotically optimal online algorithms for this problem, both in deterministic and randomized scenarios.
U2 - 10.1016/j.jda.2008.07.006
DO - 10.1016/j.jda.2008.07.006
M3 - Article
SN - 1570-8667
VL - 7
SP - 545
EP - 569
JO - Journal of Discrete Algorithms
JF - Journal of Discrete Algorithms
IS - 4
ER -