Skip to Main content Skip to Navigation

Synchronization Minimization in a SPMD Execution Model

François Bodin 1 Lionel Kervella 1 Mike O' Boyle 1
1 CAPS - Compilation, parallel architectures and system
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : 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.
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:57:43 PM
Last modification on : Friday, February 4, 2022 - 3:22:01 AM
Long-term archiving on: : Monday, April 5, 2010 - 12:08:01 AM


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



Record views


Files downloads