Practically stabilizing SWMR atomic memory in message passing systems

Abstract : 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.
Complete list of metadatas

https://hal.sorbonne-universite.fr/hal-01123697
Contributor : Sébastien Tixeuil <>
Submitted on : Thursday, March 5, 2015 - 12:24:15 PM
Last modification on : Monday, July 22, 2019 - 11:38:09 AM

Identifiers

Citation

Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Potop-Butucaru, et al.. Practically stabilizing SWMR atomic memory in message passing systems. Journal of Computer and System Sciences, Elsevier, 2015, 81 (4), pp.692-701. ⟨10.1016/j.jcss.2014.11.014⟩. ⟨hal-01123697⟩

Share

Metrics

Record views

581