Article

Free access

An abstract machine for parallel graph reduction

Author:

Lal GeorgeAuthors Info & Claims

FPCA '89: Proceedings of the fourth international conference on Functional programming languages and computer architecture

Pages 214 - 229

https://doi.org/10.1145/99370.99387

Published: 01 November 1989 Publication History

First page of PDF

References

[1]

Arvind, Nikhil, R. S., and Pingali, K. K. lstructures: data structures for parallel computing. In Graph Reduction: Proceedings of a Workshop, J. H. Fasel and R. M. Keller, Eds., Springer-Verlag, 1987, pp. 336-369. Lecture Notes in Computer Science No. 279.

Digital Library

[2]

B~ge, G., and Lindstrom, G. Committed choice functional programming. In Proc. International Conference on Fifth Generation Computer Systems (Tokyo, November 1988), Institute for New Generation Computer Technology (ICOT), pp. 666-674.

[3]

Burn, G., Peyton Jones, S. L., and Robson, J. D. The spineless g-machine. In Proc. of the 1988 A CM Conf. on Lisp and Functional Programming (July 1988), ACM, pp. 244-258. Conf. at Snowbird, Utah.

Digital Library

[4]

Burn, G. L. Evaluation Transformers- A Model for the Parallel Evaluation of Functional LaNguages. LNC$ P74, Springer-Verlag, 1987, pp. 446-470. Portland Oregon Proc., Ed. Gilles Kahn.

Digital Library

[5]

Clarke, T., Gladstone, P., and MacLean, N. A. SKIM - the s, k, i reduction machine. In The 1980 LISP Conference (August 1980), pp. 128-135. Stanford University.

Digital Library

[6]

Darlington, J., and Reve, M. ALICE: a multiprocessor reduction machine for the parallel evaluation of applicative languages. In Functional Programming Languages and Computer Architecture (October 1981), ACM, pp. 65-76.

Digital Library

[7]

George, L. Efficient Normal Order Evaluation Through Slriciness information. Master's thesis, University of Utah, March 1987.

[8]

Goldberg, B. E. Buckwheat: graph reduction on a shared memory multiprocessor. In Proc. of the 1988 A CM Conference on Lisp and Functional Programming (July 1988), ACM, pp. 40-51. Snowbird, Utah.

Digital Library

[9]

Goldberg, B.E. Multiprocessor Ezecution of Functional Programs. PhD thesis, Yale University, Dept. of Computer Science, April 1988. YALEU /I)CS/RR-61S.

Digital Library

[10]

Hankin, C. L., Osmon, P. E., and Shute, M. J. COBWEB: A Combinaior Reduction Architecture. LNC$ 201, Springer-Verlag, 1985, pp. 99-112.

Digital Library

[11]

Harper, R. Introduction to Standard ML. LFCS Report Series ECS-LFCS-86-14, Computer Science Department, Edinburgh University, November 1986.

[12]

Itudak, P., and Goldberg, B. E. Serial Combinatots "Optimal" Grains of Parallelism. LNCS 201, Springer-Verlag, 1985, pp. 382-388.

[13]

Johnsson, T. Efficient compilation of lazy evaluation. In Proc. Syrup. on Compiler Construction (Montreal, 1984), ACM SIGPLAN.

Digital Library

[14]

Johnsson, T. The < v, g >-machine: an abstract machine for parallel graph reduction. In Proc. WG 10.1 Workshop on Concepts and Characteristics of Declarative Systems (Budapest, October 1988), G. David, Ed., IFIP. Also appears in this proceedings.

[15]

Lindstrom, G. Static analysis of functional programs with logical variables. In Proc. Internatioual Workshop on Programming Language implementation and Logic Programming (PL~rLP '88), Springer Lecture Notes in Computer Science Number 348, Orleans, France, 1989, pp. 1-19.

Digital Library

[16]

Lindstrom, G., George, L., and Yeh, D. Generating efficient code from strictness annotations. In Proc.$econd Int. Join! Conf. on Theory and Prec. rice of Software Development (TAPSOFT) (March 1987).

Digital Library

[17]

Peyton Jones, S. L. The implementation of Fuuctional Proyramminy Lauyuayes. Iuternational Se. ties In Compater Science, Prentice-Hall, 1987.

Digital Library

[18]

Peyton Jones, S. L. Parallel implementations of functional programming languages. The Computer Journal g~, 2 (1989), 175-186.

Digital Library

[19]

Peyton Jones, S. L., Clack, C., Salkild, J., and Hardie, M. GRIP. a high performance architecture for parallel graph raductiou. LNCS ~74, Springer- Verlag, 1987, pp. 98-112.

Digital Library

[20]

Scheevel, M. NORMA: a graph reduction processor. In Proc. of the 1986 A CM Conference on Lisp and Functional Programming (August 1986), ACM, pp. 212-219.

Digital Library

[21]

Stoye, W. It., Clarke, J. W., and Norman, A. C. Some practical methods for rapid combinator reduction. In Proc. of the A CM Conference on LISP aud Functioual Profmmming (August 1984), ACM, pp. 159-166.

Digital Library

[22]

Thomas, B., Gurwitz, B., Goodhue, J., and Allen, D. Butterfly parallel processor: overview. Tech. Rep. 6148, BBN Laboratories Incorporated, March 1986.

[23]

Turner, D. A. A new implementation technique for applicative languages. Software Practice and Ezperience 9 (1979), 31-49.

[24]

Veh, D. Static Evaluation of a Functional Language Through Strictness Analysis. Master's thesis, University of Utah, December 1987.

Cited By

Johnsson T(2005)Parallel evaluation of functional programs: The 〈ν, G〉-machine approachPARLE '91 Parallel Architectures and Languages Europe10.1007/BFb0035092(1-5)Online publication date: 23-Jun-2005
https://doi.org/10.1007/BFb0035092
Kaser O(2005)Inlining to reduce stack spaceProgamming Language Implementation and Logic Programming10.1007/3-540-57186-8_84(262-274)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-57186-8_84
Langendoen KVree W(2005)FRATS: A parallel reduction strategy for shared memoryProgramming Language Implementation and Logic Programming10.1007/3-540-54444-5_91(99-110)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-54444-5_91
Show More Cited By

Index Terms

An abstract machine for parallel graph reduction

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

FPCA '89: Proceedings of the fourth international conference on Functional programming languages and computer architecture

November 1989

395 pages

ISBN:0897913280

DOI:10.1145/99370

Chairman:
Joseph E. Stoy

Copyright © 1989 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages
IFIP WG 2.8: IFIP WG 2.8
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

FPCA89

Sponsor:

SIGPLAN
IFIP WG 2.8
SIGARCH

FPCA89: The International Conference on Functional Programming Languages & Computer Architectures

September 11 - 13, 1989

Imperial College, London, United Kingdom

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
392
Total Downloads

Downloads (Last 12 months)22
Downloads (Last 6 weeks)2

Reflects downloads up to 14 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Johnsson T(2005)Parallel evaluation of functional programs: The 〈ν, G〉-machine approachPARLE '91 Parallel Architectures and Languages Europe10.1007/BFb0035092(1-5)Online publication date: 23-Jun-2005
https://doi.org/10.1007/BFb0035092
Kaser O(2005)Inlining to reduce stack spaceProgamming Language Implementation and Logic Programming10.1007/3-540-57186-8_84(262-274)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-57186-8_84
Langendoen KVree W(2005)FRATS: A parallel reduction strategy for shared memoryProgramming Language Implementation and Logic Programming10.1007/3-540-54444-5_91(99-110)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-54444-5_91
Pettorossi APietropoli EProietti M(1993)The Use of the Tupling Strategy in the Development of Parallel ProgramsParallel Algorithm Derivation and Program Transformation10.1007/978-0-585-27330-3_4(111-151)Online publication date: 1993
https://doi.org/10.1007/978-0-585-27330-3_4
Kaser OPawagi SRamakrishnan CRamakrishnan ISekar R(1992)Fast parallel implementation of lazy languages—the EQUALS experienceACM SIGPLAN Lisp Pointers10.1145/141478.141570V:1(335-344)Online publication date: 1-Jan-1992
https://dl.acm.org/doi/10.1145/141478.141570
Kaser OPawagi SRamakrishnan CRamakrishnan ISekar RWhite J(1992)Fast parallel implementation of lazy languages—the EQUALS experienceProceedings of the 1992 ACM conference on LISP and functional programming10.1145/141471.141570(335-344)Online publication date: 3-Jan-1992
https://dl.acm.org/doi/10.1145/141471.141570
George LLindstrom G(1992)Using a Functional Language id Graph Reduction to Program Multiprocessor Machines, or Functional Control of Imperative ProgramsProceedings of the 6th International Parallel Processing Symposium10.1109/IPPS.1992.223017(370-373)Online publication date: 1-Mar-1992
https://dl.acm.org/doi/10.1109/IPPS.1992.223017
Parrott DClack C(1992)A Common Graphical FormDeclarative Programming, Sasbachwalden 199110.1007/978-1-4471-3794-8_15(224-238)Online publication date: 1992
https://doi.org/10.1007/978-1-4471-3794-8_15
Johnsson T(1991)Parallel Evaluation of Functional Programs: The 〈v, G〉-machine approach (Summary)Parle ’91 Parallel Architectures and Languages Europe10.1007/978-3-662-25209-3_1(1-5)Online publication date: 1991
https://doi.org/10.1007/978-3-662-25209-3_1

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents