Chronological Overview 
 Type-Hierarchical Overview 
Formal Methods in Computing
(Most of the papers antecedent to 1995
are not included in the list)
FRAMES  NO FRAME 

annotation:para:12 (In proceedings)
Author(s) Marco Aldinucci, Sonia Campa, Peter Kilpatrick and Massimo Torquati
Title« Structured Data Access Annotations for Massively Parallel Computations »
InEuro-Par 2012 Workshops, Proc. of the ParaPhrase Workshop on Parallel Processing
SeriesLNCS
Volume7640
Page(s)381-390
Year2013
PublisherSpringer
URLhttp://calvados.di.unipi.it/storage/paper_files/2013_annot_europar_workshops.pdf
Abstract & Keywords
We describe an approach aimed at addressing the issue of joint exploitation of control (stream) and data parallelism in a skele-ton based parallel programming environment, based on annotations and refactoring. Annotations drive efficient implementation of a parallel com-putation. 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 howsample use case applications/kernels may be optimized and discuss pre-liminary experiments with FastFlow assessing the theoretical results.

Keywords: fastflow

BibTeX code

@inproceedings{annotation:para:12,
  volume = {7640},
  author = {Marco Aldinucci and Sonia Campa and Peter Kilpatrick and Massimo
            Torquati},
  series = {LNCS},
  keywords = {fastflow},
  booktitle = {Euro-Par 2012 Workshops, Proc. of the ParaPhrase Workshop on
               Parallel Processing},
  url = {http://calvados.di.unipi.it/storage/paper_files/2013_annot_europar_workshops.pdf},
  abstract = {We describe an approach aimed at addressing the issue of joint
              exploitation of control (stream) and data parallelism in a
              skele-ton based parallel programming environment, based on
              annotations and refactoring. Annotations drive efficient
              implementation of a parallel com-putation. 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 howsample use
              case applications/kernels may be optimized and discuss
              pre-liminary experiments with FastFlow assessing the theoretical
              results.},
  title = {Structured Data Access Annotations for Massively Parallel
           Computations},
  publisher = {Springer},
  year = {2013},
  pages = {381-390},
}


 Chronological Overview 
 Type-Hierarchical Overview 
Formal Methods in Computing
(Most of the papers antecedent to 1995
are not included in the list)
FRAMES  NO FRAME 

This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)

Valid HTML 4.01!