Compiling machine-independent parallel programs

Authors:
Michael Philippsen;Ernst A. Heinz;Paul Lukowicz
Affiliations:
-;-;-
Venue:
ACM SIGPLAN Notices
Year:
1993

Citing 12
Cited 2

Efficient parallel algorithms

Efficient parallel algorithms
The design and analysis of parallel algorithms

The design and analysis of parallel algorithms
Data-parallel programming on MIMD computers

Data-parallel programming on MIMD computers
An introduction to parallel algorithms

An introduction to parallel algorithms
Compiling Fortran D for MIMD distributed-memory machines

Communications of the ACM
A Theorem on Boolean Matrices

Journal of the ACM (JACM)
Comparative Study of Parallel Programming Languages: The Salishan Problems

Comparative Study of Parallel Programming Languages: The Salishan Problems
Optimizing Supercompilers for Supercomputers

Optimizing Supercompilers for Supercomputers
Dependence Analysis for Supercomputing

Dependence Analysis for Supercomputing
A Comparison of 12 Parallel FORTRAN Dialects

IEEE Software
MODULA-2 and Its Compilation

Proceedings of the First International ACPC Conference on Parallel Computation
The semantic elegance of applicative languages

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture

Automatic alignment of array data and processes to reduce communication time on DMPPs

PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
Exploiting Domain-Specific Properties: Compiling Parallel Dynamic Neural Network Algorithms into Efficient Code

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Initial evidence is presented that explicitly parallel, machine-independent programs can automatically be translated into parallel machine code that is competitive in performance with hand-written code.The programming language used is Modula-2*, an extension of Modula-2, which incorporates both data and control parallelism in a portable fashion. An optimizing compiler targeting MIMD, SIMD, and SISD machines translates Modula-2* into machine-dependent C code.The performance of the resulting code is compared to that of equivalent, carefully hand-coded and tuned prograins. On a MasPar MP-1 (SIMD machine with up to 16k processors) the Modula-2* programs typically achieve 80% of the performance of the hand-coded parallel versions. When targeting sequential processors, the Modula-2* programs reach 90% of the performance of hand-coded sequential C. (There are no MIMD results yet.)The effects of two major optimization techniques, synchronization point elimination and data/process alignment are also quantified.