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

Online Abstraction of Distributed Executions

Thomas Gazagnaire 1 Loïc Hélouët 1 Claude Jard 1
1 DISTRIBCOM - Distributed and Iterative Algorithms for the Management of Telecommunications Systems
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : This report proposes an on-line compression algorithm for distributed executions. An execution is decomposed into atomic communication patterns. Events are clustered together according to the following policy: the initial partial order structure is preserved, and valid global states are detected in order to find a coherent global state if a site fails. Two versions of the algorithm have been developed. The first version is online and centralized and does not depend on execution order of any concurrent events. Moreover, if clusters are bounded in size, the memory size needed for infinite executions is also bounded. The second version is distributed and is done by piggybacking subset of sites knowledge into messages: under certain conditions, size of piggybacked messages is bounded and the algorithm can be effectively implemented.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, May 19, 2006 - 7:54:44 PM
Last modification on : Friday, February 4, 2022 - 3:19:38 AM
Long-term archiving on: : Sunday, April 4, 2010 - 8:49:47 PM


  • HAL Id : inria-00070282, version 1


Thomas Gazagnaire, Loïc Hélouët, Claude Jard. Online Abstraction of Distributed Executions. [Research Report] RR-5736, INRIA. 2005, pp.28. ⟨inria-00070282⟩



Record views


Files downloads