ACM Transactions on Programming Languages and Systems · 1993 · 71 citations · 24 references
ComputingComputer ScienceComputer SystemsAlgorithmsComputer ArchitectureDistributed SystemsDistributed ComputingGarbage CollectionTermination AnalysisDistributed Garbage CollectionGarbage Collection AlgorithmsMark-sweep Garbage CollectionReference CountingTermination DetectionTermination Proofs
It is shown that the termination detection problem for distributed computations can be modeled as an instance of the garbage collection problem. Consequently, algorithms for the termination detection problem are obtained by applying transformations to garbage collection algorithms. The transformation can be applied to collectors of the “mark-and-sweep” type as well as to reference-counting protocol of Lermen and Maurer, the weighted-reference-counting protocol, the local-reference-counting protocol, and Ben-Ari's mark-and-sweep collector into termination detection algorithms. Known termination detection algorithms as well as new variants are obtained.
24
K. Mani Chandy, Leslie Lamport · ACM Transactions on Computer Systems · 1985 · 2.4K citations · Full text
Edsger W. Dijkstra, Leslie Lamport, Alain J. Martin et al. · Communications of the ACM · 1978 · 559 citations · Full text
Distributed deadlock detection
K. Mani Chandy, Jayadev Misra, Laura M. Haas · ACM Transactions on Computer Systems · 1983 · 395 citations · Full text