Structured data access annotations for massively parallel computations
Data(s) |
01/01/2013
|
---|---|
Resumo |
We describe an approach aimed at addressing the issue of joint exploitation of control (stream) and data parallelism in a skeleton based parallel programming environment, based on annotations and refactoring. Annotations drive efficient implementation of a parallel computation. Refactoring is used to transform the associated skeleton tree into a more efficient, functionally equivalent skeleton tree. In most cases, cost models are used to drive the refactoring process. We show how sample use case applications/kernels may be optimized and discuss preliminary experiments with FastFlow assessing the theoretical results. © 2013 Springer-Verlag. |
Identificador | |
Idioma(s) |
eng |
Direitos |
info:eu-repo/semantics/restrictedAccess |
Fonte |
Aldinucci , M , Campa , S , Torquati , M & Kilpatrick , P 2013 , Structured data access annotations for massively parallel computations . in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) . vol. 7640 LNCS , pp. 381-390 . DOI: 10.1007/978-3-642-36949-0_42 |
Tipo |
contributionToPeriodical |