A functional programming language compiler for massively parallel computers

Authors:
Clifford Walinsky;Deb Banerjee
Affiliations:
Dept. Mathematics and Computer Science, Dartmouth College, Hanover, NH;Dept. Mathematics and Computer Science, Dartmouth College, Hanover, NH
Venue:
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Year:
1990

Citing 8
Cited 3

Programming in Prolog (2nd ed.)

Programming in Prolog (2nd ed.)
Data parallel algorithms

Communications of the ACM - Special issue on parallelism
Executing a program on the MIT tagged-token dataflow architecture

Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Architecture and Applications of the Connection Machine

Computer
Scans as Primitive Parallel Operations

IEEE Transactions on Computers
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Compilation and delayed evaluation in APL

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Parallel Sorting Algorithms

Parallel Sorting Algorithms

Size and access inference for data-parallel programs

PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
An equational language for data-parallelism

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Compiling nested data-parallel programs for shared-memory multiprocessors

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Functional programming languages remove programmers from low-level machine details, an important achievement when programming massively parallel systems. We present an overview of an FP compiler that generates programs capable of exploiting data-parallelism, a view of parallelism where distinct data elements reside on distinct processors and all processors execute a single instruction stream. To achieve this form of parallelism, FP's sequences are represented as arrays. This representation makes possible optimization techniques developed for APL compilers that compose routing functions at compile-time. These techniques are described succinctly by a set of axioms and inference rules. We demonstrate the optimizations by compiling several FP functions, obtaining optimal performance.