Alfalfa: Distributed graph reduction on a hypercube multiprocessor

Benjamin Goldberg, Paul Hudak

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


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
EditorsRobert M. Keller, Joseph H. Fasel
PublisherSpringer Verlag
Number of pages20
ISBN (Print)9783540184201
StatePublished - 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


OtherInternational Workshop on Graph Reduction, 1986
Country/TerritoryUnited States
CitySanta Fe

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Alfalfa: Distributed graph reduction on a hypercube multiprocessor'. Together they form a unique fingerprint.

Cite this