EFFICIENT DISTRIBUTED EVALUATION OF FUNCTIONAL PROGRAMS USING SERIAL COMBINATORS.

Paul Hudak, Benjamin Goldberg

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A general strategy for automatically decomposing and dynamically distributing a functional program for parallel execution on multiprocessor architectures is discussed. The strategy borrows ideas from dataflow and reduction machine research on one hand, and conventional compiler technology for sequential machines on the other. One of the troublesome issues in such a system is choosing the right granularity for the parallel tasks. A program-transformation technique is described that is based on serial combinators. It offers in some sense just the right granularity for this style of computing and can be fine-tuned for particular multiprocessor architectures. Simulation shows the validity of the approach.

Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Parallel Processing
EditorsDouglas DeGroot
PublisherIEEE
Pages831-839
Number of pages9
ISBN (Print)0818606371
StatePublished - 1985

Publication series

NameProceedings of the International Conference on Parallel Processing
ISSN (Print)0190-3918

ASJC Scopus subject areas

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'EFFICIENT DISTRIBUTED EVALUATION OF FUNCTIONAL PROGRAMS USING SERIAL COMBINATORS.'. Together they form a unique fingerprint.

Cite this