Practically stabilizing SWMR atomic memory in message-passing systems

DOI10.1016/J.JCSS.2014.11.014zbMath1320.68042OpenAlexW2064241363WikidataQ56806110 ScholiaQ56806110MaRDI QIDQ2256720

Sébastien Tixeuil, Noga Alon, Swan Dubois, Hagit Attiya, Shlomi Dolev, Maria Gradinariu Potop-Butucaru

Publication date: 20 February 2015

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2014.11.014

zbMATH Keywords

message passingshared memoryself-stabilizationsingle writer multiple reader register

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (8)

\textit{Renaissance}: a self-stabilizing distributed SDN control plane using in-band communications ⋮ Practically-self-stabilizing virtual synchrony ⋮ Stabilizing data-link over non-FIFO channels with optimal fault-resilience ⋮ Self-stabilizing indulgent zero-degrading binary consensus ⋮ Preserving stabilization while \textit{practically} bounding state space using incorruptible partially synchronized clocks ⋮ Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks ⋮ Self-stabilizing Virtual Synchrony ⋮ Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanders: distributed spanning expanders
• Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
• Bounded time-stamps
• Self-stabilizing timestamps
• Stabilizing data-link over non-FIFO channels with optimal fault-resilience
• When consensus meets self-stabilization
• Resource Bounds for Self-Stabilizing Message-Driven Protocols
• Bounded Concurrent Time-Stamping
• Sharing memory robustly in message-passing systems
• The part-time parliament

This page was built for publication: Practically stabilizing SWMR atomic memory in message-passing systems