Wait-free concurrent memory management by create and read until deletion (CaRuD)

DOI10.1007/PL00008924MaRDI QIDQ5138347zbMATH OpenOpenAlexFDO

Authors W. H. Hesselink, Jan Friso Groote

Publication date 3 December 2020

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00008924

zbMATH Keywords

concurrent garbage collectionconsensusreference countingshared memorywait-free

Mathematics Subject Classification ID

Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Safe memory reclamation for dynamic lock-free objects using atomic reads and writes
• Bounded delay for a free address
• Atomic snapshots of shared memory
• Towards a practical snapshot algorithm
• Wait-free concurrent graph objects with dynamic traversals

Cites work

• An axiomatic proof technique for parallel programs
• Bounded delay for a free address
• scientific article; zbMATH DE number 193479 (Why is no real title available?)
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• scientific article; zbMATH DE number 1018876 (Why is no real title available?)
• Long-lived renaming made fast
• On-the-fly garbage collection for several mutators
• Progress under bounded fairness

Cited in

(1)

• A general lock-free algorithm using compare-and-swap

Describes a project that uses

Uses Software

• NQTHM
• GC

This page was built for publication: Wait-free concurrent memory management by create and read until deletion (CaRuD)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138347)