Skip to main content

Concerning the size of clocks

  • Conference paper
  • First Online:
Semantics of Systems of Concurrent Processes (LITP 1990)

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

Included in the following conference series:

Abstract

By Fidge and Mattern's algorithm, it was already known that it is sufficient to use n-tuple as timestamps of events for a system distributed over n processes if causal independence is to be characterized. In this paper we have shown that smaller clocks do not work if we just know the number of processes. Then using theorems about the dimension of partially ordered sets we have given a mathematical interpretation of this result.

Finally we would like to mention that these combinatorial notions allow to rephrase our result about the “necessity of size n” in a way which does not give any special role to the partially ordered sets (R n, <) or (N n, <).

Indeed, causality can be characterized by using other reference partially ordered sets than these ones. For instance we can allot q 1, ..., q n to the processes P 1, ..., P n and we can use the numbers ∏ n i=1 q u[i] i instead of the vectors u = Θ(a) ∈ R n (“Gödel coding”). Then the causality between the events a is detected by the divisibility of these numbers.

However, whatever reference partial order is used to define a clock, the example of Section 4 shows that its dimension must be at least n if this clock has to characterize concurrency of systems distributed over n processes.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. B. Charron-Bost. Combinatorics and geometry of consistent cuts. In Third International Workshop on Distributed Algorithms, pages 48–61, LNCS,Springer Verlag, 1989.

    Google Scholar 

  2. B. Charron-Bost. Mesures de la Concurrence et du Parallélisme des calculs répartis. PhD thesis, Université Paris 7, Septembre 1989.

    Google Scholar 

  3. R.P. Dilworth. A decomposition theorem for partially ordered sets. Annals of Mathematics, 51:161–166, 1948.

    Google Scholar 

  4. J. Eggli, A. Sandoz, and A. Schiper. A new algorithm to implement causal ordering. In Third International Workshop on Distributed Algorithms, pages 219–232, LNCS,Springer Verlag, 1989.

    Google Scholar 

  5. J. Fidge. Partial orders for parallel debugging. In Proc. ACM/SIGPLAN/SIGOPS Workshop on Parallel and Distributed Debugging, pages 183–194, 1988.

    Google Scholar 

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

  7. T. Hiraguchi. On the dimension of orders. Technical Report, University of Kanazawa, 1955.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  10. O. Ore. Theory of graphs. In Math. Soc. Colloq. Publ. 38, Providence R.I., 1962.

    Google Scholar 

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

    Google Scholar 

  12. G. Tel. Total algorithms. In Parallel and Distributed Algorithms, pages 187–198, North-Holland, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Irène Guessarian

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag

About this paper

Cite this paper

Charron-Bost, B. (1990). Concerning the size of clocks. In: Guessarian, I. (eds) Semantics of Systems of Concurrent Processes. LITP 1990. Lecture Notes in Computer Science, vol 469. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53479-2_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-53479-2_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53479-2

  • Online ISBN: 978-3-540-46897-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics