Alfalfa

Distributed graph reduction on a hypercube multiprocessor

Benjamin Goldberg, Paul Hudak

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

Abstract

Alfalfa is 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 consists of 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 and 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.

Original languageEnglish (US)
Title of host publicationGraph Reduction - Proceedings of a Workshop
PublisherSpringer Verlag
Pages94-113
Number of pages20
Volume279 LNCS
ISBN (Print)9783540184201
DOIs
StatePublished - Jan 1 1987
EventInternational Workshop on Graph Reduction, 1986 - Santa Fe, United States
Duration: Sep 29 1986Oct 1 1986

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume279 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherInternational Workshop on Graph Reduction, 1986
CountryUnited States
CitySanta Fe
Period9/29/8610/1/86

Fingerprint

Graph Reduction
Storage management
Runtime Systems
Multiprocessor
Hypercube
Compiler
Synchronization
Scheduling
Or-parallelism
Statistics
Interprocessor Communication
Abstract Machines
Dynamic Scheduling
Communication
Parallelism
Language
Model

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Goldberg, B., & Hudak, P. (1987). Alfalfa: Distributed graph reduction on a hypercube multiprocessor. In Graph Reduction - Proceedings of a Workshop (Vol. 279 LNCS, pp. 94-113). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 279 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-18420-1_51

Alfalfa : Distributed graph reduction on a hypercube multiprocessor. / Goldberg, Benjamin; Hudak, Paul.

Graph Reduction - Proceedings of a Workshop. Vol. 279 LNCS Springer Verlag, 1987. p. 94-113 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 279 LNCS).

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

Goldberg, B & Hudak, P 1987, Alfalfa: Distributed graph reduction on a hypercube multiprocessor. in Graph Reduction - Proceedings of a Workshop. vol. 279 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 279 LNCS, Springer Verlag, pp. 94-113, International Workshop on Graph Reduction, 1986, Santa Fe, United States, 9/29/86. https://doi.org/10.1007/3-540-18420-1_51
Goldberg B, Hudak P. Alfalfa: Distributed graph reduction on a hypercube multiprocessor. In Graph Reduction - Proceedings of a Workshop. Vol. 279 LNCS. Springer Verlag. 1987. p. 94-113. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-18420-1_51
Goldberg, Benjamin ; Hudak, Paul. / Alfalfa : Distributed graph reduction on a hypercube multiprocessor. Graph Reduction - Proceedings of a Workshop. Vol. 279 LNCS Springer Verlag, 1987. pp. 94-113 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{1c3ccd82b6e64a5487d011983b501e4a,
title = "Alfalfa: Distributed graph reduction on a hypercube multiprocessor",
abstract = "Alfalfa is 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 consists of 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 and 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.",
author = "Benjamin Goldberg and Paul Hudak",
year = "1987",
month = "1",
day = "1",
doi = "10.1007/3-540-18420-1_51",
language = "English (US)",
isbn = "9783540184201",
volume = "279 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "94--113",
booktitle = "Graph Reduction - Proceedings of a Workshop",
address = "Germany",

}

TY - GEN

T1 - Alfalfa

T2 - Distributed graph reduction on a hypercube multiprocessor

AU - Goldberg, Benjamin

AU - Hudak, Paul

PY - 1987/1/1

Y1 - 1987/1/1

N2 - Alfalfa is 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 consists of 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 and 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.

AB - Alfalfa is 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 consists of 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 and 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.

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

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

U2 - 10.1007/3-540-18420-1_51

DO - 10.1007/3-540-18420-1_51

M3 - Conference contribution

SN - 9783540184201

VL - 279 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 94

EP - 113

BT - Graph Reduction - Proceedings of a Workshop

PB - Springer Verlag

ER -