Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel Applications”

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 1,351 records · Page 75
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Neutronics Calculation of Fast Reactor Using Modern Computing Systems

The possibility of using the LUCKY-A three-dimensional multiprocessor transport code as a neutronics module for the COREMELT integrated non-stationary code for performing safety analysis, which is used for fast sodium reactor safety validation, is discussed. In this application, more stringent requirements are imposed on the computing speed of the LUCKY-A code. To test LUCKY-A possibilities, a typical computational problem is examined in a formulation characteristic for the proposed use of the code. The possibilities of the code for parallelized calculations are shown, and a comparison is made with calculations performed with the MMKKENO and TRIGEX codes. The efficacy of a parallel computational process is investigated as a function of the number of computing kernels used.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

A fast and accurate domain decomposition nonlinear manifold reduced order model

Here, this paper integrates nonlinear-manifold reduced order models (NM-ROMs) with domain decomposition (DD). NM ROMs approximate the full order model (FOM) state in a nonlinear-manifold by training a shallow, sparse autoencoder using FOM snapshot data. These NM-ROMs can be advantageous over linear-subspace ROMs (LS-ROMs) for problems with slowly decaying Kolmogorov n-width. However, the number of NM-ROM parameters that need to be trained scales with the size of the FOM. Moreover, for “extreme-scale” problems, the storage of high-dimensional FOM snapshots alone can make ROM training expensive. To alleviate the training cost, this paper applies DD to the FOM, computes NM-ROMs on each subdomain, and couples them to obtain a global NM-ROM. This approach has several advantages: Subdomain NM-ROMs can be trained in parallel, involve fewer parameters to be trained than global NM-ROMs, require smaller subdomain FOM dimensional training data, and can be tailored to subdomain specific features of the FOM. The shallow, sparse architecture of the autoencoder used in each subdomain NM-ROM allows application of hyper-reduction (HR), reducing the complexity caused by nonlinearity and yielding computational speedup of the NM-ROM. This paper provides the first application of NM-ROM (with HR) to a DD problem. In particular, this paper details an algebraic DD reformulation of the FOM, training a NM-ROM with HR for each sub domain, and a sequential quadratic programming (SQP) solver to evaluate the coupled global NM-ROM. Theoretical convergence results for the SQP method and a priori and a posteriori error estimates for the DD NM-ROM with HR are provided. The proposed DD NM-ROM with HR approach is numerically compared to a DD LS-ROM with HR on the 2D steady-state Burgers’ equation, showing an order of magnitude improvement in accuracy of the proposed DD NM-ROM over the DD LS-ROM.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Sensitivity and reliability of key electrochemical markers for detecting lithium plating during extreme fast charging

Lithium plating is one of the key challenges for enabling extreme fast charging (XFC, ≤10 to 15 min charging at ≥6C) in graphite-based lithium-ion batteries. Significant R&D effort has been focused on how to mitigate Li plating. Parallel effort is also being devoted to developing methods to detect Li plating when and if it happens during fast charging. In that regard, electrochemical (EC) signature-based detection techniques are less resource intensive, more convenient, and more practical from an end-user application perspective. However, a comprehensive understanding of key plating related EC signatures for extreme fast charging is presently unavailable. In particular, there exist distinct issues of unreliability with key plating-related EC signatures—e.g., incremental capacity (dQ.dV -1 ), differential OCV (dOCV.dt -1 ), end of lithiation (EOL) rest voltage—at XFC conditions, and the underlying reasons have not been explored and identified methodically. Using a comprehensive test matrix and XFC conditions with Li/graphite half cells, this article highlights the unreliability issues associated with the EC Li plating diagnostics and explains the underlying root cause. This study finds distinct sensitivity and unreliability issues with plating related dQ.dV -1 , dOCV.dt -1 , and EOL rest voltage signatures with charging rates. Furthermore, the complex interaction between graphite and plated Li that happens through multiple competing mechanisms —Li stripping and chemical intercalation— at different charging rates is at the core of the sensitivity and unreliability issue.

25 ENERGY STORAGE↗
DOE OSTI2015

Characterization of Traveling Wave Ion Mobility Separations in Structures for Lossless Ion Manipulations

We report on the development and characterization of a new traveling wave-based Structure for Lossless Ion Manipulations (TW-SLIM) for ion mobility separations (IMS). The TW-SLIM module uses parallel arrays of rf electrodes on two closely spaced surfaces for ion confinement, where the rf electrodes are separated by arrays of short electrodes, and using these TWs can be created to drive ion motion. In this initial work, TWs are created by the dynamic application of dc potentials. The capabilities of the TW-SLIM module for efficient ion confinement, lossless ion transport, and ion mobility separations at different rf and TW parameters are reported. The TW-SLIM module is shown to transmit a wide mass range of ions (m/z 200–2500) utilizing a confining rf waveform (~1 MHz and ~300 V p-p ) and low TW amplitudes (<20 V). Additionally, the short TW-SLIM module achieved resolutions comparable to existing commercially available low pressure IMS platforms and an ion mobility peak capacity of ~32 for TW speeds of <210 m/s. TW-SLIM performance was characterized over a wide range of rf and TW parameters and demonstrated robust performance. In conclusion, the combined attributes of the flexible design and low voltage requirements for the TW-SLIM module provide a basis for devices capable of much higher resolution and more complex ion manipulations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Design and performance of parallel-channel nanocryotrons in magnetic fields

We introduce a design modification to conventional geometry of the cryogenic three-terminal switch, the nanocryotron (nTron). The conventional geometry of nTrons is modified by including parallel current-carrying channels, an approach aimed at enhancing the device's performance in magnetic field environments. The common challenge in nTron technology is to maintain efficient operation under varying magnetic field conditions. Here, we show that the adaptation of parallel channel configurations leads to an enhanced gate signal sensitivity, an increase in operational gain, and a reduction in the impact of superconducting vortices on nTron operation within magnetic fields up to 1 T. Contrary to traditional designs that are constrained by their effective channel width, the parallel nanowire channels permits larger nTron cross sections, further bolstering the device's magnetic field resilience while improving electro-thermal recovery times due to reduced local inductance. This advancement in nTron design not only augments its functionality in magnetic fields but also broadens its applicability in technological environments, offering a simple design alternative to existing nTron devices.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

MTUQ: a framework for estimating moment tensors, point forces, and their uncertainties

SUMMARY We introduce MTUQ, an open-source Python package for seismic source estimation and uncertainty quantification, emphasizing flexibility and operational scalability. MTUQ provides MPI-parallelized grid search and global optimization capabilities, compatibility with 1-D and 3-D Green’s function database formats, customizable data processing, C-accelerated waveform and first-motion polarity misfit functions, and utilities for plotting seismic waveforms and visualizing misfit and likelihood surfaces. Applicability to a range of full- and constrained-moment tensor, point force, and centroid inversion problems is possible via a documented application programming interface, accompanied by example scripts and integration tests. We demonstrate the software using three different types of seismic events: (1) a 2009 intraslab earthquake near Anchorage, Alaska; (2) an episode of the 2021 Barry Arm landslide in Alaska; and (3) the 2017 Democratic People’s Republic of Korea underground nuclear test. With these events, we illustrate the well-known complementary character of body waves, surface waves, and polarities for constraining source parameters. We also convey the distinct misfit patterns that arise from each individual data type, the importance of uncertainty quantification for detecting multimodal or otherwise poorly constrained solutions, and the software’s flexible, modular design.

58 GEOSCIENCES↗
DOE OSTI2021

It’s Time to Talk About HPC Storage: Perspectives on the Past and Future

High-performance computing (HPC) storage systems are a key component of the success of HPC to date. Recently, we have seen major developments in storage-related technologies, as well as changes to how HPC platforms are used, especially in relation to artificial intelligence and experimental data analysis workloads. Additionally, these developments merit a revisit of HPC storage system architectural designs. In this article, we discuss the drivers, identify key challenges to status quo posed by these developments, and discuss directions future research might take to unlock the potential of new technologies for the breadth of HPC applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Realistic Cost to Execute Practical Quantum Circuits using Direct Clifford+T Lattice Surgery Compilation

We report a resource estimation pipeline that explicitly compiles quantum circuits expressed using the Clifford+T gate set into a surface code lattice surgery instruction set. The cadence of magic state requests from the compiled circuit enables the optimization of magic state distillation and storage requirements in a post-hoc analysis. To compile logical circuits into lattice surgery operations, we build upon the open-source Lattice Surgery Compiler. The revised compiler operates in two stages: the first translates logical gates into an abstract, layout-independent instruction set; the second compiles these into local lattice surgery instructions that are allocated to hardware tiles according to a specified resource layout. The second stage retains logical parallelism while avoiding resource contention in the fault-tolerant layer, aiding realism. Additionally, users can specify dedicated tiles at which magic states are replenished, enabling resource costs from the logical computation to be considered independently from magic state distillation and storage. We demonstrate the applicability of our pipeline to large practical quantum circuits by providing resource estimates for the ground state estimation of molecules. Finally, we find that variable magic state consumption rates in real circuits can cause the resource costs of magic state storage to dominate unless production is varied to suit.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Summer Proceedings 2016: The Center for Computing Research at Sandia National Laboratories

Solving sparse linear systems from the discretization of elliptic partial differential equations (PDEs) is an important building block in many engineering applications. Sparse direct solvers can solve general linear systems, but are usually slower and use much more memory than effective iterative solvers. To overcome these two disadvantages, a hierarchical solver (LoRaSp) based on H2-matrices was introduced in [22]. Here, we have developed a parallel version of the algorithm in LoRaSp to solve large sparse matrices on distributed memory machines. On a single processor, the factorization time of our parallel solver scales almost linearly with the problem size for three-dimensional problems, as opposed to the quadratic scalability of many existing sparse direct solvers. Moreover, our solver leads to almost constant numbers of iterations, when used as a preconditioner for Poisson problems. On more than one processor, our algorithm has significant speedups compared to sequential runs. With this parallel algorithm, we are able to solve large problems much faster than many existing packages as demonstrated by the numerical experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

DARMA-MPI Interoperability WBS 2.3.1.04 Milestone 15 (ECP Milestone Report)

DARMA (Distributed Asynchronous Resilient Models for Applications) is a runtime library developed as part of the the Sandia ATDM (Advanced Technology Development and Mitigation) program. DARMA supports applications within 2.2.5.03 ADNN03-ASC ATDM SNL Application, which includes a number of applications featuring dynamic physics which requires load balancing and asynchronous communication for high performance. We have implemented a modern C++ programming model that can enable dynamic, asynchronous communication on top of existing data structures from a serial or MPI code. DARMA development has occurred in parallel with a verification milestone for ATDM in FY18. For FY19, DARMA will impact ATDM by enabling the performance benefits of a dynamic runtime through only incremental changes to existing verified MPI codes. The results presented here demonstrate the DARMA development process for an MPI mini-app, showing a 3-4x improvement in performance for a challenging problem relative to the parent MPI code and coming within 25 percent of the theoretically optimal performance achievable from a perfect, fine-grained load balancer for most cases.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Model Reduction for Compressible Cavity Simulations Towards Uncertainty Quantification of Structural Loading

This report summarizes FY16 progress towards enabling uncertainty quantification for compressible cavity simulations using model order reduction (MOR). The targeted application is the quantification of the captive-carry environment for the design and qualification of nuclear weapons systems. To accurately simulate this scenario, Large Eddy Simulations (LES) require very fine meshes and long run times, which lead to week-long runs even on parallel state-of-the-art super- computers. MOR can reduce substantially the CPU-time requirement for these simulations. We describe two approaches for model order reduction for nonlinear systems, which can yield significant speed-ups when combined with hyper-reduction: the Proper Orthogonal Decomposition (POD)/Galerkin approach and the POD/Least-Squares Petrov Galerkin (LSPG) approach. The implementation of these methods within the in-house compressible flow solver SPARC is discussed. Next, a method for stabilizing and enhancing low-dimensional reduced bases that was developed as a part of this project is detailed. This approach is based on a premise termed "minimal subspace rotation", and has the advantage of yielding ROMs that are more stable and accurate for long-time compressible cavity simulations. Numerical results for some laminar cavity problems aimed at gauging the viability of the proposed model reduction methodologies are presented and discussed.

42 ENGINEERING↗
DOE OSTI2021

Understanding the Design Space of Sparse/Dense Multiphase Dataflows for Mapping Graph Neural Networks on Spatial Accelerators

Graph Neural Networks (GNNs) have garnered a lot of recent interest because of their success in learning representations from graph-structured data across several critical applications in cloud and HPC. Owing to their unique compute and memory characteristics that come from an interplay between dense and sparse phases of computations, the emergence of reconfigurable dataflow (aka spatial) accelerators offers promise for acceleration by mapping optimized dataflows (i.e., computation order and parallelism) for both phases. The goal of this work is to characterize and understand the design-space of dataflow choices for running GNNs on spatial accelerators in order for the compilers to optimize the dataflow based on the workload. Specifically, we propose a taxonomy to describe all possible choices for mapping the dense and sparse phases of GNNs spatially and temporally over a spatial accelerator, capturing both the intra-phase dataflow and the inter-phase (pipelined) dataflow. Using this taxonomy, we do deep-dives into the cost and benefits of several dataflows and perform case studies on implications of hardware parameters for dataflows and value of flexibility to support pipelined execution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

HTGR Multiphysics Application Drivers FY26 Updates

This report summarizes FY26 progress under the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program's high-temperature gas-cooled reactor (HTGR) application driver work, covering a wide range of activities such as code validation and multi-physics code assessment. 1) A detailed SAM model of the High-Temperature Engineering Test Reactor (HTTR) was developed using a unique-block grouping approach, with an extended parallel thermal network method to capture block-to-block conduction and radiation heat transfer, and applied to steady-state simulations of the HTTR 30~MW and 9~MW cases. 2) In another activity, SAM's newly implemented multi-component gas flow model was validated against the Natural convection Shutdown heat removal Test Facility (NSTF) argon ingress experiment, correctly capturing the density-driven suppression and thermal recovery of natural circulation observed when argon is introduced into the air-cooled Reactor Cavity Cooling System (RCCS) loop. 3) For the OECD/NEA High Temperature Test Facility (HTTF) benchmark, we co-led the international benchmark activities as well as the OECD/NEA final benchmark report to be released at the end of this year. 4) Finally, the coupled Griffin-SAM modeling capability for pebble-bed HTGRs was advanced by verifying the Griffin neutronics solution against Serpent Monte Carlo for a realistic non-uniform temperature distribution, resolving several deficiencies in the SAM-to-Griffin temperature transfer scheme, and enabling distinct fuel kernel, moderator, and coolant temperatures for cross section feedback. These new features were demonstrated in a PBR load-following transient.

Lee, Alvin↗
DOE OSTI2016

Compressible flow in front of an axisymmetric blunt object: analytic approximation and astrophysical implications

Compressible flows around blunt objects have diverse applications, but current analytic treatments are inaccurate and limited to narrow parameter regimes. We show that the gas-dynamic flow in front of an axisymmetric blunt body is accurately derived analytically using a low order expansion of the perpendicular gradients in terms of the parallel velocity. This reproduces both subsonic and supersonic flows measured and simulated for a sphere, including the transonic regime and the bow shock properties. Some astrophysical implications are outlined, in particular for planets in the solar wind and for clumps and bubbles in the intergalactic medium. The bow shock standoff distance normalized by the obstacle curvature is ∼2/(3g) in the strong shock limit, where g is the compression ratio. For a subsonic Mach number M approaching unity, the thickness δ of an initially weak, draped magnetic layer is a few times larger than in the incompressible limit, with amplification ∼(1+1.3M{sup 2.6})/(3δ).

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2017

Calculation of Higher Eigenpairs of the Transport Equation Using IRAM Based on Domain Decomposition

The higher eigenpairs of the neutron transport (or diffusion) equation are useful in core flux distribution reconstruction, transient analysis, stability analysis, and loading pattern optimization. There are various methods for the calculation of higher eigenpairs, such as the power iteration method with filtering technique, the Generalized Modified Power Method (GMPM), the power iteration method with innovative boundary conditions for symmetric cores, and Krylov subspace methods. In regard to Krylov subspace methods, the Implicitly Restarted Arnoldi Method (IRAM) and ORTHOMIN were implemented to calculate higher eigenpairs for both transport and diffusion equations. In Warsa's work, however, there was a significant drawback that problems with energy upscatter could not be treated efficiently. In Modak's work, the mode to which his method was likely to converge depended on the shape of initial guess flux, and only one mode could be computed each time, making it impractical for real use. Furthermore, the computational burden for higher eigenpairs is generally much larger than for only the first eigenpair, especially for neutron transport equations. Therefore, the implementation of parallel computation for higher eigenpairs is essential to improve the efficiency, and no such work has been reported in literature so far. In this summary, we propose an innovative method to calculate higher eigenpairs of the neutron transport equation based on high performance computation. In this method, 2D Matrix Method of Characteristic (MMOC) is used to discretize the neutron transport equation; IRAM is used to evaluate higher eigenpairs; spatial domain decomposition is used to realize parallel computation. The highlight of this method is using the MGMD PGMRES (Multi-Group and Multi-Domain coupled Parallel Generalized Minimal Residual Method) algorithm to simultaneously accelerate the upscatter iterations and the inner interface angular fluxes iterations, avoiding the drawback in Warsa's method and the efficiency problem of conventional Jacobi iteration. To the best of our knowledge, our work represents the first application of IRAM based on domain decomposition for higher eigenpairs.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2018

Asynchronously parallel optimization solver for finding multiple minima

This paper proposes and analyzes an asynchronously parallel optimization algorithm for finding multiple, high-quality minima of nonlinear optimization problems. Our multistart algorithm considers all previously evaluated points when determining where to start or continue a local optimization run. Theoretical results show that, under certain assumptions, the algorithm almost surely starts a finite number of local optimization runs and identifies, or has a single local optimization run converging to, every minimum. The algorithm is applicable to general optimization settings, but our numerical results focus on the case when derivatives are unavailable. In numerical tests, a PYTHON implementation of the algorithm is shown to yield good approximations of many minima (including a global minimum), and this ability scales well with additional resources. Our implementation’s time to solution is shown also to scale well even when the time to evaluate the function evaluation is highly variable.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Identifying crystallographic faces of the fluorites urania and thoria with rotational polarized Raman spectroscopy

Crystallite orientation identification is invaluable, but is often limited to small area identification or requires a large area sample. Nondestructive optical methods such as polarized Raman spectroscopy, in contrast, can be used to completely map a variety of sample sizes, but their potential is not yet fully realized. Here, we report a systematic study of polarized Raman scattering of high-quality, hydrothermally grown, single crystals of urania and thoria. The peak intensity variations for as-grown major crystal planes, post-growth polished crystal planes, and a post-growth polished non-crystallographic plane are directly linked to crystallographic orientation and crystal rotation, and agree with computed models. In particular, the parallel polarized peak intensity results are directly correlated with metal–oxygen–metal chains in the fluorite structure and can be used to determine both orientation and rotational alignment of a given crystal face if sufficiently small rotational steps are applied. These results are structure based, being applicable to the larger fluorite phase space, which is useful for optical, semiconductor, nuclear, and solid oxide fuel cell industries. Further, these results suggest that Raman spectroscopy can identify non-crystallographic orientations that are not discernable by traditional means.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Rapid discovery and evolution of nanosensors containing fluorogenic amino acids

Binding-activated optical sensors are powerful tools for imaging, diagnostics, and biomolecular sensing. However, biosensor discovery is slow and requires tedious steps in rational design, screening, and characterization. Here we report on a platform that streamlines biosensor discovery and unlocks directed nanosensor evolution through genetically encodable fluorogenic amino acids (FgAAs). Building on the classical knowledge-based semisynthetic approach, we engineer ~15 kDa nanosensors that recognize specific proteins, peptides, and small molecules with up to 100-fold fluorescence increases and subsecond kinetics, allowing real-time and wash-free target sensing and live-cell bioimaging. An optimized genetic code expansion chemistry with FgAAs further enables rapid (~3 h) ribosomal nanosensor discovery via the cell-free translation of hundreds of candidates in parallel and directed nanosensor evolution with improved variant-specific sensitivities (up to ~250-fold) for SARS-CoV-2 antigens. Altogether, this platform could accelerate the discovery of fluorogenic nanosensors and pave the way to modify proteins with other non-standard functionalities for diverse applications.

Biosensors↗