Skip to main content
SpringerLink
Log in

The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes (Extended Abstract)

  • Conference paper
Parle ’91 Parallel Architectures and Languages Europe

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

Abstract

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.

The work of this author was supported by the ESPRIT II Basic Research Actions Program of the EC under contract no. 3075 (project ALCOM).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bevan, D.I., An Efficient Reference Counting Solution to the Distributed Garbage Collection Problem, Parallel Computing 9 (1989) 179–192.

    Article  Google Scholar 

  2. Chandy, K.M., L. Lamport, Distributed Snapshots: Determining Global States of Distributed Systems, ACM Trans. on Computer Systems 3 (1985) 45–56.

    Article  Google Scholar 

  3. Chandy, K.M., J.. Misra, L.M. Haas, Distributed Deadlock Detection, ACM Trans. on Computer Systems 1 (1983) 144–156.

    Article  Google Scholar 

  4. Collins, G.E., A Method for Overlapping and Erasure of Lists, Comm. ACM 3 (1960) 655–657.

    Article  MathSciNet  Google Scholar 

  5. 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.

    Article  Google Scholar 

  6. Dijkstra, E.W., L. Lamport, A.J. Martin, C.S. Scholten, E.F.M. Steffens, Onthe—fly Garbage Collection: An Exercise in Cooperation, Comm. ACM 21 (1978) 966–975.

    Article  Google Scholar 

  7. 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 

  8. Mattem, F., Algorithms for Distributed Termination Detection, Distributed Computing 2 (1987) 161–175.

    Article  Google Scholar 

  9. Mattem, F., Global Quiescence Detection Based on Credit Distribution and Recovery, Inf. Proc. Lett. 30 (1989) 195–200.

    Article  Google Scholar 

  10. McCarthy, J., Recursive Functions of Symbolic Expressions and Their Computation by Machine, Comm. ACM 3 (1960) 184–195.

    Article  Google Scholar 

  11. Rudalics, M., Implementation of Distributed Reference Counts, Technical Report (forthcoming), Research Institute for Symbolic Computation, J. Kepler University, Linz, 1990.

    Google Scholar 

  12. Shavit, N., N. Francez, A New Approach to Detection of Locally Indicative Stabilityin: L. Kott (ed.) Proceedings ICALP 1986Lecture Notes in Computer Science 226, Springer—Verlag, 1986, pp. 344–358.

    Google Scholar 

  13. 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 

  14. Tel, G., F. Mattem, The Derivation of Distributed Termination Detection Algorithms from Garbage Collection SchemesTechnical Report RUU—CS-90–24, Dept. of Computer Science, Utrecht University, 1990.

    Google Scholar 

  15. Tel, G., R.B. Tan, J. van Leeuwen, The Derivation of Graph Marking Algorithms from Distributed Termination Detection ProtocolsScience of Computer Programming 10 (1988) 107–137.

    Google Scholar 

  16. 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 

  17. Dijkstra, E.W., C.S. Scholten, Termination Detection for Diffusing Computations, Inf. Proc. Lett. 11 (1980) 1–4.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands

    Gerard Tel

  2. Department of Computer Science, Kaiserslautern University, P.O. Box 3049, D 6750, Kaiserslautern, Fed. Rep. Germany

    Friedemann Mattern

Authors
  1. Gerard Tel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Friedemann Mattern
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Philips Research Laboratories, P.O. Box 80.000, 5600 JA, Eindhoven, The Netherlands

    Emile H. L. Aarts

  2. Department of Computer Science, University of Utrecht, Padualaan 14, 3584 CH, Utrecht, The Netherlands

    Jan van Leeuwen

  3. Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Martin Rem

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tel, G., Mattern, F. (1991). The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes (Extended Abstract). In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds) Parle ’91 Parallel Architectures and Languages Europe. Lecture Notes in Computer Science, vol 505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-25209-3_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-25209-3_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-23206-4

  • Online ISBN: 978-3-662-25209-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation