Amortized efficiency of list update and paging rules
Communications of the ACM
Self-adjusting binary search trees
Journal of the ACM (JACM)
HARMONIC is a 3–competitive for two servers
Theoretical Computer Science
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The Complexity of Multiterminal Cuts
SIAM Journal on Computing
Online tracking of mobile users
Journal of the ACM (JACM)
Improved randomized on-line algorithms for the list update problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An improved approximation algorithm for MULTIWAY CUT
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
The 3-server problem in the plane
Theoretical Computer Science
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
Page Migration with Limited Local Memory Capacity
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Page Migration Algorithms Using Work Functions
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
More on randomized on-line algorithms for caching
Theoretical Computer Science
Weak Adversaries for the k-Server Problem
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Competitive distributed file allocation
Information and Computation
Hi-index | 0.00 |
We study Distributed Object Migration using competitive analysis. The problem is motivated by distributed object-oriented computing, for which intelligent dynamic migration of (Java or other object-oriented) objects during runtime is important for efficient implementation on multiprocessor systems. In the online version of the problem, k mobile objects reside at n nodes of a network and they respond to a sequence of requests. Each request specifies two objects which have to communicate, and the algorithm has to decide whether to bring the objects together or not. We focus on the case of uniform networks with relatively large communication costs and show tight upper and lower bounds of k, for any network size n≥2. Our algorithm Timestamp uses a timestamp for each object, and we analyze it using an implicit potential function argument; the analysis is interesting in its own right, and may be applicable to a wider class of problems, but it doesn't seem to be widely used. This implicit potential function argument gives a simple and intuitive proof of the (suboptimal) competitive ratio of 2k−1, within a factor of 2 of the optimal deterministic competitive ratio. To show the optimal competitive ratio of k, we use an explicit, yet less intuitive, potential function.