License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.OPODIS.2021.29
URN: urn:nbn:de:0030-drops-158043
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/15804/
Go to the corresponding LIPIcs Volume Portal

Nahum, Liad ; Attiya, Hagit ; Ben-Baruch, Ohad ; Hendler, Danny

Recoverable and Detectable Fetch&Add

pdf-format:
LIPIcs-OPODIS-2021-29.pdf (0.8 MB)

Abstract

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.

BibTeX - Entry

@InProceedings{nahum_et_al:LIPIcs.OPODIS.2021.29,
  author =	{Nahum, Liad and Attiya, Hagit and Ben-Baruch, Ohad and Hendler, Danny},
  title =	{{Recoverable and Detectable Fetch\&Add}},
  booktitle =	{25th International Conference on Principles of Distributed Systems (OPODIS 2021)},
  pages =	{29:1--29:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-219-8},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{217},
  editor =	{Bramas, Quentin and Gramoli, Vincent and Milani, Alessia},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2022/15804},
  URN =		{urn:nbn:de:0030-drops-158043},
  doi =		{10.4230/LIPIcs.OPODIS.2021.29},
  annote =	{Keywords: Multi-core algorithms, persistent memory, non-volatile memory}
}

Keywords: Multi-core algorithms, persistent memory, non-volatile memory
Collection: 25th International Conference on Principles of Distributed Systems (OPODIS 2021)
Issue Date: 2022
Date of publication: 28.02.2022

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI