Skip to main navigation Skip to search Skip to main content

Fast parallel implementation of lazy languages - the EQUALS experience

  • Stony Brook University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Scopus citations

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 sequential SML/NJ as well as parallel 〈ν, G〉-machine and GAML implementations.

Original languageEnglish
Title of host publicationProc 92 ACM Conf Lisp Funct Program
PublisherPubl by ACM
Pages335-344
Number of pages10
ISBN (Print)0897914813
StatePublished - 1992
EventProceedings of the 1992 ACM Conference on Lisp and Functional Programming - San Francisco, CA, USA
Duration: Jun 22 1992Jun 24 1992

Publication series

NameProc 92 ACM Conf Lisp Funct Program

Conference

ConferenceProceedings of the 1992 ACM Conference on Lisp and Functional Programming
CitySan Francisco, CA, USA
Period06/22/9206/24/92

Fingerprint

Dive into the research topics of 'Fast parallel implementation of lazy languages - the EQUALS experience'. Together they form a unique fingerprint.

Cite this