The derivation of distributed termination detection algorithms from garbage collection schemes

  • Gerard Tel
  • Friedemann Mattern
Submitted Presentations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 505)


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 garbage collectors. As an example, the scheme is used to transform the weighted reference counting protocol.


Termination Detection Garbage Collection Indicator Object Passive Process Garbage Collector 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Be89]
    Bevan, D.I., An Efficient Reference Counting Solution to the Distributed Garbage Collection Problem, Parallel Computing 9 (1989) 179–192.CrossRefGoogle Scholar
  2. [CL85]
    Chandy, K.M., L. Lamport, Distributed Snapshots: Determining Global States of Distributed Systems, ACM Trans. on Computer Systems 3 (1985) 45–56.Google Scholar
  3. [CMH83]
    Chandy, K.M., J. Misra, L.M. Haas, Distributed Deadlock Detection, ACM Trans. on Computer Systems 1 (1983) 144–156.CrossRefGoogle Scholar
  4. [Co60]
    Collins, G.E., A Method for Overlapping and Erasure of Lists, Comm. ACM 3 (1960) 655–657.CrossRefGoogle Scholar
  5. [DFG83]
    Dijkstra, E.W., W.H.J. Feijen, A.J.M. van Gasteren, Derivation of a Termination Detection Algorithm for Distributed Computations, Inf. Proc. Lett. 16 (1983) 217–219.CrossRefGoogle Scholar
  6. [Dij78]
    Dijkstra, E.W., L. Lamport, A.J. Martin, C.S. Scholten, E.F.M. Steffens, On-the-fly Garbage Collection: An Exercise in Cooperation, Comm. ACM 21 (1978) 966–975.CrossRefGoogle Scholar
  7. [DS80]
    Dijkstra, E.W., C.S. Scholten, Termination Detection for Diffusing Computations, Inf. Proc. Lett. 11 (1980) 1–4.CrossRefGoogle Scholar
  8. [LM86]
    Lermen, C.-W., D. Maurer, A Protocol for Distributed Reference Counting, ACM Conference on Lisp and Functional Programming, Cambridge, 1986, pp. 343–354.Google Scholar
  9. [Ma87]
    Mattern, F., Algorithms for Distributed Termination Detection, Distributed Computing 2 (1987) 161–175.CrossRefGoogle Scholar
  10. [Ma89]
    Mattern, F., Global Quiescence Detection Based on Credit Distribution and Recovery, Inf. Proc. Lett. 30 (1989) 195–200.CrossRefGoogle Scholar
  11. [McC60]
    McCarthy, J., Recursive Functions of Symbolic Expressions and Their Computation by Machine, Comm. ACM 3 (1960) 184–195.CrossRefGoogle Scholar
  12. [Ru90]
    Rudalics, M., Implementation of Distributed Reference Counts, Technical Report (forthcoming), Research Institute for Symbolic Computation, J. Kepler University, Linz, 1990.Google Scholar
  13. [SF86]
    Shavit, N., N. Francez, A New Approach to Detection of Locally Indicative Stability, in: L. Kott (ed.), Proceedings ICALP 1986, Lecture Notes in Computer Science 226, Springer-Verlag, 1986, pp. 344–358.Google Scholar
  14. [Te90]
    Tel, G., Total Algorithms, Technical Report RUU-CS-88-16, Dept. of Computer Science, Utrecht University, 1988. Also in: Algorithms Review 1 (1990) 13–42.Google Scholar
  15. [TM90]
    Tel, G., F. Mattern, The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes, Technical Report RUU-CS-90-24, Dept. of Computer Science, Utrecht University, 1990.Google Scholar
  16. [TTL88]
    Tel, G., R.B. Tan, J. van Leeuwen, The Derivation of Graph Marking Algorithms for Distributed Termination Detection Protocols, Science of Computer Programming 10 (1988) 107–137.CrossRefGoogle Scholar
  17. [WW87]
    Watson, P., I. Watson, An Efficient Garbage Collection Scheme for Parallel Computer Architectures, in: J.W. de Bakker, A.J. Nijman, P.C. Treleaven (eds.), Proceedings Parallel Architectures and Languages Europe, vol. II, Lecture Notes in Computer Science 259, Springer-Verlag, 1987, pp. 432–443.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Gerard Tel
    • 1
  • Friedemann Mattern
    • 2
  1. 1.Department of Computer ScienceUtrecht UniversityUtrechtThe Netherlands
  2. 2.Department of Computer ScienceKaiserslautern UniversityKaiserslauternFed. Rep. Germany

Personalised recommendations