A method for parallel program generation with an application to the Booster language

Authors:
Edwin M. Paalvast;Arjan J. van Gemund;Henk J. Sips
Affiliations:
TNO Institute of Applied Computer Science (ITI-TNO), P.O. Box 214, NL-2600 AE Delft, The Netherlands;TNO Institute of Applied Computer Science (ITI-TNO), P.O. Box 214, NL-2600 AE Delft, The Netherlands;Delft University of Technology, P.O. Box 5046, NL-2600 GA Delft, The Netherlands
Venue:
ICS '90 Proceedings of the 4th international conference on Supercomputing
Year:
1990

Citing 8
Cited 7

Programming for Parallelism

Computer
The design and implementation of a Pascal-based language for array processor architectures

Journal of Parallel and Distributed Computing
Future scientific programming on parallel machines

Journal of Parallel and Distributed Computing - Special Issue on Languages, Compilers and environments for Parallel Programming
Conception, evolution, and application of functional programming languages

ACM Computing Surveys (CSUR)
Process decomposition through locality of reference

PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Array distribution in SUPERB

ICS '89 Proceedings of the 3rd international conference on Supercomputing
Exploring Parafunctional Programming: Separating the What from the How

IEEE Software
A Comparison of 12 Parallel FORTRAN Dialects

IEEE Software

Object distribution in Orca using Compile-Time and Run-Time techniques

OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Performance prediction of parallel processing systems: the PAMELA methodology

ICS '93 Proceedings of the 7th international conference on Supercomputing
An Implementation Framework for HPF Distributed Arrays on Message-Passing Parallel Computer Systems

IEEE Transactions on Parallel and Distributed Systems
Compiling Global Name-Space Parallel Loops for Distributed Execution

IEEE Transactions on Parallel and Distributed Systems
Supercompilers for massively parallel architectures

PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Programming in Vienna Fortran

Scientific Programming
Efficient, portable implementation of asynchronous multi-place programs

Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a translation method for the automatic parallelization of programs based on a separately specified representation of the data. The method unifies the concept of data-representation on the algorithm-level as well as machine-level, based on the so-called view concept. It is shown that given a decomposition of the data, application of the translation method to the view-based Booster programming language results in efficient SPMD-code for distributed- as well as shared-memory architectures. It will be argued that the method is not restricted to Booster, but can also be applied to other languages.