The limits of helping in non-volatile memory data structures
type: Item
instance of: scholarly article
title: The limits of helping in non-volatile memory data structures
zbMATH Open document ID: 1522.68058
DOI: 10.1007/978-3-031-21017-4_6
author: Ohad Ben-Baruch
author: Srivatsan Ravi
published in: Lecture Notes in Computer Science
publication date: 2023-06-12T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 7694569
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-031-21017-4 6
OpenAlex ID: W4312511045
cites work: Nontrivial and universal helping for wait-free queues and stacks
cites work: Q4398822
cites work: Robust shared objects for non-volatile main memory
cites work: Linearizable implementations do not suffice for randomized distributed computation
cites work: Q4436059
Recommended article: Robust shared objects for non-volatile main memory
Recommended article: Nesting-safe recoverable linearizability: modular constructions for non-volatile memory
Recommended article: Verifying correctness of persistent concurrent data structures: a sound and complete method
Recommended article: Strict linearizability and abstract atomicity
Recommended article: Recovering shared objects without stable storage
description: scientific article; zbMATH DE number 7694569