A superset of the C programming language that is applicable to the SIMD/MIMD mode processing environment of PASM is described. The language extensions for SIMD mode include the definition of parallel variables, functions, and expressions; a scheme for accessing parallel variables; and extended control structure semantics. Extensions for MIMD mode are realized by defining a preprocessor to conve...

This paper dis usses an extension of Haskell by support for nested data-parallel programming in the style of the spe ialpurpose language Nesl. More pre isely, the extension onsists of a parallel array type, array omprehensions, and a set of primitive parallel array operations. This extension brings a hitherto unsupported style of parallel programming to Haskell. Moreover, nested data parallelis...

High-level control of parallel process behaviour simplifies the development of parallel software substantially by freeing the programmer from low-level process management and coordination details. The latter are handled by a sophisticated runtime system which controls program execution. In this paper we look behind the scenes and show how the enormous gap between high-level parallel language co...

We evaluate the impact of programming language features on the performance of parallel applications on modern parallel architectures, particularly for the demanding case of sparse integer codes. We compare a number of programming languages (Pthreads, OpenMP, MPI, UPC) on both shared and distributed-memory architectures. We find that language features can make parallel programs easier to write, ...

The notion of isolating the \common case" is a well known computer science principle. This paper describes ZPL, a language that treats data parallelism as a common case of MIMD parallelism. This separation of concerns has many bene ts. It allows us to de ne a clean and concise language for describing data parallel computations, and this in turn leads to e cient parallel execution. Our particula...

The notion of isolating the \common case" is a well known computer science principle. This paper describes ZPL, a language that treats data parallelism as a common case of MIMD parallelism. This separation of concerns has many bene ts. It allows us to de ne a clean and concise language for describing data parallel computations, and this in turn leads to e cient parallel execution. Our particula...