A Provable Time and Space Efficient Implementation of NESL

@inproceedings{Blelloch1996APT,
  title={A Provable Time and Space Efficient Implementation of NESL},
  author={Guy E. Blelloch and John Greiner},
  booktitle={ICFP},
  year={1996}
}
In this paper we prove time and space bounds for the implementation of the programming language NESL on various parallel machine models. NESL is a sugared typed λ-calculus with a set of array primitives and an explicit parallel map over arrays. Our results extend previous work on provable implementation bounds for functional languages by considering space and by including arrays. For modeling the cost of NESL we augment a standard call-by-value operational semantics to return two cost… CONTINUE READING
Highly Influential
This paper has highly influenced 15 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 134 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 94 extracted citations

135 Citations

051015'96'01'07'13'19
Citations per Year
Semantic Scholar estimates that this publication has 135 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…