Skip to Main content Skip to Navigation
Reports

An Alternate representation of distributed computations

Abstract : 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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00074730
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 4:11:37 PM
Last modification on : Thursday, February 11, 2021 - 2:50:07 PM
Long-term archiving on: : Tuesday, April 12, 2011 - 6:39:43 PM

Identifiers

  • HAL Id : inria-00074730, version 1

Collections

Citation

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

Share

Metrics

Record views

116

Files downloads

58