Amortized efficiency of list update and paging rules
Communications of the ACM
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Journal of Algorithms
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
On page migration and other relaxed task systems
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Page Migration Algorithms Using Work Functions
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Fighting against two adversaries: page migration in dynamic networks
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Dynamic page migration with stochastic requests
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
ACM SIGACT News
Power-aware online file allocation in mobile ad hoc networks: [extended abstract]
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Optimal algorithms for page migration in dynamic networks
Journal of Discrete Algorithms
Bucket game with applications to set multicover and dynamic page migration
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Page migration in dynamic networks
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Dynamic page migration under brownian motion
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Hi-index | 0.00 |
The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can both access a unit of data from the page and move with a constant speed, thus changing the costs of communication. The problem is to compute online a schedule of page movements to minimize the total communication cost. In this paper we construct and analyze the first deterministic algorithm for this problem. We prove that it achieves an (up to a constant factor) optimal competitive ratio $\mathcal{O}(n\cdot\sqrt{D})$. We show that the randomization of this algorithm improves this ratio to $\mathcal{O}(\sqrt{D}\cdot {\rm log} n)$ (against an oblivious adversary). This substantially improves an $\mathcal{O}(n\cdot\sqrt{D})$ upper bound from [4]. We also give an almost matching lower bound of $\Omega(\sqrt{D}\cdot\sqrt{{\rm log} n})$ for this problem.