An Alternate representation of distributed computations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1993

An Alternate representation of distributed computations

Celine Valot
  • Function : Author
Dominique Fortin
  • Function : Author


This paper proposes another representation of the event partially ordered set of distributed executions which relies on diagrams called arc diagrams. Arc diagrams are already in use within order theory and appears to have useful properties which can be of interest to distributed algorithms. It is shown that arc diagrams describe efficiently event ordering relations as well as reachable global states. Access to both of those levels is done without switching between different representations. Furthermore, this representation allows to decompose the event set into chains and yields to nearly optimal linear extensions. These linear extensions can beviewed as the nearest linear extensions of the poset that ca be produced. Those can be efficiently used to detect a new kind of global predicates called greedy predicates.


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

Dates and versions

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


  • HAL Id : inria-00074730 , version 1


Celine Valot, Dominique Fortin. An Alternate representation of distributed computations. [Research Report] RR-1944, INRIA. 1993. ⟨inria-00074730⟩
37 View
13 Download


Gmail Facebook Twitter LinkedIn More