On-the-fly garbage collection for several mutators
From MaRDI portal
Publication:1189858
DOI10.1007/BF02277666zbMath0744.68059MaRDI QIDQ1189858
Publication date: 27 September 1992
Published in: Distributed Computing (Search for Journal in Brave)
Theory of compilers and interpreters (68N20) Theory of operating systems (68N25) Distributed algorithms (68W15)
Related Items
Proof rules for recursive procedures ⋮ Wait-free linearization with an assertional proof ⋮ Wait-free concurrent memory management by Create and Read until Deletion (CaRuD) ⋮ Simple concurrent garbage collection almost without synchronization
Cites Work