The causal ordering abstraction and a simple way to implement it - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1989

The causal ordering abstraction and a simple way to implement it

Abstract

Control in distributed systems is mainly introduced to reduce non-determinism. This non-determinism is due on once hand to the asynchronous execution of the processes located on the various sites of the system, and on the other hand to the asynchronous nature of the communication channels. In order to get rid of part of the asynchronism due to the communication channels, a new ordering relation, known as causal ordering, has been introduced by Birman. After having shown the usefulness of causal ordering, we propose a natural implementation, based simply on counting the emitted messages. A proof of the correctness of the algorithm is also given.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1132.pdf (756.93 Ko) Télécharger le fichier

Dates and versions

inria-00075427 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00075427 , version 1

Cite

Michel Raynal, André Schiper. The causal ordering abstraction and a simple way to implement it. [Research Report] RR-1132, INRIA. 1989. ⟨inria-00075427⟩
368 View
2038 Download

Share

Gmail Facebook X LinkedIn More