Optimal algorithms for page migration in dynamic networks

Marcin Bieńkowski, Jarosław Byrka, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide

Journal of Discrete Algorithms · 2008 · 10 citations · 16 references

DOIFull text

Open access

Concepts

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.

References

16