@inproceedings{18912,
  abstract     = {{We consider Dynamic Page Migration (DPM) problem, one of the fundamental subproblems of data management in dynamically changing networks. We investigate a hybrid scenario, where access patterns to the shared object are dictated by an adversary, and each processor performs a random walk in X. We extend the previous results of [4]: we develop algorithms for the case where X is a ring, and prove that with high probability they achieve a competitive ratio of O~(min{D−−√4,n}), where D is the size of the shared object and n is the number of nodes in the network. These results hold also for any d-dimensional torus or mesh with diameter at least Ω~(D−−√).}},
  author       = {{Bienkowski, Marcin and Korzeniowski, Miroslaw}},
  booktitle    = {{Proc. of the European Conference in Parallel Processing (Euro-Par)}},
  isbn         = {{9783540287001}},
  issn         = {{0302-9743}},
  title        = {{{Dynamic Page Migration Under Brownian Motion}}},
  doi          = {{10.1007/11549468_105}},
  year         = {{2005}},
}