NESL: A Nested Data-Parallel Language (Version 2.6)
Guy E. Blelloch · 1993
The views and conclusions contained in this document are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of Wright Laboratory or the U. S. Government. Keywords: Data-parallel, parallel algorithms, supercomputers, nested parallelism, This report describes Nesl, a strongly-typed, applicative, data-parallel language. Nesl is intended to be used as a portable interface for programming a variety of parallel and vector computers, and as a basis for teaching parallel algorithms. Parallelism is supplied through a simple set of data-parallel constructs based on sequences, including a mechanism for applying any function over the elements of a sequence in parallel and a rich set of parallel functions that manipulate sequences. Nesl fully supports nested sequences and nested parallelism—the ability to take a parallel function and apply it over multiple instances in parallel. Nested parallelism is important for implementing algorithms with irregular nested loops (where the inner loop lengths depend on the outer iteration) and for divide-and-conquer algorithms. Nesl also provides a performance model for calculating the asymptotic performance of a program on
Cited by 112 works.
Authors
References
- A programming language
- Computational geometry. an introduction
- Computer Processing of Line-Drawing Images
- The Definition of Standard ML
- Scans as primitive parallel operations
- The Parallel Evaluation of General Arithmetic Expressions
- Parallelism in random access machines
- Programming with Sets: An Introduction to SETL
- An O(n2log n) parallel max-flow algorithm
- Vector models for data-parallel computing