On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Data management in networks: experimental evaluation of a provably good strategy
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
On-Line Distributed Data Management
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Exploiting Locality for Data Management in Systems of Limited Bandwidth
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Caching in networks (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Data management in hierarchical bus networks
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Approximation algorithms for data management in networks
Proceedings of the thirteenth annual ACM symposium on Parallel 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
Page migration in dynamic networks
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.02 |
This paper deals with the on-line allocation of shared data objects to the local memory modules of the nodes in a network. We assume that the data is organized in indivisible objects such as files, pages, or global variables. The data objects can be replicated and discarded over time in order to minimize the communication load for read and write accesses done by the nodes in the network. Non-uniform data management is characterized by a different communication load for accesses to small pieces of the data objects and migrations of whole data objects.We introduce on-line algorithms that minimize the congestion, i.e., the maximum communication load over all links. Our algorithms are evaluated in a competitive analysis comparing the congestion produced by an on-line algorithm with the congestion produced by an optimal off-line algorithm.We present the first deterministic and distributed algorithm that achieves a constant competitive ratio on trees. Our algorithm minimizes not only the congestion but minimizes simultaneously the load on each individual edge up to a optimal factor of 3.Algorithms for trees are of special interest as they can be used as a subroutine in algorithms for other networks. For example, using our tree algorithm as a subroutine in the recently introduced "access tree strategy" yields an algorithm that is O(d 驴 logn)-competitive for d-dimensional meshes with n nodes. This competitive ratio is known to be optimal for meshes of constant dimension.