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
Competitive algorithms for distributed data management (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Randomized algorithms
Convergence rates for Markov chains
SIAM Review
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
A new average case analysis for completion time scheduling
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Page Migration Algorithms Using Work Functions
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Developments from a June 1996 seminar on Online algorithms: the state of the art
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm
FOCS '03 Proceedings of the 44th Annual IEEE 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
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
Improved algorithms for dynamic page migration
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D, which is stored in one of the processors. During runtime, processors access unit size data items from the page, and the system is allowed to move the page from one processor to another in order to minimize the total communication cost.This problem was considered in the online setting numerous times by many researchers, and some online algorithms were proven to achieve a cost within a constant factor of the optimal offline solution. However, all results were achieved under the assumption that the communication costs between processors were fixed during the execution of the whole process.In this paper we consider a model in which the communication costs can change in each time step, but the pace of the changes is restricted. This is typical in mobile networks, and also models the dynamics of networks that are not exclusively dedicated to the page migration.If both changes of the network and the request sequence are given by some adversarial entity, we prove a tight bound on the competitive ratio of the problem. However, the size of this ratio motivates us to assume that the changes of communication costs are modeled by some stochastic process, and an adversary dictates only which processor issues a request. To analyze such a hybrid case, we introduce the notion of expected competitive ratio and prove that, for the case where constant number of processors perform a random walk on a torus or on a mesh of diameter √D, it is O(log2 D).