ACM Home Page
Please provide us with feedback. Feedback
Fast parallel implementation of lazy languages—the EQUALS experience
Full text PdfPdf (1.03 MB)
Source Conference on LISP and Functional Programming archive
Proceedings of the 1992 ACM conference on LISP and functional programming table of contents
San Francisco, California, United States
Pages: 335 - 344  
Year of Publication: 1992
ISBN:0-89791-481-3
Also published in ...
Authors
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 17,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/141471.141570
What is a DOI?

ABSTRACT

This paper describes EQUALS, a fast parallel implementation of a lazy functional language on a commercially available shared-memory parallel machine, the Sequent Symmetry. In contrast to previous implementations, we detect parallelism automatically by propagating exhaustive (normal form) demand. Another important difference between EQUALS and previous implementations is the use of reference counting for memory management instead of garbage collection. Our implementation shows that reference counting leads to very good scalability, low memory requirements and improved locality. We compare our results with sequntial SML/NJ as well as parallel (v, G-machine and GAML implementations.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

AEL88
 
Aug84
L. Augustsson, A compiler for lazy M~, LFP,1984.
 
Aug89
L. Augustsson and T. Johnsson, Parallel graph reduction with the (u, G) machzne, FPCA, t989.
Dar81
Geo89
 
Gol88a
B. Goldberg, Buckwheat: Graph reduction on shared-memory multiprocessor, LFP, t988.
 
Gol88b
Joh84
 
HL79
G. Huet and J.J. Levy, Computatzons ~n hot, ambiguous hnear term rewriting systems, Tech Rep. No. 359, 1979, IRIA, ke Chesney, France, 1979.
 
Lav88
 
Mar91
MKH90
PS90
 
PJ87
S.L. Peyton Jones, GRIP: A parallel graph reduction machine, FPCA, 1987.
SPR90
 
SRR92
 
Seq87
Sequent Computer Systems, Sequent guide to parallel programming, 1987.
 
WW87


Collaborative Colleagues:
O. Kaser: colleagues
S. Pawagi: colleagues
C. R. Ramakrishnan: colleagues
I. V. Ramakrishnan: colleagues
R. C. Sekar: colleagues