The derivation of graph marking algorithms from distributed termination detection protocols

DOI10.1016/0167-6423(88)90024-XzbMATH Open0647.68031OpenAlexW2058841903MaRDI QIDQ1104744FDOQ1104744

Authors Gerard Tel, Richard B. Tan, J. Van Leeuwen

Publication date 1988

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(88)90024-x

zbMATH Keywords

concurrent garbage collectiondistributed termination detection protocolshighly parallel algorithmson-the-fly garbage collection

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of operating systems (68N25)

Recommendations

• scientific article; zbMATH DE number 3990849
• scientific article; zbMATH DE number 3997151
• On-the-fly garbage collection for several mutators
• scientific article; zbMATH DE number 2016070
• Algorithms for on-the-fly garbage collection

Cited in

(4)

• Concurrent garbage collection for concurrent rewriting
• scientific article; zbMATH DE number 3997151 (Why is no real title available?)
• scientific article; zbMATH DE number 3990849 (Why is no real title available?)
• Strong stable properties in distributed systems

This page was built for publication: The derivation of graph marking algorithms from distributed termination detection protocols

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