Skip to main content
Springer Nature Link
Log in

Repeated synchronous snapshots and their implementation in CSP

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1985)

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

Included in the following conference series:

Abstract

A new version of the Snapshot algorithm of Chandy and Lamport is presented. It considers synchronous communications and partially ordered semantics. It allows for repeated snapshots. Its implementation in the language CSP is described: it is symmetric, generic and bounded in storage. It yields a symmetric and generic solution to the classical Distributed Termination Detection problem of Francez.

extended abstract

The author is also affiliated with Laboratoire d'informatique, UER Sciences, Université d'Orléans, rue de Chartres, 45046 Orléans, FRANCE.

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.

Literature

  1. K.R. Apt and Ph. Clermont, Two normal form theorems for CSP programs, in preparation (1984)

    Google Scholar 

  2. K.R. Apt and J.L. Richier, Real time clocks versus virtual clocks, Rept. No. 84-34, LITP, Univ. Paris 7, Paris (1984).

    Google Scholar 

  3. L. Bougé, Symmetric election in CSP, Rept. No. 84-31, LITP, Univ. Paris 7, Paris (1984), submitted for publication.

    Google Scholar 

  4. L. Bougé, More about the snapshot algorithm: repeated synchronous snapshots and their implementation in CSP, Rept. No. 84-56, LITP, Univ. Paris 7, Paris (1984).

    Google Scholar 

  5. L. Bougé, Symmetry and Genericity for CSP distributed system, Rept. No. 85-, LITP, Univ. Paris 7, Paris (1985) in preparation.

    Google Scholar 

  6. K.M. Chandy, Paradigms for distributed computing, in: Proc. 3rd Conf. on Found. of Soft. Technology and Theory of Computer Science, Bengalore, India (1983) 192–201.

    Google Scholar 

  7. K.M. Chandy and L. Lamport, Distributed snapshots: determining the global state of distributed systems, Rept. No. TR-LCS-8401, Univ. Texas, Austin, Texas (jan. 1984) submitted for publication (1984).

    Google Scholar 

  8. E.W. Dijkstra, The distributed snapshot algorithm of K.M. Chandy and L. Lamport, Letter No. EWD864a (1983).

    Google Scholar 

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

    Article  Google Scholar 

  10. E.W. Dijkstra and C.S. Scholten, Termination detection for diffusing computations, Inf. Proc. Letters 11 (1980) 1–4.

    Article  Google Scholar 

  11. R. Fagin, J.Y. Halpern and M.Y. Vardi, A model-theoritic analysis of knowledge: extended abstract, IBM Research Laboratory, San Jose, Calif. (1984).

    Google Scholar 

  12. N. Francez, Distributed termination, ACM Trans. Prog. Lang. Syst. 2 (1980) 42–55.

    Article  Google Scholar 

  13. N. Francez and M. Rodeh, Achieving distributed termination without freezing, IEEE Trans. Soft. Eng. SE-8 (1982) 287–292.

    Google Scholar 

  14. N. Francez, M. Rodeh and M. Sintzoff, Distributed termination with interval assertion, in: J. Diaz and I. Ramos, eds., Proc. Int. Coll. on Formalization of Programming Concepts, Peniscola, Spain, Lecture Notes in Computer Science 107 (Springer, Berlin, 1981).

    Google Scholar 

  15. C.A.R. Hoare, Communicating sequential processes, Comm. ACM 21 (1978) 666–677.

    Article  Google Scholar 

  16. T. Herman and K.M. Chandy, A distributed algorithm to detect and/or deadlock, Rept. No. TR LCS-8301, Dept. of Computer Science, Univ. of Texas, Austin, Texas (1983).

    Google Scholar 

  17. J. Halpern and Y. Moses, Common knowledge in a distributed environment, Computer Science Dpt., Stanford Univ., Calif. (1984).

    Google Scholar 

  18. L. Lamport, Time, clocks and the ordering of events in a distributed system, Comm. ACM 21 (1978) 558–565.

    Article  Google Scholar 

  19. L. Lamport, Lecture Notes prepared for the Advanced Course on Distributed Systems — Methods and Tools for Specification, Computer Science Inst., TUM, Munchen, Germany (1984).

    Google Scholar 

  20. D. Lehmann, Knowledge, common knowledge and related puzzles (extended summary), Inst. of Math. and Computer Science, Hebrew Univ., Jerusalem, Israel (1984).

    Google Scholar 

  21. G. Le Lann, Distributed systems — towards a formal approach, in: B. Gilchrist, ed., Information Processing 77 (North-Holland, Amsterdam, 1977) 155–160.

    Google Scholar 

  22. C. Morgan, Global and logical time in distributed systems, Inf. Proc. Letters (1985), to appear.

    Google Scholar 

  23. J. Misra and K.M. Chandy, Termination detection of diffusing computations in communicating sequential processes, ACM Trans. Prog. Lang. Syst. 4 (1982) 37–42.

    Article  Google Scholar 

  24. G. Plotkin, An operational semantics for CSP, in: D. Bjorner, ed., Formal Description of Programming Concepts, IFIP TC-2 Working Conference, Garmish-Partenkirchen, Germany (1982) 185–208.

    Google Scholar 

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

    Article  Google Scholar 

  26. W. Reisig, Partial order semantics for CSP-like languages and its impact on fairness, in: J. Paradaens, ed., Automata, Languages and Programming, Lecture Notes in Computer Science 172 (Springer, Berlin, 1984) 403–413.

    Google Scholar 

  27. J.L. Richier, Distributed termination in CSP — symmetric solution with minimal storage, Rept. No. 84-49, LITP, Univ. Paris 7, Paris (1984).

    Google Scholar 

  28. F.B. Schneider, Lecture Notes prepared for the Advanced Course on Distributed Systems — Methods and Tools for Specification, Inst. for Computer Science, TUM, Munchen, Germany (1984).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LITP, Université Paris 7, 2 Place Jussieu, 75251, Paris, France

    Luc Bougé

Authors
  1. Luc Bougé
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wilfried Brauer

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bougé, L. (1985). Repeated synchronous snapshots and their implementation in CSP. In: Brauer, W. (eds) Automata, Languages and Programming. ICALP 1985. Lecture Notes in Computer Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015731

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation