The control mechanism for the Myrias parallel computer system
ACM SIGARCH Computer Architecture News - Special Issue: Architectural Support for Operating Systems
Supercompilers for parallel and vector computers
Supercompilers for parallel and vector computers
The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
Defining, Analyzing, and Transforming Program Constructs
IEEE Parallel & Distributed Technology: Systems & Technology
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
Mathematical Theory of Program Correctness
Mathematical Theory of Program Correctness
V-cal: A Calculus for the Compilation of Data Parallel Languages
LCPC '95 Proceedings of the 8th International Workshop on Languages and Compilers for Parallel Computing
A Formal Approach to the Compilation of Data-Parallel Languages
LCPC '94 Proceedings of the 7th International Workshop on Languages and Compilers for Parallel Computing
Runtime adjustment of parallel nested loops
WOMPAT'04 Proceedings of the 5th international conference on OpenMP Applications and Tools: shared Memory Parallel Programming with OpenMP
| Hi-index | 0.00 |
In this paper we present a generalized forall statement for parallel languages. The forall statement occurs in many (data) parallel languages and specifies which computations can be performed independently. Many different definitions of such a construct can be found in literature, with differ-ent conditions and execution models. We will show how for-all constructs of a wide class of parallel languages can be mapped to this generalized forall statement. In addition, the forall statement we propose has the ability to spawn more complex independent activities than can be found in these languages. Denotational semantics are used to define the meaning of the forall and define only one possible program state change. It is shown that it is easy to use and that it is feasible to implement this forall efficiently.