Group communication as a base for a load-balancing replicated data service
Roger I. Khazan · 1998
Abstract. We give a rigorous account of an algorithm that provides sequentially consistent replicated data on top of the view synchronous group communication service previously specied by Fekete, Lynch and Shvartsman. The algorithm performs updates at all members of a major-ity view, but rotates the work of queries among the members to equalize the load. The algorithm is presented and veried using I/O automata. 1