2026-07-26T03:22:19Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:15804 2024-03-06T10:56:12Z ddc:004 open_access

Recoverable and Detectable Fetch&Add Nahum, Liad Attiya, Hagit Ben-Baruch, Ohad Hendler, Danny Multi-core algorithms persistent memory non-volatile memory The emergence of systems with non-volatile main memory (NVRAM) increases the need for persistent concurrent objects. Of specific interest are recoverable implementations that, in addition to being robust to crash-failures, are also detectable. Detectability ensures that upon recovery, it is possible to infer whether the failed operation took effect or not and, in the former case, obtain its response. This work presents two recoverable detectable Fetch&Add (FAA) algorithms that are self-implementations, i.e, use only a fetch&add base object, in addition to read/write registers. The algorithms target two different models for recovery: the global-crash model and the individual-crash model. In both algorithms, operations are wait-free when there are no crashes, but the recovery code may block if there are repeated failures. We also prove that in the individual-crash model, there is no implementation of recoverable and detectable FAA using only read, write and fetch&add primitives in which all operations, including recovery, are lock-free. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Liad Nahum and Hagit Attiya and Ohad Ben-Baruch and Danny Hendler 2022 Is Part Of LIPIcs, Volume 217, 25th International Conference on Principles of Distributed Systems (OPODIS 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.OPODIS.2021.29 urn:nbn:de:0030-drops-158043 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.29 eng https://creativecommons.org/licenses/by/4.0/legalcode