Applications of probabilistic quorums to iterative algorithms
Hyunyoung Lee, Jennifer Lundelius Welch · 2002
Presents a definition of a read-write register that sometimes returns out-of-date values, shows that the definition is implemented by the probabilistic quorum algorithm of D. Malkhi et al. (1997), and shows how to program with such registers using the framework of A. U/spl uml/resin and M. Dubois (1990). Consequently, existing iterative algorithms for an interesting class of problems (including finding shortest paths, constraint satisfaction and transitive closure) converge with high probability if executed in a system in which the shared data is implemented with registers satisfying the new definition. Furthermore, the algorithms in this framework inherit positive attributes concerning load and availability from the underlying register implementation. A monotone version of the new register definition is specified and implemented; it can provide improved expected convergence time and message complexity for iterative algorithms.