Practically-self-stabilizing virtual synchrony
Artikel i vetenskaplig tidskrift, 2018

The virtual synchrony abstraction was proven to be extremely useful for asynchronous, large-scale, message-passing distributed systems. Self-stabilizing systems can automatically regain consistency after the occurrence of transient faults. We present the first practically-self-stabilizing virtual synchrony algorithm that uses a new counter algorithm that establishes an efficient practically unbounded counter, which in turn can be directly used for emulating a self-stabilizing Multiple-Writer Multiple-Reader (MWMR). Other self-stabilizing services include membership, multicast, and replicated state machine (RSM) emulation. As we base the latter on virtual synchrony, rather than consensus, the system can progress in more extreme asynchronous executions than consensus-based RSM emulations.

Practically-self-stabilization

State machine replication

Practically unbounded counters

Virtual Synchrony

Författare

Shlomi Dolev

Ben-Gurion University of the Negev

C. Georgiou

University of Cyprus

I. Marcoullis

University of Cyprus

Elad Schiller

Chalmers, Data- och informationsteknik, Nätverk och system

Journal of Computer and System Sciences

0022-0000 (ISSN) 1090-2724 (eISSN)

Vol. 96 50-73

Ämneskategorier

Datorteknik

Inbäddad systemteknik

Datorsystem

DOI

10.1016/j.jcss.2018.04.003