An interface to support lazy replicated file service

Abstract

The authors argue that, if they are going to assume low-sharing workloads, then it is possible to build more efficient implementations that provide the same (or stronger) semantics by making fullest use of the assumption. Accordingly, they take an extreme point on the spreading/searching tradeoff: the searcher is made responsible for all the work. Thus, spreading can be made asynchronous and hence very fast from the caller's viewpoint. They employ an important optimization to eliminate most of the searching work when there is little sharing. Their technique carries other advantages as well: simple and flexible recovery algorithms, and suitability for mobile computing.<>