Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel”

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 973 records · Page 54

Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations

In this article, we focus on the communication costs of three symmetric matrix computations: (i) multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK) (ii) adding the result of the multiplication of a matrix with the transpose of another matrix and the transpose of that result, known as a symmetric rank-2k update (SYR2K) (iii) performing matrix multiplication with a symmetric input matrix (SYMM). All three computations appear in the Level 3 Basic Linear Algebra Subroutines (BLAS) and have wide use in applications involving symmetric matrices. We establish communication lower bounds for these kernels using sequential and distributed-memory parallel computational models, and we show that our bounds are tight by presenting communication-optimal algorithms for each setting. Our lower bound proofs rely on applying a geometric inequality for symmetric computations and analytically solving constrained nonlinear optimization problems. As a result, the symmetric matrix and its corresponding computations are accessed and performed according to a triangular block partitioning scheme in the optimal algorithms.

Al Daas, Hussam [Rutherford Appleton Laboratory, D↗

Enhancing ChatPORT with CUDA-to-SYCL Kernel Translation Capability

Large Language Models (LLMs) have shown strong capabilities in general code translation. However, code translation involving parallel programming models remains largely unexplored. This work enhances the capabilities of code LLMs in CUDA-to-SYCL kernel translation with parameter-efficient fine-tuning. The resultant fine-tuned LLM, called ChatPORT, is an effort to provide high-fidelity translations from one programming model to another. We describe the preparation of datasets from heterogeneous computing benchmarks for model fine-tuning and testing, the parameter-efficient fine-tuning of 19 open-source code models ranging in size from 0.5 to 34 billion parameters and evaluate the correctness rates of the SYCL kernels by the fine-tuned models. The experimental results show that most code models fail to translate CUDA codes to SYCL correctly. However, fine-tuning these models using a small set of CUDA and SYCL kernels can enhance the capabilities of these models in kernel translation. Depending on the sizes of the models, the correctness rate ranges from 19.9% to 81.7% for a test dataset of 62 CUDA kernels.

Jin, Zheming [ORNL] (ORCID:000000027197780X)↗

A Survey on Error-Bounded Lossy Compression for Scientific Datasets

Error-bounded lossy compression has been effective in significantly reducing the data storage/transfer burden while preserving the reconstructed data fidelity very well. Many error-bounded lossy compressors have been developed for a wide range of parallel and distributed use cases for years. They are designed with distinct compression models and principles, such that each of them features particular pros and cons. In this article, we provide a comprehensive survey of emerging error-bounded lossy compression techniques. The key contribution is fourfold. (1) We summarize a novel taxonomy of lossy compression into six classic models. (2) We provide a comprehensive survey of 10 commonly used compression components/modules. (3) We summarized pros and cons of 47 state-of-the-art lossy compressors and present how state-of-the-art compressors are designed based on different compression techniques. (4) We discuss how customized compressors are designed for specific scientific applications and use-cases. We believe this survey is useful to multiple communities including scientific applications, high-performance computing, lossy compression, and big data.

Error-Bounded Lossy Compression↗

Lustre Unveiled: Evolution, Design, Advancements, and Current Trends

The Lustre filesystem serves as a vital element in high-performance parallel storage, meeting the rising demands of scientific, research, and enterprise environments. Widely deployed across HPC environments, ranging from small-scale applications in AI/ML, to domains like oil and gas, drug discovery, and meteorology, and manufacturing, Lustre addresses the universal challenge of efficiently accessing vast and ever-increasing volumes of data. Lustre is the filesystem of choice on six out of the top 10 fastest supercomputers in the world today, over 65% of the top 100, and also for over 60% of the top 500. Despite its widespread popularity, there is a lack of a complete and up-to-date reference, covering Lustre’s evolution, design, and various advancements made over the years. In this journal, we aim to fill this gap by providing a comprehensive journey of Lustre, including its history with significant contributions to HPC, detailed architecture and design elements, exploration of advancements added through its evolution, and future directions. Additionally, we present a comparison of Lustre with other prominent storage technologies of the era. To illustrate the current state of Lustre, we analyze several filesystem trends, including utilization, performance, and usage patterns on Orion, the Lustre filesystem on the first exascale supercomputer Frontier. We hope that this journal serves as a comprehensive educational reference for the current and future generations interested in HPC filesystem storage aspects.

97 MATHEMATICS AND COMPUTING↗

Spatially Accelerated Winding Numbers for Curved Geometry

The generalized winding number (GWN) is a scalar field that supports robust containment queries on curved geometry, including non-watertight, overlapping, and nested boundary representations. While queries can be easily parallelized over samples, direct evaluation on parametric curves and surfaces remains costly for large and complex models. Fast, state-of-the-art GWN approaches leverage a spatial index to approximate the GWN, typically coupled with a Taylor expansion which approximates the GWN contribution for far clusters of geometric primitives. However, such methods operate only on discrete inputs such as triangle meshes and point clouds, and would introduce containment errors near boundaries if applied to curved input. We extend support for fast GWN evaluation over arbitrary collections of NURBS curves in 2D and trimmed NURBS patches in 3D via a Bounding Volume Hierarchy that stores efficiently precomputed moment data in the hierarchy nodes. When querying the hierarchy, approximations for far clusters are used alongside direct evaluation for nearby NURBS primitives, achieving sub-linear complexity while preserving the geometric features in the vicinity of the query point. Central to our performance improvements is an adaptive subdivision strategy for NURBS primitives during a preprocessing phase, creating better spatial partitions while retaining the same accuracy for containment decisions as a direct evaluation. We demonstrate the performance and accuracy of our approach across a large collection of 2D and 3D datasets.

Computer science↗

High-Pressure Electrides: A Quantum Chemical Perspective

It has long been assumed that all matter will adopt simple close-packed lattices and become metallic under pressure, in accordance with the Thomas–Fermi–Dirac (TFD) model. However, this model struggles to explain pressure-driven complex structural transitions that have been observed in elements, including sodium, challenging our conventional understanding of compressed matter. Moreover, in stark contrast to the TFD model, first-principles calculations suggest that various elements and compounds become electrides under pressure. Electrides, characterized by concentrations of charge density at interstitial regions, can be thought of as ionic compounds where electrons behave as the anions. Though ambient-pressure molecular electrides have been extensively studied via experiments and computations, high-pressure electrides (HPEs) are not well-understood. The identification and characterization of HPEs have been, to date, based purely on theory, including topological analysis of the electron density and the electron localization function. Here, we review these theoretical analysis tools and suggest guidelines that can be used to classify systems as electrides. Moreover, we describe models used to rationalize the electronic structure of HPEs, drawing parallels with ambient-pressure molecular systems, and encourage the development of experimental techniques that provide evidence for the theoretically calculated charge localization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Low-Energy Backgrounds in Solid-State Phonon and Charge Detectors

Solid-state phonon and charge detectors probe the scattering of weakly interacting particles, such as dark matter and neutrinos, through their low recoil thresholds. Recent advancements have pushed sensitivity to eV-scale energy depositions, uncovering previously unseen low-energy excess backgrounds. While some arise from known processes such as thermal radiation, luminescence, and stress, others remain unexplained. This review examines these backgrounds, their possible origins, and parallels to low-energy effects in solids, an understanding of which is essential for interpreting particle interactions at and below the eV scale.

coherent neutrino–nucleus scattering↗

Physics-Based Analysis of Cell Imbalances and Aging in Lithium-Ion Battery Modules and Packs

Lithium-ion battery (LIB) packs are a key solution for grid-scale energy storage, enabling grid resilience and supporting critical infrastructure. LIB modules and packs experience current imbalances and uneven cell aging due to various design and operational factors, and require a battery management system (BMS) to continuously monitor and control. In this context, a physics-based modeling framework for LIB modules and packs (liionpack) was enhanced to identify design and control strategies that minimize current imbalance and improve module/pack operation. Simulations of an 8-cell parallel-connected module demonstrate that reducing current imbalance leads to more uniform cell aging and improved module/pack-level degradation predictions. The analysis shows that current imbalance are affected by the electrical resistances. Terminal location significantly affects imbalance, with opposite-end terminal connections at intermediate branches minimizing the imbalance, and the pack circuit construction influences the accuracy of physics-based analysis at the pack scale. This framework enables design optimization of modules and packs through a fast and easy evaluation of pack performance and aging, and supports the development of aging-informed balancing strategies compatible with BMS implementation. Thereby, offering practical pathways to improve reliability and cycle life predictions in large-scale battery energy storage systems.

Ayalasomayajula, Surya Mitra [Oak Ridge National L↗

Unraveling Grain Boundary Instability in Dense Proton-Conducting Oxides

The long-term stability of protonic ceramic electrolysis cell (PCEC) materials under high-steam operating conditions remains a critical barrier to device commercialization. Here, we investigate the fundamental degradation mechanisms of dense BaCe 0.7 Zr 0.1 Y 0.1 Yb 0.1 O 3-δ (BCZYYb) electrolytes operated at 550 °C, 50% H 2 O in air. Over 1,000 h, the total electrolyte conductivity decreases by 11.1%, driven primarily by a >130% increase in grain-boundary resistivity. Post-mortem analyses reveal that damage is localized to near-surface grain boundaries extending ∼50 μm into the dense electrolyte pellet. This surface localization indicates that degradation is likely to be severe in thin, device-level electrolytes. Degradation is primarily attributed to chemo-mechanical grain-boundary weakening arising from hydration-induced chemical expansion, culminating in the formation of intergranular cracks oriented parallel to the pellet surface. These internal cracks subsequently react with steam and/or CO 2 , leading to the formation of nanoscale insulating phases, including Ba(OH) 2 , nanocrystalline BaCO 3 , and amorphous Ce/Zr/Y/Yb-containing oxides or hydroxycarbonates. After an initial degradation period of approximately 200 h, the overall conductivity stabilizes. Incorporating NiO sintering aids reduces grain-boundary density by an order of magnitude under identical sintering conditions. Although addition of NiO increases the initial resistivity by >160% at 550 °C, it substantially suppresses grain-boundary instability and mitigates chemical degradation. These findings underscore the urgent need for chemical and/or physical stabilization of BCZYYb electrolytes and offer design guidelines to enable durable, high-performance PCECs.

08 HYDROGEN↗

Mitigating Electrochemical Impedance Spectroscopy Artifacts in PEMWE Reference Electrode Measurements

This study investigates strategies to improve the quality of electrochemical impedance spectroscopy (EIS) measurements using reference electrodes (RE) in proton exchange membrane water electrolyzers (PEMWE). We demonstrate that adding a low impedance wire in parallel to the RE significantly enhances signal accuracy, especially at high frequencies. Additionally, we identify electrical pad heaters as a source of measurement noise. EIS measurements fulfilling Kramers–Kronig validity criteria were only achieved in their absence. These insights advance the diagnostic capabilities of REs in water electrolyzers and support more reliable, spatially resolved analysis of electrochemical losses within the cell.

08 HYDROGEN↗

CORRLA-RS

The CORRLA-RS package provides a suite of statistical methods for sampling multidimensional distributions and to conduct sensitivity and correlation analysis of large scale data in the Rust programming language. The software provides a unique solution to multidimensional constrained sampling problems utilizing a combination of parallelized Markov Chain Monte Carlo methods and traditional rejection sampling. The sensitivity and correlation analysis methods are backed by a high performance randomized singular value decomposition implementation which enables datasets larger than the random access memory (RAM) size to be analyzed. Additionally, CORRLA-RS implements the active subspace identification method using a KD-Tree and the randomized singular value decomposition acting in concert.

Gurecky, William [Oak Ridge National Laboratory (O↗

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↗

PPO And Friends

PPO and Friends (PPOAF) is a pytorch implementation of proximal policy optimization for single- and multi-agent reinforcement learning (the PPO), along with several optimizations and add-ons (the Friends) to enable efficient MPI-parallelized model training on HPC clusters.

Maguire, AlisterO↗

Domain-decomposition nonlinear manifold reduced order model

This software combines nonlinear-manifold reduced order models (NM-ROMs) with domain decomposition (DD) techniques. NM-ROMs, which utilize a shallow, sparse autoencoder trained with full order model (FOM) snapshot data, approximate the FOM state on a nonlinear manifold. These models offer advantages over linear-subspace ROMs (LS-ROMs) particularly in scenarios with slowly decaying Kolmogorov n-width. However, the training of NM-ROMs involves a number of parameters that scale with the size of the FOM, and storing high-dimensional FOM snapshots can significantly increase the cost of ROM training for extreme-scale problems. To mitigate these costs, the software employs DD to partition the FOM into smaller subdomains, computes NM-ROMs for each, and then integrates these to form a global NM-ROM. This strategy offers multiple benefits: it enables parallel training of subdomain NM-ROMs, reduces the number of parameters needed, decreases the dimensional requirements of subdomain FOM training data, and allows for customization to the unique characteristics of each FOM subdomain. The use of a shallow, sparse autoencoder architecture in each subdomain NM-ROM facilitates the application of hyper-reduction (HR), simplifying the nonlinear complexities and enhancing computational speed. This software marks the inaugural application of NM-ROM combined with HR to a DD problem. It features an algebraic DD reformulation of the FOM, training of NM-ROMs with HR for each subdomain, and employs a sequential quadratic programming (SQP) solver for the evaluation of the coupled global NMROM. The effectiveness of the DD NM-ROM with HR is numerically demonstrated on the 2D steady-state Burgers' equation, showing an order of magnitude improvement in accuracy over the DD LS-ROM with HR.

Diaz, AlejandroN↗

Spinbox: tools for many-body quantum systems in a Monte Carlo context

Spinbox is a piece of software that facilitates quantum mechanical calculations relevant to Monte Carlo simulation of atomic nuclei. At the front lines of research on the nuclear many-body problem are a large number of supercomputer-scale simulation codes. These codes produce valuable results but can be hard to understand, especially for those without intimate knowledge of the relevant theoretical methods. Thus, tools that fill pedagogical roles are extremely valuable. Spinbox makes it easy for one to replicate and analyze the computational processes relevant to a Quantum Monte Carlo (QMC) simulation that may be difficult to understand/debug/analyze due to the scale of the corresponding simulation software. Spinbox is written in Python using other state-of-the-art Python modules for numerical calculations. While a number of Python libraries exist that are suited to general quantum many-body calculations, the motivation of Spinbox is quite particular. In Diffusion Monte Carlo methods (DMC, GFMC, AFDMC), the central calculation is the imaginary-time propagation of individual samples of the many-body wavefunction. Although quantum wavefunctions generally must be described by a probability distribution over a basis, DMC imbues particles (within one sample) with classical spatial coordinates. This method is unusual, so other Python packages are typically not set up to do this easily. Furthermore, the software has built-in options for nuclear systems assuming isospin symmetry, which can be set up with other libraries but is a nontrivial process to do so. Features: - numerical representation of samples of the many-body wavefunctions, including tensor-product states (used in AFDMC) - numerical representation of many-body operators, including tensor-product operators: general, spin, imaginary-time propagation, etc. - the correct associated arithmetic and algebra, implemented as class methods - classes for representing realistic nuclear two- and three-body Hamiltonians (e.g. Argonne V18, Illinois NNN) - large-scale parallel integration over random variables, crucial for the AFDMC method My goal is to make this package open source so that anyone may use it and contribute to it, particularly other researchers doing AFDMC calculations

Fox, Jordan↗

pnnl/LAP

A software framework to study, from the performance and energy perspective, the efficacy of GPU-resident parallel Conjugate Gradient (CG) linear solver with different preconditioner options, including Gauss-Seidel, Jacobi, and incomplete Cholesky. We also propose a novel GPU-based preconditioner, in which the triangular solves are approximated by an iterative process

Swirydowicz, Kasia↗

thevenin: An Equivalent Circuit Modeling Package [SWR-24-132]

This package is a wrapper for the well-known Thevenin equivalent circuit model for simulating battery behavior with a focus on ease of use. The model is comprised of a single series resistor followed by any number of parallel RC pairs. The package includes an intuitive "experiment" interface, which simplifies the programming of constant or dynamic current, voltage, and/or power-driven loads, making it ideal for a wide range of applications, from basic tests to complex simulations. It also supports state-of-charge (SOC) and temperature-dependent properties, allowing the model to be more easily calibrated against real cells.

Randall, Corey↗

Sentinel

Network intrusion detection systems (NIDS) are commonplace in network security but they frequently employ algorithms that are computational demanding requiring hardware and software with significant power requirements. Two examples of such resource-intensive algorithms used for network security are regular expression matching and broader signature pattern matching which are commonly used in deep packet inspection (DPI). Network security algorithms that have large power requirements may be a challenge for low-power internet-of-things (IoT) environments, which generally lack the power resources to implement complex security measures like computationally expensive DPI at the edge. Furthermore, IoT environments incorporating 5G standalone networks have network latency constraints beyond just power that make DPI at the edge even more difficult. Programmable logic is ideally suited for machine learning inference for DPI because of its deep instruction level parallelism and single-cycle memory access. Machine learning approaches for DPI have been explored before using the programmable logic of field programmable gate arrays (FPGA) as a potential solution for NIDS approaches that would be power-suitable for IoT. However, those previous programmable logic NIDS approaches utilize either a supervised or unsupervised learning model. Sentinel utilizes the ensemble of these two machine learning approaches known as a semi-supervised approach which has shown promise in NIDS implementations. Sentinel provides a programmable logic implementation of a semi-supervised approach for DPI which operates at much lower power and latency than a GPU implementation with negligible loss of accuracy due to quantization through a logistic regressor.

Anderson, MatthewW [Idaho National Laboratory (INL↗