L. Bouge. The data parallel programming model: A semantic perspective. In The Data Parallel Programming Model: Foundations, HPF Realization, and Scientific Applications. Springer-Verlag, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
What Really is Data Parallel Programming? - Violard (2000) (Correct)
.... HPF ALIGN A(I,J) WITH B(I,J) FORALL ( I=1:9, J=1:9 ) B(I,J) A(I,J) A(I 1,J) A(I,J 1) END FORALL . These two programs are equivalent: they only differ syntactically and could illustrate the dual macroscopic and microscopic views of data parallel programs [2]. Although the second syntactic form is not allowed in C , there is no important difference between HPF and C for expressing parallelism. Here is an equivalent program in C : shape [10] 10]matrix; real:matrix A, B . where ( pcoord(0) 0) pcoord(1) 0) B = A [ 1] A ....
L. Bouge, D. Cachera, Y. Guyadec, G. Utard, and B. Virot. The data parallel programming model: A semantic perspective. In LNCS Tutorial: The Data Parallel Programming Model, volume 1132, pages 4--26. Springer-Verlag, 1996.
Stages and Transformations in Parallel Programming - Gorlatch (1996) (6 citations) (Correct)
....explicitly. The feasibility of the approach relies on the following arguments: ffl In the design view, an algorithm is specified as if the data were globally addressable and there is a single logical execution thread. It has been demonstrated in both CSP [10] and data parallel programming [11], that programming in such SEQ of PAR view is much easier than attempting to directly deal with data on many processors and with many different execution threads. ffl Many practical parallel applications are naturally specifiable as a sequence of potentially parallel steps, where each step is a ....
....regarding its influence on the performance. Our case studies account for the communication costs and yield either asymptotic time and cost optimality or constant time improvements confirmed by machine tests. Our approach extends the idea of communication closed layers in imperative programming [10, 11] by putting the stage abstraction into the transformational calculus of BMF, which makes stages themselves and their interface an object of design and ensures the design correctness. Our work is inspired and heavily influenced by the seminal research on applying BMF to parallel computing [8] The ....
L. Bouge. The data-parallel programming model: a semantic perspective. Research Report 92-45, Ecole Normale Superieure de Lyon, 1992.
Renewed Hope for Data Parallelism: Unintegrated Support for Task.. - Deitz (2003) (1 citation) (Correct)
No context found.
L. Bouge. The data parallel programming model: A semantic perspective. In The Data Parallel Programming Model: Foundations, HPF Realization, and Scientific Applications. Springer-Verlag, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC