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

Abstract : 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.
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00005850
Contributor : Bruno Raffin <>
Submitted on : Wednesday, July 6, 2005 - 2:51:24 PM
Last modification on : Thursday, February 7, 2019 - 3:46:28 PM
Long-term archiving on : Thursday, April 1, 2010 - 9:54:01 PM

Identifiers

  • HAL Id : hal-00005850, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

232

Files downloads

200