HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

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 :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 4:11:37 PM
Last modification on : Friday, February 4, 2022 - 3:15:15 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 6:39:43 PM


  • HAL Id : inria-00074730, version 1



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



Record views


Files downloads