Measuring Concurrency of Regular Distributed Computations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1994

Measuring Concurrency of Regular Distributed Computations


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.
Fichier principal
Vignette du fichier
RR-2394.pdf (312.13 Ko) Télécharger le fichier

Dates and versions

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


  • 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⟩
379 View
121 Download


Gmail Facebook Twitter LinkedIn More