Parallel Distributed Implementations of 2D Explicit Euler Solvers
نویسندگان
چکیده
In this work we present a subdomain partitioning strategy applied to an explicit high-resolution Euler solver. We describe the design of a parallel multi-domain code suitable for distributed memory multi-processors. We present several implementations on a distributed virtual shared memory computer as well as on a network of workstations. We give computational results to illustrate the eeciency of this approach.
منابع مشابه
Scalable Parallel RK Solvers for ODEs Derived by the Method of Lines
This paper describes how the specific access structure of the Brusselator equation, a typical example for ordinary differential equations (ODEs) derived by the method of lines, can be exploited to obtain scalable distributed-memory implementations of explicit Runge-Kutta (RK) solvers. These implementations need less communication and therefore achieve better speed-ups than general explicit RK i...
متن کاملSemi-explicit Parareal method based on convergence acceleration technique
The Parareal algorithm is used to solve time-dependent problems considering multiple solvers that may work in parallel. The key feature is a initial rough approximation of the solution that is iteratively refined by the parallel solvers. We report a derivation of the Parareal method that uses a convergence acceleration technique to improve the accuracy of the solution. Our approach uses firstly...
متن کاملCombining Explicit, Recursive Blocking for Solving Triangular Sylvester-Type Matrix Equations on Distributed Memory Platforms
Parallel ScaLAPACK-style hybrid algorithms for solving the triangular continuous-time Sylvester (SYCT) equation AX − XB = C using recursive blocked node solvers from the novel high-performance library RECSY are presented. We compare our new hybrid algorithms with parallel implementations based on the SYCT solver DTRSYL from LAPACK. Experiments show that the RECSY solvers can significantly impro...
متن کاملCombining Explicit and Recursive Blocking for Solving Triangular Sylvester-Type Matrix Equations on Distributed Memory Platforms
Parallel ScaLAPACK-style hybrid algorithms for solving the triangular continuous-time Sylvester (SYCT) equation AX − XB = C using recursive blocked node solvers from the novel high-performance library RECSY are presented. We compare our new hybrid algorithms with parallel implementations based on the SYCT solver DTRSYL from LAPACK. Experiments show that the RECSY solvers can significantly impro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994