Pragmatic primitives for non-blocking data structures

DOI10.1145/2484239.2484273zbMath1323.68256arXiv1712.06688OpenAlexW1971661928WikidataQ56587925 ScholiaQ56587925MaRDI QIDQ5176078

Trevor Brown, Eric Ruppert, Faith Ellen

Publication date: 2 March 2015

Published in: Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.06688

zbMATH Keywords

multisetnon-blockingload-link/store-conditional

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20) Distributed systems (68M14)

Related Items (4)

The amortized analysis of a non-blocking chromatic tree ⋮ Non-blocking Patricia tries with replace operations ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Pragmatic primitives for non-blocking data structures