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.
Type de document :
[Research Report] RR-2394, INRIA. 1994
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 14:56:04
Dernière modification le : mercredi 16 mai 2018 - 11:23:04
Document(s) archivé(s) le : dimanche 4 avril 2010 - 22:14:44



  • 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〉



Consultations de la notice


Téléchargements de fichiers