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 

aldinuc:stream-data:98 (In proceedings)
Author(s) Marco Aldinucci, Massimo Coppola and Marco Danelutto
Title« Rewriting skeleton programs: How to evaluate the data-parallel stream-parallel tradeoff »
InProc of CMPP: Intl. Workshop on Constructive Methods for Parallel Programming
Editor(s) S. Gorlatch
Page(s)44-58
Year1998
OrganizationFakultät für mathematik und informatik
PublisherUni. Passau, Germany
URLhttp://calvados.di.unipi.it/storage/paper_files/1998_transf_cmpp.pdf
Abstract
Some skeleton based parallel programming models allow the programmer to use both data and stream parallel skeletons within the same program. It is known that particular skeleton nestings can be formally rewritten into different nestings that preserve the functional semantics. Indeed, the kind and possibly the amount of parallelism usefully exploitable may change while rewriting takes place. Here we discuss an original framework allowing the user (and/or the compiling tools) of a skeleton based parallel programming language to evaluate whether or not the transformation of a skeleton program is worthwhile in terms of the final program performance. We address, in particular, the evaluation of transformations exchanging data parallel and stream parallel skeleton subtrees.

BibTeX code

@inproceedings{aldinuc:stream-data:98,
  month = may,
  author = {Marco Aldinucci and Massimo Coppola and Marco Danelutto},
  optseries = {University of Passau technical report},
  booktitle = {Proc of CMPP: Intl. Workshop on Constructive Methods for Parallel
               Programming},
  editor = {S. Gorlatch},
  url = {http://calvados.di.unipi.it/storage/paper_files/1998_transf_cmpp.pdf},
  abstract = { Some skeleton based parallel programming models allow the
              programmer to use both data and stream parallel skeletons within
              the same program. It is known that particular skeleton nestings
              can be formally rewritten into different nestings that preserve
              the functional semantics. Indeed, the kind and possibly the amount
              of parallelism usefully exploitable may change while rewriting
              takes place. Here we discuss an original framework allowing the
              user (and/or the compiling tools) of a skeleton based parallel
              programming language to evaluate whether or not the transformation
              of a skeleton program is worthwhile in terms of the final program
              performance. We address, in particular, the evaluation of
              transformations exchanging data parallel and stream parallel
              skeleton subtrees.},
  optnumber = {MIP-9805},
  title = {Rewriting skeleton programs: How to evaluate the data-parallel
           stream-parallel tradeoff},
  publisher = {Uni. Passau, Germany},
  year = {1998},
  organization = {Fakult{\"a}t f{\"u}r mathematik und informatik},
  pages = {44-58},
}


 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!