Practically stabilizing SWMR atomic memory in message-passing systems

Practically stabilizing SWMR atomic memory in message-passing systems

A fault-tolerant and practically stabilizing simulation of an atomic register is presented. The simulation works in asynchronous message-passing systems, and allows a minority of processes to crash. The simulation stabilizes in a practically stabilizing manner, by reaching a long execution in which...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computer and system sciences 2015-06, Vol.81 (4), p.692-701
Hauptverfasser: Alon, Noga, Attiya, Hagit, Dolev, Shlomi, Dubois, Swan, Potop-Butucaru, Maria, Tixeuil, Sébastien
Format: Artikel
Sprache:eng
Schlagworte:
Combinatorial analysis
Computational Complexity
Computer Science
Computer simulation
Construction
Crashes
Data Structures and Algorithms
Distributed, Parallel, and Cluster Computing
Fault tolerance
Labels
Mathematical models
Message passing
Networking and Internet Architecture
Registers
Self-stabilization
Shared memory
Single writer multiple reader register
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A fault-tolerant and practically stabilizing simulation of an atomic register is presented. The simulation works in asynchronous message-passing systems, and allows a minority of processes to crash. The simulation stabilizes in a practically stabilizing manner, by reaching a long execution in which it runs correctly. A key element in the simulation is a new combinatorial construction of a bounded labeling scheme accommodating arbitrary labels, including those not generated by the scheme itself.
ISSN:0022-0000
1090-2724
DOI:10.1016/j.jcss.2014.11.014