Passing Programming on a Finite Element Application

نویسندگان

  • R. BERRENDORF
  • M. GERNDT
  • Z. LAHJOMRI
  • T. PRIOL
چکیده

This paper describes the methods used and experiences made with implementing a nite element application on three diierent parallel computers with either message passing or shared virtual memory as the programming model. Designing a parallel nite element application using message-passing requires to nd a data domain decomposition to map data into the local memory of the processors. Since data accesses may be very irregular, communication patterns are unknown prior to the parallel execution and thus makes the parallelization a diicult task. We argue that the use of a shared virtual memory greatly simpliies the parallelization step. It is shown experimentally on an hypercube iPSC/2 that the use of the KOAN/Fortran-S programming environment based on a shared virtual memory allows to port quickly and easily a sequential application without a signiicant degradation in performance compared to the message passing version. Results for recent parallel architectures such as the Paragon XP/S for message-passing and the KSR1 for shared virtual memory are presented, too. Comparaison des techniques de m emoire virtuelle partag ee et d' echange de messages a l'aide d'une application par el ement nie R esum e : Ce papier pr esente les r esultats d'une mise en oeuvre d'une application par el ement nie sur trois architectures parall eles en utilisant soit l' echange de messages soit une m emoire virtuelle partag ee. La conception d'une application par el ement nie sur une architecture parall ele a m emoire distribu ee n ecessite une d ecomposition de domaine aan de placer les donn ees dans les m emoires locales des processeurs. Les acc es aux donn ees etant irr eguliers, la parall elisation est une t^ ache complexe. Nous montrons que l'utilisation d'une m emoire virtuelle partag ee simpliie grandement cette t^ ache. Nous montrons, a l'aide de r esultats exp erimentaux sur un hypercube iPSC/2, que l'utilisation de l'environnement de programmation KOAN/Fortran-S permet le portage rapide d'une telle application sans constater une perte signiicative. Nous pr esentons egalement des r esultats sur des machines plus r ecentes comme le Paragon XP/S et la KSR-1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Comparison of Shared Virtual Memory and Message Passing Programming Techniques Based on a Finite Element Application

This paper describes the methods used and experiences made with implementing a nite element application on three diierent parallel computers with either message passing or shared virtual memory as the programming model. Designing a parallel nite element application using message-passing requires to nd a data domain decomposition to map data into the local memory of the processors. Since data ac...

متن کامل

PERFORMANCE OF HYBRID OpenMP/MPI PARALLEL PROGRAMMING APPLICATION OF FINITE ELEMENT METHOD

In the area of parallel processing and parallel algorithms several processors are used together to execute a single application faster. There are two major programming paradigms: Shared Memory and Message Passing. Each of them fits into a specific physical model, but there are multiprocessors architectures whose mapping to one of these paradigms is not so simple. SMP clusters, for example, are ...

متن کامل

Parallel Finite Element Method for Coupled Chloride Moisture Diffusion in Concrete

Penetration of chloride ions into concrete and diffusion of moisture in concrete are important factors responsible for the corrosion of steel in concrete. The two diffusion processes are coupled. This paper deals with the analysis and simulation of coupled chloride penetration and moisture diffusion in concrete. Of particular interest is the parallel programming in finite element method for sol...

متن کامل

Computational and Programming Aspects of Transition Elements in a Three-dimensional Finite Element Program

The performance of any finite element (FE) structural analysis is directly related to the global number of nodes and degrees of freedom (DOF) of the discretized structure and mesh distribution attributes. It is obvious that the appropriate numerical analysis needs finer elements in the zone of interest, e.g. zone of high stress concentration and intensity, and coarser elements for farther porti...

متن کامل

Parallel Object-Oriented Computation Applied to a Finite Element Problem

The conventional wisdom in the scientific computing community is that the best way to solve largescale numerically-intensive scientific problems on today’s parallel MIMD computers is to use Fortran or C programmed in a data-parallel style using low-level message-passing primitives. This approach inevitably leads to non-portable codes and extensive development time, and restricts parallel progra...

متن کامل

Finite Element Message - Passing / DSMSimulation Algorithm for Parallel

In this paper we propose a heterogeneous parallel algorithm for nite element compressible uid ow simulations on unstructured grids. The algorithm incorporates two kinds of programming models: the explicit model (with message-passing paradigm) and the implicit one (in which data-parallel programming is used).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994