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

Fingerprint

Sequential machines

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Hudak, P., & Goldberg, B. (1985). EFFICIENT DISTRIBUTED EVALUATION OF FUNCTIONAL PROGRAMS USING SERIAL COMBINATORS. In D. DeGroot (Ed.), Proceedings of the International Conference on Parallel Processing (pp. 831-839). IEEE.

EFFICIENT DISTRIBUTED EVALUATION OF FUNCTIONAL PROGRAMS USING SERIAL COMBINATORS. / Hudak, Paul; Goldberg, Benjamin.

Proceedings of the International Conference on Parallel Processing. ed. / Douglas DeGroot. IEEE, 1985. p. 831-839.

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

Hudak, P & Goldberg, B 1985, EFFICIENT DISTRIBUTED EVALUATION OF FUNCTIONAL PROGRAMS USING SERIAL COMBINATORS. in D DeGroot (ed.), Proceedings of the International Conference on Parallel Processing. IEEE, pp. 831-839.
Hudak P, Goldberg B. EFFICIENT DISTRIBUTED EVALUATION OF FUNCTIONAL PROGRAMS USING SERIAL COMBINATORS. In DeGroot D, editor, Proceedings of the International Conference on Parallel Processing. IEEE. 1985. p. 831-839
Hudak, Paul ; Goldberg, Benjamin. / EFFICIENT DISTRIBUTED EVALUATION OF FUNCTIONAL PROGRAMS USING SERIAL COMBINATORS. Proceedings of the International Conference on Parallel Processing. editor / Douglas DeGroot. IEEE, 1985. pp. 831-839
@inproceedings{c2371904ad5640baadbf2a61919b1e77,
title = "EFFICIENT DISTRIBUTED EVALUATION OF FUNCTIONAL PROGRAMS USING SERIAL COMBINATORS.",
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.",
author = "Paul Hudak and Benjamin Goldberg",
year = "1985",
language = "English (US)",
isbn = "0818606371",
pages = "831--839",
editor = "Douglas DeGroot",
booktitle = "Proceedings of the International Conference on Parallel Processing",
publisher = "IEEE",

}

TY - GEN

T1 - EFFICIENT DISTRIBUTED EVALUATION OF FUNCTIONAL PROGRAMS USING SERIAL COMBINATORS.

AU - Hudak, Paul

AU - Goldberg, Benjamin

PY - 1985

Y1 - 1985

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0022248358&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022248358&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0818606371

SP - 831

EP - 839

BT - Proceedings of the International Conference on Parallel Processing

A2 - DeGroot, Douglas

PB - IEEE

ER -