NESL is a parallel programming language developed at Carnegie Mellon by the SCandAL project and released in 1993. It integrates various ideas from parallel algorithms, functional programming, and array programming languages.
| Paradigm | parallel, functional, array |
|---|---|
| Developer | SCandAL project |
| First appeared | 1993 |
| Stable release | 3.1
/ November 1995 |
| License | permissive license similar to the ISC and X11 licenses |
The most important new ideas behind NESL are
- Nested data parallelism: this feature offers the benefits of data parallelism, concise code that is easy to understand and debug, while being well suited for irregular algorithms, such as algorithms on trees, graphs or sparse matrices.
- A language based performance model: this gives a formal way to calculate the work and depth of a program. These measures can be related to running time on parallel machines.
The main design guideline for NESL was to make parallel programming easy and portable. Algorithms are typically significantly more concise in NESL than in most other parallel programming languages, and the code closely resembles high-level pseudocode.
NESL handles nested data parallelism by using the flattening transformation to convert nested data parallelism to flat data parallelism. This works by storing nested vectors as the nested data and a segment descriptor of vector lengths, separately.[1] This flattening transform, however, can increase the asymptotic work and space complexity of the original program, leading to a much less efficient result.[2]
Influences
editSee also
editReferences
edit- ^ Blelloch, Guy (1995). "NESL: A Nested Data-Parallel Language".
{{cite journal}}: Cite journal requires|journal=(help) - ^ Spoonhower, Daniel; Harper; Blelloch; Gibbons (2008). "Space profiling for parallel functional programs".
{{cite journal}}: Cite journal requires|journal=(help) - ^ Jones, Simon Peyton. "Data Parallel Haskell". YouTube. Retrieved 6 September 2011.
External links
edit
 | This programming-language-related article is a stub. You can help Wikipedia by expanding it. |