EFFICIENT SOLUTIONS TO THE REPLICATED LOG AND DICTIONARY PROBLEMS*.

Abstract

We propose efficient algorithms to maintain a replicated dictionary using a log in an unreliable network. A nonserializable approach is used to achieve high concurrency. The solutions are resilient to both node and communications failures. Optimizations are developed for networks which are not completely connected.