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.
This research was supported in part by the US Government under DOE grant FG02-86ER25012
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R.M. Burstall, D.B. MacQueen, and D.T. Sannella. Hope: an experimental applicative language. In The 1980 LISP Conference, pages 136–143, Stanford University, August 1980.
T. Clarke, P. Gladstone, and Norman A. MacLean. Skim — the s, k, i reduction machine. In The 1980 LISP Conference, pages 128–135, Stanford University, August 1980.
Intel Corporation. iPSC User's Guide — Preliminary. Technical Report 175455-001, Intel Corporation, July 1985.
P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th ACM Sym. on Prin. of Prog. Lang., pages 238–252, ACM, 1977.
J. Darlington and M. Reeve. Alice: a multi-processor reduction machine for the parallel evaluation of applicative languages. In Functional Programming Languages and Computer Architecture, pages 65–76, ACM, October 1981.
P. Hudak. ALFL Reference Manual and Programmer's Guide. Research Report YALEU/DCS/RR-322, Second Edition, Yale University, October 1984.
P. Hudak. Collecting interpretations of expressions. Research Report 497, Yale University, Department of Computer Science, 1986. submitted to the Third Workshop on the Mathematical Foundations of Programming Language Semantics.
P. Hudak. Object and Task Reclamation in Distributed Applicative Processing Systems. PhD thesis, University of Utah, July 1982.
P. Hudak and B. Goldberg. Distributed execution of functional programs using serial combinators. In Proceedings of 1985 Int'l Conf. on Parallel Proc., pages 831–839, August 1985. Also appeared in IEEE Trans. on Computers, Vol C-34, No. 10, October 1985, pp. 881–891.
P. Hudak and B. Goldberg. Serial combinators: “optimal” grains of parallelism. In Functional Programming Languages and Computer Architecture, pages 382–388, Springer-Verlag LNCS 201, September 1985.
T. Johnsson. The G-machine: an abstract machine for graph reduction. Technical Report, PMG, Dept. of Computer Science, Chalmers Univ. of Tech., February 1985.
R.B. Kieburtz. The G-machine: a fast, graph-reduction evaluator. Technical Report CS/E-85-002, Dept. of Computer Science, Oregon Graduate Center, January 1985.
R. Milner. A proposal for standard ml. In Proc. 1984 ACM Conf. on LISP and Functional Prog., pages 184–197, ACM, August 1984.
A. Mycroft. Abstract Interpretation and Optimizing Transformations for Applicative Programs. PhD thesis, Univ. of Edinburgh, 1981.
D.A. Turner. SASL language manual. Technical Report, University of St. Andrews, 1976.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goldberg, B., Hudak, P. (1987). Alfalfa: Distributed graph reduction on a hypercube multiprocessor. In: Fasel, J.H., Keller, R.M. (eds) Graph Reduction. GR 1986. Lecture Notes in Computer Science, vol 279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18420-1_51
Download citation
DOI: https://doi.org/10.1007/3-540-18420-1_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18420-1
Online ISBN: 978-3-540-47963-5
eBook Packages: Springer Book Archive