Recoverable Lock-Free Locks

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Attiya, Hagit, Fatourou, Panagiota, Kosmas, Eleftherios, Wei, Yuanhao
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866915666401951744
author Attiya, Hagit
Fatourou, Panagiota
Kosmas, Eleftherios
Wei, Yuanhao
author_facet Attiya, Hagit
Fatourou, Panagiota
Kosmas, Eleftherios
Wei, Yuanhao
contents This paper presents the first transformation that introduces both lock-freedom and recoverability. Our transformation starts with a lock-based implementation, and provides a recoverable, lock-free substitution to lock acquire and lock release operations. The transformation supports nested locks for generality and ensures recoverability without jeopardising the correctness of the lock-based implementation it is applied on.
format Preprint
id arxiv_https___arxiv_org_abs_2512_09710
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Recoverable Lock-Free Locks
Attiya, Hagit
Fatourou, Panagiota
Kosmas, Eleftherios
Wei, Yuanhao
Distributed, Parallel, and Cluster Computing
This paper presents the first transformation that introduces both lock-freedom and recoverability. Our transformation starts with a lock-based implementation, and provides a recoverable, lock-free substitution to lock acquire and lock release operations. The transformation supports nested locks for generality and ensures recoverability without jeopardising the correctness of the lock-based implementation it is applied on.
title Recoverable Lock-Free Locks
topic Distributed, Parallel, and Cluster Computing
url https://arxiv.org/abs/2512.09710