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 685 records · Page 38
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Using Computational Storage Devices: OpenMP/MPI and Charliecloud [Slides]

Originally used Spark and HadoopFS. Collected interesting results, but this method had its issues: limited application, too much overhead to gauge CSDs’ raw performance. Solution? Rewrite our benchmarks without Spark using Serial Python and Serial & Parallel C++ (Combinations of OpenMP & OpenMPI). Compared to Spark and Python, C++ implementation is a lot faster. Caveat: an expert with Spark or Python would likely be able to improve the performance of those implementations. Computational power of our CSDs seem to be much lower than the host machine. Using all 4 cores of a single CSD, the job takes ~6.8x longer than using just one core on the host machine. Host also seems to scale better with increasing file size. Resulting Question: When, if ever, would it make sense to use CSDs for compute rather than a much-faster host?

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Electron Coherence and Interactions in Nanostructures (Final Report)

The goal of this program was to develop the tools of quantum many-body theory suitable for studying electronic properties of nanostructures, to apply them to recent or contemporaneous experiments, and to chart the directions of future development in the physics of low-dimensional quantum materials and devices. Over the duration of this Program, we introduced and developed the notion of Nonlinear Luttinger liquid, which is viewed by peers as one of a few major developments in the theory of one-dimensional quantum liquids since the notion of Tomonaga-Luttinger liquids was introduced by Tomonaga in 1950. Later, motivated by the raise of the ideas of topological quantum computing, we contributed to the theory of structure and dynamics of Majorana states in superconducting devices. In parallel, we worked to understand the sources of decoherence of experimentally-implemented superconducting qubits. Over time, we developed a comprehensive theory of the qubit relaxation by quasiparticles. This theory is widely used in the interpretation of experiments and in developing practical ways to mitigate the qubit decoherence.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Frog: Asynchronous Graph Processing on GPU with Hybrid Coloring Model

GPUs have been increasingly used to accelerate graph processing for complicated computational problems regarding graph theory. Many parallel graph algorithms adopt the asynchronous computing model to accelerate the iterative convergence. Unfortunately, the consistent asynchronous computing requires locking or atomic operations, leading to significant penalties/overheads when implemented on GPUs. As such, coloring algorithm is adopted to separate the vertices with potential updating conflicts, guaranteeing the consistency/correctness of the parallel processing. Common coloring algorithms, however, may suffer from low parallelism because of a large number of colors generally required for processing a large-scale graph with billions of vertices. We propose a light-weight asynchronous processing framework called Frog with a preprocessing/hybrid coloring model. The fundamental idea is based on Pareto principle (or 80-20 rule) about coloring algorithms as we observed through masses of realworld graph coloring cases. We find that a majority of vertices (about 80%) are colored with only a few colors, such that they can be read and updated in a very high degree of parallelism without violating the sequential consistency. Accordingly, our solution separates the processing of the vertices based on the distribution of colors. In this work, we mainly answer three questions: (1) how to partition the vertices in a sparse graph with maximized parallelism, (2) how to process large-scale graphs that cannot fit into GPU memory, and (3) how to reduce the overhead of data transfers on PCIe while processing each partition. Here, we conduct experiments on real-world data (Amazon, DBLP, YouTube, RoadNet-CA, WikiTalk and Twitter) to evaluate our approach and make comparisons with well-known non-preprocessed (such as Totem, Medusa, MapGraph and Gunrock) and preprocessed (Cusha) approaches, by testing four classical algorithms (BFS, PageRank, SSSP and CC). On all the tested applications and datasets, Frog is able to significantly outperform existing GPU-based graph processing systems except Gunrock and MapGraph. MapGraph gets better performance than Frog when running BFS on RoadNet-CA. The comparison between Gunrock and Frog is inconclusive. Frog can outperform Gunrock more than 1.04X when running PageRank and SSSP, while the advantage of Frog is not obvious when running BFS and CC on some datasets especially for RoadNet-CA.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Direct simulation Monte Carlo on petaflop supercomputers and beyond

The gold-standard definition of the Direct Simulation Monte Carlo (DSMC) method is given in the 1994 book by Bird [Molecular Gas Dynamics and the Direct Simulation of Gas Flows (Clarendon Press, Oxford, UK, 1994)], which refined his pioneering earlier papers in which he first formulated the method. In the intervening 25 years, DSMC has become the method of choice for modeling rarefied gas dynamics in a variety of scenarios. The chief concern to applying DSMC to more dense or even continuum flows is its computational expense compared to continuum computational fluid dynamics methods. The dramatic (nearly billion-fold) increase in speed of the largest supercomputers over the last 30 years has thus been a key enabling factor in using DSMC to model a richer variety of flows, due to the method’s inherent parallelism. We have developed the open-source SPARTA DSMC code with the goal of running DSMC efficiently on the largest machines, both current and future. It is largely an implementation of Bird’s 1994 formulation. In this work, we describe algorithms used in SPARTA to enable DSMC to operate in parallel at the scale of many billions of particles or grid cells, or with billions of surface elements. We highlight a few examples of the kinds of fundamental physics questions and engineering applications that DSMC can address at these scales.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Calibration of the underground muon detector of the Pierre Auger Observatory

To obtain direct measurements of the muon content of extensive air showers with energy above 10 16.5 eV, the Pierre Auger Observatory is currently being equipped with an underground muon detector (UMD), consisting of 219 10 m 2 -modules, each segmented into 64 scintillators coupled to silicon photomultipliers (SiPMs). Direct access to the shower muon content allows for the study of both of the composition of primary cosmic rays and of high-energy hadronic interactions in the forward direction. As the muon density can vary between tens of muons per m 2 close to the intersection of the shower axis with the ground to much less than one per m 2 when far away, the necessary broad dynamic range is achieved by the simultaneous implementation of two acquisition modes in the read-out electronics: the binary mode, tuned to count single muons, and the ADC mode, suited to measure a high number of them. In this work, we present the end-to-end calibration of the muon detector modules: first, the SiPMs are calibrated by means of the binary channel, and then, the ADC channel is calibrated using atmospheric muons, detected in parallel to the shower data acquisition. The laboratory and field measurements performed to develop the implementation of the full calibration chain of both binary and ADC channels are presented and discussed. The calibration procedure is reliable to work with the high amount of channels in the UMD, which will be operated continuously, in changing environmental conditions, for several years.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2017

Decentralized Interleaving of Paralleled Dc-Dc Buck Converters

We present a decentralized control strategy that yields switch interleaving among parallel-connected dc-dc buck converters. The proposed method is based on the digital implementation of the dynamics of a nonlinear oscillator circuit as the controller. Each controller is fully decentralized, i.e., it only requires the locally measured output current to synthesize the pulse width modulation (PWM) carrier waveform and no communication between different controllers is needed. By virtue of the intrinsic electrical coupling between converters, the nonlinear oscillator-based controllers converge to an interleaved state with uniform phase-spacing across PWM carriers. To the knowledge of the authors, this work presents the first fully decentralized strategy for switch interleaving in paralleled dc-dc buck converters.

14 SOLAR ENERGY↗
DOE OSTI2024

PySAGES: flexible, advanced sampling methods accelerated with GPUs

Abstract Molecular simulations are an important tool for research in physics, chemistry, and biology. The capabilities of simulations can be greatly expanded by providing access to advanced sampling methods and techniques that permit calculation of the relevant underlying free energy landscapes. In this sense, software that can be seamlessly adapted to a broad range of complex systems is essential. Building on past efforts to provide open-source community-supported software for advanced sampling, we introduce PySAGES, a Python implementation of the Software Suite for Advanced General Ensemble Simulations (SSAGES) that provides full GPU support for massively parallel applications of enhanced sampling methods such as adaptive biasing forces, harmonic bias, or forward flux sampling in the context of molecular dynamics simulations. By providing an intuitive interface that facilitates the management of a system’s configuration, the inclusion of new collective variables, and the implementation of sophisticated free energy-based sampling methods, the PySAGES library serves as a general platform for the development and implementation of emerging simulation techniques. The capabilities, core features, and computational performance of this tool are demonstrated with clear and concise examples pertaining to different classes of molecular systems. We anticipate that PySAGES will provide the scientific community with a robust and easily accessible platform to accelerate simulations, improve sampling, and enable facile estimation of free energies for a wide range of materials and processes.

Chemistry↗
DOE OSTI2018

Establishing mesh topology in multi-material cells: enabling technology for robust and accurate multi-material simulations

Real world problems are typically multi-material, combining materials such as gases, liquids and solids that have very different properties. The material interfaces may be fixed in time or can be a part of the solution, as in fluid-structure interactions or air-water dynamics, and therefore move and change shape. In such problems the computational mesh may be non-conformal to interfaces due to complexity of these interfaces, presence of small fractions of materials, or because the mesh does not move with the flow, as in the arbitrary Lagrangian–Eulerian (ALE) methods. In order to solve problems of interest on such meshes, interface reconstruction methods are usually used to recover an approximation of material regions within the cells. For a cell intersecting multiple material regions, these approximations of contained subregions can be considered as single-material subcells in a local mesh that we call a minimesh. In this paper, we discuss some of the requirements that discretization methods have on topological information in the resulting hierarchical meshes and present an approach that allows incorporating the buildup of sufficiently detailed topology into the nested dissections based PLIC-type reconstruction algorithms (e.g. Volume-of-Fluid, Moment-of-Fluid) in an efficient and robust manner. Specifically, we describe the X-MOF interface reconstruction algorithm in 2D, which extends the Moment-Of-Fluid (MOF) method to include the topology of minimeshes created inside of multi-material cells and parent-child relations between corresponding mesh entities on different hierarchy levels. X-MOF retains the property of being local to a cell and not requiring external communication, which makes it suitable for massively parallel applications. Here, we demonstrate some scaling results for the X-MOF implementation in Tangram, a modern interface reconstruction framework for exascale computing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Distributed approximate minimal Steiner trees with millions of seed vertices on billion-edge graphs

In this report, we present a parallel 2-approximation Steiner minimal tree algorithm and its MPI-based distributed implementation. In place of expensive distance computations between all pairs of seed vertices, the solution we employ exploits a cheaper Voronoi cell computation. Our design leverages asynchronous processing and message prioritization to accelerate convergence of distance computations, and harnesses vertex and edge centric processing to offer fast time-to-solution. We demonstrate scalability and performance using real-world graphs with up to 128 billion edges and 512 compute nodes, and show the ability to find Steiner trees with up to one million seed vertices. Using 12 data instances, we present comparison with the state-of-the-art exact solver, SCIP-Jack, and two sequential 2-approximate algorithms. We empirically show that, on average, the total distance of the Steiner tree identified by our solution is 1.1290 times greater than the Steiner minimal tree – well within the theoretical approximation bound of 2.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Geometric GNNs for charged particle tracking at GlueX

Nuclear physics experiments are aimed at uncovering the fundamental building blocks of matter. The experiments involve high-energy collisions that produce complex events with many particle trajectories. Tracking charged particles resulting from collisions in the presence of a strong magnetic field is critical to enable the reconstruction of particle trajectories and precise determination of interactions. It is traditionally achieved through combinatorial approaches that scale worse than linearly as the number of hits grows. Since particle hit data naturally form a point cloud and can be structured as graphs, graph neural networks (GNNs) emerge as an intuitive and effective choice for this task. In this study, we evaluate the GNN model for track finding on the data from the GlueX experiment at Jefferson Lab. We use simulation data to train the model and test on both simulation and real GlueX measurements. We demonstrate that GNN-based track finding outperforms the currently used traditional method at GlueX in terms of segment-based efficiency at a fixed purity while providing faster inferences. We show that the GNN model can achieve significant speedup by processing multiple events in batches, which exploits the parallel computation capability of graphical processing units (GPUs). Finally, we compare the GNN implementation on GPU and field-programmable gate array and describe the trade-off.

batched GNN pipeline↗
DOE OSTI2019

Electromagnetic wave propagation based upon spectral-element methodology in dispersive and attenuating media

SUMMARY We build on mathematical equivalences between Maxwell’s wave equations for an electromagnetic medium and elastic seismic wave equations. This allows us to readily model Maxwell’s wave propagation in the spectral-element codes SPECFEM2D and SPECFEM3D, written for acoustic, viscoelastic and poroelastic seismic wave propagation, providing the ability to handle complex geometries, inherent to finite-element methods and retaining the strength of exponential convergence and accuracy due to the use of high-degree polynomials to interpolate field functions on the elements, characteristic to spectral-element methods (SEMs). Attenuation and dispersion processes related to the frequency dependence of dielectric permittivity and conductivity are also included using a Zener model, similar to shear attenuation in viscoelastic media or viscous diffusion in poroelastic media, and a Kelvin–Voigt model, respectively. Ability to account for anisotropic media is also discussed. Here, we limit ourselves to certain dielectric permittivity tensor geometries, in order to conserve a diagonal mass matrix after discretization of the system of equations. Doing so, simulation of Maxwell’s wave equations in the radar frequency range based on SEM can be solved using explicit time integration schemes well suited for parallel computation. We validate our formulation with analytical solutions. In 2-D, our implementation allows for the modelling of both a transverse magnetic (TM) mode, suitable for surface based reflection ground penetration radar type of applications, and a transverse electric (TE) mode more suitable for crosshole and vertical radar profiling setups. Two 2-D examples are designed to demonstrated the use of the TM and TE modes. A 3-D example is also presented, which allows for the full TEM solution, different antenna orientations, and out-of-plane variations in material properties.

58 GEOSCIENCES↗
DOE OSTI2019

The Target-Matrix Optimization Paradigm for High-Order Meshes

Here, we describe a framework for controlling and improving the quality of high-order finite element meshes based on extensions of the Target-Matrix Optimization Paradigm (TMOP) of [P. Knupp, Eng. Comput., 28 (2012), pp. 419--429]. This approach allows high-order applications to have a very precise control over local mesh quality, while still improving the mesh globally. We address the adaption of various TMOP components to the settings of general isoparametric element mappings, including the mesh quality metric in 2D and 3D, the selection of sample points and the solution of the resulting mesh optimization problem. We also investigate additional practical concerns, such as tangential relaxation and restricting the deviation from the original mesh. The benefits of the new high-order TMOP algorithms are illustrated on a number of test problems and examples from a high-order arbitrary Lagrangian--Eulerian (ALE) application [BLAST: High-order curvilinear finite elements for shock hydrodynamics, http://www.llnl.gov/CASC/blast]. Our implementation is freely available in an open-source library form [MFEM: Modular parallel finite element methods library, http://mfem.org].

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Modern gyrokinetic particle-in-cell simulation of fusion plasmas on top supercomputers

The Gyrokinetic Toroidal Code at Princeton (GTC-P) is a highly scalable and portable particle-in-cell (PIC) code. It solves the 5D Vlasov-Poisson equation featuring efficient utilization of modern parallel computer architectures at the petascale and beyond. Motivated by the goal of developing a modern code capable of dealing with the physics challenge of increasing problem size with sufficient resolution, new thread-level optimizations have been introduced as well as a key additional domain decomposition. GTC-P's multiple levels of parallelism, including inter-node 2D domain decomposition and particle decomposition, as well as intra-node shared memory partition and vectorization have enabled pushing the scalability of the PIC method to extreme computational scales. In this paper, we describe the methods developed to build a highly parallelized PIC code across a broad range of supercomputer designs. This particularly includes implementations on heterogeneous systems using NVIDIA GPU accelerators and Intel Xeon Phi (MIC) co-processors and performance comparisons with state-of-the-art homogeneous HPC systems such as Blue Gene/Q. New discovery science capabilities in the magnetic fusion energy application domain are enabled, including investigations of Ion-Temperature-Gradient (ITG) driven turbulence simulations with unprecedented spatial resolution and long temporal duration. Performance studies with realistic fusion experimental parameters are carried out on multiple supercomputing systems spanning a wide range of cache capacities, cache-sharing configurations, memory bandwidth, interconnects and network topologies. Furthermore, these performance comparisons using a realistic discovery-science-capable domain application code provide valuable insights on optimization techniques across one of the broadest sets of current high-end computing platforms worldwide.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Neuromorphic scaling advantages for energy-efficient random walk computations

Computing stands to be radically improved by neuromorphic computing (NMC) approaches inspired by the brain's incredible efficiency and capabilities. Most NMC research, which aims to replicate the brain's computational structure and architecture in man-made hardware, has focused on artificial intelligence; however, less explored is whether this brain-inspired hardware can provide value beyond cognitive tasks. We demonstrate that high-degree parallelism and configurability of spiking neuromorphic architectures makes them well-suited to implement random walks via discrete time Markov chains. Such random walks are useful in Monte Carlo methods, which represent a fundamental computational tool for solving a wide range of numerical computing tasks. Additionally, we show how the mathematical basis for a probabilistic solution involving a class of stochastic differential equations can leverage those simulations to provide solutions for a range of broadly applicable computational tasks. Despite being in an early development stage, we find that NMC platforms, at a sufficient scale, can drastically reduce the energy demands of high-performance computing platforms.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Initial Developments in Modeling Graphite Behavior

Graphite is used in High Temperature Reactor designs as a moderator, reflector and core material responsible for protecting the fuel and maintaining structural stability. From a safety perspective, it is imperative to be able to predict how graphite will behave under reactor operating conditions which may compromise the core’s structural integrity or fuel’s safety performance. The following report summarizes recent modeling work undertaken at Idaho National Laboratory which focuses on graphite degradation behavior. One phenomenon which is explored in this report and can cause significant degradation to graphite properties is oxidation. Oxidation behavior in graphite is highly temperature dependent. At low temperatures, oxygen can fully penetrate a component and cause a homogeneous damage profile. At high temperatures, only the graphite near the surface of a component is affected. Understanding and modeling this temperature dependence is essential to predicting graphite behavior. In this report, three graphite models are discussed. The first model is used to investigate strength loss after low temperature oxidation. It does this by generating an approximate graphite microstructure then determining the required load to cause crack propagation. It has been shown that the model reproduces the quasi brittle stress versus strain relationship observed in graphite. Strength loss results from the model are shown to match experimental values. The second model investigates strength loss under high temperature oxidation conditions. This model is more applicable to full scale graphite components where the oxidation damage is often inhomogeneous throughout a component. The third model computes stresses in graphite under reactor conditions. Specifically, the model incorporates the effect of creep, irradiation dose, thermal strains, and oxidation in order to predict internal stresses in a component. All of these models are implemented in the Multiphysics Object-Oriented Simulation Environment (MOOSE), an open source, parallel finite element framework.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2016

PFLOTRAN Integrated Performance Assessment at Waste Isolation Pilot Plant

The Waste Isolation Pilot Plant (WIPP) is developed by the U.S. Department of Energy (DOE) for the deep geologic disposal of transuranic (TRU) waste in southeast New Mexico. The purpose of performance assessment (PA) is to estimate probability of potential radionuclide releases from the repository to the environment for a regulatory period of 10,000 years after its closure. The use of PFLOTRAN has been proposed to enhance PA with more physically realistic flow and transport models in 3D. PFLOTRAN is a state-of-art massively parallel subsurface flow and reactive transport code. This paper introduces the progress of implementation of PFLOTRAN in the PA and the preliminary results for undisturbed repository conditions. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2024

Plastic Parallel Pathways Platform - 4P Model

Global momentum is building towards a circular economy capable of keeping plastics in use and out of waste streams. Given that 79% of all plastic produced since 1950 has accumulated in landfills or the natural environment,rapid implementation of various end-of-life (EoL) management technologies will be needed to reach this target. However, it can be challenging to develop an effective plastic EoL strategy when the available options - chemical or molecular recycling, energy recovery, upcycling, downcycling, closed-loop (plastic-to-plastic) or open-loop (plastic-to-x) recycling, among others - can generate products ranging from low-grade to virgin-quality plastic and from fuels to value-added chemicals. We present a flexible material flow model capable of analyzing the effects of both plastic-to-plastic and plastic-to-x EoL management strategies on the U.S. PET economy. This Plastic Parallel Pathways Platform (4P) assesses the environmental impacts, costs, and circularity of a PET system in which waste is managed through six potential EoL pathways: landfill, incineration with energy recovery, pyrolysis to fuel oil, upcycling to glass fiber reinforced plastic (GFRP), mechanical recycling to low-grade PET, and chemical recycling (glycolysis) to bottle-grade PET. We compare the pathways across multiple metrics using multi-criteria decision analysis (MCDA) and then use a brute force algorithm to predict an optimal combination of EoL pathways to minimize greenhouse gas (GHG) emissions and costs and maximize circularity. This work highlights the need to implement a diverse portfolio of EoL strategies in parallel to enable a PET economy that meets environmental, economic, and circularity requirements simultaneously.

downcycling↗