Advertisement

A new algorithm to implement causal ordering

  • André Schiper
  • Jorge Eggli
  • Alain Sandoz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 392)

Abstract

This paper presents a new algorithm to implement causal ordering. Causal ordering was first proposed in the ISIS system developed at Cornell University. The interest of causal ordering in a distributed system is that it is cheaper to realize than total ordering. The implementation of causal ordering proposed in this paper uses logical clocks of Mattern-Fidge (which define a partial order between events in a distributed system) and presents two advantages over the implementation in ISIS: (1) the information added to messages to ensure causal ordering is bounded by the number of sites in the system, and (2) no special protocol is needed to dispose of this added information when it has become useless. The implementation of ISIS presents however advantages in the case of site failures.

Keywords

distributed algorithms ordering 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Birman 87]
    K. Birman, T. Joseph, "Reliable Communications in Presence of Failures", ACM Trans. on Computer Systems, Vol 5, No 1 (Feb 1987), pp 47–76.Google Scholar
  2. [Birman 88a]
    K.Birman et al., "ISIS — A Distributed Programming Environment", Cornell University, June 1988.Google Scholar
  3. [Birman 88b]
    K.Birman, "Exploiting Replication", in Lectures Notes Arctic'88, Tromso, July 1988.Google Scholar
  4. [Fidge 88]
    C.Fidge, "Timestamps in Message-Passing Systems That Preserve the Partial Ordering", Proc. of the 11th Australian Computer Science Conference, Univ of Queensland, Feb 1988.Google Scholar
  5. [Joseph 86]
    T. Joseph, K. Birman, "Low Cost Management of Replicated Data in Fault-Tolerant Distributed Systems", ACM Trans. on Computer Systems, Vol 4, No 1 (Feb 1986), pp54–70.Google Scholar
  6. [Lamport 78]
    L. Lamport, "Time, Clocks, and the Ordering of Events in a Distributed System", Communications of the ACM, Vol 21, No 7 (July 1978), pp 558–565.CrossRefGoogle Scholar
  7. [Mattern 89]
    F.Mattern, "Time and Global States of Distributed Systems", Proc. of the International Workshop on Parallel and Distributed Algorithms, Bonas, France, October 1988, North-Holland 1989.Google Scholar
  8. [Peterson 87]
    L.Peterson, "Preserving Context Information in an IPC Abstraction", IEEE Proc. of the 6th Symp. on Reliability in Distributed Software and Database Systems, March 1987.Google Scholar
  9. [Schiper 89]
    A.Schiper, J.Eggli, A.Sandoz, "A New Algorithm to Implement Causal Ordering", Rapport Interne 89/02, EPFL-Laboratoire de Systèmes d'Exploitation, April 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • André Schiper
    • 1
  • Jorge Eggli
    • 1
  • Alain Sandoz
    • 1
  1. 1.Département d'InformatiqueEcole Polytechnique Fédérale de LausanneLausanneSwitzerland

Personalised recommendations