The derivation of graph marking algorithms from distributed termination detection protocols
- 30 April 1988
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 10 (2) , 107-137
- https://doi.org/10.1016/0167-6423(88)90024-x
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Correctness proofs of distributed termination algorithmsACM Transactions on Programming Languages and Systems, 1986
- A distributed scheme for detecting communication deadlocksIEEE Transactions on Software Engineering, 1986
- Algorithms for on-the-fly garbage collectionACM Transactions on Programming Languages and Systems, 1984
- A distributed solution of the distributed termination problemInformation Processing Letters, 1983
- Derivation of a termination detection algorithm for distributed computationsInformation Processing Letters, 1983
- Garbage Collection of Linked Data StructuresACM Computing Surveys, 1981
- Termination detection for diffusing computationsInformation Processing Letters, 1980
- Distributed TerminationACM Transactions on Programming Languages and Systems, 1980
- On-the-fly garbage collectionCommunications of the ACM, 1978
- An efficient machine-independent procedure for garbage collection in various list structuresCommunications of the ACM, 1967