WHICH APPROACH TO PARALLELIZING SCIENTIFIC CODES - THAT IS THE QUESTION

We present in this paper the strong points and limitations of semi-aut omatic parallelization, data parallel programming and message passing programming. We apply these on two numerical algorithms namely a bi-di mensional Fourier transform algorithm and a conjugate gradient program s. We implemented this program for each of the different methods on a Gray T3D. The results of these experiments demonstrate the accuracy of our proposition that when the three methods are combined, efficiency, portability and easiness of parallel programming may be achieved.