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

Measuring Concurrency of Regular Distributed Computations

Cyrille Bareau 1 Benoit Caillaud 1 Claude Jard 1 René Thoraval 1
1 PAMPA - Models and Tools for Programming Distributed Parallel Architectures
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : In this paper, we present a concurrency measure that is especially adapted to distributed programs that exhibit regular run-time behaviours. Such programs are frequently obtained by automatic parallelization of sequential code. This measure is based on the antichain lattice of the partial order that models the distributed execution under consideration. We show under which condition the measure is computable on an infinite execution which is the repetition of a finite pattern. The measure can then be computed by considering only a bounded number of patterns, this bound being at most the number of processors.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 2:56:04 PM
Last modification on : Friday, February 4, 2022 - 3:24:04 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:14:44 PM


  • HAL Id : inria-00074281, version 1


Cyrille Bareau, Benoit Caillaud, Claude Jard, René Thoraval. Measuring Concurrency of Regular Distributed Computations. [Research Report] RR-2394, INRIA. 1994. ⟨inria-00074281⟩



Record views


Files downloads