Skip to main content

An Efficient Distributed Termination

  • Chapter
Computer Science
  • 259 Accesses

Abstract

Detecting termination of a program is an important task in distributed computing systems. Wedescribe a method for detecting distributed termination, called SP - termination, whichhas certain advantages over the known methods: shorter time delays, better distribution of control messages over the communication network, suitability for concurrent job processing, higher reliability. This approach provides also an improvement for dynamic distributed systems.

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

Access this chapter

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

  • Apt, K.R., 1986, Corectness proofs of distributed termination algorithms, ACM TOPLAS 8: 388–405.

    Article  MATH  Google Scholar 

  • Cohen S., and Lehmann, D., 1982, Dynamic systems and their distributed termination, Proc. ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, Ottawa, 29–33.

    Google Scholar 

  • Dijkstra, E.W., Feijen, W.H.J., and van Gasteren, A.J.M., 1983, Derivation of a termination detection algorithm for distributed computations, Information Processing Letters 16: 217–219.

    Article  MathSciNet  Google Scholar 

  • Francez, N., 1980, Distributed termination, ACM TOPLAS 2:42–55.

    Article  MATH  Google Scholar 

  • Francez N., and Rodeh, M., 1982, Achieving distributed termination without freezing, IEEE Trans, on Software Engineering, SE-8: 287–292.

    Article  Google Scholar 

  • Gallaire H., Minker J., and Nicolas, J.-M., 1984, Logic and databases: a deductive approach, ACM Computing Surveys, 16: 153–186.

    Article  MathSciNet  MATH  Google Scholar 

  • Hoare, C.A.R., 1978, Communicating sequential processes, Comm. ACM 21: 666–677.

    Article  MATH  Google Scholar 

  • Lozinskii, E.L., 1986, A problem-oriented inferential database system, ACM TODS 11: 323–356.

    Article  MathSciNet  MATH  Google Scholar 

  • Misra, J., 1983, Detecting termination of distributed computations using markers, Proc. 2nd Annual ACM Symp. on Principles of Distributed Computing, Montreal, 290–294.

    Google Scholar 

  • Rana, S.R, 1983, A distributed solution of the distributed termination problem, Information Processing Letters 17: 43–46.

    Article  MathSciNet  MATH  Google Scholar 

  • Richier, J.L., 1984, Distributed termination in CSP: symmetric solutions with minimal storage, TR 84-49, Universite P. et M. Curie, Paris.

    Google Scholar 

  • Topor, R.W., 1984, Termination detection for distributed computations, Information Processing Letters, 18: 33–36.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer Science+Business Media New York

About this chapter

Cite this chapter

Lozinskii, E.L. (1992). An Efficient Distributed Termination. In: Baeza-Yates, R., Manber, U. (eds) Computer Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3422-8_28

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-3422-8_28

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-6513-6

  • Online ISBN: 978-1-4615-3422-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics