Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “MPI”

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.

102 records · Page 6

Refactoring the elastic–viscous–plastic solver from the sea ice model CICE v6.5.1 for improved performance

This study focuses on the performance of the elastic–viscous–plastic (EVP) dynamical solver within the sea ice model, CICE v6.5.1. The study has been conducted in two steps. First, the standard EVP solver was extracted from CICE for experiments with refactored versions, which are used for performance testing. Second, one refactored version was integrated and tested in the full CICE model to demonstrate that the new algorithms do not significantly impact the physical results. The study reveals two dominant bottlenecks, namely (1) the number of Message Parsing Interface (MPI) and Open Multi-Processing (OpenMP) synchronization points required for halo exchanges during each time step combined with the irregular domain of active sea ice points and (2) the lack of single-instruction, multiple-data (SIMD) code generation. The standard EVP solver has been refactored based on two generic patterns. The first pattern exposes how general finite differences on masked multi-dimensional arrays can be expressed in order to produce significantly better code generation by changing the memory access pattern from random access to direct access. The second pattern takes an alternative approach to handle static grid properties. The measured single-core performance improvement is more than a factor of 5 compared to the standard implementation. The refactored implementation of strong scales on the Intel® Xeon® Scalable Processors series node until the available bandwidth of the node is used. For the Intel® Xeon® CPU Max series, there is sufficient bandwidth to allow the strong scaling to continue for all the cores on the node, resulting in a single-node improvement factor of 35 over the standard implementation. This study also demonstrates improved performance on GPU processors.

58 GEOSCIENCES↗

Repository of HydroSMADE: Hydropower Site-level Monthly Availability Data Ensemble for 1950-2100 at Existing and Potential Global Sites

This repository presents HydroSMADE—Hydropower Site-level Monthly Availability Data Ensemble, a new open dataset that provides monthly hydropower availability for 1,593 existing and 124,333 potential sites worldwide over the period 1950–2100. The dataset is generated by using a global hydrologic model (Xanthos) with explicit representation of hydropower operation. Specifically, HydroSMADE distinguishes between storage and diversion sites, applies optimized operating rules, and incorporates site-specific characteristics such as generation capacity, maximum turbine flow, and reservoir storage. Driven by bias-corrected meteorological inputs, the data is provided for 30 alternative future scenarios. The scenarios consist of the full factorial combination of three standard CMIP6 atmospheric forcing pathways (SSP1-2.6, SSP3-7.0, and SSP5-8.5) and ten CMIP6 General Circulation Models (GCMs): GFDL-ESM4, IPSL-CM6A-LR, MPI-ESM1-2-HR, MRI-ESM2-0, EC-Earth3, CanESM5, MIROC6, CNRM-ESM2-1, UKESM1-0-LL, and CNRM-CM6-1. The repository contains a total of 122 files: a text file (readme.txt) containing a brief description of the included data, a CSV file containing site attributes, and the remaining 120 files (in CSV) containing site-level monthly hydropower availability. Example Jupyter Notebooks to explore the HydroSMADE dataset are available on GitHub at https://github.com/kamal0013/HydroSMADE More details on the methods and technical validation of HydroSMADE are available in the following paper by the same authors: Chowdhury, A. K., Abeshu, G. W., Zhao, M., Wild, T. B., Hassan, N., Ying, Z., Kim, G. J., Matthew, B., Jonathan, L., & Li, H.-Y. (Submitted). Hydropower Site-level Monthly Availability Data Ensemble for 1950-2100 at Existing and Potential Global Sites.

Existing and Potential Sites↗

Dynamical Downscaling of Earth System Model Data for Energy System Analysis

Assessing energy resources (e.g., solar, wind, and hydro) under future scenarios requires datasets with sufficient spatial and temporal detail to capture variability and extreme events. While global-scale Earth System Model (ESM) projections are widely used, their coarse resolution limits direct application to regional energy system analyses. Dynamical downscaling offers a robust approach to generate physically consistent, fine-scale datasets that better represent local atmospheric processes impacting energy resources. In this work, we present a two-stage approach for producing high-resolution historical and future projections over the contiguous United States (CONUS). First, we optimize the Weather Research and Forecasting (WRF) model configuration for energy-relevant variables - solar irradiance, wind speed, and precipitation - by conducting ERA5-driven simulations at 8-km and 28-km resolution. Multiple physics schemes and model configurations within the WRF are evaluated against observational datasets including the National Solar Radiation Database (NSRDB), the Parameter-elevation Regressions on Independent Slopes Model (PRISM), and the Stage IV multi-radar/multi-sensor precipitation product for the CONUS domain. Using the best-performing configuration, we dynamically downscale MPI-ESM1-2-HR simulations for 2000-2060 under SSP2-4.5 and SSP5-8.5 scenarios at 4-km spatial and hourly temporal resolution. This presentation will provide a comprehensive analysis of the results from multiple numerical experiments and high-resolution ESM projections. In addition, we will discuss potential applications of our high-resolution datasets within the energy sector and outline future research avenues dedicated to evaluating how extreme weather events influence system performance and resilience.

24 POWER TRANSMISSION AND DISTRIBUTION↗

The Profiled Feldman-Cousins Method for Confidence Interval Construction for the Nova 3-Flavor Oscillation Analysis

The small interaction cross-section of neutrinos makes experimental neutrino physics particularly responsive to technological advancements. A significant development leveraged by the NOvA experiment is large-scale parallel processing, enabling novel computational approaches to longstanding experimental challenges. Central to managing the resulting high-throughput data is NOvA’s implementation of the Freight Train model, designed for efficient data production and handling.This dissertation details the methodology and execution of the NOvA 2024 3-Flavor Oscillation Analysis, supported by a comprehensive dataset spanning ten years. It emphasizes frequentist results refined through the Feldman-Cousins (FC) technique, specifically addressing confidence interval corrections in parameter estimation. The computational intensity associated with Feldman-Cousins arises from extensive Monte Carlo simulations, which were substantially mitigated through parallel computing on the Perlmutter supercomputer at the National Energy Research Scientific Computing Center (NERSC), employing the MPI framework.To further enhance computational efficiency, an Importance Sampling method is introduced and evaluated, demonstrating significant potential to reduce complexity, particularly in exploring extreme parameter space regions. This thesis presents both the successful application of advanced computational resources and the development of sophisticated statistical techniques, aiming to enhance the precision and scope of neutrino oscillation analyses.

Dye ajdye11190@gmail.com, Andrew Joseph [Mississip↗

Performance Evaluation of Different Parallel Programming Models in SCALE-Shift Sequences for Criticality and Shielding Applications [Abstract]

The SCALE code system has been widely used for nuclear criticality safety, reactor physics, radiation shielding, source term generation, and inventory analyses by researchers, industry, and regulatory bodies. Although limited support for shared- and distributed-memory parallel processing was introduced via C++ threading, OpenMP, and MPI, a hybrid parallel programming model with both distributed- and shared-memory parallelism has not been fully supported in the SCALE code system.

Nuclear Criticality Safety Program (NCSP)↗

Transient Triplet Metallopnictinidenes M–Pn (M = Pd II , Pt II ; Pn = P, As, Sb): Characterization and Dimerization

Nitrenes (R–N) have been subject to a large body of experimental and theoretical studies. The fundamental reactivity of this important class of transient intermediates has been attributed to their electronic structures, particularly the accessibility of triplet vs singlet states. In contrast, electronic structure trends along the heavier pnictinidene analogues (R–Pn; Pn = P–Bi) are much less systematically explored. We here report the synthesis of a series of metallodipnictenes, {M–Pn=Pn–M} (M = Pd II , Pt II ; Pn = P, As, Sb, Bi) and the characterization of the transient metallopnictinidene intermediates, {M–Pn} for Pn = P, As, Sb. Structural, spectroscopic, and computational analysis revealed spin triplet ground states for the metallopnictinidenes with characteristic electronic structure trends along the series. In comparison to the nitrene, the heavier pnictinidenes exhibit lower-lying ground state SOMOs and singlet excited states, thus suggesting increased electrophilic reactivity. Furthermore, the splitting of the triplet magnetic microstates is beyond the phosphinidenes {M–P} dominated by heavy pnictogen atom induced spin–orbit coupling.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Enhanced Interfacial Strength in Carbon Fiber Composites via Mussel‐Inspired Sizing Polymers

Composite materials possess a high strength-to-weight ratio. A key determinant of their mechanical performance is the interfacial strength between the fibers and the matrix. Sizing agents are commonly used to improve this interface by promoting better adhesion, though optimizing this interaction remains a significant challenge. Here, this study evaluates the use of poly(catechol-styrene) (PCS), a mussel-inspired sizing agent, to enhance fiber–matrix bonding in carbon fiber composites. Woven carbon fiber laminates were dip-coated with varying concentrations of PCS (0.05 and 0.1 wt%) and subsequently fabricated using vacuum-assisted resin transfer molding followed by compression molding. Interlaminar shear strength (ILSS) tests showed improvements of 4% and 8% for the 0.05% and 0.1% PCS treatments, respectively. These results indicate that PCS is effective in reinforcing interfacial adhesion, thereby improving the mechanical integrity of carbon fiber-reinforced composites.

Carbon fiber composites↗

A time-parallel multiple-shooting method for large-scale quantum optimal control

Quantum optimal control plays a crucial role in quantum computing by providing the interface between compiler and hardware. Solving the optimal control problem is particularly challenging for multi-qubit gates, due to the exponential growth in computational complexity with the system's dimensionality and the deterioration of optimization convergence. To ameliorate the computational complexity of time-integration, this paper introduces a multiple-shooting approach in which the time domain is divided into multiple windows and the intermediate states at window boundaries are treated as additional optimization variables. Further, this enables parallel computation of state evolution across time-windows, significantly accelerating objective function and gradient evaluations. Since the initial state matrix in each window is only guaranteed to be unitary upon convergence of the optimization algorithm, the conventional gate trace infidelity is replaced by a generalized infidelity that is convex for non-unitary state matrices. Continuity of the state across window boundaries is enforced by equality constraints. A quadratic penalty optimization method is used to solve the constrained optimal control problem, and an efficient adjoint technique is employed to calculate the gradients in each iteration. We demonstrate the effectiveness of the proposed method through numerical experiments on quantum Fourier transform gates in systems with 2, 3, and 4 qubits, noting a speedup of 80x for evaluating the gradient in the 4-qubit case, highlighting the method's potential for optimizing control pulses in multi-qubit quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computing Sparse Tensor Decompositions via Chapel and C++/MPI Interoperability without Intermediate I/O

We extend an existing approach for efficient use of shared mapped memory across Chapel and C++ for graph data stored as 1-D arrays to sparse tensor data stored using a combination of 2-D and 1-D arrays. We describe the specific extensions that provide use of shared mapped memory tensor data for a particular C++ tensor decomposition tool called GentenMPI. We then demonstrate our approach on several real-world datasets, providing timing results that illustrate minimal overhead incurred using this approach. Finally, we extend our work to improve memory usage and provide convenient random access to sparse shared mapped memory tensor elements in Chapel, while still being capable of leveraging high performance implementations of tensor algorithms in C++.

97 MATHEMATICS AND COMPUTING↗

Parthenon

Explore the source record for details and available documents.

MPI, GPU, parallelism↗

Uniqueness of MHV Gravity Amplitudes

We investigate MHV tree-level gravity amplitudes as defined on the spinor-helicity variety. Unlike their gluon counterparts, the gravity amplitudes do not have logarithmic singularities and do not admit Amplituhedron-like construction. Importantly, they are not determined just by their singularities, but rather their numerators have interesting zeroes. We make a conjecture about the uniqueness of the numerator and explore this feature from a more mathematical perspective. This leads us to a new approach for examining adjoints. We outline steps of our proposed proof and provide computational evidence for its validity in specific cases.

adjoints↗

Final Technical Report

Explore the source record for details and available documents.

97 MATHEMATICS AND COMPUTING↗