Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel implementation”

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 217 records · Page 12

On the Scalability of Data Reduction Techniques in Current and Upcoming HPC Systems from an Application Perspective

We implement and benchmark parallel I/O methods for the fully-manycore driven particle-in-cell code PIConGPU. Identifying throughput and overall I/O size as a major challenge for applications on today’s and future HPC systems, we present a scaling law characterizing performance bottlenecks in state-of-the-art approaches for data reduction. Consequently, we propose, implement and verify multi-threaded data-transformations for the I/O library ADIOS as a feasible way to trade underutilized host-side compute potential on heterogeneous systems for reduced I/O latency.

Huebl, Axel↗

Performance Optimization of a Beam Dynamics PIC Code On Hybrid Computer Architectures

The self-consistent multi-particle tracking based on particle-in-cell method (PIC) has been widely used in particle accelerator beam dynamics study. However, the PIC simulation is time-consuming and needs to use modern parallel computers for high resolution applications. In this paper, we implemented and optimized a parallel beam dynamics PIC code on two types of hybrid parallel computer architectures: one is the GPU and GPU cluster, while the other is the "Knight Landing" CPU cluster.

Liu, Zhicong↗

Description of Sensor Assignment Optimization Method as Deployed on a Multi-Node Cluster

Data analytic methods are being developed to address the problem of how to assign a sensor set in a nuclear facility such that a requisite level of process monitoring capability is realized and that the sensor set is sufficiently rich to determine the status of the individual sensors with respect to need for calibration. There is an awareness in the nuclear industry that data analytics combined with rich sensor sets represent a means to improve operations and reduce costs. In the industry the calibration problem has been previously approached as an empirical data-driven problem with several methods having been developed. However, the experience of the utilities over the past ten years with these methods indicates that the absence of physics-based information renders the data-driven approach less reliable. Complicating factors such as the inherent variability of operation (both equipment alignment and operating condition) can confound a pure data-driven approach while there are no rigorous guidelines for determining what constitutes an adequate sensor set. The solution under development to overcome these shortcomings supplements the data analytic method with process information in a so-called process-constrained data-analytic approach. Simple balance equations are written for generic components (e.g., mechanical pump, valve, and heat exchanger). These do not require a priori knowledge of process parameters, such as heat transfer coefficients or friction factors. All that is needed on the part of the utility user is to identify the components and how they are connected. This report describes the development of a parallel computing capability for determining the optimal sensor set. The optimal sensor set problem suffers from the curse of dimensionality. Computation time increases exponentially as the size of the system grows. To overcome this difficulty a pre-conditioner algorithm is developed to find an approximate solution close the actual solution. This serves as a seed for the full-blown algorithm and acts to constrain the space that must searched. The optimization algorithms are described and the implementation on a parallel computing platform is described. The application of the method to a use case we are solving in collaboration with our utility partner served to illustrate how the default sensor set in a nuclear plant may not provide sufficient coverage to infer sensor calibration status.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Vectorization of Random Number Generation and Reproducibility of Concurrent Particle Transport Simulation

Efficient random number generation with high quality statistical properties and exact reproducibility of Monte Carlo simulations are important requirements in many areas of computational science. VecRNG is a package providing pseudo-random number generation (pRNG) in the context of a new library VecMath. This library bundles up several general-purpose mathematical utilities, data structures, and algorithms having both SIMD and SIMT (GPUs) support based on VecCore.~Several state-of-the-art RNG algorithms are implemented as kernels supporting parallel generation of random numbers in scalar, vector, and Cuda workflows. In this report, we will present design considerations, implementation details, and computing performance of parallel pRNG engines on both CPU and GPU. Reproducibility of propagating multiple particles in parallel for HEP event simulation is demonstrated, using GeantV-based examples, for both sequential and fine-grain track-level concurrent simulation wor kflows. Strategies for efficient uses of vectorized pRNG and non-overlapping streams of random number sequences in concurrent computing environments is discussed as well.

Jun, S. Y.↗

An in-situ conductometric apparatus for physicochemical characterization of solutions and in-line monitoring of separation processes at elevated temperatures and pressures

Specific conductance and frequency-dependent resistance (impedance) data are widely utilized for understanding the physicochemical characteristics of aqueous and non-aqueous fluids and for evaluating the performance of chemical processes. However, the implementation of such an in-situ probe in high-temperature and high-pressure environments is not trivial. This work provides a description of both the hardware and software associated with implementing a parallel-type in-situ electrochemical sensor. The sensor can be used for in-line monitoring of thermal desalination processes and for impedance measurements in fluids at high temperature and pressure. Further, a comparison between the experimental measurements on the specific conductance in aqueous sodium chloride solutions and the conductance model demonstrate that the methodology yields reasonable agreement with both the model and literature data. A combination of hardware components, a software-based correction for experimental artifacts, and computational fluid dynamics (CFD) calculations used in this work provide a sound basis for implementing such in-situ electrochemical sensors to measure frequency-dependent resistance spectra.

47 OTHER INSTRUMENTATION↗

Extending OpenSHMEM with Aggregation Support for Improved Message Rate Performance

OpenSHMEM is a highly efficient one-sided communication API that implements the PGAS parallel programming model, and is known for its low latency communication operations that can be mapped efficiently to RDMA capabilities of network interconnects. However, applications that use OpenSHMEM can be sensitive to point-to-point message rates, as many-to-many communication patterns can generate large amounts of small messages which tend to overwhelm network hardware that has predominantly been optimised for bandwidth over message rate. Additionally, many important emerging classes of problems such as data analytics are similarly troublesome for the irregular access patterns they employ. Message aggregation strategies have been proven to significantly enhance network performance, but their implementation often involves complex restructuring of user code, making them unwieldy. This paper shows how to combine the best qualities of message aggregation within the communication model of OpenSHMEM such that applications with small and irregular access patterns can improve network performance while maintaining their algorithmic simplicity. We do this by providing a path to a message aggregation framework called conveyors through a minimally intrusive OpenSHMEM extension introducing aggregation contexts that fit more naturally to the OpenSHMEM atomics, gets, and puts model. We test these extensions using four of the bale 3.0 applications which contain essential many-to-many access patterns to show how they can produce performance improvements of up to 65×.

Welch, Aaron↗

Concurrent conversation modeling and parallel simulation of the naming game in social networks

The Naming Game is an effective self-organization model to understand the emergence of linguistic consensus and to investigate the system dynamics in a variety of phenomena over social networks of autonomous agents. The Naming Game is an effective description for the evolution of consensus despite the absence of any central coordination or specialized initialization even in large-scale networks. While the classical game is effective in description, it was defined with inherently sequential evaluation semantics over the entire network. Here, we develop a new concurrent model as a relaxation of the classical formulation and express it in a discrete event style of evaluation. Further, with the uncovered concurrency that was absent in the classical algorithm, we map the concurrent model to parallel discrete event simulation. Using a prototype implementation, we present an initial parallel performance study on networks containing hundreds of thousands of individuals, with a decrease in simulation time in the best-observed case from 4800 seconds down to 1400 seconds.

Perumalla, Kalyan↗

TorchBraid: High-Performance Layer-Parallel Training of Deep Neural Networks with MPI and GPU Acceleration

TorchBraid is a high-performance implementation of layer-parallel training for deep neural networks (DNNs) supporting MPI-based parallelism and GPU acceleration. Layer-parallel training has been developed to overcome the serialization inherent in forward and backward propagation of DNNs that limits utilization of computational resources in the strong scaling limit. To achieve this, TorchBraid integrates the PyTorch neural network framework with the state-of-the-art XBraid time-parallel library. Furthermore, this article presents the use and performance of TorchBraid, in addition to solutions for overcoming the algorithmic challenges inherent in combining automatic differentiation with layer-parallel. Results are presented with and without GPU acceleration for the Tiny ImageNet and MNIST image classification data sets, as well as recurrent neural networks. Overall, TorchBraid enables fast training of DNNs, both in a strong and weak scaling context. In addition to the TorchBraid software, several new advances in applying layer-parallel algorithms are detailed. Integration of layer-parallel with data-parallel algorithms is presented for the first time, showing the computational advantages of the combination. Standard deep learning techniques, like batch-normalization, are developed for layer-parallel training. Finally, a new approach combining layer-parallel with spatial coarsening in order to accelerate training for 3D image classification shows roughly a 10× speedup over serial execution.

Layer-parallel↗

ppdx : Automated modeling of protein–protein interaction descriptors for use with machine learning

This paper describes ppdx, a python workflow tool that combines protein sequence alignment, homology modeling, and structural refinement, to compute a broad array of descriptors for characterizing protein–protein interactions. The descriptors can be used to predict various properties of interest, such as protein–protein binding affinities, or inhibitory concentrations (IC 50 ), using approaches that range from simple regression to more complex machine learning models. The software is highly modular. It supports different protocols for generating structures, and 95 descriptors can be currently computed. More protocols and descriptors can be easily added. The implementation is highly parallel and can fully exploit the available cores in a single workstation, or multiple nodes on a supercomputer, allowing many systems to be analyzed simultaneously. As an illustrative application, ppdx is used to parametrize a model that predicts the IC 50 of a set of antigens and a class of antibodies directed to the influenza hemagglutinin stalk.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Computing the QRPA level density with the finite amplitude method

Here, we describe a new algorithm to calculate the vibrational nuclear level density of an atomic nucleus. Fictitious perturbation operators that probe the response of the system are generated by drawing their matrix elements from some probability distribution function. We use the Finite Amplitude Method to explicitly compute the response for each such sample. With the help of the Kernel Polynomial Method, we build an estimator of the vibrational level density and provide the upper bound of the relative error in the limit of infinitely many random samples. The new algorithm can give accurate estimates of the vibrational level density. Since it is based on drawing multiple samples of perturbation operators, its computational implementation is naturally parallel and scales like the number of available processing units.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Analytic band-to-trap tunneling model including band offset for heterojunction devices

In this paper, we present an analytic band-to-trap tunneling model based on the open boundary scattering approach. The new model has three major advantages: (i) It includes not only the well-known electric field effect, but more importantly, the effect of heterojunction band offset. This feature allows us to simulate both electric field and band offset enhanced carrier recombination near a heterojunction in heterostructures. (ii) Its analytic form enables straightforward implementation into a parallel Technology Computer Aided Design device and circuit simulators. (iii) The developed method can be used for any potentials which can be approximated to a good degree such that the Schrödinger equation with open boundary conditions results in piecewise analytic wave functions. Simulation results of an InGaP/GaAs heterojunction bipolar transistor (HBT) reveal that the proposed model predicts significantly increased base currents, because the tunneling of holes in the base to traps in the emitter is greatly enhanced by the emitter-base band offset. Lastly, this finding, which is not captured by existing band-to-trap tunneling models, is consistent with the experimental observation for an InGaP/GaAs HBT after neutron irradiation.

36 MATERIALS SCIENCE↗

UniverseMachine: The correlation between galaxy growth and dark matter halo assembly from z = 0−10

ABSTRACT We present a method to flexibly and self-consistently determine individual galaxies’ star formation rates (SFRs) from their host haloes’ potential well depths, assembly histories, and redshifts. The method is constrained by galaxies’ observed stellar mass functions, SFRs (specific and cosmic), quenched fractions, ultraviolet (UV) luminosity functions, UV–stellar mass relations, IRX–UV relations, auto- and cross-correlation functions (including quenched and star-forming subsamples), and quenching dependence on environment; each observable is reproduced over the full redshift range available, up to 0 < z < 10. Key findings include the following: galaxy assembly correlates strongly with halo assembly; quenching correlates strongly with halo mass; quenched fractions at fixed halo mass decrease with increasing redshift; massive quenched galaxies reside in higher-mass haloes than star-forming galaxies at fixed galaxy mass; star-forming and quenched galaxies’ star formation histories at fixed mass differ most at z < 0.5; satellites have large scatter in quenching time-scales after infall, and have modestly higher quenched fractions than central galaxies; Planck cosmologies result in up to 0.3 dex lower stellar – halo mass ratios at early times; and, none the less, stellar mass–halo mass ratios rise at z > 5. Also presented are revised stellar mass – halo mass relations for all, quenched, star-forming, central, and satellite galaxies; the dependence of star formation histories on halo mass, stellar mass, and galaxy SSFR; quenched fractions and quenching time-scale distributions for satellites; and predictions for higher-redshift galaxy correlation functions and weak lensing surface densities. The public data release (DR1) includes the massively parallel (>105 cores) implementation (the UniverseMachine), the newly compiled and remeasured observational data, derived galaxy formation constraints, and mock catalogues including lightcones.

79 ASTRONOMY AND ASTROPHYSICS↗

Development of a new quantum trajectory molecular dynamics framework

An extension to the wave packet description of quantum plasmas is presented, where the wave packet can be elongated in arbitrary directions. A generalized Ewald summation is constructed for the wave packet models accounting for long-range Coulomb interactions and fermionic effects are approximated by purpose-built Pauli potentials, self-consistent with the wave packets used. We demonstrate its numerical implementation with good parallel support and close to linear scaling in particle number, used for comparisons with the more common wave packet employing isotropic states. Ground state and thermal properties are compared between the models with differences occurring primarily in the electronic subsystem. Especially, the electrical conductivity of dense hydrogen is investigated where a 15% increase in DC conductivity can be seen in our wave packet model compared with other models.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

On-Board AC Charging Topology Integrated with Electric Vehicle Motor Drive System

On-board AC charging is a convenient and widely adopted method for recharging electric vehicles (EVs) directly from standard alternating current (AC) power sources. This paper presents a novel topology for AC charging of EVs that utilizes EV 3-phase electric machine windings as the input inductors, thus eliminating the requirement for bulky grid interfacing inductors and resulting in a compact and cost-effective integrated motor drive and charger system. The proposed approach leverages the motor windings and parallel operating half-bridge inverter during the charging process by interconnecting the inverter phases with the motor windings in a mechanically interleaved and electrically paralleled manner. The implementation of this unique and innovative idea, achieved through precise control and arrangement of the motor winding as a series inductor, successfully eliminates the possibility of unintended motion of the electric machine during the charging process.

ADVANCED PROPULSION SYSTEMS↗

Simulation of Magnetic Systems in the Domain with a Corner

Numerical simulation of magnetic systems having corner points is considered. The literature on this topic is reviewed. A method of encapsulating the function behavior near corner points in the difference scheme is proposed for numerical solution of the 2D magnetostatic problem in the iron domain. For the 3D magnetostatic problem in the iron/vacuum domain, the increase in the magnetic field near the corner point is estimated, and a method for construction of an adaptive mesh is proposed. A parallel algorithm is implemented on the graphics-processing unit (GPU) architecture for faster search for the numerical solution of the magnetostatic problem. Numerical simulation is performed for the magnetic system of the SPD detector to be used at the NICA complex (JINR, Dubna).

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

libpfasst v1.0

This is a Fortran 95/2003 implementation of the Parallel Full Approximation Scheme in Space and Time (PFASST), which is a method for the time parallelization of ordinary and partial differential equations.

Minion, Michael↗

Trajectory Balance with Asynchrony

Finetune large language models (LLMs) quicker via parallelization. Specifically, this implements asynchronous reinforcement learning with a trajectory balance objective function

Bartoldson, BrianR [Lawrence Livermore National La↗