Premium
An MPI Parallel Implementation of Newmark's Method
Author(s) -
Namazifard Ali,
Parsons I. D.
Publication year - 2000
Publication title -
computer‐aided civil and infrastructure engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.773
H-Index - 82
eISSN - 1467-8667
pISSN - 1093-9687
DOI - 10.1111/0885-9507.00183
Subject(s) - software portability , computer science , parallel computing , conjugate gradient method , message passing interface , code (set theory) , interface (matter) , message passing , parallel algorithm , ibm , computational science , algorithm , programming language , set (abstract data type) , bubble , maximum bubble pressure method , materials science , nanotechnology
The standard message‐passing interface (MPI) is used to parallelize Newmark's method. The linear matrix equation encountered at each time step is solved using a preconditioned conjugate gradient algorithm. Data are distributed over the processors of a given parallel computer on a degree‐of‐freedom basis; this produces effective load balance between the processors and leads to a highly parallelized code. The portability of the implementation of this scheme is tested by solving some simple problems on two different machines: an SGI Origin2000 and an IBM SP2. The measured times demonstrate the efficiency of the approach and highlight the maintenance advantages that arise from using a standard parallel library such as MPI.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom