Skip to main content
SpringerLink
Log in

Combinatorics and geometry of consistent cuts : Application to concurrency theory

  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1989)

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

Included in the following conference series:

Abstract

We define a concurrency measure of a distributed computation which is based on the number μ of its consistent cuts. We prove that counting consistent cuts takes into account the non-transitivity of the concurrency relation. Besides this combinatorial study, we give a geometric interpretation of μ using the clock designed by Fidge and Mattern for characterizing concurrency between two events. This geometric approach shows how much this clock is also a powerful tool for assessing the global concurrency. Moreover it provides a geometric picture of the concurrency phenomena in a distributed computation.

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.

References

  1. M. Aigner. Combinatorial Theory. Springer-Verlag, 1979.

    Google Scholar 

  2. B. Charron-Bost. Au sujet de la taille des horloges. Technical Report, LIENS, Paris, à paraître.

    Google Scholar 

  3. B. Charron-Bost. Concurrence dans les calculs répartis. Technical Report, LIENS, Paris, à paraître.

    Google Scholar 

  4. B. Charron-Bost. Measure of parallelism of distributed computations. In STACS, pages 434–445, AFCET, 1989.

    Google Scholar 

  5. P.L. Curien. Categorical Combinators, Sequential Algorithms and Functional Programming. Pitman, 1986.

    Google Scholar 

  6. G. Kahn et G. Plotkin. Domaines concrets. Technical Report 336, INRIA-LABORIA, 1978.

    Google Scholar 

  7. K.M. Chandy et L. Lamport. Distributed snapshots: determining the global state of distributed systems. ACM Trans. Comp. Systems, 3(1):63–75, 1985.

    Google Scholar 

  8. J. Fidge. Timestamps in message passing systems that preserve the partial ordering. In Proc. 11th. Australian Computer Science Conference, pages 55–66, 1988.

    Google Scholar 

  9. L. Lamport. Time, clocks and the orderings of events in a distributed system. Comm. of ACM, 21,7:558–564, 1978.

    Google Scholar 

  10. F. Mattern. Virtual time and global states of distributed systems. In Parallel and Distributed Algorithms, pages 215–226, North-Holland, 1988.

    Google Scholar 

  11. C.A. Petri. Concurrency theory. In Advances in Petri Nets, pages 4–24, Springer-Verlag, 1986.

    Google Scholar 

  12. E. Szpilrajn. Sur l'extension de l'ordre partiel. Fund. Math., 16:386–389, 1930.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. I.N.T., 9 rue C. Fourier, 91011, Evry

    Bernadette Charron-Bost

  2. L.I.E.N.S., 45 rue d'Ulm, 75230, Paris Cedex 05, France

    Bernadette Charron-Bost

Authors
  1. Bernadette Charron-Bost
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jean-Claude Bermond Michel Raynal

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Charron-Bost, B. (1989). Combinatorics and geometry of consistent cuts : Application to concurrency theory. In: Bermond, JC., Raynal, M. (eds) Distributed Algorithms. WDAG 1989. Lecture Notes in Computer Science, vol 392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51687-5_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-51687-5_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51687-3

  • Online ISBN: 978-3-540-46750-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation