Practically-self-stabilizing virtual synchrony

Shlomi Dolev, Chryssis Georgiou, Ioannis Marcoullis, Elad M. Schiller

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)50-73
Number of pages24
JournalJournal of Computer and System Sciences
Volume96
DOIs
StatePublished - 1 Sep 2018

Keywords

  • Practically unbounded counters
  • Practically-self-stabilization
  • State machine replication
  • Virtual Synchrony

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science
  • Applied Mathematics
  • Computer Networks and Communications
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'Practically-self-stabilizing virtual synchrony'. Together they form a unique fingerprint.

Cite this