Distributed algorithms for dynamic replication of data
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Placement of Replicated Items in Distributed Databases
EDBT '88 Proceedings of the International Conference on Extending Database Technology: Advances in Database Technology
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Powers of graphs: A powerful approximation technique for bottleneck problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2
The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy
Distributed Computing
| Hi-index | 0.00 |
This paper studies the problem of the optimal placement of replicas in a network so that communications costs are minimized when a strict consistency policy is in effect. A READ ANYWRITE ALL policy is introduced, and the appropriate cost function is developed to measure the relative effectiveness of each choice of replica placement. The general problem is proven to be NP complete. An efficient polynomial-time dynamic programming algorithm is introduced for linear graphs. A zero-one linear programming solution is provided for the general problem, using the cost function introduced here. A parametric approach is taken to the problem in the situation in which all activities of each node are identical. This leads to the introduction of piecewise linear solutions to particular problems and the existence of an underlying enveloping curve for the problem.The approach taken to the problem here is to examine simple models to develop some understanding of the issues. This has led to a number of interesting and challenging mathematical questions.