A Loosely Synchronized Execution Model for a Simple Data-Parallel Language.

Yann Le Guyadec (1) , Emmanuel Melin (1) , Bruno Raffin (1) , Xavier Rebeuf (1) , Bernard Virot (1)

1 LIFO - Laboratoire d'Informatique Fondamentale d'Orléans

Classical imperative data-parallel languages offer a simple synchronous programming model. The challenge consists in taking advantage of the power of present parallel MIMD architectures by designing execution models which reduce the number and the complexity of synchronizations. In this paper, we propose a structured approach to the problem of desynchronization of data-parallel programs. It relies on a translation process from a synchronous data-parallel programming language into an asynchronous target language. The synchronous data-parallel programming language uses twin-memories to temporarily mask local computations. The asynchronous target language handles explicit and partial synchronizations through the use of structural clocks.

Mots clés: Concurrent Programming; Data-Parallel Languages; Desynchronization; Twin Memories; Structural Clocks

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Yann Le Guyadec, Emmanuel Melin, Bruno Raffin, Xavier Rebeuf, Bernard Virot. A Loosely Synchronized Execution Model for a Simple Data-Parallel Language.. 1996, pp.732-741. ⟨hal-00005850⟩