Concurrent garbage collection for concurrent rewriting

DOI10.1007/3-540-59200-8_53zbMATH Open1503.68084OpenAlexW1493587417MaRDI QIDQ5055825FDOQ5055825

Authors: Ilies Alouini 

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59200-8_53

Recommendations

• Adjunction for Garbage Collection with Application to Graph Rewriting
• Simple concurrent garbage collection almost without synchronization
• scientific article; zbMATH DE number 4043232
• The derivation of graph marking algorithms from distributed termination detection protocols

zbMATH Keywords

MIMD architecturesgraph rewritingconcurrent rewritingconcurrent garbage collection algorithms

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Title not available (Why is that?)
• Conditional rewriting logic as a unified model of concurrency
• An abstract concurrent machine for rewriting
• Algorithms for on-the-fly garbage collection
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• Adjunction for Garbage Collection with Application to Graph Rewriting
• Toward the concurrent implementation of computational systems
• Parallel graph rewriting on loosely coupled machine architectures
• Garbage Collection for Reversible Functional Languages
• A fully concurrent garbage collector for functional programs on multicore processors
• Garbage collection in shared-environment closure reducers: Space-efficient depth first copying using a tailored approach
• GC\(^{2}\): a generational conservative garbage collector for the ATERM library
• Lock-free atom garbage collection for multithreaded Prolog

This page was built for publication: Concurrent garbage collection for concurrent rewriting

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