Implementing functional programs on a hypercube multiprocessor

Authors:
B. Goldberg;P. Hudak
Affiliations:
Department of Computer Science, Courant Institute of Mathematical Sciences, New York University;Department of Computer Science, Yale University
Venue:
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Year:
1988

Citing 6
Cited 7

Serial combinators: “optimal” grains of parallelism

Proc. of a conference on Functional programming languages and computer architecture
Para-Functional Programming

Computer
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Experiments in diffused combinator reduction

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
The semantic elegance of applicative languages

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Multiprocessor execution of functional programs

Multiprocessor execution of functional programs

Buckwheat: graph reduction on a shared-memory multiprocessor

LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
Conception, evolution, and application of functional programming languages

ACM Computing Surveys (CSUR)
Partitioning declarative programs into communicating processes

Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Dynamic load balancing in parallel and distributed networks by random matchings (extended abstract)

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Tight analyses of two local load balancing algorithms

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
First and second order diffusive methods for rapid, coarse, distributed load balancing (extended abstract)

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Program Demultiplexing: Data-flow based Speculative Parallelization of Methods in Sequential Programs

Proceedings of the 33rd annual international symposium on Computer Architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

Alfalfa is an implementation of a functional language on the Intel iPSC multiprocessor. It is based on a heterogeneous abstract machine model consisting of both graph reduction and stack oriented execution. Alfalfa has two major components, a compiler and a run-time system. The source language, ALFL, contains no constructs that allow the programmer to specify parallelism or synchronization; thus it is the task of the compiler to detect the exploitable parallelism in a program. The run-time system supports dynamic scheduling, interprocessor communication, and storage management. A number of statistics gathered during execution are presented.