next up previous [Postscript]Postscript version of this document
Next: 1 Introduction

Efficiency Comparison of Explicit and Implicit Parallel Programming for a FEM Problem on HP Exemplar Systems

J. Plazek1, J. Kitowski2,3 and K. Banas1

1 Section of Applied Mathematics UCK, Cracow University of Technology, ul. Warszawska 24, 31-155 Cracow, Poland

2 Institute of Computer Science, AGH, al. Mickiewicza 30, 30-059 Cracow, Poland

3 ACC CYFRONET, ul. Nawojki 11, 30-950 Cracow, Poland

Abstract:

In this paper we compare two parallel programming models: the explicit model (with message-passing paradigm) and the implicit one (in which data-parallel programming is used) applied for solving finite element problems on unstructured grids.

In the first the domain decomposition of the unstructured grid is applied, while the second uses the functional decomposition - both applied to the preconditioned GMRES method that solves iteratively the finite element system of linear equations. They have been tested on HP Exemplar SPP computers.

As test cases for measuring the performance of the parallel versions of the GMRES we used two flow simulations where sequences of finite element solutions form time approximations to the Euler equations.


 
in: Bubak, M., Moscinski, J., (Eds.), Proc. Int. Conf. High Performance Computing on Hewlett-Packard Systems, Cracow, Poland, November 5-8, 1997, pp. 181-188, CCNS Ltd Krakow, 1997.