scholarly journals Delta: An object-oriented finite element code architecture for massively parallel computers

1996 ◽  
Author(s):  
J.R. Weatherby ◽  
J.A. Schutt ◽  
J.S. Peery ◽  
R.E. Hogan
Keyword(s):  
Finite Element ◽  
Object Oriented ◽  
Parallel Computers ◽  
Massively Parallel ◽  
Finite Element Code ◽  
Massively Parallel Computers

scholarly journals C++ and Massively Parallel Computers

1993 ◽  
Vol 2 (4) ◽  
pp. 193-202 ◽  
Author(s):  
Daniel J. Lickly ◽  
Philip J. Hatcher
Keyword(s):  
Object Oriented ◽  
Feasibility Studies ◽  
Parallel Computers ◽  
Parallel Architectures ◽  
Parallel Execution ◽  
Object Oriented Programming ◽  
Massively Parallel ◽  
Data Parallel ◽  
Massively Parallel Computers ◽  
Massively Parallel Architectures

Our goal is to apply the software engineering advantages of object-oriented programming to the raw power of massively parallel architectures. To do this we have constructed a hierarchy of C++ classes to support the data-parallel paradigm. Feasibility studies and initial coding can be supported by any serial machine that has a C++ compiler. Parallel execution requires an extended Cfront, which understands the data-parallel classes and generates C*code. (C*is a data-parallel superset of ANSI C developed by Thinking Machines Corporation). This approach provides potential portability across parallel architectures and leverages the existing compiler technology for translating data-parallel programs onto both SIMD and MIMD hardware.

The Fast Multipole Method in Canonical Ensemble Dynamics on Massively Parallel Computers

1992 ◽  
Vol 278 ◽  
Author(s):  
Steven R. Lustig ◽  
J.J. Cristy ◽  
D.A. Pensak
Keyword(s):  
Canonical Ensemble ◽  
Yukawa Potential ◽  
Direct Method ◽  
Fast Multipole Method ◽  
Parallel Computers ◽  
Massively Parallel ◽  
Fast Multipole ◽  
Massively Parallel Computers ◽  
Multipole Method ◽  
Execution Times

AbstractThe fast multipole method (FMM) is implemented in canonical ensemble particle simulations to compute non-bonded interactions efficiently with explicit error control. Multipole and local expansions have been derived to implement the FMM efficiently in Cartesian coordinates for soft-sphere (inverse power law), Lennard- Jones, Morse and Yukawa potential functions. Significant reductions in execution times have been achieved with respect to the direct method. For a given number, N, of particles the execution times of the direct method scale asO(N2). The FMM execution times scale asO(N) on sequential workstations and vector processors and asymptotically0(logN) on massively parallel computers. Connection Machine CM-2 and WAVETRACER-DTC parallel FMM implementations execute faster than the Cray-YMP vectorized FMM for ensemble sizes larger than 28k and 35k, respectively. For 256k particle ensembles the CM-2 parallel FMM is 12 times faster than the Cray-YMP vectorized direct method and 2.2 times faster than the vectorized FMM. For 256k particle ensembles the WAVETRACER-DTC parallel FMM is 33 times faster than the Cray-YMP vectorized direct method.

Design of object oriented finite element code

2001 ◽  
Vol 32 (10-11) ◽  
pp. 759-767 ◽  
Author(s):  
B Patzák ◽  
Z Bittnar
Keyword(s):  
Finite Element ◽  
Object Oriented ◽  
Finite Element Code
Sign in / Sign up

Export Citation Format

Share Document