Inproceedings,

ZPL: An Array Sublanguage

, and .
Proceedings of the Sixth International Workshop on Languages and Compilers for Parallel Computing, volume 768 of Lecture Notes in Computer Science, page 96--114. Springer, (1994)
DOI: 10.1007/3-540-57659-2_6

Abstract

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 benefits. It allows us to define a clean and concise language for describing data parallel computations, and this in turn leads to efficient parallel execution. Our particular language also provides mechanisms for handling boundary conditions. We introduce the concepts, constructs and semantics of our new language, and give a simple example that contrasts ZPL with other data parallel languages.

Tags

Users

  • @gron

Comments and Reviews