Robust, distributed references and acyclic garbage collection

DOI10.1145/135419.135448zbMATH Open1369.68057OpenAlexW2000475900MaRDI QIDQ5348845

Marc Shapiro, David Plainfossé, Peter Dickman

Publication date: 21 August 2017

Published in: Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/135419.135448

Mathematics Subject Classification ID

Data structures (68P05) Distributed systems (68M14)

Related Items (3)

An efficient reference counting solution to the distributed garbage collection problem ⋮ Using bisimulation proof techniques for the analysis of distributed abstract machines ⋮ Tree rerooting in distributed garbage collection: Implementation and performance Evaluation

This page was built for publication: Robust, distributed references and acyclic garbage collection

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