A Structured Synchronization and Communication Model Fitting Irregular Data Accesses

In this paper, we present a parallel programming and execution model based on alogicalordering of control flows. We show that it is possible to provide a unifying framework consisting of a synchronous programming model, thereby facilitating the mastery of programs, and an asynchronous execution mode...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of parallel and distributed computing Ročník 50; číslo 1-2; s. 3 - 27
Hlavní autoři: Melin, Emmanuel, Raffin, Bruno, Rebeuf, Xavier, Virot, Bernard
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 10.04.1998
Elsevier
Témata:
automatic parallelization
Computer Science
data parallel programming model
design of parallel programming languages
Distributed, Parallel, and Cluster Computing
implementation results on Cray T3D
irregular algorithm
structural clock
task parallel language
structural clock
design of parallel programming languages
irregular algorithm
automatic parallelization
implementation results on Cray T3D
data parallel programming model
task parallel language
ISSN:0743-7315, 1096-0848
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we present a parallel programming and execution model based on alogicalordering of control flows. We show that it is possible to provide a unifying framework consisting of a synchronous programming model, thereby facilitating the mastery of programs, and an asynchronous execution model yielding efficient executions. Our approach is based on a SPMD and task parallel programming language, called SCL–Chan. Communications take place through channels and rely on explicit send/receive instructions. In contrast to classical message passing models, synchronizations and communications are dissociated. We show that it is possible to perform a data-driven automatic translation of sequential and arbitrary DOACROSS loops into SCL–Chan, by using nonmatching send/receive instructions. Our parallelization technique allows us to handle irregular control and leads to optimizations of communications in irregular computations.
ISSN:0743-7315
1096-0848
DOI:10.1006/jpdc.1998.1439