Concurrent cycle collection in reference counted systems

DOI10.1007/3-540-45337-7_12MaRDI QIDQ2779246zbMATH OpenFDO

Authors David Francis Bacon, V. T. Rajan

Publication date 15 April 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2072/20720207

Mathematics Subject Classification ID

Theory of programming languages (68N15) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Computing methodologies and applications (68U99)

Recommendations

• An efficient approach to cyclic reference counting based on a coarse-grained search
• Cyclic reference counting
• Cyclic reference counting with local mark-scan
• Cyclic reference counting with lazy mark-scan
• New Algorithms and Applications of Cyclic Reference Counting

Cited in

(16)

• Cyclic reference counting with lazy mark-scan
• Generational cyclic reference counting
• Optimal real-time garbage collection for acyclic pointer structures
• An efficient approach to cyclic reference counting based on a coarse-grained search
• The space cost of lazy reference counting
• New Algorithms and Applications of Cyclic Reference Counting
• Verifying Reference Counting Implementations
• An efficient multi-processor architecture for parallel cyclic reference counting
• Integrating generations with advanced reference counting garbage collectors
• Sapphire: copying garbage collection without stopping the world
• Collecting cyclic distributed garbage by controlled migration
• Lock-free reference counting
• Simple concurrent garbage collection almost without synchronization
• Stop-and-copy and one-bit reference counting
• Cyclic reference counting with local mark-scan
• Cyclic reference counting

This page was built for publication: Concurrent cycle collection in reference counted systems

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