Skip to main content
SpringerLink
Log in
Book cover

International Conference on Parallel Architectures and Languages Europe

PARLE 1992: PARLE '92 Parallel Architectures and Languages Europe pp 363–378Cite as

Distributed termination enforcement

  • Conference paper
  • First Online:

  • 127 Accesses

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

Abstract

A distributed termination enforcement algorithm should be capable of solving two problems simultaneously: (i) Assure that all activities of an underlying computation terminate and (ii) report their eventual termination. In this paper we derive a simple termination enforcement algorithm from a well-known termination detector due to Dijkstra and Scholten. The resulting algorithm does not require a separate reset phase and is suitable for repeated execution on distributed systems with completely asynchronous communication. Applications of the algorithm include stopping of indefinitely excecuting computations, orphan detection, and the reclamation of irrelevant speculative computations.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baker, H.G., and Hewitt, C. The incremental garbage collection of processes. A.I. Memo 454, M.I.T., Cambridge, MA, Dec. 1977.

    Google Scholar 

  2. Burton, F.W. Controlling speculative computation in a parallel functional programming language. In: Proc. 5th Int'l Conf. on Distributed Computing Systems, Denver, CO, IEEE Comp. Soc. Press, May 1985, 453–458.

    Google Scholar 

  3. Chandy, K.M., and Lamport, L. Distributed snapshots: Determining global states of distributed systems. ACM TOPLAS 3, 1 (Feb. 1985), 63–75.

    Google Scholar 

  4. Chandy, K.M., and Misra, J. Parallel Program Design: A Foundation. Addison-Wesley, Reading, MA, 1988.

    Google Scholar 

  5. Ciepielewski, A., and Haridi, S. Control of activities in the or-parallel token machine. In: Proc. IEEE 1984 Int'l Symp. on Logic Programming, IEEE, 1984, 49–57.

    Google Scholar 

  6. Dijkstra, E.W., and Scholten, C.S. Termination detection for diffusing computations. Information Processing Letters 11, 1 (Aug. 1980), 1–4.

    Article  Google Scholar 

  7. Francez, N., and Forman, I.R. Superimposition for interacting processes. MCC Tech. Rep. STP-124-90, Microelectronics and Computer Technology Corp., Austin, TX, April 1990. Also in: Proc. CONCUR' 90, Amsterdam, Aug. 1990.

    Google Scholar 

  8. Grit, D.H., and Page, R.L. Deleting irrelevant tasks in an expression-oriented multiprocessor system. ACM TOPLAS 3, 1 (Jan. 1981), 49–59.

    Article  Google Scholar 

  9. Hudak, P. Distributed task and memory management. In: Proc. Symp. on Principles of Distributed Computing, N.A. Lynch (ed.), ACM, Aug. 1983, 277–289.

    Google Scholar 

  10. Liskov, B., Scheifler, R., Walker, E., and Weihl, W. Orphan detection. Programming Methodology Group Memo 53, M.I.T., Lab. for Comp. Sci., Cambridge, MA, Feb. 1987.

    Google Scholar 

  11. Mattern, F. Algorithms for distributed termination detection. Distributed Computing 2, 4 (1987), 161–175.

    Article  Google Scholar 

  12. Mattern, F. Global quiescence detection based on credit distribution and recovery. Information Processing Letters 30, 4 (Feb. 1989), 195–200.

    Article  Google Scholar 

  13. Peyton-Jones, S.L. The Implementation of Functional Programming Languages. Prentice-Hall, Englewoods Cliffs, No., 1987.

    Google Scholar 

  14. Rokusawa, K., Ichiyoshi, N., Chikayama, T., and Kakashima, H. An efficient termination detection and abortion algorithm for distributed processing systems. In: Proc. 1988 Int'l Conf. on Parallel Processing, 1988, 18–22.

    Google Scholar 

  15. Rudalics, M. Multiprocessor list memory management. Ph.D. Thesis, RJSC-Linz Series 88-87.0, Res. Inst. for Symbolic Computation, Johannes Kepler Univ., Linz, Dec. 1988.

    Google Scholar 

  16. Rudalics, M. Recursive distributed termination detection. To appear.

    Google Scholar 

  17. Shavit, N., and Francez, N. A new approach to detection of locally indicative stability. In: Proc. ICALP 1986, L. Kott (ed.), LNCS 226, Springer-Verlag, 1986, 344–358.

    Google Scholar 

  18. Tel, G. Topics in Distributed Algorithms. Cambridge Int'l Series on Parallel Computation, Cambridge Univ. Press, Cambridge, UK, 1991.

    Google Scholar 

  19. Tel, G., and Mattern, F. The derivation of distributed termination detection algorithms from garbage collection schemes. In: Proc. PARLE '91, LNCS 505, Vol. 1, Springer-Verlag, 1991, 137–149.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Symbolic Computation, Johannes Kepler Universität, A-4040, Linz, Austria

    Martin Rudalics

Authors
  1. Martin Rudalics
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Daniel Etiemble Jean-Claude Syre

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rudalics, M. (1992). Distributed termination enforcement. In: Etiemble, D., Syre, JC. (eds) PARLE '92 Parallel Architectures and Languages Europe. PARLE 1992. Lecture Notes in Computer Science, vol 605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55599-4_99

Download citation

  • DOI: https://doi.org/10.1007/3-540-55599-4_99

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55599-5

  • Online ISBN: 978-3-540-47250-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation