Wait-free concurrent memory management by Create and Read until Deletion (CaRuD)

DOI10.1007/PL00008924zbMath1448.68112OpenAlexW2125230050MaRDI QIDQ5138347

Jan Friso Groote, Wim H. Hesselink

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

shared memoryconsensusconcurrent garbage collectionwait-freereference counting

Mathematics Subject Classification ID

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

Related Items (1)

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

Uses Software

• NQTHM
• GC

Cites Work

• On-the-fly garbage collection for several mutators
• An axiomatic proof technique for parallel programs
• Bounded delay for a free address
• Long-lived renaming made fast
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Wait-free concurrent memory management by Create and Read until Deletion (CaRuD)