Treffer: PolyAPM: Parallel programming via stepwise refinement with Abstract Parallel machines

Title:
PolyAPM: Parallel programming via stepwise refinement with Abstract Parallel machines
Source:
IFL 2002 : implementation of functional languages (Madrid, 16-18 September 2002, revised selected papers)Lecture notes in computer science. :118-133
Publisher Information:
Berlin: Springer, 2003.
Publication Year:
2003
Physical Description:
print, 1 p.1/4
Original Material:
INIST-CNRS
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Fakultät für Mathematik und Informatik, Universität Passau, Germany
ISSN:
0302-9743
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.15690986
Database:
PASCAL Archive

Weitere Informationen

Writing a parallel program can be a difficult task which has to meet several, sometimes conflicting goals. While the manual approach is time-consuming and error-prone, the use of compilers reduces the programmer's control and often does not lead to an optimal result. With our approach, PolyAPM, the programming process is structured as a series of source-to-source transformations. Each intermediate result is a program for an Abstract Parallel Machine (APM) on which it can be executed to evaluate the transformation. We propose a decision tree of programs and corresponding APMs that help to explore alternative design decisions. Our approach stratifies the effects of individual, self-contained transformations and enables their evaluation during the parallelisation process.