Synchronization Minimization in a SPMD Execution Model - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1994

Synchronization Minimization in a SPMD Execution Model


This paper presents an algorithm for synchronization placement when using a SPMD execution model, where synchronizations are enforced only when there exists a cross-processor dependence. In this paper we investigate two scheduling techniques, loop based and data based, both of which use an SPMD model. Using scheduling information from previous stages in the compilation process, potential cross-processor dependences are determined. Given the minimum number of cross-processor data dependences that must be satisfied, an optimization technique based on a maximal cut algorithm is used so as to minimize the number of synchronization points needed to satisfy them. This algorithm has been successfully implemented in an experimental compiler. Initial experimental data show this technique to be very effective, outperforming existing methods.
Fichier principal
Vignette du fichier
RR-2387.pdf (216.27 Ko) Télécharger le fichier

Dates and versions

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


  • HAL Id : inria-00074288 , version 1


François Bodin, Lionel Kervella, Mike O' Boyle. Synchronization Minimization in a SPMD Execution Model. [Research Report] RR-2387, INRIA. 1994. ⟨inria-00074288⟩
85 View
131 Download


Gmail Facebook Twitter LinkedIn More