Skip to main content
SpringerLink
Log in

The derivation of on-the-fly garbage collection algorithms from distributed termination detection protocols

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 87 (STACS 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 247))

Included in the following conference series:

Abstract

In this paper a close relation is worked out that exists between two distinct problems in the area of distributed computations, namely "on-the-fly" garbage collection and distributed termination detection. It is demonstrated how "on-the-fly" garbage collecting algorithms can be derived from termination detection protocols by applying a few standard transformations. Virtually all existing on-the-fly garbage collecting algorithms can be obtained in this way. Also some new, highly parallel garbage collecting algorithms are easily obtained in this way.

Extended abstract

The work of this author was supported by the Foundation for Computer Science of the Netherlands Organization for the Advancement of Pure Research (ZWO)

The work of this author was partially supported by a grant from the Netherlands Organization for the Advancement of Pure Research (ZWO).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

9. References

  1. M. Ben-Ari, Algorithms for on-the-fly garbage collection, ACM ToPLaS 6 (june 1984), pp. 333–344.

    Google Scholar 

  2. K.M. Chandy and J. Misra, A paradigm for detecting quiescence properties in distributed computations, In: K.R. Apt (ed), Logics and models of concurrent systems, Springer Verlag, pp 325–341.

    Google Scholar 

  3. J. Cohen, Garbage collection of linked datastructures, Comp. Surv. 13 (sept. 1981) pp. 341–367.

    Google Scholar 

  4. E.W. Dijkstra, On making solutions more and more fine-grained, EWD622, in: E.W. Dijkstra, Selected writings on computing, a personal perspective, Springer Verlag, Heidelberg 1982.

    Google Scholar 

  5. E.W. Dijkstra, W.H.J. Feijen and A.J.M. van Gasteren, Derivation of a termination detection algorithm for distributed computations, Inf. Proc. Lett. 16 (june 1983), pp. 217–219.

    Google Scholar 

  6. E.W. Dijkstra and C.S. Scholten, Termination detection for diffusing computations, Inf. Proc.Lett. 11 (aug. 1980), pp. 1–4.

    Google Scholar 

  7. E.W. Dijkstra, L. Lamport, A.J. Martin, C.S. Scholten and E.F.M. Steffens, On-the-fly garbage collection: An exercise in cooperation, Comm. ACM 21 (nov 1978), pp. 966–975.

    Google Scholar 

  8. P. Hudak, R.M. Keller, Garbage collection and task detection in distributive applicative processing systems, in: Proceedings of the ACM Symp. on LISP and functional programming, Pittsburg, 1982.

    Google Scholar 

  9. J. Hughes, A distributed garbage collection algorithm, in: J.P. Jouannaud (ed.), Functional Programming Languages and Computer Architecture, LNCS vol. 201, Springer Verlag, Heidelberg, 1985, pp. 256–272.

    Google Scholar 

  10. H.T. Kung and S.W. Song, An efficient parallel garbage collection system and its correctness proof, in: Proceedings 18th Annual IEEE Symp. on Found. of Comp. Sc., 1977, pp. 120–131.

    Google Scholar 

  11. N. Natarajan, A distributed scheme for detecting communication deadlock, IEEE Trans. on Softw. Eng. SE 12 (apr. 1986), pp. 531–537.

    Google Scholar 

  12. S.P. Rana, A distributed solution to the distributed termination problem, Inf. Proc. Lett. 17 (1983) pp. 43–46.

    Google Scholar 

  13. R.B. Tan and J. van Leeuwen, General symmetric distributed termination detection, Techn. Rep. RUU-CS-86-2, Dept. of Computer Science, University of Utrecht, 1986. (Submitted to Computers and Artificial Intelligence.)

    Google Scholar 

  14. G. Tel, R.B. Tan and J. van Leeuwen, Derivation of graph marking algorithms from distributed termination detection protocols, Techn. Report RUU-CS-86-11, Dept. of Computer Science, University of Utrecht, Utrecht, 1986. (Submitted for publication.)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Utrecht, P.O. Box 80.012, 3508 TA, Utrecht, The Netherlands

    Gerard Tel, Richard B. Tan & Jan van Leeuwen

  2. Dept. of Mathematics and Computer Science, University of Sciences & Arts of Oklahoma, 73018, Chickasha, OK, USA

    Richard B. Tan

Authors
  1. Gerard Tel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard B. Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jan van Leeuwen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Franz J. Brandenburg Guy Vidal-Naquet Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tel, G., Tan, R.B., van Leeuwen, J. (1987). The derivation of on-the-fly garbage collection algorithms from distributed termination detection protocols. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds) STACS 87. STACS 1987. Lecture Notes in Computer Science, vol 247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039626

Download citation

  • DOI: https://doi.org/10.1007/BFb0039626

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17219-2

  • Online ISBN: 978-3-540-47419-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation