Treffer: A symbolic cost model for asynchronous parallel programs with structured dependences

Title:
A symbolic cost model for asynchronous parallel programs with structured dependences
Contributors:
Laboratoire d'Informatique Fondamentale d'Orléans (LIFO), Université d'Orléans (UO)-Ecole Nationale Supérieure d'Ingénieurs de Bourges, Institut d'Informatique et de Mathématiques Appliquées de Grenoble (IMAG), Université Joseph Fourier - Grenoble 1 (UJF)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), Real time and interoperability (TRIO), INRIA Lorraine, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)
Source:
[Intern report] A02-R-031 || melin02a, 2002, 21 p
Publisher Information:
CCSD, 2002.
Publication Year:
2002
Collection:
collection:UGA
collection:CNRS
collection:INRIA
collection:UNIV-GRENOBLE1
collection:UNIV-ORLEANS
collection:INPL
collection:ENSI-BOURGES
collection:INPG
collection:LIG
collection:INRIA-LORRAINE
collection:LORIA2
collection:INRIA-NANCY-GRAND-EST
collection:MSL
collection:MSL-THESE
collection:LIG_SRCPR
collection:TESTALAIN1
collection:UNIV-LORRAINE
collection:INRIA2
collection:LORIA
collection:LARA
collection:TEST-UGA
collection:AM2I-UL
Original Identifier:
HAL:
Document Type:
Report report<br />Reports
Language:
English
Rights:
info:eu-repo/semantics/OpenAccess
Accession Number:
edshal.inria.00099423v1
Database:
HAL

Weitere Informationen

Rapport interne.
We propose to associate a symbolic cost to a asynchronous parallel program. In contrast to classical approaches, we take into account all the dynamic asynchronism related to the different initial states that generate dynamic independences. We introduce an asynchronous intermediate model called SCP. It only imposes static independences allowing a sequential lecture of programs. To compute the symbolic cost, we condition the existence of a dependence by annotating it with a predicate on program variables. To evaluate the cost in the initial environment, predicates are transformed by a backward method based on the model Weakest Liberal Preconditions Calculus. The resulting symbolic cost is parameterized by the initial environment and integrates dynamic dependences.