SEARCH · Search NASA

Results for “scalable computing”

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 649 records · Page 36

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Solving sparse finite element problems on neuromorphic hardware

The finite element method (FEM) is one of the most important and ubiquitous numerical methods for solving partial differential equations (PDEs) on computers for scientific and engineering discovery. Applying the FEM to larger and more detailed scientific models has driven advances in high-performance computing for decades. Here we demonstrate that scalable spiking neuromorphic hardware can directly implement the FEM by constructing a spiking neural network that solves the large, sparse, linear systems of equations at the core of the FEM. We show that for the Poisson equation, a fundamental PDE in science and engineering, our neural circuit achieves meaningful levels of numerical accuracy and close to ideal scaling on modern, inherently parallel and energy-efficient neuromorphic hardware, specifically Intel’s Loihi 2 neuromorphic platform. We illustrate extensions to irregular mesh geometries in both two and three dimensions as well as other PDEs such as linear elasticity. Our spiking neural network is constructed from a recurrent network model of the brain’s motor cortex and, in contrast to black-box deep artificial neural network-based methods for PDEs, directly translates the well-understood and trusted mathematics of the FEM to a natively spiking neuromorphic algorithm.

Applied mathematics↗

DOE OSTI2022

Smart connected worker edge platform for smart manufacturing: Part 1—Architecture and platform design

Abstract The challenge of sustainably producing goods and services for healthy living on a healthy planet requires simultaneous consideration of economic, societal, and environmental dimensions in manufacturing. Enabling technology for data driven manufacturing paradigms like Smart Manufacturing (a.k.a. Industry 4.0) serve as the technological backbone from which sustainable approaches to manufacturing can be implemented. Unfortunately, these technologies are typically associated with broader and deeper factory automation that is often too expensive and complex for the small and medium sized manufacturers (SMMs) that comprise the majority of manufacturing business in the USA and for whom their most valuable asset are the people whose jobs automation while replace. This paper describes an edge intelligent platform to integrate internet‐of‐things technologies with computing hardware, software, computational workflows for machine learning, and data ingestion, enabling SMMs to transition into smart manufacturing paradigms by leveraging the intelligence of their people. The platform leverages consumer grade electronics and sensors (affordable and portable), customized software with open source software packages (accessible), and existing communication network infrastructures (scalable). The software systems are implemented via Kubernetes orchestration of Docker containerization to ensure scalability and programmability. The platform is adaptive via computational workflow engines that produce information from data by processing with low‐cost edge computing devices while efficiently accessing resources of cloud servers as needed. The proposed edge platform connects workers to technological resources that provide computational intelligence (i.e., silicon‐based sensing and computation for data collection and contextualization) to enable decision making at the edge of advanced manufacturing.

Kim, Yoon G.↗

DOE OSTI2016

A scalable framework for the global offline community land model ensemble simulation

Current earth system models have a large range of uncertainty, owing to differences in the simulation of feedbacks and insufficient information to constrain model parameters. Parameter disturbance experiment provides a straightforward method to quantify the variation (uncertainty) outputs caused by model inputs. Owing to the software complexity and computational intensity of earth system models, a large-scale simulation framework is needed to support ensemble simulation required by parameter disturbance experiment. This paper presents a parallel framework for the community land model ensemble simulation. After a software structure review of the community land model simulation, a single factor parameter disturbance experiment of a reference computational experiment design is used to demonstrate the software design principles, computational characteristics of individual application, parallel ensemble simulation implementation, as well as the weak scalability of this simulation framework on a high-end computer. Lastly, the paper discusses some preliminary diagnostic analysis results of the single factor parameter disturbance experiments. The framework design considerations and implementation details described in this paper can be beneficial to many other research programmes involving large scale, legacy modelling system.

58 GEOSCIENCES↗

DOE OSTI2020

Integrating solvation shell structure in experimentally driven molecular dynamics using x-ray solution scattering data

In the past few decades, prediction of macromolecular structures beyond the native conformation has been aided by the development of molecular dynamics (MD) protocols aimed at exploration of the energetic landscape of proteins. Yet, the computed structures do not always agree with experimental observables, calling for further development of the MD strategies to bring the computations and experiments closer together. Here, we report a scalable, efficient MD simulation approach that incorporates an x-ray solution scattering signal as a driving force for the conformational search of stable structural configurations outside of the native basin. We further demonstrate the importance of inclusion of the hydration layer effect for a precise description of the processes involving large changes in the solvent exposed area, such as unfolding. Utilization of the graphics processing unit allows for an efficient all-atom calculation of scattering patterns on-the-fly, even for large biomolecules, resulting in a speed-up of the calculation of the associated driving force. The utility of the methodology is demonstrated on two model protein systems, the structural transition of lysine-, arginine-, ornithine-binding protein and the folding of deca-alanine. We discuss how the present approach will aid in the interpretation of dynamical scattering experiments on protein folding and association.

Hsu, Darren J.↗

DOE OSTI2024

PanDA: Production and Distributed Analysis System

The Production and Distributed Analysis (PanDA) system is a data-driven workload management system engineered to operate at the LHC data processing scale. The PanDA system provides a solution for scientific experiments to fully leverage their distributed heterogeneous resources, showcasing scalability, usability, flexibility, and robustness. The system has successfully proven itself through nearly two decades of steady operation in the ATLAS experiment, addressing the intricate requirements such as diverse resources distributed worldwide at about 200 sites, thousands of scientists analyzing the data remotely, the volume of processed data beyond the exabyte scale, dozens of scientific applications to support, and data processing over several billion hours of computing usage per year. PanDA’s flexibility and scalability make it suitable for the High Energy Physics community and wider science domains at the Exascale. Beyond High Energy Physics, PanDA’s relevance extends to other big data sciences, as evidenced by its adoption in the Vera C. Rubin Observatory and the sPHENIX experiment. As the significance of advanced workflows continues to grow, PanDA has transformed into a comprehensive ecosystem, effectively tackling challenges associated with emerging workflows and evolving computing technologies. The paper discusses PanDA’s prominent role in the scientific landscape, detailing its architecture, functionality, deployment strategies, project management approaches, results, and evolution into an ecosystem.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

Hierarchical optimization for neutron scattering problems

We present a scalable optimization method for neutron scattering problems that determines confidence regions of simulation parameters in lattice dynamics models used to fit neutron scattering data for crystalline solids. The method uses physics-based hierarchical dimension reduction in both the computational simulation domain and the parameter space. We demonstrate for silicon that after a few iterations the method converges to parameters values (interatomic force-constants) computed with density functional theory simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2026

Metalloborophenes: Structural Diversity and Emerging Properties of Metal–Boron Two‐Dimensional Frameworks

Metalloborophenes, an emerging subclass of 2D materials, have attracted growing attention owing to their exceptional structural diversity and highly tunable electronic and magnetic properties. Constructed from vacancy‐rich borophene frameworks stabilized by electron donation from incorporated metal atoms, metalloborophenes merge the chemical versatility of boron with the functional richness of metal dopants. The first experimental realization of Cu–borophene nanoribbons in 2024 marked a pivotal advance, confirming long‐standing theoretical predictions and revitalizing interest in this new frontier of boron‐based 2D chemistry. Despite this progress, most studies to date remain conceptual and theoretical, constrained by challenges in scalable synthesis, dopant precision, and substrate control. Computational investigations have revealed a broad landscape of stable metalloborophene structures, exhibiting metallic, semiconducting, and magnetic behavior across diverse dopant families, including alkali, alkaline‐earth, transition, and lanthanide elements. These tunable characteristics open promising avenues for applications in spintronics, catalysis, and hydrogen storage. This review provides a comprehensive overview of metalloborophenes, emphasizing the interplay between structure, stability, and functionality, and outlining future directions toward bridging predictive modeling with experimental realization of this rapidly evolving class of 2D materials.

2D materials↗

DOE OSTI2026

Advancing specialized biofoundries via automated adaptive laboratory evolution

Adaptive laboratory evolution (ALE) is a powerful strategy for improving microbial phenotypes by harnessing natural selection under defined environmental conditions. Through applying selection regimes, beneficial mutations accumulate, enabling the generation of strains with enhanced properties. However, conventional ALE is labor-intensive and difficult to scale, limiting reproducibility and broader discovery of evolutionary principles. Recent advances in robotics, automation, and computational infrastructure are transforming ALE into a scalable, data-rich experimental paradigm. Automated platforms enable standardized and complex protocols, real-time monitoring, and highly parallel evolution campaigns, improving consistency while generating longitudinal datasets that reveal convergent adaptive mechanisms. Here, we discuss the role of specialized biofoundries in advancing automated ALE and enabling large-scale evolutionary engineering. We review major automated ALE formats and outline key design principles for effective ALE biofoundries, highlighting how automated ALE can support autonomous experimentation and AI-guided strain engineering.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2021

Deep Learning Explicit Differentiable Predictive Control Laws for Buildings

We present a differentiable predictive control (DPC) methodology for learning constrained control laws for unknown nonlinear systems. DPC poses an approximate solution to multiparametric programming problems emerging from explicit nonlinear model predictive control (MPC). Contrary to approximate MPC, DPC does not require supervision by an expert controller. Instead, a system dynamics model is learned from a small dataset of recorded observations of the perturbed system's dynamics and the control law is optimized offline by interaction with the learned system model. The DPC method is based on two sequential steps, i) system identification using a constrained neural state-space model, and ii) optimization of an explicit control law parametrized by another neural network in closed-loop simulation with the identified neural state-space model. The combination of a differentiable closed-loop system and penalty methods for constraint handling of system outputs and inputs allows us to optimize the control law's parameters directly by backpropagating economic MPC loss through the learned system model. By incorporating domain knowledge and leveraging established techniques from optimal control, our method leverages deep neural networks as nonlinear function approximators for system identification and control while avoiding concomitant costs of intractably large datasets, and computationally expensive over-parametrized models. The scalability, data efficiency, and constrained optimal control capability of the proposed DPC method are demonstrated in simulation using a multi-zone building emulator.

Drgona, Jan↗

DOE OSTI2026

Facile Synthesis of Oxyhydrides by Reaction with NaBH 4 in an Open System

Oxyhydrides are an intriguing class of materials in which there is partial replacement of the oxide ion with hydride ions and oxygen vacancies. Conventional synthesis relies on vacuum sealed ampules, using long reaction times at high temperatures, limiting accessibility. Here, we demonstrate a rapid, ambient-pressure route to oxyhydride formation using NaBH 4 under flowing argon in just 1 h. This approach significantly lowers experimental barriers, enabling broader exploration of these materials. The maximum hydride incorporation, obtained using a reaction temperature of 400 °C, is given by the formula SrTiO 2.945 H 0.049 , where the hydride, oxygen vacancy, and unpaired electron concentrations are determined through thermogravimetric analysis, quantitative solid-state nuclear magnetic resonance (NMR) spectroscopy, and electron paramagnetic resonance (EPR) spectroscopy. Density functional theory simulations of the 1 H NMR shifts for candidate point defects support the assignment of the observed hydride peak, validating the efficacy of the synthetic approach. A combination of in situ and ex situ studies of the reaction pathway reveal that hydride incorporation into the perovskite occurs via direct solid-solid reaction, with higher reaction temperatures favoring NaBH 4 decomposition and H 2 (g) release over oxyhydride formation. The electronic defect structure established from the EPR and NMR studies indicate that, at ambient temperature, anion vacant sites are occupied by single electrons, whereas hydride sites do not trap electrons. As a result, this work establishes a scalable synthesis strategy and provides a computational-experimental framework for understanding defect chemistry in oxyhydrides, opening pathways for their integration into energy and electronic applications.

Anions↗

DOE OSTI2026

Development of MOSCATO: A CFD-Level Electrochemistry and Corrosion Simulator for Molten Salt Systems

For both coolant and fueled variants of molten salt reactors (MSRs), the corrosion of structural materials is a significant challenge. The corrosion stems from chemical and electrochemical reactions initiated by fissile material, fission products, and impurities in the salt. Lower-fidelity models rely on empirical correlations for mass transfer, simplified lumped temperature profiles, and similar assumptions. They do not capture detailed spatial variations in complex geometries, creating the need for high-fidelity modeling to bridge this gap.As we approach the demonstration and possible deployment of MSRs in this decade, the development of a high-fidelity, high-performance simulator becomes imperative. To simulate the complex electrochemical environment and corrosion within molten salt systems, we have developed the Molten Salt Chemistry And TranspOrt (MOSCATO) code. This endeavor is comprised of three essential components. First, mass transfer equations are coupled with the Navier-Stokes equations in order to account for the transport of species in the salt. Second, the diffusion of alloy constituents, such as Cr, Fe, Ni, etc. is simulated within the structural metals. Third, the alloy and salt domains are coupled to account for the heterogeneous chemical and electrochemical reactions that occur at the salt-alloy interface.MOSCATO manages all three components within the framework of the highly scalable, open-source spectral element method computational fluid dynamics code Nek5000/NekRS. This integration enables MOSCATO to harness the immense computational power of modern high-performance computing resources, ensuring both high fidelity and computational speed.In addition to code development, we have initiated a comprehensive verification and validation campaign, utilizing data from diverse sources. First, MOSCATO's electrochemical solver was verified with reference numerical data. Then validation occurred against experiments: one of a thermal galvanic cell and the other for corrosion in flowing molten salt of FLiNaK (LiF-NaF-KF). This campaign verified and validated MOSCATO as a reliable tool for simulating electrochemical environments and corrosion in molten salt systems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2020

Distributed-Memory Parallel Symmetric Nonnegative Matrix Factorization

We develop the first distributed-memory parallel implementation of Symmetric Nonnegative Matrix Factorization (SymNMF), a key data analytics kernel for clustering and dimensionality reduction. Our implementation includes two different algorithms for SymNMF, which give comparable results in terms of time and accuracy. The first algorithm is a parallelization of an existing sequential approach that uses solvers for non symmetric NMF. The second algorithm is a novel approach based on the Gauss-Newton method. It exploits second-order information without incurring large computational and memory costs. We evaluate the scalability of our algorithms on the Summit system at Oak Ridge National Laboratory, scaling up to 128 nodes (4,096 cores) with 70% efficiency. Additionally, we demonstrate our software on an image segmentation task.

Eswar, Srinivas↗

DOE OSTI2024

AGS-GNN: Attribute-guided Sampling for Graph Neural Networks

We propose AGS-GNN, a novel attribute-guided sampling algorithm for Graph Neural Networks (GNNs) that exploits node features and connectivity structure of a graph while simultaneously adapting for both homophily and heterophily in graphs. (In homophilic graphs vertices of the same class are more likely to be connected, and vertices of different classes tend to be linked in heterophilic graphs.) While GNNs have been successfully applied to homophilic graphs, their application to heterophilic graphs remains challenging. The best-performing GNNs for heterophilic graphs do not fit the sampling paradigm, suffer high computational costs, and are not inductive. We employ samplers based on feature-similarity and feature-diversity to select subsets of neighbors for a node, and adaptively capture information from homophilic and heterophilic neighborhoods using dual channels. Currently, AGS-GNN is the only algorithm that we know of that explicitly controls homophily in the sampled subgraph through similar and diverse neighborhood samples. For diverse neighborhood sampling, we employ submodularity, which was not used in this context prior to our work. The sampling distribution is pre-computed and highly parallel, achieving the desired scalability. Using an extensive dataset consisting of 35 small (<=100K nodes) and large (>100K nodes) homophilic and heterophilic graphs, we demonstrate the superiority of AGS-GNN compare to the current approaches in the literature. AGS-GNN achieves comparable test accuracy to the best-performing heterophilic GNNs, even outperforming methods using the entire graph for node classification. AGS-GNN also converges faster compared to methods that sample neighborhoods randomly, and can be incorporated into existing GNN models that employ node or graph sampling.

artificial intelligence↗

DOE OSTI2013

Scalable Domain Decomposed Monte Carlo Particle Transport

In this dissertation, we present the parallel algorithms necessary to run domain decomposed Monte Carlo particle transport on large numbers of processors (millions of processors). Previous algorithms were not scalable, and the parallel overhead became more computationally costly than the numerical simulation.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2013

miniGMG

miniGMG is a compact geometric multigrid (MG benchmark designed to proxy the performance characteristics of the solves found in adaptive mesh refinement multigrid (AMR MG) applications. It solves the equation a*alpha*u - b div beta grad u = f on a large cubical domain using cell-centered values and periodic boundaries. a and b are scalar constants, alpha and beta are space varying constants, f is the right hand side, and u is the solution. The cubical domain is divided into cubical subdomains which are distributed across the supercomputer. The righthand side f is generated from a continuous function for u. Thus, one can solve this linear system of equations and verify the error properties of the discrete solution u by comparing to a sampling of the continuous u. miniGMG implements both v- and f- cycles, as well as two constant coeffficient discretications of the equation above (one 27pt 2nd order, and one 13pt 4th order). In both cases, the (embedded) v-cycles are truncated when a subdomain reaces 4^3, 2^3, or 1^3 cells (a u-cycle). The multigrd solver then swtiches to one of seven coarse grid (bottom) solves. relaxation, BiCGStab, CABiCGStab, TelescopingCABiCGStab, CG, or CACG. The code exploits two forms of communication-avoiding. The first is exemplified by the referenced SC'12 paper in which DRAM data movment is avoided when smoothing. The second, described in the IPDPS'14 paper avoids collectives in a bottom solve (the CA bottom solves). There are a number of implementations of the operators for both CPUs and NVIDIA GPUs. The CPUs have been optimized to exploit a wavefront approach to communication-avoiding. The GPU versions include a number of optimized and tunable implementations. The code has been demonstrated to scale to 46K nodes on the BGQ Mira (750K cores), 9K nodes on Edison (111K cores), and 14K GPUs on Titan (37M cuda cores). It thus acts as a scalable testbed for a wide range of computer science and applied math research. Nominally, one invokes the benchmark as ./run b x y z alpha beta gamma Each subdomain is (2^b)^3 cells Each MPI process receives a x-by-y-by-z collection of subdomains. There are alpha*beta*gamma total MPI processes For correctness (a cubical domain), *alpha==y*beta==z*gamma.

Williams, Sameul↗

DOE OSTI2019

OPERATIONAL TOPOLOGY ESTIMATION OF THREE PHASE UNBALANCED POWER DISTRIBUTION SYSTEMS WITH OUTAGES

Distribution grid, in general, is constructionally loopy but a radially operated network. Opening and closing of suitable tie-switches allows transition from one radial topology to another. Tie-switches ensure reliability and provide restoration paths when faults (outages) occur. The estimation of the system's current operational topology is a precursor to implementing any optimal control actions (during normal operation) or restorative actions (during outage condition). The existing literature in topology detection suffers with several limitations including: (1) computationally intensive nonlinear formulations that are not scalable for large distribution systems, (2) methods requiring exhaustive search for the correct topology by enumerating the complete topological search space, and (3) approaches requiring large volumes of time-series measurements and are not applicable for estimating continuously changing operational topology. Furthermore, the existing literature on distribution grid topology estimation cannot be extended to estimate the operational topology during outage conditions. For operational topology estimation during outages, our objective is to estimate both energized radial feeder and the outaged sections. Starting with a radial topology, these methods identify outaged feeder sections and hence, are inapplicable when the current radial operational topology is not known. In this work, we present a mathematical programming approach to estimate the operational topology of a three-phase unbalanced power distribution system under both outage and normal operating conditions. The aforementioned limitations of existing literature were countered by modeling the problem as a mixed-integer linear programming (MILP) problem which minimizes the errors in available measurements while satisfying the power flow and structural constraints of the system. Specically, a minimum weighted least absolute value estimator is proposed that uses the instantaneous line flow measurements, historical/ forecasted load data, and ping measurements from a limited set of smart meters and solves an MILP to identify the operational topology based on a linearized three-phase unbalanced power flow model. The proposed approach is tested on IEEE 123-bus feeder and 1069 bus multi-feeder test system and the numerical results prove the applicability of the proposed method to large three phase unbalanced grids with high errors in measurements. It is observed that the approach performs well even at high percentages of measurement errors.

GANDLURU NAGA, ANANDINI↗

DOE OSTI2023

STREAM: A Scalable Federated HPC Telemetry Platform

Obtaining and analyzing high performance computing (HPC) telemetry in real time is a complex task that can impact algo- rithmic performance, operating costs, and ultimately scientific outcomes. If your organization operates multiple HPC systems, filesystems, and clusters, telemetry streams can be synthesized in order to ease operational and analytics burden. In order to collect this telemetry, the Oak Ridge Leadership Computing Facility (OLCF) has deployed STREAM (Streaming Telemetry for Resource Events, Analytics, and Monitoring), which is a distributed and high-performance message bus based on Apache Kafka. STREAM collects center-wide performance information and must interface with many sources, including five HPE deployed supercomputers, each with their own Kafka cluster which is managed by HPCM. OLCF Supercomputers and their attached scratch filesystems currently send more than 300 million messages to over 200 topics producing around 1.3 Terabytes per day of telemetry data to STREAM. This paper describes the architectural principles that enable STREAM to be both resilient and highly performant while supporting multiple upstream Kafka clusters and other data sources. It also discusses the design challenges and decisions faced in adapting our existing system- monitoring infrastructure to support the first Exascale computing platform.

Adamson, Ryan↗

DOE OSTI2025

CGSim: A Simulation Framework for Large Scale Distributed Computing Environment

Large-scale distributed computing infrastructures such as the Worldwide LHC Computing Grid (WLCG) require comprehensive simulation tools for evaluating performance, testing new algorithms, and optimizing resource allocation strategies. However, existing simulators suffer from limited scalability, hardwired algorithms, lack of real-time monitoring, and inability to generate datasets suitable for modern machine learning approaches. We present CGSim, a simulation framework for large-scale distributed computing environments that addresses these limitations. Built upon the validated SimGrid simulation framework, CGSim provides high-level abstractions for modeling heterogeneous grid environments while maintaining accuracy and scalability. Key features include a modular plugin mechanism for testing custom workflow scheduling and data movement policies, interactive real-time visualization dashboards, and automatic generation of event-level datasets suitable for AI-assisted performance modeling. We demonstrate CGSim’s capabilities through a comprehensive evaluation using production ATLAS PanDA workloads, showing significant calibration accuracy improvements across WLCG computing sites. Scalability experiments show near-linear scaling for multi-site simulations, with distributed workloads achieving 6 × better performance compared to single-site execution. The framework enables researchers to simulate WLCG-scale infrastructures with hundreds of sites and thousands of concurrent jobs within practical time budget constraints on commodity hardware.

Vatsavai, Sairam Sri [Brookhaven National Laborato↗