Practically-self-stabilizing virtual synchrony

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

doi:10.1016/j.jcss.2018.04.003

Practically-self-stabilizing virtual synchrony

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

Research output: Contribution to journal › Article › peer-review

13 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 language	English
Pages (from-to)	50-73
Number of pages	24
Journal	Journal of Computer and System Sciences
Volume	96
DOIs	https://doi.org/10.1016/j.jcss.2018.04.003
State	Published - 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
Computer Networks and Communications
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.1016/j.jcss.2018.04.003

Cite this

@article{3088bb6f60e044dd8e43755f2e1ec3a3,

title = "Practically-self-stabilizing virtual synchrony",

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.",

keywords = "Practically unbounded counters, Practically-self-stabilization, State machine replication, Virtual Synchrony",

author = "Shlomi Dolev and Chryssis Georgiou and Ioannis Marcoullis and Schiller, \{Elad M.\}",

note = "Publisher Copyright: {\textcopyright} 2018 Elsevier Inc.",

year = "2018",

month = sep,

day = "1",

doi = "10.1016/j.jcss.2018.04.003",

language = "English",

volume = "96",

pages = "50--73",

journal = "Journal of Computer and System Sciences",

issn = "0022-0000",

publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - Practically-self-stabilizing virtual synchrony

AU - Dolev, Shlomi

AU - Georgiou, Chryssis

AU - Marcoullis, Ioannis

AU - Schiller, Elad M.

PY - 2018/9/1

Y1 - 2018/9/1

N2 - 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.

AB - 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.

KW - Practically unbounded counters

KW - Practically-self-stabilization

KW - State machine replication

KW - Virtual Synchrony

UR - https://www.scopus.com/pages/publications/85046168261

U2 - 10.1016/j.jcss.2018.04.003

DO - 10.1016/j.jcss.2018.04.003

M3 - Article

AN - SCOPUS:85046168261

SN - 0022-0000

VL - 96

SP - 50

EP - 73

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

ER -

Practically-self-stabilizing virtual synchrony

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this