Dynamic page migration under brownian motion

  • Authors:
  • Marcin Bienkowski;Miroslaw Korzeniowski

  • Affiliations:
  • International Graduate School of Dynamic Intelligent Systems, University of Paderborn, Germany;International Graduate School of Dynamic Intelligent Systems, University of Paderborn, Germany

  • Venue:
  • Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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 $\mathcal{X}$. We extend the previous results of [4]: we develop algorithms for the case where $\mathcal{X}$ is a ring, and prove that with high probability they achieve a competitive ratio of $\tilde{\mathcal{O}} (\min \{ \sqrt[4]{D}, 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 $\tilde{\Omega}(\sqrt{D})$.