Fast Parallel Implementation of Lazy Languages - The EQUALS Experience

Fast Parallel Implementation of Lazy Languages - The EQUALS Experience (1992)

Cached

Download Links

[seclab.cs.sunysb.edu]
[ftp.cs.sunysb.edu]

Other Repositories/Bibliography

DBLP

by Owen Kaser , Shaunak Pawagi , C. R. Ramakrishnan , I. V. Ramakrishnan , R. C. Sekar

Venue:	Journal of Functional Programming
Citations:	12 - 4 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Fast Parallel Implementation of Lazy Languages - The EQUALS Experience	user correction - Legacy Corrections
AUTHOR NAME	Owen Kaser	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Mathematics, Statistics and Computer Science; University of New Brunswick at Saint John	SVM HeaderParse 0.2
AUTHOR ADDR	Saint John, NB E2L 4L5, Canada.	SVM HeaderParse 0.1
AUTHOR NAME	Shaunak Pawagi	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science; SUNY at	SVM HeaderParse 0.2
AUTHOR ADDR	Stony Brook, NY 11794.	SVM HeaderParse 0.1
AUTHOR NAME	C. R. Ramakrishnan	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science; SUNY at	SVM HeaderParse 0.2
AUTHOR ADDR	Stony Brook, NY 11794.	SVM HeaderParse 0.1
AUTHOR NAME	I. V. Ramakrishnan	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science; SUNY at	SVM HeaderParse 0.2
AUTHOR ADDR	Stony Brook, NY 11794.	SVM HeaderParse 0.1
AUTHOR NAME	R. C. Sekar	SVM HeaderParse 0.1
AUTHOR ADDR	Bellcore, 445 South Street; Morristown, NJ 07962.	SVM HeaderParse 0.1
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 using strictness analysis. 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 other sequential (SML/NJ) and parallel (h; Gi-machine and GAML) implementations of functional languages.	user correction - Legacy Corrections
YEAR	1992	INFERENCE
VENUE	Journal of Functional Programming	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	335--344	INFERENCE
VOLUME	7	INFERENCE
CITATIONS	24 found	ParsCit 1.0