Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel processing”

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 775 records · Page 43

High-order asynchrony-tolerant finite difference schemes for partial differential equations

Synchronizations of processing elements (PEs) in massively parallel simulations, which arise due to communication or load imbalances between PEs, significantly affect the scalability of scientific applications. We have recently proposed a method based on finite-difference schemes to solve partial differential equations in an asynchronous fashion – synchronization between PEs is relaxed at a mathematical level. While standard schemes can maintain their stability in the presence of asynchrony, their accuracy is drastically affected. In this work, we present a general methodology to derive asynchrony-tolerant (AT) finite difference schemes of arbitrary order of accuracy, which can maintain their accuracy when synchronizations are relaxed. We show that there are several choices available in selecting a stencil to derive these schemes and discuss their effect on numerical and computational performance. We provide a simple classification of schemes based on the stencil and derive schemes that are representative of different classes. Their numerical error is rigorously analyzed within a statistical framework to obtain the overall accuracy of the solution. Results from numerical experiments are used to validate the performance of the schemes.

42 ENGINEERING↗

A parallel strategy for density functional theory computations on accelerated nodes

Using the Löwdin orthonormalization of tall-skinny matrices as a proxy-app for wavefunction-based Density Functional Theory solvers, we investigate a distributed memory parallel strategy focusing on Graphics Processing Unit (GPU)-accelerated nodes as available on some of the top ranked supercomputers at the present time. Here we present numerical results in the strong limit regime, as it is particularly relevant for First-Principles Molecular Dynamics. We also examine how matrix product-based iterative solvers provide a competitive alternative to dense eigensolvers on GPUs, allowing to push the strong scaling limit of these computations to a larger number of distributed tasks. Our strategy, which relies on replicated Gram matrices and efficient collective communications using the NCCL library, leads to a time-to-solution under 0.5 s for the Löwdin orthonormalization of a tall-skinny matrix of 3000 columns on Summit at Oak Ridge Leadership Facility (OLCF). Given the similarity in computational operations between one iteration of a DFT solver and this proxy-app, this shows the possibility of solving accurately the DFT equations well under a minute for 3000 electronic wave functions, and thus perform First-Principles molecular dynamics of physical systems much larger than traditionally solved on CPU systems.

97 MATHEMATICS AND COMPUTING↗

Transformation of brucine into trifluoromethyl neobrucine using the homoleptic nickel catalyst [Ni(CF3)4]2-

The homoleptic trifluoromethyl nickel complex [Ni(CF3)4]2- catalyzes a stereoselective trifluoromethylation of brucine with Umemoto II reagent. The trifluoromethylation process proceeds with concomitant isomerization of its alkenyl double bond leading to a trifluoromethylated neobrucine-like derivative. A minor difunctionalization product was also detected from the reaction mixture, consistent with a radical addition process that is occurring in parallel. Stoichiometric reactions between the nickel(II) catalyst precursor and brucine led to no reaction. However, a stochiometric reaction with a high-valent nickel(IV) complex formed trifluoromethylated neobrucine, implicating its intermediacy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Magnetosheath Reconnection Before Magnetopause Reconnection Driven by Interplanetary Tangential Discontinuity: A Three‐Dimensional Global Hybrid Simulation With Oblique Interplanetary Magnetic Field

Abstract Terrestrial dayside dynamics associated with a southward turning, oblique interplanetary magnetic field (IMF) carried by an interplanetary tangential discontinuity (TD) is investigated by performing a three‐dimensional global‐scale hybrid simulation systematically for cases in which the incoming solar wind TD possesses various magnetic field rotation angles ΔΦ = 90° to 180° and half widths w = 2 d i 0 to w = 30 d i 0 , where d i 0 is the ion inertial length in the solar wind. Overall, the TD is compressed while being transmitted into the magnetosheath, with different compression processes downstream of the quasi‐parallel (Q‐||) and quasi‐perpendicular (Q‐ ⊥ ) shocks. It is found that magnetosheath reconnection may take place downstream of both the Q‐|| and Q‐ ⊥ shocks due to interaction of the directional TD with the bow shock and magnetopause, but the existence of magnetosheath reconnection depends on w and ΔΦ . Magnetosheath flux ropes are formed through three‐dimensional patchy reconnection in the thinned current sheet, with a longer rope lengths under a larger ΔΦ . There exists a dawn‐dusk asymmetry in the spatial extent of the flux ropes, which becomes more significant as ΔΦ decreases. When ΔΦ decreases to 90° , no reconnection flux ropes are found. Magnetopause reconnection is initiated when the magnetic fluxes with a southward turning IMF (on the sunward side) reach the magnetopause, and the magnetopause flux ropes can be mixed with the magnetosheath ones. Our simulation demonstrates that the effects of a southward turning of the IMF may not be a simple field direction change that leads to reconnection only at the magnetopause.

Guo, Zhifang↗

Accelerating the Lagrangian Particle Tracking in Hydrologic Modeling to Continental-Scale

Unprecedented climate change and anthropogenic activities have induced increasing ecohydrological problems, which have motivated the development of large-scale modeling for solutions. Water age/quality is as important as water quantity for understanding the water cycle. However, current scientific progress in tracking water parcels at large-scale with high spatiotemporal resolutions is far behind that in water balance/quantity owing to the lack of powerful tools. EcoSLIM is a particle tracking model that works with the hydrologic model ParFlow-CLM, which couples surface-subsurface hydrology with land surface processes. Here, we demonstrate a parallel framework to accelerate EcoSLIM to continental-scale on a distributed, multi-GPU platform with CUDA-Aware MPI. In tests from catchment-, to regional-, and then to continental-scale using 25-million to 1.6-billion particles, EcoSLIM shows significant speedup and excellent parallel performance. The parallel framework is portable to atmospheric and oceanic particle tracking models, where parallelization is inadequate and a standard parallel framework is absent. Parallelized EcoSLIM is a promising tool to accelerate our understanding of the terrestrial water cycle and the upscaling of subsurface hydrology to Earth system models.

54 ENVIRONMENTAL SCIENCES↗

A Parallelised ROOT for Future HEP Data Processing

In the coming years, HEP data processing will need to exploit parallelism on present and future hardware resources to sustain the bandwidth requirements. As one of the cornerstones of the HEP software ecosystem, ROOT embraced an ambitious parallelisation plan which delivered compelling results. In this contribution the strategy is characterised as well as its evolution in the medium term. The units of the ROOT framework are discussed where task and data parallelism have been introduced, with runtime and scaling measurements. We will give an overview of concurrent operations in ROOT, for instance in the areas of I/O (reading and writing of data), fitting / minimization, and data analysis. This paper introduces the programming model and use cases for explicit and implicit parallelism, where the former is explicit in user code and the latter is implicitly managed by ROOT internally.

97 MATHEMATICS AND COMPUTING↗

A 1 A laser driver in 0.35 {mu}m complementary metal oxide semiconductor technology for a pulsed time-of-flight laser rangefinder

An integrated complementary metal oxide semiconductor (CMOS) current pulse generator is presented which achieves an ampere-scale peak current pulse with a rise time and pulse width of less than 1 and 2.5 ns (pulse width at half maximum), respectively. The generator is implemented in a 0.35 {mu}m CMOS process and consists of four parallel n-type metal oxide semiconductor transistors driven by a scaled buffer chain to achieve fast switching.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Edge-localized-modes in tokamaks

Edge-localized-modes (ELMs) are a ubiquitous feature of H-mode in tokamaks. When gradients in the H-mode transport barrier grow to exceed the MHD stability limit the ELM instability grows explosively, rapidly transporting energy and particles onto open field lines and material surfaces. Though ELMs provide additional particle and impurity transport through the H-mode transport barrier, enabling steady operation, the resulting heat flux transients to plasma facing surfaces project to large amplitude in future low collisionality burning plasma tokamaks. Measurements of the ELM heat flux deposition onto material surfaces in the divertor and main chamber indicate significant broadening compared to inter-ELM heat flux, with a timescale for energy deposition that is consistent with sonic ion flow and numerical simulation. Comprehensive ELM simulation is highlighting the important physics processes of ELM transport including parallel transport due to magnetic reconnection and turbulence resulting from collapse of the H-mode transport barrier. Encouraging prospects for ELM control and/or suppression in future tokamaks include intrinsic modes of ELM free operation, ELM triggering with frequent small pellet injection and the application of 3D magnetic fields.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Nonlinear electronic excitations in crystalline solids using meta-generalized gradient approximation and hybrid functional in time-dependent density functional theory

We develop methods to calculate electron dynamics in crystalline solids in real-time time-dependent density functional theory employing exchange-correlation potentials which reproduce band gap energies of dielectrics; a meta-generalized gradient approximation was proposed by Tran and Blaha [Phys. Rev. Lett. 102, 226401 (2009)] (TBm-BJ) and a hybrid functional was proposed by Heyd, Scuseria, and Ernzerhof [J. Chem. Phys. 118, 8207 (2003)] (HSE). In time evolution calculations employing the TB-mBJ potential, we have found it necessary to adopt the predictor-corrector step for a stable time evolution. We have developed a method to evaluate electronic excitation energy without referring to the energy functional which is unknown for the TB-mBJ potential. For the HSE functional, we have developed a method for the operation of the Fock-like term in Fourier space to facilitate efficient use of massive parallel computers equipped with graphic processing units. We compare electronic excitations in silicon and germanium induced by femtosecond laser pulses using the TB-mBJ, HSE, and a simple local density approximation (LDA). At low laser intensities, electronic excitations are found to be sensitive to the band gap energy: they are close to each other using TB-mBJ and HSE and are much smaller in LDA. At high laser intensities close to the damage threshold, electronic excitation energies do not differ much among the three cases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Track reconstruction as a service for collider physics

Optimizing charged-particle track reconstruction algorithms is crucial for efficient event reconstruction in Large Hadron Collider (LHC) experiments due to their significant computational demands. Existing track reconstruction algorithms have been adapted to run on massively parallel coprocessors, such as graphics processing units (GPUs), to reduce processing time. Nevertheless, challenges remain in fully harnessing the computational capacity of coprocessors in a scalable and non-disruptive manner. This paper proposes an inference-as-a-service approach for particle tracking in high energy physics experiments. To evaluate the efficacy of this approach, two distinct tracking algorithms are tested: Patatrack, a rule-based algorithm, and Exa.TrkX, a machine learning-based algorithm. The as-a-service implementations show enhanced GPU utilization and can process requests from multiple CPU cores concurrently without increasing per-request latency. The impact of data transfer is minimal and insignificant compared to running on local coprocessors. This approach greatly improves the computational efficiency of charged particle tracking, providing a solution to the computing challenges anticipated in the High-Luminosity LHC era.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

SHARP: a distributed GPU-based ptychographic solver

Ever brighter light sources, fast parallel detectors and advances in phase retrieval methods have made ptychography a practical and popular imaging technique. Compared to previous techniques, ptychography provides superior robustness and resolution at the expense of more advanced and time-consuming data analysis. Therefore, by taking advantage of massively parallel architectures, high-throughput processing can expedite this analysis and provide microscopists with immediate feedback. These advances allow real-time imaging at wavelength-limited resolution, coupled with a large field of view. This article describes a set of algorithmic and computational methodologies used at the Advanced Light Source and US Department of Energy light sources. These are packaged as a CUDA-based software environment named SHARP, aimed at providing state-of-the-art high-throughput ptychography reconstructions for the coming era of diffraction-limited light sources.

47 OTHER INSTRUMENTATION↗

Performance Evaluation of Heterogeneous GPU Programming Frameworks for Hemodynamic Simulations

Preparing for the deployment of large scientific and engineering codes on upcoming exascale systems with GPU-dense nodes is made challenging by the unprecedented diversity of device architectures and heterogeneous programming models. In this work, we evaluate the process of porting a massively parallel, fluid dynamics code written in CUDA to SYCL, HIP, and Kokkos with a range of backends, using a combination of automated tools and manual tuning. We use a proxy application along with a custom performance model to inform the results and identify additional optimization strategies. At scale performance of the programming model implementations are evaluated on pre-production GPU node architectures for Frontier and Aurora, as well as on current NVIDIA device-based systems Summit and Polaris. Real-world workloads representing 3D blood flow calculations in complex vasculature are assessed. Our analysis highlights critical trade-offs between code performance, portability, and development time.

Martin, Aristotle↗

Fast Equilibration of Ocean Tracers Software

The Fast Equilibration of Ocean Tracers Software (FEOTS) is a set of Fortran modules and programs for post-processing output from LANL's Parallel Ocean Program (POP). However, it is written so that it can be extended for use with other General Circulation Models. Tools are provided for aiding in the diagnosis of sparse matrices that capture advection and diffusion operators that are consistent with General Circulation Model discretizations. FEOTS additionally offers tools to make use of the diagnosed operators to run offline tracer models in forward or equilibration modes.

Zhang, Jiaxu↗

Julienne v1.0.0

Julienne is a compiler-portable unit-testing framework for Fortran software projects, including those that use the parallel/accelerator-programming features of Fortran 2023. Julienne achieves portability across compilers through minimalism and isolation. The minimal design ensures that Julienne uses only features supported by the majority of Fortran compilers. The isolation through zero dependencies ensures that no other projects block Julienne from building with a particular compiler. Julienne also contains with additional services that support its unit-testing code. These include functions for manipulating strings, command lines and input/output format strings; and a user-defined collective subroutine for verifying that all processes pass a test in parallel testing. Julienne's name derives from the term for vegetables sliced into thin strings: julienne vegetables. Julienne captures the authors' most frequently used thin slice of the Veggies and Sourcery software repositories while avoiding certain compiler limitations of the those two packages.

Rouson, Damian↗

Solid-state-based analog of optomechanics

In this study, we investigate a semiconductor quantum dot as a microscopic analog of a basic optomechanical setup. We show that optomechanical features can be reproduced by the solid-state platform, arising from parallels of the underlying interaction processes, which in the optomechanical case is the radiation pressure coupling and in the semiconductor case the electron–phonon coupling. We discuss bistabilities, lasing, and phonon damping, and recover the same qualitative behaviors for the semiconductor and the optomechanical cases expected for low driving strengths. However, in contrast to the optomechanical case, distinct signatures of higher order processes arise in the semiconductor model.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Fiats: Functional inference and training for surrogates

Fiats provides a platform for research on the training and deployment of neural-network surrogate models for computational science. Fiats also supports exploring, advancing, and combining functional, object-oriented, and parallel programming patterns in Fortran 2023. As such, the Fiats name has dual expansions: “Functional Inference And Training for Surrogates” or “Fortran Inference And Training for Science.” Fiats inference and training procedures are pure and therefore satisfy a language constraint imposed on procedure invocations inside Fortran’s parallel loop construct: do concurrent. Furthermore, the Fiats training procedures are built around a do concurrent parallel reduction. Several compilers can automatically parallelize do concurrent on Central Processing Units (CPUs) or Graphics Processing Units (GPUs). Fiats thus aims to achieve performance portability through standard language mechanisms.

Rouson, Damian [Lawrence Berkeley National Laborat↗

UPC++ v1.0 Specification, Revision 2020.10.0

UPC++ is a C++11 library providing classes and functions that support Partitioned Global Address Space (PGAS) programming. The key communication facilities in UPC++ are one-sided Remote Memory Access (RMA) and Remote Procedure Call (RPC). All communication operations are syntactically explicit and default to non-blocking; asynchrony is managed through the use of futures, promises and continuation callbacks, enabling the programmer to construct a graph of operations to execute asynchronously as high-latency dependencies are satisfied. A global pointer abstraction provides system-wide addressability of shared memory, including host and accelerator memories. The parallelism model is primarily process-based, but the interface is thread-safe and designed to allow efficient and expressive use in multi-threaded applications. The interface is designed for extreme scalability throughout, and deliberately avoids design features that could inhibit scalability.

97 MATHEMATICS AND COMPUTING↗

UPC++ v1.0 Specification, Revision 2021.9.0

UPC++ is a C++ library providing classes and functions that support Partitioned Global Address Space (PGAS) programming. The key communication facilities in UPC++ are one-sided Remote Memory Access (RMA) and Remote Procedure Call (RPC). All communication operations are syntactically explicit and default to non-blocking; asynchrony is managed through the use of futures, promises and continuation callbacks, enabling the programmer to construct a graph of operations to execute asynchronously as high-latency dependencies are satisfied. A global pointer abstraction provides system-wide addressability of shared memory, including host and accelerator memories. The parallelism model is primarily process-based, but the interface is thread-safe and designed to allow efficient and expressive use in multi-threaded applications. The interface is designed for extreme scalability throughout, and deliberately avoids design features that could inhibit scalability.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗