Compile-time techniques for data distribution in distributed memory machines

1991 ◽  
Vol 2 (4) ◽  
pp. 472-482 ◽  
Author(s):  
J. Ramanujam ◽  
P. Sadayappan
1994 ◽  
Vol 04 (03) ◽  
pp. 301-312 ◽  
Author(s):  
VINCENT VAN DONGEN

Given a loop written in a sequential language and a block-cyclic distribution, we present some techniques for generating SPMD code to run on distributed-memory machines. This is illustrated on three types of loops: parallel loops without internal dependence, parallel loops with internal dependences, and loops with hidden parallelism. Two models of distributions are considered: the data distribution and the computation distribution. We argue here that the data distribution model together with the owner-computes rule is only well adapted for the first class of loops. For the other loops, we present the idea of using a computation distribution instead, and we show how this can be compiled for distributed-memory machines.


1992 ◽  
Vol 1 (1) ◽  
pp. 31-50 ◽  
Author(s):  
Barbara Chapman ◽  
Piyush Mehrotra ◽  
Hans Zima

Exploiting the full performance potential of distributed memory machines requires a careful distribution of data across the processors. Vienna Fortran is a language extension of Fortran which provides the user with a wide range of facilities for such mapping of data structures. In contrast to current programming practice, programs in Vienna Fortran are written using global data references. Thus, the user has the advantages of a shared memory programming paradigm while explicitly controlling the data distribution. In this paper, we present the language features of Vienna Fortran for FORTRAN 77, together with examples illustrating the use of these features.


1995 ◽  
Vol 2 (2) ◽  
pp. 18-29 ◽  
Author(s):  
Ynan-Shin Hwang ◽  
R. Das ◽  
J.H. Saltz ◽  
M. Hodoscek ◽  
B.R. Brooks

Sign in / Sign up

Export Citation Format

Share Document