Dynamic view-oriented group communication service

View-oriented group communication services are widely used for fault-tolerant distributed computing. For applications involving coherent data, it is important to know when a process has a primary view of the current group membership, usually defined as a view containing a majority out of a static universe of processes. For high availability in a system where processes can join and leave routinely, some researchers have suggested defining primary views dynamically, depending on having enough members in common with recent views. We present a new formal automaton specification, DVS, for the safety guarantees made by a practical group communication service providing a dynamic notion of primary view. We demonstrate the value of DVS by showing both how it can be implemented and how it can be used in an application. First, we present a distributed algorithm based on a group membership algorithm of Lotem, Keidar and Dolev; our version integrates communication with the membership service, uses information from the application processes saying when a view has been prepared for computation by the application, and uses a static view-oriented service internally. We prove that this algorithm implements DVS. Second, we present an application algorithm that is a variant of an algorithm of Amir, Dolev, Keidar, Melliar-Smith and Moser, modified to use DVS instead of a static service. We prove that it implements a (non-group-oriented) totally-ordered-broadcast service.