Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel methods”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 307 records · Page 17

Massively parallel transport sweeps on meshes with cyclic dependencies

When solving the first-order form of the linear Boltzmann equation, a common misconception is that the matrix-free computational method of “sweeping the mesh”, used in conjunction with the Discrete Ordinates method, is too complex or does not scale well enough to be implemented in modern high performance computing codes. This has led to considerable efforts in the development of matrix-based methods that are computationally expensive and is partly driven by the requirements placed on modern spatial discretizations. In particular, modern transport codes are required to support higher order elements, a concept that invariably adds a lot of complexity to sweeps because of the introduction of cyclic dependencies with curved mesh cells. In this article we will present a comprehensive implementation of sweeping, to a piecewise-linear DFEM spatial discretization with particular focus on handling cyclic dependencies and possible extensions to higher order spatial discretizations. We find that these methods are implemented in a new C++ simulation framework called Chi-Tech (). We present some typical simulation results with some performance aspects that one can expect during real world simulations, we also present a scaling study to >100k processes where Chi-Tech maintains greater than 80% efficiency solving a total of 87.7 trillion angular flux unknowns for a 116 group simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

GENERATION OF MAGNETOHYDRODYNAMIC WAVES IN LOW SOLAR ATMOSPHERIC FLUX TUBES BY PHOTOSPHERIC MOTIONS

Recent ground- and space-based observations reveal the presence of small-scale motions between convection cells in the solar photosphere. In these regions, small-scale magnetic flux tubes are generated via the interaction of granulation motion and the background magnetic field. This paper studies the effects of these motions on magnetohydrodynamic (MHD) wave excitation from broadband photospheric drivers. Numerical experiments of linear MHD wave propagation in a magnetic flux tube embedded in a realistic gravitationally stratified solar atmosphere between the photosphere and the low choromosphere (above β = 1) are performed. Horizontal and vertical velocity field drivers mimic granular buffeting and solar global oscillations. A uniform torsional driver as well as Archimedean and logarithmic spiral drivers mimic observed torsional motions in the solar photosphere. The results are analyzed using a novel method for extracting the parallel, perpendicular, and azimuthal components of the perturbations, which caters to both the linear and non-linear cases. Employing this method yields the identification of the wave modes excited in the numerical simulations and enables a comparison of excited modes via velocity perturbations and wave energy flux. The wave energy flux distribution is calculated to enable the quantification of the relative strengths of excited modes. The torsional drivers primarily excite Alfvén modes (≈60% of the total flux) with small contributions from the slow kink mode, and, for the logarithmic spiral driver, small amounts of slow sausage mode. The horizontal and vertical drivers primarily excite slow kink or fast sausage modes, respectively, with small variations dependent upon flux surface radius.

79 ASTRONOMY AND ASTROPHYSICS↗

Charge order–superfluidity transition in a two-dimensional system of hard-core bosons and emerging domain structures

We have used high-performance parallel computations by NVIDIA graphics cards applying the method of nonlinear conjugate gradients and Monte Carlo method to observe directly the developing ground state configuration of a two-dimensional hard-core boson system with decrease in temperature, and its evolution with deviation from a half-filling. This has allowed us to explore unconventional features of a charge order—superfluidity phase transition, specifically, formation of an irregular domain structure, emergence of a filamentary superfluid structure that condenses within of the charge-ordered phase domain antiphase boundaries, and formation and evolution of various topological structures.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

An O ( N ) and parallel approach to integral problems by a kernel-independent fast multipole method: Application to polarization and magnetization of interacting particles

Large classes of materials systems in physics and engineering are governed by magnetic and electrostatic interactions. Continuum or mesoscale descriptions of such systems can be cast in terms of integral equations, whose direct computational evaluation requires O ( N 2 ) operations, where N is the number of unknowns. Such a scaling, which arises from the many-body nature of the relevant Green's function, has precluded wide-spread adoption of integral methods for solution of large-scale scientific and engineering problems. In this work, a parallel computational approach is presented that relies on using scalable open source libraries and utilizes a kernel-independent Fast Multipole Method (FMM) to evaluate the integrals in O ( N ) operations, with O ( N ) memory cost, thereby substantially improving the scalability and efficiency of computational integral methods. We demonstrate the accuracy, efficiency, and scalability of our approach in the context of two examples. In the first, we solve a boundary value problem for a ferroelectric/ferromagnetic volume in free space. In the second, we solve an electrostatic problem involving polarizable dielectric bodies in an unbounded dielectric medium. Lastly, the results from these test cases show that our proposed parallel approach, which is built on a kernel-independent FMM, can enable highly efficient and accurate simulations and allow for considerable flexibility in a broad range of applications.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Non-perturbative Approach to Computing Seismic Normal Modes in Rotating Planets

In this work, a continuous Galerkin method based approach is presented to compute the seismic normal modes of rotating planets. Special care is taken to separate out the essential spectrum in the presence of a fluid outer core using a polynomial filtering eigensolver. The relevant elastic-gravitational system of equations, including the Coriolis force, is subjected to a mixed finite-element method, while self-gravitation is accounted for with the fast multipole method. Our discretization utilizes fully unstructured tetrahedral meshes for both solid and fluid regions. The relevant eigenvalue problem is solved by a combination of several highly parallel and computationally efficient methods. We validate our three-dimensional results in the non-rotating case using analytical results for constant elastic balls, as well as numerical results for an isotropic Earth model from standard “radial” algorithms. We also validate the computations in the rotating case, but only in the slowly-rotating regime where perturbation theory applies, because no other independent algorithms are available in the general case. The algorithm and code are used to compute the point spectra of eigenfrequencies in several Earth and Mars models studying the effects of heterogeneity on a large range of scales.

58 GEOSCIENCES↗

Devastator Parallel Discrete Event Simulation Runtime (Devastator) v1.0

The Devastator runtime is a modern C++ implementation of optimistic parallel discrete event simulation methods. Devastator allows simulation application code to productively specify their component and event functionality with C++14 constructs. It utilizes GASNet-EX for distributed memory communication and includes parallel performance optimizations such as light-weight thread message queues and asynchronous GVT. Furthermore, it supports efficient event broadcasts and pause-rewind-resume functionality to support periodic load balancing and outer loop optimization algorithms.

Chan, Cy↗

Transient cycling of nitrogen, organic carbon and oxygen within the free-flowing Columbia River corridor: Linking exposure time dependent biogeochemical reactions to river stage fluctuations (Final project report)

The objective of this project was to develop next-generation techniques for representing the transformations of complex reaction networks like those impacting transient river-corridors, then apply them to develop upscaling tools. The project contributed significantly to the development of Lagrangian “mass transfer particle tracking” (MTPT) tools that are the first numerical framework that explicitly separates mixing and spreading processes; a crucial distinction for accurate representations of reaction rates across scales. The MTPT approach uses an operator splitting scheme where physical transport processes are simulated using classical random walk methods and each particle is treated as a “container” that carries with it any number of chemical species. Mixing between particles is simulated using a colocation-probability based mass transfer kernel and reactions are evaluated on each particle after mixing. The method is stable, accurate, and also allows the explicit modeling of residence time distributions of the individual containers of mass. The MTPT scheme allowed us to explore several research questions related to reactive transport in river corridors and complex reaction networks. We found that it is possible to quantify the exposure time distributions (ETDs) of reactants and that this does suggest some pathways to upscaling. However, comparable approximations can be obtained using simplified (reduced dimensionality) MTPT simulations in less time with similar uncertainty, so development of extensive ETD-based methods was not productive. The major findings are that i) the MTPT schemes are robust and highly accurate across a range of arbitrarily complex reactions, ii) the methods can be efficiently parallelized and the parallel performance characteristics of MTPT are predictable, and iii) the MTPT tools allow simultaneous tracking of residence time. The development of these research tools into efficient software packages continues. The methods are already available to the community because open-source, working examples have been included with all publications.

54 ENVIRONMENTAL SCIENCES↗

Space-time discretizations using constrained first-order system least squares (CFOSLS)

This work studies finite element discretizations for three types of time-dependent PDEs, namely heat equation, scalar conservation law and wave equation, which we reformulate as first order systems in a least-squares setting, subject to a space-time conservation constraint (coming from the original PDE). Available piecewise polynomial finite element spaces in (n + 1)-dimensions for functional spaces from the (n + 1)-dimensional de Rham sequence for n = 2, 3 are used for the implementation of the method. Computational results illustrating the error behavior, iteration counts and performance of block-diagonal and monolithic geometric multigrid preconditioners are presented for the discrete CFOSLS system. The results are obtained from a parallel implementation of the methods for which we report reasonable scalability.

4D de Rham sequence↗

Closures for Two-fluid Five-moment Equations for Magnetized Plasmas (Final Scientific Report)

In the proposed work, we will develop a complete set of closures for two-fluid five-moment equations for magnetized plasmas. Specifically, we propose to obtain explicit formulas for electrons and ions to express heat flow, viscosity, frictional force, and collisional heating in terms of density, and temperature, flow velocity. For this purpose, we solve a set of general moment equations for the relevant closure moments. An infinite hierarchy of general moment equations is completely equivalent to the original Landau-Fokker-Planck kinetic equation. In the small gyro-period expansion, the parallel components of the general moment equations agree with the moments of the drift-kinetic equation (DKE). The advantages of solving the moment equations include (i) an exact treatment of the collision operator, (ii) closure and transport relations with no flux-surface average, and (iii) a unified form of closures for general collisionality. Practically we solve a truncated set of moment equations and hence must verify the convergence of the solutions by increasing number of moments. The parallel integral (nonlocal) closures obtained by solving a set of linearized parallel moment equations are useful only when the nonlinear coupling of moments to the temperature and magnetic field gradient terms is negligible. When the nonlinear coupling terms are substantial, we propose a Fourier transform method to solve the parallel moment equations. By Fourier-expanding the magnetic field, we can convert the differential equations of parallel moments to linear algebraic equations for Fourier components of the moments. The convergence of the solutions can be confirmed by increasing the number of Fourier modes. Our preliminary study in axisymmetric circular magnetic geometry with a large aspect ratio shows that (i) the solutions for Fourier modes n=0 and n=1 converge when modes up to n=2 are included in the expansion, and (ii) lower collisionality requires more moments for convergent closures, as in the case of the integral closures. The proposed work will start from this simple magnetic geometry to find general parallel closures and then be generalized to explore a non-circular magnetic field with finite aspect-ratio. With parallel moments known, the perpendicular component of moment closures can be obtained by inverting the generalized cross product operator in the general moment equations. These efforts will be performed in conjunction with several multi-institutional projects, NIMROD, the Center for Extended MHD Modeling (CEMM), and the Plasma Science and Innovation (PSI) Center.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Considerations on the Use of Custom Accelerators for Big Data Analytics

Accelerators, including Graphic Processing Units (GPUs) for gen- eral purpose computation, many-core designs with wide vector units (e.g., Intel Phi), have become a common component of many high performance clusters. The appearance of more stable and reliable tools tools that can automatically convert code written in high-level specifications with annotations (such as C or C++) to hardware de- scription languages (High-Level Synthesis - HLS), is also setting the stage for a broader use of reconfigurable devices (e.g., Field Pro- grammable Gate Arrays - FPGAs) in high performance system for the implementation of custom accelerators, helped by the fact that new processors include advanced cache-coherent interconnects for these components. In this chapter, we briefly survey the status of the use of accelerators in high performance systems targeted at big data analytics applications. We argue that, although the progress in the use of accelerators for this class of applications has been sig- nificant, differently from scientific simulations there still are gaps to close. This is particularly true for the ”irregular” behaviors exhibited by no-SQL, graph databases. We focus our attention on the limits of HLS tools for data analytics and graph methods, and discuss a new architectural template that better fits the requirement of this class of applications. We validate the new architectural templates by mod- ifying the Graph Engine for Multithreaded System (GEMS) frame- work to support accelerators generated with such a methodology, and testing with queries coming from the Lehigh University Benchmark (LUBM). The architectural template enables better supporting the task and memory level parallelism present in graph methods by sup- porting a new control model and a enhanced memory interface. We show that out solution allows generating parallel accelerators, pro- viding speed ups with respect to conventional HLS flows. We finally draw conclusions and present a perspective on the use of reconfig- urable devices and Design Automation tools for data analytics.

Data Analytics↗

Controlled Selective CVD Growth of ZnO Nanowires Enabled by Mask‐Free Fabrication Approach using Aqueous Fe Catalytic Inks

Abstract Fabrication process that enables selective growth of vertically oriented zinc oxide (ZnO) nanowires (NWs) via chemical vapor deposition method and mask‐free patterning approach is reported. It is shown that synthesis of high‐quality ZnO nanowires in various architectures is achievable by optimizing the growth conditions and by precise patterning of catalytic ink precursors. Parallel direct‐write patterning method is utilized to fabricate arrays of different architectures on Si/SiO 2 substrates and directly on devices at preselected locations. The production of high‐quality, crystalline ZnO NWs is demonstrated using aqueous iron catalytic inks. The composition of the ink and the lateral size of the patterns deposited on substrates are shown to affect the resulting nanowires and thus, allowing to control the geometry (length and diameter) of the individual ZnO NWs in the patterned assemblies. The results indicate that our protocols are tailored to the fabrication of ZnO NWs with specific surface geometries and interface functionalities for variety of targeted device applications.

Alameri, Dheyaa↗

Fast approximate STEM image simulations from a machine learning model

Abstract Accurate quantum mechanical scanning transmission electron microscopy image simulation methods such as the multislice method require computation times that are too large to use in applications in high-resolution materials imaging that require very large numbers of simulated images. However, higher-speed simulation methods based on linear imaging models, such as the convolution method, are often not accurate enough for use in these applications. We present a method that generates an image from the convolution of an object function and the probe intensity, and then uses a multivariate polynomial fit to a dataset of corresponding multislice and convolution images to correct it. We develop and validate this method using simulated images of Pt and Pt–Mo nanoparticles and find that for these systems, once the polynomial is fit, the method runs about six orders of magnitude faster than parallelized CPU implementations of the multislice method while achieving a 1 − R 2 error of 0.010–0.015 and root-mean-square error/standard deviation of dataset being predicted of about 0.1 when compared to full multislice simulations.

47 OTHER INSTRUMENTATION↗

Π4U: A high performance computing framework for Bayesian uncertainty quantification of complex models

We present Π4U,{sup 1} an extensible framework, for non-intrusive Bayesian Uncertainty Quantification and Propagation (UQ+P) of complex and computationally demanding physical models, that can exploit massively parallel computer architectures. The framework incorporates Laplace asymptotic approximations as well as stochastic algorithms, along with distributed numerical differentiation and task-based parallelism for heterogeneous clusters. Sampling is based on the Transitional Markov Chain Monte Carlo (TMCMC) algorithm and its variants. The optimization tasks associated with the asymptotic approximations are treated via the Covariance Matrix Adaptation Evolution Strategy (CMA-ES). A modified subset simulation method is used for posterior reliability measurements of rare events. The framework accommodates scheduling of multiple physical model evaluations based on an adaptive load balancing library and shows excellent scalability. In addition to the software framework, we also provide guidelines as to the applicability and efficiency of Bayesian tools when applied to computationally demanding physical models. Theoretical and computational developments are demonstrated with applications drawn from molecular dynamics, structural dynamics and granular flow.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Critical percolation on the kagome hypergraph

In this report we study the percolation critical surface of the kagome lattice in which each triangle is allowed an arbitrary connectivity. Using the method of critical polynomials, we find points along this critical surface to high precision. This kagome hypergraph contains many unsolved problems as special cases, including bond percolation on the kagome and (3, 12 2 ) lattices, and site percolation on the hexagonal, or honeycomb, lattice, as well as a single point for which there is an exact solution. We are able to compute enough points along the critical surface to find a very accurate fit, essentially a Taylor series about the exact point, that allows estimations of the critical point of any system that lies on the surface to precision rivaling Monte Carlo and traditional techniques of similar accuracy. We find also that this system sheds light on some of the surprising aspects of the method of critical polynomials, such as why it is so accurate for certain problems, like the kagome and (3, 12 2 ) lattices. The bond percolation critical points of these lattices can be found to 17 and 18 digits, respectively, because they are in close proximity, in a sense that can be made quantitative, to the exact point on the critical surface. We also discuss in detail a parallel implementation of the method which we use here for a few calculations.

97 MATHEMATICS AND COMPUTING↗

Multimodal Bayesian registration of noisy functions using Hamiltonian Monte Carlo

Functional data registration is a necessary processing step for many applications. The observed data can be inherently noisy, often due to measurement error or natural process uncertainty; which most functional alignment methods cannot handle. A pair of functions can also have multiple optimal alignment solutions, which is not addressed in current literature. In this paper, a flexible Bayesian approach to functional alignment is presented, which appropriately accounts for noise in the data without any pre-smoothing required. Additionally, by running parallel MCMC chains, the method can account for multiple optimal alignments via the multi-modal posterior distribution of the warping functions. To most efficiently sample the warping functions, the approach relies on a modification of the standard Hamiltonian Monte Carlo to be well-defined on the infinite-dimensional Hilbert space. In this work, this flexible Bayesian alignment method is applied to both simulated data and real data sets to show its efficiency in handling noisy functions and successfully accounting for multiple optimal alignments in the posterior; characterizing the uncertainty surrounding the warping functions.

97 MATHEMATICS AND COMPUTING↗

Methods and apparatus for capture and storage of semantic information with sub-files in a parallel computing system

Techniques are provided for storing files in a parallel computing system using sub-files with semantically meaningful boundaries. A method is provided for storing at least one file generated by a distributed application in a parallel computing system. The file comprises one or more of a complete file and a plurality of sub-files. The method comprises the steps of obtaining a user specification of semantic information related to the file; providing the semantic information as a data structure description to a data formatting library write function; and storing the semantic information related to the file with one or more of the sub-files in one or more storage nodes of the parallel computing system. The semantic information provides a description of data in the file. The sub-files can be replicated based on semantically meaningful boundaries.

97 MATHEMATICS AND COMPUTING↗

Concrete material science: Past, present, and future innovations

Concrete is flying off, but it is simultaneously facing tremendous challenges in terms of environmental impact, financial needs, societal acceptance and image. Based on an historical approach of the science of concrete and reinforced concrete in particular, this paper calls for the exploration of radical changes in three key aspects of concrete use: reinforcement, binder content, and implementation methods. More precisely, it is suggested that, in parallel to the introduction of robotic fabrication methods, digital technologies may be key for the introduction several innovations like (i) rebar-free reinforcement using non-convex granular media; (ii) compression-optimized concrete structures, using topology optimization, architectural geometry, and 3D-printing or origami-patterned formworks; (iii) truly digital concrete through the coupling of massive data collection and deep learning.

36 MATERIALS SCIENCE↗