Abstract

Abstract

Delaunay triangulation is a geometric problem that is relatively difficult to parallelize. Parallel algorithms are usually characterized by considerable interprocessor communication or important serialized parts. In this paper, we propose a method that achieves high speed‐ups, but needs information regarding locally maximum element circumspheres prior to the beginning of the algorithm. Such information is directly available in iterative methods, like the particle finite element methods. The developed parallel Delaunay triangulation method, has minimum communication requirements, is quite simple and achieves high parallel efficiency.

Abstract

An unstructured grid-based, parallel-free surface solver is presented. The overall scheme combines a finite-element, equal-order, projection-type 3-D incompressible flow solver with a finite element, 2-D advection equation solver for the free surface equation. For steady-state applications, the mesh is not moved every timestep, in order to reduce the cost of geometry recalculations and surface repositioning. A number of modifications required for efficient processing on shared-memory, cache-based parallel machines are discussed, and timings are shown that indicate scalability to a modest number of processors. The results show good quantitative comparison with experiments and the results of other techniques. The present combination of unstructured grids (enhanced geometrical flexibility) and good parallel performance (rapid turnaround) should make the present approach attractive to hydrodynamic design simulations.

Abstract

The present article describes a simple element-driven strategy for the conforming refinement of simplicial finite element meshes in a distributed environment. The proposed algorithm is effective both for local adaptive refinement and for the division of all the elements within an existing mesh. We aim to provide sufficient detail to allow the practical implementation of the algorithm, which can be coded with minimal effort provided that a distributed linear algebra library is available. The proposed refinement strategy is composed of three basic components: a global splitting strategy, an elemental splitting procedure and an error estimation technique, which are combined so to guarantee obtaining a conformant refined mesh. A number of benchmark examples show the capabilities of the proposed method. Error is estimated for the incompressible fluid-flow benchmarks using a novel indicator based on the computation of the sub-scale velocity.

Abstract

In this paper we present a fully distributed, communicator-aware, recursive, and interlevel-overlapped message-passing implementation of the multilevel balancing domain decomposition by constraints (MLBDDC) preconditioner. The implementation highly relies on subcommunicators in order to achieve the desired effect of coarse-grain overlapping of computation and communication, and communication and communication among levels in the hierarchy (namely, interlevel overlapping). Essentially, the main communicator is split into as many nonoverlapping subsets of message-passing interface (MPI) tasks (i.e., MPI subcommunicators) as levels in the hierarchy. Provided that specialized resources (cores and memory) are devoted to each level, a careful rescheduling and mapping of all the computations and communications in the algorithm lets a high degree of overlapping be exploited among levels. All subroutines and associated data structures are expressed recursively, and therefore MLBDDC preconditioners with an arbitrary number of levels can be built while re-using significant and recurrent parts of the codes. This approach leads to excellent weak scalability results as soon as level-1 tasks can fully overlap coarser-levels duties. We provide a model to indicate how to choose the number of levels and coarsening ratios between consecutive levels and determine qualitatively the scalability limits for a given choice. We have carried out a comprehensive weak scalability analysis of the proposed implementation for the three-dimensional Laplacian and linear elasticity problems on structured and unstructured meshes. Excellent weak scalability results have been obtained up to 458,752 IBM BG/Q cores and 1.8 million MPI being, being the first time that exact domain decomposition preconditioners (only based on sparse direct solvers) reach these scales. (An erratum is attached.)

Abstract

Abstract

Abstract

Abstract

Abstract