SEARCH · Engineering Papers

Results for “distributed parallelization”

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.

SourceResearch connectionFrom yearThrough year

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

At least 289 records · Page 16

All sources NASA NTRS DOE OSTI

DOE OSTI2020

Distinguishing resonance symmetries with energy-resolved photoion angular distributions from ion-pair formation in O 2 following two-photon absorption of a 9.3 eV femtosecond pulse

We present a combined experimental and theoretical study on the photodissociation dynamics of ion-pair formation in O 2 following resonant two-photon absorption of a 9.3 eV femtosecond pulse, where the resulting O + ions are detected using 3-D momentum imaging. Ion-pair formation states of $^3\Sigma^-_g$ and $^3\Pi_g$ symmetry are accessed through predissociation of optically dark continuum Rydberg states converging to the B $^2\Sigma^-_g$ ionic state, which are resonantly populated via a mixture of both parallel-parallel and parallel-perpendicular two-photon transitions. This mixture is evident in the angular distribution of the dissociation relative to the light polarization, and varies with the kinetic energy release (KER) of the fragmenting ion-pair. The KER-dependent photoion angular distribution reveals the underlying two-photon absorption dynamics involved in the ion-pair production mechanism and indicates the existence of two nearly degenerate continuum resonances possessing different symmetries, which can both decay by coupling to ion-pair states of the same total symmetry through internal conversion.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2025

Lowering and Runtime Support for Fortran’s Multi-Image Parallel Features using LLVM Flang, PRIF, and Caffeine

This paper provides an overview of the multi-image parallel features in Fortran 2023 and their implementation in the LLVM flang compiler and the Caffeine parallel runtime library. The features of interest support a Single-Program, Multiple-Data (SPMD) programming model based on executing multiple “images”, each of which is a program instance. The features also support a Partitioned Global Address Space (PGAS) in the form of “coarray” distributed data structures. The paper discusses the lowering of multi-image features to the Parallel Runtime Interface for Fortran (PRIF) and the implementation of PRIF in the Caffeine parallel runtime library. This paper also provides an early view into the design of a new multi-image dialect of the LLVM Multi-Level Intermediate Representation (MLIR). We describe validation and testing of the resulting software stack, and demonstrate that performance compares favorably to another open-source compiler and runtime library: GNU Compiler Collection (GCC) gfortran and OpenCoarrays, respectively.

Bonachea, Dan↗

DOE OSTI2022

Programming approaches for scalability, performance, and portability of combustion physics codes

Here, this paper presents the process, strategy, and results associated with porting a typical combustion physics flow solver to current state-of-the-art and future massively-parallel computer architectures. Major focus is placed on the distinct algorithmic structure of these types of codes and how it can be integrated with modern programming paradigms for heterogeneous platforms (i.e., distributed many-core systems with accelerators). An end-to-end case study is presented that exemplifies the process in a generic manner, which then serves as a clear guide with respect to the strategy and best practices leading to a robust and adaptable framework that performs well, is durable over time, is portable, and requires minimal human-effort. This end is accomplished beginning with the use of a mature, validated, structured, multiblock code framework optimized for application of both Large Eddy Simulation (LES) and Direct Numerical Simulation (DNS). This code has been ported to a variety of platforms over the past decade, including most recently the Oak Ridge Leadership Computing Facility’s “Summit” Platform. The experience gained on these multiple platforms provides general insights and thus the results presented are not specific to any one code or platform other than the overarching trend toward distributed many-core systems with accelerators in order to move toward exascale performance. The resultant performance and scalability of the ported code is demonstrated on a real-world application; a state-of-the-art rotating detonation rocket engine simulation that matches the complex geometry and boundary conditions imposed as part of a companion experimental campaign.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

torch-einshard v1.0

torch-einshard is a Python library for describing local and distributed PyTorch tensor computations with compact, einsum-like notation. Its expressions name logical axes, specify how they are sharded across a PyTorch DeviceMesh, and represent partial reductions. The library automatically performs contractions, permutations, reshaping, splitting, gathering, reduction, reduce-scatter, and repartitioning while preserving autograd. Additional features include sharding-aware FFTs, tensor rolls, halo exchange, sliding windows, 1D–3D convolutions, uneven-shard handling, parameter initialization and gradient management, and cost-based execution planning. It is designed for scientific machine learning and large-model workloads, including tensor-, sequence-, and spatial-parallel MLPs, attention, convolutions, and spectral operations. Compared with manually combining torch.einsum and distributed collectives, torch-einshard expresses both the mathematical operation and data placement in one readable formula. This reduces boilerplate and synchronization errors, keeps forward and backward communication consistent, and allows the library to select optimized collective strategies without changing model code.

Morozov, Dmitriy [Lawrence Berkeley National Labor↗

DOE OSTI2024

Particle Acceleration in Relativistic Alfvénic Turbulence

Abstract Strong magnetically dominated Alfvénic turbulence is an efficient engine of nonthermal particle acceleration in a relativistic collisionless plasma. We argue that in the limit of strong magnetization, the type of energy distribution attained by accelerated particles depends on the relative strengths of turbulent fluctuations δ B 0 and the guide field B 0 . If δ B 0 ≪ B 0 , the particle magnetic moments are conserved, and the acceleration is provided by magnetic curvature drifts. Curvature acceleration energizes particles in the direction parallel to the magnetic field lines, resulting in log-normal tails of particle energy distribution functions. Conversely, if δ B 0 ≳ B 0 , interactions of energetic particles with intense turbulent structures can scatter particles, creating a population with large pitch angles. In this case, magnetic mirror effects become important, and turbulent acceleration leads to power-law tails of the energy distribution functions.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2025

Exploring the Three-Dimensional Momentum Distribution of Longitudinally Polarized Quarks in the Proton

By analyzing experimental data on semi-inclusive deep inelastic scattering off longitudinally polarized targets, we extract the transverse momentum dependence of the quark helicity distribution, i.e., the difference between the three-dimensional motion of quarks with polarization parallel or antiparallel to the longitudinal polarization of the parent hadron. We perform the analysis at next-to-leading and next-to-next-to-leading perturbative accuracy. The quality of the fit is very good for both cases, reaching a χ 2 per number of data points equal to 1.11 and 1.09, respectively. Although the limited number of data points leads to significant uncertainties, the data are consistent with an interpretation in which the helicity distribution is narrower in transverse momentum than the unpolarized distribution. Published by the American Physical Society 2025

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2023

symPACK: A GPU-Capable Fan-Out Sparse Cholesky Solver

Sparse symmetric positive definite systems of equations are ubiquitous in scientific workloads and applications. Parallel sparse Cholesky factorization is the method of choice for solving such linear systems. Therefore, the development of parallel sparse Cholesky codes that can efficiently run on today’s large-scale heterogeneous distributed-memory platforms is of vital importance. Modern supercomputers offer nodes that contain a mix of CPUs and GPUs. To fully utilize the computing power of these nodes, scientific codes must be adapted to offload expensive computations to GPUs. We present symPACK, a GPU-capable parallel sparse Cholesky solver that uses one-sided communication primitives and remote procedure calls provided by the UPC++ library. We also utilize the UPC++ "memory kinds" feature to enable efficient communication of GPU-resident data. We show that on a number of large problems, symPACK outperforms comparable state-of-the-art GPU-capable Cholesky factorization codes by up to 14x on the NERSC Perlmutter supercomputer.

Bellavita, Julian↗

DOE OSTI2025

Impact of Different Thermal Gradients on the Dynamics of Cylindrical Lithium-ion Cells Subject to Accelerated Aging and on Module Performance

This study investigates the impacts of applying different thermal gradient patterns to cylindrical lithium-ion cells in a module on cell dynamics (temperatures, current flows, state of charge), module performance (evolution of resistance, capacity, and energy versus cycle number), and module lifetime. The thermal gradients were generated using cooling plates (CPs) with three different flow-field designs, namely, straight, perpendicular, and U-turn. The study uses computational fluid dynamics (CFD), the pseudo-two-dimensional (P2D) battery model, capacity loss and increased impedance due to the growth of a solid-electrolyte-interphase, and the electric current distribution from module terminals to cells that depends on the series-parallel electrical connections among the cells. The impact of the thermal gradient (resulting from the CP designs) on the variability in resistance, current, state of charge, and voltage among the cells was analyzed and linked to differences in the module's performance. Applying a thermal gradient to parallel-connected strings of series-connected cells led to variation in the current through each parallel string and an imbalance in the voltage of series-connected cells. Module performance is poorer when the thermal gradient causes a voltage imbalance than when it causes a current imbalance. Module performance becomes the worst when both current variation and voltage imbalance happen together. For instance, the module's lifetime (estimated as reaching 80% of its initial capacity) varied by 5% to 17.5%, depending on the magnitude and pattern of the imposed thermal gradient. As the relative orientation between thermal gradients and cells' electrical connectivity influences the module's performance, appropriate consideration should be given to the choice of the CP, especially if large thermal gradients are allowed.

Battery thermal management↗

DOE OSTI2020

Modular performance prediction for scientific workflows using Machine Learning

Scientific workflows provide an opportunity for declarative computational experiment design in an intuitive and efficient way. A distributed workflow is typically executed on a variety of resources, and it uses a variety of computational algorithms or tools to achieve the desired outcomes. Such a variety imposes additional complexity in scheduling these workflows on large scale computers. As computation becomes more distributed, insights into expected workload that a workflow presents become critical for effective resource allocation. In this paper, we present a modular framework that leverages Machine Learning for creating precise performance predictions of a workflow. The central idea is to partition a workflow in such a way that makes the task of forecasting each atomic unit manageable and gives us a way to combine the individual predictions efficiently. We recognize a combination of an executable and a specific physical resource as a single module. This gives us a handle to characterize workload and machine power as a single unit of prediction. Overall, our modular technique of creating atomic modules and deployment of longest-path approach to estimate workflow performance, allows the framework to adapt to highly complex nested directed acyclic workflows and scale to new scenarios, since it does not make assumptions of underlying workflow structure. We present performance estimation results of independent workflow modules executed on the XSEDE SDSC Comet cluster using various Machine Learning algorithms. The results provide insights into the behavior and effectiveness of different algorithms in the context of scientific workflow performance prediction.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Measurements and modeling of type-I and type-II ELMs heat flux to the DIII-D divertor

Type-I and type-II edge-localized-modes (ELMs) heat flux profiles measured at the DIII-D divertor feature a peak in the vicinity of the strike-point and a plateau in the scrape-off-layer (SOL), which extends to the first wall. The plateau is present in attached and detached divertors and it is found to originate with plasma bursts upstream in the SOL. The integrated ELM heat flux is distributed at ~65% in the peak and ~35% in this plateau. The parallel loss model, currently used at ITER to predict power loads to the walls, is benchmarked using these results in the primary and secondary divertors with unprecedented constraints using experimental input data for ELM size, radial velocity, energy, electron temperature and density, heat flux footprints and number of filaments. The model can reproduce the experimental near-SOL peak within ~20%, but cannot match the SOL plateau. Employing a two-component approach for the ELM radial velocity, as guided by intermittent data, the full radial heat flux profile can be well matched. The ELM-averaged radial velocity at the separatrix, which explains profile widening, increases from ~0.2 km s –1 in attached to ~0.8 km s –1 in detached scenarios, as the ELM filaments' path becomes electrically disconnected from the sheath at the target. The results presented here indicate filaments fragmentation as a possible mechanism for ELM transport to the far-SOL and provide evidence on the beneficial role of detachment to mitigate ELM flux in the divertor far-SOL. However, these findings imply that wall regions far from the strike points in future machines should be designed to withstand significant heat flux, even for small-ELM regimes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2026

On how avalanches penetrate the SOL and broaden heat loads

Recent experiments reported a correlation between power law core temperature spectra and Dα emission, suggesting that heat avalanches penetrate the SOL. This paper derives a threshold criterion for avalanche penetration using a reduced model. Avalanches with ($\bigtriangledown$$\tilde{T}$) rms > $\bigtriangledown$$\tilde{T}$ crit at the separatrix are predicted to penetrate, and so broaden the SOL and heat load distribution. $\bigtriangledown$$\tilde{T}$ crit is ~ 1/$τ$ ∥ , where $τ$ ∥ is the parallel heat flow time through the SOL. Penetration occurs when avalanches are strong enough to steepen sufficiently to shock at the separatrix. A positive correlation is found between the nonlinear drive for steepening and the penetration depth. In particular, penetration depth exceeds that of the heuristic drift limit when shocks form. Implications for numerical and physical experiments are also discussed.

SOL heat load↗

DOE OSTI2021

Asynchronous Iterative Solvers for Extreme-Scale Computing

The Asynchronous Iterative Solvers for Extreme-Scale Computing (AsyncIS) project aims to explore more efficient numerical algorithms by decreasing their overhead. AsyncIS does this by replacing the outer Krylov subspace solver with an asynchronous optimized Schwarz method, thereby removing the global synchronization and bulk synchronous operations typically used in numerical codes. AsyncIS—a U.S. Department of Energy (DOE)-funded collaboration between Georgia Tech, the University of Tennessee, Knoxville, Temple University, and Sandia National Laboratories—also focuses on the development and optimization of asynchronous preconditioners (i.e., preconditioners that are generated and/or applied in an asynchronous fashion). The novel preconditioning algorithms that provide fine-grained parallelism enable preconditioned Krylov solvers to run efficiently on large-scale distributed systems and manycore accelerators like GPUs.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Designing a parallel Feel-the-Way clustering algorithm on HPC systems

This paper introduces a new parallel clustering algorithm, named Feel-the-Way clustering algorithm, that provides better or equivalent convergence rate than the traditional clustering methods by optimizing the synchronization and communication costs. Our algorithm design centers on how to optimize three factors simultaneously: reduced synchronizations, improved convergence rate, and retained same or comparable optimization cost. To compare the optimization cost, we use the Sum of Square Error (SSE) cost as the metric, which is the sum of the square distance between each data point and its assigned clusters. Compared with the traditional MPI k-means algorithm, the new Feel-the-Way algorithm requires less communications among participating processes. As for the convergence rate, the new algorithm requires fewer number of iterations to converge. As for the optimization cost, it obtains the SSE costs that are close to the k-means algorithm. In the paper, we first design the full-step Feel-the-Way k-means clustering algorithm that can significantly reduce the number of iterations that are required by the original k-means clustering method. Next, we improve the performance of the full-step algorithm by adopting an optimized sampling-based approach, named reassignment-history-aware sampling. Our experimental results show that the optimized sampling-based Feel-the-Way method is significantly faster than the widely used k-means clustering method, and can provide comparable optimization costs. More extensive experiments with several synthetic datasets and real-world datasets (e.g., MNIST, CIFAR-10, ENRON, and PLACES-2) show that the new parallel algorithm can outperform the open source MPI k-means library by up to 110% on a high-performance computing system using 4,096 CPU cores. In addition, the new algorithm can take up to 51% fewer iterations to converge than the k-means clustering algorithm.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Parallel Runtime Interface for Fortran (PRIF) Specification (Rev. 0.3)

This document specifies an interface to support the parallel features of Fortran, named the Parallel Runtime Interface for Fortran (PRIF). PRIF is a proposed solution in which the runtime library is responsible for coarray allocation, deallocation and accesses, image synchronization, atomic operations, events, and teams. In this interface, the compiler is responsible for transforming the invocation of Fortran-level parallel features into procedure calls to the necessary PRIF procedures. The interface is designed for portability across shared- and distributed-memory machines, different operating systems, and multiple architectures. Implementations of this interface are intended as an augmentation for the compiler's own runtime library. With an implementation-agnostic interface, alternative parallel runtime libraries may be developed that support the same interface. One benefit of this approach is the ability to vary the communication substrate. A central aim of this document is to define a parallel runtime interface in standard Fortran syntax, which enables us to leverage Fortran to succinctly express various properties of the procedure interfaces, including argument attributes.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Parallel Runtime Interface for Fortran (PRIF) Specification (Rev. 0.5)

This document specifies an interface to support the parallel features of Fortran, named the Parallel Runtime Interface for Fortran (PRIF). PRIF is a proposed solution in which the runtime library is primarily responsible for implementing coarray allocation, deallocation and accesses, image synchronization, atomic operations, events, teams and collective subroutines. In this interface, the compiler is responsible for transforming the invocation of Fortran-level parallel features into procedure calls to the necessary PRIF subroutines. The interface is designed for portability across shared- and distributed-memory machines, different operating systems, and multiple architectures. Implementations of this interface are intended as an augmentation for the compiler's own runtime library. With an implementation-agnostic interface, alternative parallel runtime libraries may be developed that support the same interface. One benefit of this approach is the ability to vary the communication substrate. A central aim of this document is to define a parallel runtime interface in standard Fortran syntax, which enables us to leverage Fortran to succinctly express various properties of the procedure interfaces, including argument attributes.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Parallel Runtime Interface for Fortran (PRIF) Design Document (Rev. 0.2)

This design document proposes an interface to support the parallel features of Fortran, named the Parallel Runtime Interface for Fortran (PRIF). PRIF is a proposed solution in which the runtime library is responsible for coarray allocation, deallocation and accesses, image synchronization, atomic operations, events, and teams. In this interface, the compiler is responsible for transforming the invocation of Fortran-level parallel features into procedure calls to the necessary PRIF procedures. The interface is designed for portability across shared- and distributed-memory machines, different operating systems, and multiple architectures. Implementations of this interface are intended as an augmentation for the compiler's own runtime library. With an implementation-agnostic interface, alternative parallel runtime libraries may be developed that support the same interface. One benefit of this approach is the ability to vary the communication substrate. A central aim of this document is to define a parallel runtime interface in standard Fortran syntax, which enables us to leverage Fortran to succinctly express various properties of the procedure interfaces, including argument attributes.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Parallel Runtime Interface for Fortran (PRIF) Specification (Rev. 0.6)

This document specifies an interface to support the multi-image parallelism features of Fortran, named the Parallel Runtime Interface for Fortran (PRIF). PRIF is a solution in which a runtime library is primarily responsible for implementing coarray allocation, deallocation and accesses, image synchronization, atomic operations, events, teams and collective subroutines. The Fortran compiler is responsible for transforming the invocation of Fortran-level multi-image parallelism features into procedure calls to the necessary PRIF subroutines. The interface is designed for portability across shared- and distributed-memory machines, different operating systems, and multiple architectures. Implementations of this interface are intended as an augmentation for the compiler's own runtime library. With an implementation-agnostic interface, alternative parallel runtime libraries may be developed that support the same interface. One benefit of this approach is the ability to vary the communication substrate. A central aim of this document is to define a parallel runtime interface in standard Fortran syntax, which enables us to leverage Fortran to succinctly express various properties of the procedure interfaces, including argument attributes.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Parallel Runtime Interface for Fortran (PRIF) Specification (Rev. 0.4)

97 MATHEMATICS AND COMPUTING↗