Towards Textbook Efficiency for Parallel Multigrid

2015 ◽  
Vol 8 (1) ◽  
pp. 22-46 ◽  
Author(s):  
Björn Gmeiner ◽  
Ulrich Rüde ◽  
Holger Stengel ◽  
Christian Waluga ◽  
Barbara Wohlmuth

In this work, we extend Achi Brandt's notion of textbook multigrid efficiency (TME) to massively parallel algorithms. Using a finite element based geometric multigrid implementation, we recall the classical view on TME with experiments for scalar linear equations with constant and varying coefficients as well as linear systems with saddle-point structure. To extend the idea of TME to the parallel setting, we give a new characterization of a work unit (WU) in an architecture-aware fashion by taking into account performance modeling techniques. We illustrate our newly introduced parallel TME measure by large-scale computations, solving problems with up to 200 billion unknowns on a TOP-10 supercomputer.

1997 ◽  
Vol 23 (9) ◽  
pp. 1365-1377 ◽  
Author(s):  
Genki Yagawa ◽  
Yasushi Nakabayashi ◽  
Hiroshi Okuda

2019 ◽  
Vol 878 ◽  
pp. 544-597 ◽  
Author(s):  
Andrew M. Fiore ◽  
James W. Swan

We present a new method for large scale dynamic simulation of colloidal particles with hydrodynamic interactions and Brownian forces, which we call fast Stokesian dynamics (FSD). The approach for modelling the hydrodynamic interactions between particles is based on the Stokesian dynamics (SD) algorithm (J. Fluid Mech., vol. 448, 2001, pp. 115–146), which decomposes the interactions into near-field (short-ranged, pairwise additive and diverging) and far-field (long-ranged many-body) contributions. In FSD, the standard system of linear equations for SD is reformulated using a single saddle point matrix. We show that this reformulation is generalizable to a host of particular simulation methods enabling the self-consistent inclusion of a wide range of constraints, geometries and physics in the SD simulation scheme. Importantly for fast, large scale simulations, we show that the saddle point equation is solved very efficiently by iterative methods for which novel preconditioners are derived. In contrast to existing approaches to accelerating SD algorithms, the FSD algorithm avoids explicit inversion of ill-conditioned hydrodynamic operators without adequate preconditioning, which drastically reduces computation time. Furthermore, the FSD formulation is combined with advanced sampling techniques in order to rapidly generate the stochastic forces required for Brownian motion. Specifically, we adopt the standard approach of decomposing the stochastic forces into near-field and far-field parts. The near-field Brownian force is readily computed using an iterative Krylov subspace method, for which a novel preconditioner is developed, while the far-field Brownian force is efficiently computed by linearly transforming those forces into a fluctuating velocity field, computed easily using the positively split Ewald approach (J. Chem. Phys., vol. 146, 2017, 124116). The resultant effect of this field on the particle motion is determined through solution of a system of linear equations using the same saddle point matrix used for deterministic calculations. Thus, this calculation is also very efficient. Additionally, application of the saddle point formulation to develop high-resolution hydrodynamic models from constrained collections of particles (similar to the immersed boundary method) is demonstrated and the convergence of such models is discussed in detail. Finally, an optimized graphics processing unit implementation of FSD for mono-disperse spherical particles is used to demonstrated performance and accuracy of dynamic simulations of $O(10^{5})$ particles, and an open source plugin for the HOOMD-blue suite of molecular dynamics software is included in the supplementary material.


2006 ◽  
Vol 05 (04) ◽  
pp. 671-681 ◽  
Author(s):  
XIAOJUN CHEN ◽  
TAKUMA KIMURA

We propose a new finite element surface fitting method which can handle very large databases. This method uses finite element discretization to find an approximation of a smooth function which minimizes a sum of data residuals and second derivatives under some constraints on data. The finite element discretization derives a large scale constrained quadratic program, which can be reformulated as a system of piecewise linear equations. We develop a preconditioned Newton method to solve the system efficiently. We apply this method to form surfaces over Aomori Region in Japan by geographic databases, such that every bridge became associated with environmental information.


Author(s):  
Simon Thomas

Trends in the technology development of very large scale integrated circuits (VLSI) have been in the direction of higher density of components with smaller dimensions. The scaling down of device dimensions has been not only laterally but also in depth. Such efforts in miniaturization bring with them new developments in materials and processing. Successful implementation of these efforts is, to a large extent, dependent on the proper understanding of the material properties, process technologies and reliability issues, through adequate analytical studies. The analytical instrumentation technology has, fortunately, kept pace with the basic requirements of devices with lateral dimensions in the micron/ submicron range and depths of the order of nonometers. Often, newer analytical techniques have emerged or the more conventional techniques have been adapted to meet the more stringent requirements. As such, a variety of analytical techniques are available today to aid an analyst in the efforts of VLSI process evaluation. Generally such analytical efforts are divided into the characterization of materials, evaluation of processing steps and the analysis of failures.


Sign in / Sign up

Export Citation Format

Share Document