Interval approximations of message causality in distributed executions

  • Claire Diehl
  • Claude Jard
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 577)


In this paper we study timestamping for the dynamic analysis of events ordering in message-passing systems. We use the partial order theory to shed new light on classical timestamping algorithms. Consequently we present a new stamp technique based on a special class of order: interval orders. This technique gives better results than the Lamport's logical clocks for the same cost. Lastly we characterize executions for which our timestamping is optimum.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    B. Charron-Bost. Concerning the size of logical clocks in distributed systems. Information Processing Letters, 39(1):11–16, July 1991.Google Scholar
  2. [2]
    W.A. Cook, M. Kress, and M. Seiford. An axiomatic approach to distance on partial orderings. R.A.I.R.O. Recherche opérationnelle/Operations Research, 20(2):115–122, Mai 1986.Google Scholar
  3. [3]
    R.P Dilworth. A decomposition theorem for partially ordered sets. Annals of Math., 51:161–165, 1950.Google Scholar
  4. [4]
    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
  5. [5]
    P.C Fishburn. Interval orders and interval graphs. Wiley, New York, 1985.Google Scholar
  6. [6]
    L. Lamport. Time, clocks and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–565, July 1978.Google Scholar
  7. [7]
    F. Mattern. Virtual time and global states of distributed systems. In Cosnard, Quinton, Raynal, and Robert, editors, Proc. Int. Workshop on Parallel and Distributed Algorithms Bonas, France, Oct. 1988, North Holland, 1989.Google Scholar
  8. [8]
    R.H. Möhring. Computationally tractable classes of ordered sets. In Algorithms and Order, pages 105–193, Kluwer Academic Publishers, 1989.Google Scholar
  9. [9]
    C. H. Papadimitriou and M. Yannakakis. Scheduling interval-ordered task. Siam J. Comput., 8(3):405–409, August 1979.Google Scholar
  10. [10]
    J.X. Rampon. Mesures de concurrence et extensions d'intervalles. Ph. D Thesis, University of Montpellier II, February 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Claire Diehl
    • 1
  • Claude Jard
    • 1
  1. 1.IRISARennesFrance

Personalised recommendations