Optimal algorithms for page migration in dynamic networks

M. Bienkowski; J. Byrka; M. Korzeniowski; F. Meyer auf der Heide

doi:10.1016/j.jda.2008.07.006

Optimal algorithms for page migration in dynamic networks

M. Bienkowski
, J. Byrka
, M. Korzeniowski
, F. Meyer auf der Heide

Research output: Contribution to journal › Article › Academic › peer-review

9 Citations (Scopus)

3 Downloads (Pure)

Abstract

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.

Original language	English
Pages (from-to)	545-569
Journal	Journal of Discrete Algorithms
Volume	7
Issue number	4
DOIs	https://doi.org/10.1016/j.jda.2008.07.006
Publication status	Published - 2009

Access to Document

10.1016/j.jda.2008.07.006

Cite this

@article{4ed9881298444c498cba62a8079e2478,

title = "Optimal algorithms for page migration in dynamic networks",

abstract = "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.",

author = "M. Bienkowski and J. Byrka and M. Korzeniowski and \{Meyer auf der Heide\}, F.",

year = "2009",

doi = "10.1016/j.jda.2008.07.006",

language = "English",

volume = "7",

pages = "545--569",

journal = "Journal of Discrete Algorithms",

issn = "1570-8667",

publisher = "Elsevier",

number = "4",

}

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 -

Optimal algorithms for page migration in dynamic networks

Abstract

Access to Document

Fingerprint

Cite this