Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.jda.2008.07.006 | J. Discrete Algorithms |
Keywords | Field | DocType |
dynamic network,classical data management subproblem,different node,randomized scenario,asymptotically optimal online algorithm,data management,both in deterministic and randomized scenarios. key words: online algorithms,optimal online algorithms for this problem,randomized algorithms,online algorithms,page migration,optimal algorithm,dynamic networks,online algorithm,randomized algorithm | Online algorithm,Randomized algorithm,Computer science,Theoretical computer science,Asymptotically optimal algorithm,Data management,Randomized algorithms as zero-sum games | Journal |
Volume | Issue | ISSN |
7 | 4 | Journal of Discrete Algorithms |
Citations | PageRank | References |
5 | 0.47 | 24 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marcin Bienkowski | 1 | 254 | 27.18 |
| Jaroslaw Byrka | 2 | 523 | 31.45 |
| Miroslaw Korzeniowski | 3 | 143 | 10.78 |
| Friedhelm Meyer auf der Heide | 4 | 1744 | 238.01 |