SEARCH · Search NASA

Results for “Parallel in time”

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 145 records · Page 8

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Robustness of Deep Learning Classification to Adversarial Input on GPUs: Asynchronous Parallel Accumulation Is a Source of Vulnerability

The ability of machine learning (ML) classification models to resist small, targeted input perturbations—known as adversarial attacks—is a key measure of their safety and reliability. We show that floating-point non associativity (FPNA) coupled with asynchronous parallel programming on GPUs is sufficient to result in misclassification, without any perturbation to the input. Additionally, we show that this misclassification is particularly significant for inputs close to the decision boundary and that standard adversarial robustness results may be overestimated up to 4.6 when not considering machine-level details. We first study a linear classifier, before focusing on standard Graph Neural Network (GNN) architectures and datasets used in robustness assessments. We develop a novel black-box attack using Bayesian optimization to discover external workloads that can change the instruction scheduling which bias the output of reductions on GPUs and reliably lead to misclassification. Motivated by these results, we present a new learnable permutation (LP) gradient-based approach to learning floating-point operation orderings that lead to misclassifications. The LP approach provides a worst-case estimate in a computationally efficient manner, avoiding the need to run identical experiments tens of thousands of times over a potentially large set of possible GPU states or architectures. Finally, using instrumentation-based testing, we investigate parallel reduction ordering across different GPU architectures under external background workloads, when utilizing multi-GPU virtualization, and when applying power capping. Our results demonstrate that parallel reduction ordering varies significantly across architectures under the first two conditions, substantially increasing the search space required to fully test the effects of this parallel scheduler-based vulnerability. These results and the methods developed here can help to include machine-level considerations into adversarial robustness assessments, which can make a difference in safety and mission critical applications.

Shanmugavelu, Sanjif [Maxeler Technologies, a Groq↗

DOE OSTI2026

The high level trigger and express data production at STAR

To meet the demands of the Beam Energy Scan phase-II (BES-II) program, the STAR experiment at the Relativistic Heavy Ion Collider (RHIC) developed a dual real-time framework consisting of a High Level Trigger (HLT) and an Express Data Production system (xProduction). The HLT operates online within the Data Acquisition (DAQ) chain on a dedicated multi-core CPU cluster with the option to offload compute-intensive kernels to Xeon Phi coprocessors. It uses parallelized algorithms, such as the Cellular Automaton (CA) Track Finder, to perform rapid tracking, vertexing, and event filtering. This allows it to select events of interest in real time and provide immediate feedback on detector and beam conditions. In contrast, the xProduction workflow runs concurrently and independently of the DAQ loop. It applies near offline-quality calibration and reconstruction within hours of data collection. The xProduction input is the express data stream, whose content can be enriched by HLT trigger/priority selections under DAQ/HLT resource constraints, and it uses the STAR calibration/conditions framework, incorporating online calibration/QA information when available. This enables early preliminary physics analysis, including the reconstruction of rare signals, such as hyperons and hypernuclei. It also provides collaboration-wide access to analysis-ready datasets. Together, the HLT and xProduction systems form a complementary architecture: the HLT performs online event selection while the xProduction chain delivers high-quality results within a short amount of time. This integrated framework has enabled the prompt reconstruction of the $^5_Λ$ He hypernucleus with high statistical significance and the efficient processing of hundreds of millions of heavy-ion collision events. In conclusion, its demonstrated scalability and robustness establish a model for future high-luminosity experiments requiring both online event filtering and rapid access to analysis-quality data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2025

MBX V1.2: Accelerating Data-Driven Many-Body Molecular Dynamics Simulations

The MBX software provides an advanced platform for molecular dynamics simulations, leveraging state-of-the-art MB-pol and MB-nrg data-driven many-body potential energy functions. Developed over the past decade, these potential energy functions integrate physics-based and machine-learned many-body terms trained on electronic structure data calculated at the "gold standard" coupled-cluster level of theory. Recent advancements in MBX have focused on optimizing its performance, resulting in the release of MBX v1.2. While the inherently many-body nature of MB-pol and MB-nrg ensures high accuracy, it poses computational challenges. MBX v1.2 addresses these challenges with significant performance improvements, including enhanced parallelism that fully harnesses the power of modern multicore CPUs. In conclusion, these advancements enable simulations on nanosecond time scales for condensed-phase systems, significantly expanding the scope of high-accuracy, predictive simulations of complex molecular systems powered by data-driven many-body potential energy functions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2025

Knowledge Oriented Graph Unified Transformer (KOGUT) v0.1

KOGUT — Knowledge Oriented Graph Unified Transformer KOGUT implements the Relational Graph Transformer (RelGT) architecture for knowledge graph link prediction in biological domains, with a primary focus on microbial growth media prediction. While the original RelGT (arXiv:2505.10960) targets relational tables, time series, and multi-table databases, KOGUT adapts this architecture for heterogeneous biological knowledge graphs, providing first-in-class AI predictive models for microbial cultivation. Key Adaptations Beyond Original RelGT: - Knowledge Graph Focus: Applied to biological KGs with semantic node types (taxa, chemicals, media, phenotypes, environments) versus generic relational database tables, trained on the KG-Microbe knowledge graph (1.3M entities, 2.9M edges, 24 relation types). - Multimodal Node Encoding: Integrates node labels, categories, descriptions, and synonyms from KG metadata through learned embedding layers—adapting relational column features to graph node attributes with textual semantics. - Extended K-Hop Subgraph Strategy: Optimized neighborhood sampling (3-hop default, configurable up to 200 nodes) tuned for sparse biological networks, building on the original local-global attention framework with biological relation preservation. - Biolink Predicate Preservation: Type-specific transformations for 24 biological edge semantics (occurs_in, consumes, produces, has_phenotype, subclass_of) beyond standard relational foreign keys, enabling multi-relation link prediction. - Inductive Learning Support: Enables zero-shot predictions for novel taxa through feature-based embeddings (temperature, oxygen requirements, gram stain, cell shape), extending the original transductive relational benchmark scope to uncultured microorganisms. CheapSOTA Performance Optimizations (This Distribution): - VQ-EMA Centroid Attention: Vector quantization with exponential moving average for improved global context modeling (+5-10% MRR improvement). - HDF5 Precomputed Data Loading: One-time preprocessing of k-hop subgraphs to eliminate redundant graph traversals (2-5× training speedup). - Distributed Data Parallel Training: Multi-GPU support for scaling to larger knowledge graphs (tested on 4× NVIDIA A100 GPUs at NERSC Perlmutter). - Mixed Precision Training: Automatic mixed precision (AMP) for memory efficiency and faster training. Advantages Over Standard Knowledge Graph Embedding Models: Combines RelGT's proven multi-element tokenization (features, type, hop, structure) with graph-native biological representations, enabling interpretable link prediction across heterogeneous entities that standard embedding models (TransE, RotatE, ComplEx) and table-based transformers cannot directly model. Achieves near-perfect performance on microbial growth media prediction (MRR: 0.9966, Precision@1: 0.9932, Hit@10: 1.0000) while maintaining explainability through attention-based reasoning over biological pathways. Training Data: - KG-Microbe merged knowledge graph: 1,379,337 nodes, 2,960,472 edges - 24 biological relation types including taxonomic hierarchies, metabolic interactions, phenotype associations, and environmental relationships - Primary prediction task: Growth media suitability for microbial taxa (biolink:occurs_in, 50K edges) - Multi-relation capability: Predicts links for any of the 24 relation types, including chemical consumption/production, phenotype associations, and taxonomic classification Citation: Original RelGT Architecture: Dwivedi et al., "Relational Graph Transformer", arXiv:2505.10960, 2025 KOGUT Implementation: Knowledge Oriented Graph Unified Transformer for Microbial Growth Media Prediction Developed at Lawrence Berkeley National Laboratory (LBNL) Trained on NERSC Perlmutter supercomputer

Joachimiak, Marcin [Lawrence Berkeley National Lab↗

DOE OSTI2024

Medial axis and local thickness computation using the Fast Sweeping Method

This report describes an efficient and robust voxel-based methodology for computing the medial axis, local thickness, and distance-to-skeleton of arbitrary three-dimensional geometries. It is assumed that the object can be represented by an exact or approximate signed distance function on a discrete grid. The gradient of such function is used to formulate a hyperbolic partial differential equation (PDE) that models the collapse of the position vector in space. By exploiting the causality property of the PDE, the Fast Sweeping Method is able to obtain the solution in a finite number of sweeps independent of the mesh resolution. The intersection of characteristic lines leads to the formation of shocks and a discrete bisector function is used to identify the medial axis. The same PDE approach is used to compute the local thickness inside the object and obtain the distance-to-skeleton field. Multiple examples are given in two and three dimensions along with a resolution study. The methodology has optimal complexity and yields subsecond computational times for geometries with over a million zones on a single core. The methodology is also capable of parallelization across shared and distributed memory architectures.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

HtPIP: High-throughput phage isolation platform increases diversity and reduces isolation time using multiple bacteria

Bacteriophages are ubiquitous in nature, but relatively few have been isolated and characterized compared to the number of bacterial strains. Phage biotechnology applications benefit from a diverse library of isolated phages to kill or transfer genetic material to a bacterium of interest. However, scaling up phage discovery for diverse bacterial hosts can be time-consuming and costly. Here, we developed an approach to capture novel phages for multiple bacterial strains in parallel from an environmental sample using commercially available 0.2-μM filter plates. Using this High-throughput Phage Isolation Platform (HtPIP), 12 novel phages were isolated spanning 9 diverse bacterial host genera. Eleven of the isolated phages define new phage species, with nine also defining new genera. The HtPIP was used to discover both DNA and RNA phages, including a Tectiviridae infecting Pseudomonas putida mt-2 and a Leviviricetes infecting a Microbacterium isolate, which represents the first cultured RNA phage infecting a host outside of Proteobacteria. Using a metagenomic approach, we demonstrate that the HtPIP captures a higher proportion of novel phages compared to traditional low-throughput methods.

High-throughput↗

DOE OSTI2024

Electrofracturing of Shale at Elevated Pressure

Electrofracturing deeply buried shale formations could be used to increase reservoir permeability and improve reservoir production without requiring large volumes of freshwater. This paper describes a novel experimental system and initial test results to electrofracture shale under high confining pressures. Core-scale laboratory testing was performed on twelve rock samples recovered from a shale gas reservoir. Each sample was subjected to confining pressures of 20.7 MPa (3000 psi) or 58.6 MPa (8000 psi), representative of overburden pressures at depth. Samples were then subjected to application of high voltage until specimen fracture. The experiments produced deformed samples with multiple fracture types, both parallel and oblique to bedding planes. Electrofracturing increased permeabilities by up to nine orders of magnitude for extended time periods. Rock fracture and throughgoing fractures were demonstrated. Computed tomography images revealed the creation of fractures and tube/tunnel flow channels, which resisted closure under hydrostatic pressures up to 58.6 MPa. The breakdown energy and permeability changes in the sample were independent of applied confining pressure. The cumulative energy input required for fracture depended on applied confining pressure and sample length. The energy required to fracture samples up to 9 cm in length is generally more than 0.5 kJ/cm, but no greater than 1 kJ/cm. Our results show that electrofracture of shales under confining pressure is possible and could be a possible water-free mechanism for reservoir stimulation.

04 OIL SHALES AND TAR SANDS↗

DOE OSTI2025

Towards modelling AR Sco: calibration – reproducing high-energy pulsar emission and testing convergence to Aristotelian electrodynamics

In recent years, kinetic simulations have been crucial to further our understanding of pulsar electrodynamics. Yet, due to the large-scale separation between the gyro-period and the stellar rotation period, resolving the particle gyration has been computationally unfeasible for realistic pulsar parameters. The main aim of this work is comparing our gyro-phase-resolved model with a gyro-centric pulsar model, where our model solves the general equations of motion with included radiation reaction using a higher order numerical solver with adaptive time-steps. Specifically, we aim to (i) reproduce a pulsar’s high-energy emission maps, namely one with 10 per cent of the surface B-field strength of Vela, and the spectra produced by an independent gyro-centric pulsar emission model; and (ii) test convergence of these results to the radiation-reaction limit of Aristotelian electrodynamics. (iii) Additionally, we identify the effect that a large $E_{\parallel }$-field has on the trajectories and radiation calculations. We find that we can reproduce the curvature radiation emission maps and spectra well, using 10 per cent field strengths of the Vela pulsar and injecting our particles at a higher altitude in the magnetosphere. Using sufficiently large $E_{\parallel }$-fields, our numeric results converge to the analytic radiation-reaction limit trajectories. Additionally, we illustrate the importance of accounting for the $\mathbf {E}\times \mathbf {B}$-drift in the particle trajectories and radiation calculations, validating the Harding and collaborators’ model approach. Lastly, we found that our model deals very well with the high-radiation-reaction and high-field regimes present in pulsars.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2025

Accelerating Neutrino Event Generation in MARLEY Using CUDA-Based RNG and GPU Parallelization

MARLEY is a simulation tool that helps scientists study how low-energy neutrinos interact with matter. To work properly, MARLEY uses random numbers thousands of times in each simulation. These random numbers are important for modeling things like how neutrinos collide with atoms and what particles they produce. Right now, MARLEY runs on a regular computer processor (CPU) and uses a built-in random number generator called the Mersenne Twister. This setup works, but it can be slow, especially when trying to simulate many events. This research focuses on making MARLEY run faster by moving the random number generation and some of the repetitive calculations from the CPU to a graphics processing unit (GPU), which can handle many tasks at the same time. We use CUDA (a tool for programming NVIDIA GPUs) and cuRAND (a GPU-based random number library) to test faster alternatives to the current random number system. We compare different GPU-based generators, like curand_mtgp32, xorwow, and philox, to see which ones are the quickest and still give reliable results. Early tests show that using the GPU can make MARLEY simulations much faster. This project not only helps improve current simulation performance but also moves closer to a full simulation chain where all stages can run on modern GPU hardware.

Dunkley, Kimieka [Florida A-M]↗

DOE OSTI2025

Leveraging FPGA Advantages for Quicker Data Processing for LBNF

The Long Baseline Neutrino Facility (LBNF) will deliver a 2.4 MW muon neutrino beam from Fermilab to the Deep Underground Neutrino Experiment (DUNE), requiring unprecedented precision in beamline alignment to achieve DUNE's neutrino oscillation measurement goals. Vertical misalignments of beamline components as small as 0.5 mm can contribute 6-7\% uncertainty in predicted neutrino flux, necessitating sub-0.1 mm alignment monitoring capabilities. The Horn Location Sensor (HLS) system employs frequency sweep interferometry (FSI) in a distributed hydrostatic leveling network to achieve the required precision under harsh radiation conditions up to 5000 kRad/year. Traditional FSI implementations suffer from laser sweep nonlinearities that degrade resolution and require computationally intensive post-processing corrections using gas reference cells. This work presents a real-time FPGA-based implementation of the HLS data acquisition and processing system using a sweep tracker interferometer for dynamic sweep linearization. The system utilizes a PYNQ-Z2 FPGA with programmable logic implementing parallel 16k-point FFT processing across four channels, synchronized by the sweep tracker signal to eliminate post-processing requirements. Spectral performance testing demonstrates significant improvements in peak sharpness compared to traditional fixed-frequency digitization. The FPGA implementation enables real-time displacement monitoring with processing speeds orders of magnitude faster than software-based approaches, essential for the operational requirements of LBNF's eventual distributed sensor network. This advancement in real-time FSI processing directly supports DUNE's precision neutrino physics program by providing the rapid feedback necessary for maintaining stringent beamline alignment tolerances during high-power beam operations.

Rossel, Jacob↗

DOE OSTI2025

Real-Time FPGA Implementation For Frequency Sweep Interferometry In The LBNF Complex

Rossel, A. Jacob [Fermilab; Unlisted]↗

DOE OSTI2025

Core-edge integrated predictive studies of ST40 and NSTX plasmas with the scrape-off layer box model

The ability to model the interplay between the core and edge of tokamak plasmas is crucial to designing both the plasma operating scenario of a fusion pilot plant and the design of the tokamak itself. Scrape-off-layer (SOL) models that are tailored to integrated scenario modeling need to have fast turn-around time and minimal computational burden to enable wide parameter-space coverage for design scoping. The SOL 0-D Box model is a reduced SOL model based on global power and particle balance that captures the essential physics of SOL transport with little computational cost. The usage of the 0-D Box model in core-edge coupled simulations has been demonstrated in both interpretive and predictive modes on a variety of devices. This paper presents a sensitivity study of the 0-D Box model to the input SOL heat-flux width for an ST40 plasma. This study demonstrates that accurate prediction of this width is crucial to predicting global performance parameters of a plasma scenario, such as energy confinement time and flux consumption. We also present an extension of the Box model to 1-D to allow for parallel variation of plasma parameters along the magnetic field lines. The 1-D Box model is then compared with SOLPS-ITER simulations of an NSTX plasma. Advantages and limitations of the Box model are discussed, and future directions are outlined.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2025

Performance of an X-γ ray detection system based on a thick silicon LGAD

We present the performance of a X-γ ray detection systems based on a 300 µm thick silicon low-gain avalanche diode (LGAD) and of an equivalent Diode structure without the gain layer, read-out by a custom-made low-noise charge amplifier. For the LGAD structure, the multiplication gains M s from 10.2 to 19.3 are measured, and the Equivalent Noise Charge (ENC) components have been studied in detail. As expected, a significant reduction of the white and 1/f voltage series and dielectric ENC components is observed with increasing gain, shortening the optimum peaking time to τ = 0.4÷8 μs depending on the gain value, with respect to the standard diode, while the parallel ENC component increases proportionally to the gain up to M s = 15. Setting the gain M s = 12.7, a minimum ENC = 34.5 electrons r.m.s. (298 eV FWHM) at τ = 1 μs is found. However, the electronic noise, evaluated on the pulser FWHM, is found to only marginally contribute to the width of the spectral lines of a radioactive source, which are dominated instead by the statistical noise of the charge multiplication within the LGAD structure. The spectral lines' excess width is found to be proportional to the signal multiplication gain M s and increases with the energy of the photons. A minimum line width of 850 eV FWHM at 13.9 keV is measured at room temperature, τ = 2 μs and a gain M s = 10.2.

47 OTHER INSTRUMENTATION↗

DOE OSTI2025

Composite Behavior of Nanopore Array Large Memristors

Synthetic nanopores were recently demonstrated with memristive and nonlinear voltage-current behaviors, akin to ion channels in a cell membrane. Such ionic devices are considered a promising candidate for the development of brain-inspired neuromorphic computing techniques. In this work, we show the composite behavior of nanopore-array large memristors, formed with different membrane materials, pore sizes, electrolytes, and device arrangements. Anodic aluminum oxide (AAO) membranes with 5 nm and 20 nm diameter pores and track-etched polycarbonate (PCTE) membranes with 10 nm diameter pores are tested and shown to demonstrate memristive and nonlinear behaviors with approximately 107–1010 pores in parallel when electrolyte concentration across the membranes is asymmetric. Ion diffusion through the large number of channels induces time-dependent electrolyte asymmetry that drives the system through different memristive states. The behaviors of series composite memristors with different configurations are also presented. In addition to helping understand fluidic devices and circuits for neuromorphic computing, the results also shed light on the development of field-assisted ion-selection-membrane filtration techniques as well as the investigations of large neurons and giant synapses. Further work is needed to de-embed parasitic components of the measurement setup to obtain intrinsic large memristor properties.

Chemistry↗

DOE OSTI2024

Streaming Matching and Edge Cover in Practice

Graph algorithms with polynomial space and time requirements often become infeasible for massive graphs with billions of edges or more. State-of-the-art approaches therefore employ approximate serial, parallel, and distributed algorithms to tackle these challenges. However, such approaches require storing the entire graph in memory and thus need access to costly computing resources such as clusters and supercomputers. In this paper, we present practical streaming approaches for solving massive graph problems using limited memory for two prototypical graph problems: maximum weighted matching and minimum weighted edge cover. For matching, we conduct a thorough computational study on two of the semi-streaming algorithms including a recent breakthrough result that achieves a $1/(2+\varepsilon)$-approximation of the weight while using $O( n \log W /\epsilon)$ memory (here $n$ is the number of vertices and $W$ is the maximum edge weight), designed by Paz and Schwartzman [SODA, 2017]. Empirically, we show that the semi-streaming algorithms produce matchings whose weight is close to the best $1/2$-approximate offline algorithm while requiring less time and an order-of-magnitude less memory. For minimum weighted edge cover, we develop three novel semi-streaming algorithms. Two of these algorithms require a single pass through the input graph, require $O(n \log n)$ memory, and provide a 2-approximation guarantee on the objective. We also leverage a relationship between approximate maximum weighted matching and approximate minimum weighted edge cover to develop a two-pass $3/2+\epsilon$-approximate algorithm with the memory requirement of Paz and Schwartzman's semi-streaming matching algorithm. These streaming approaches are compared against the state-of-the-art 3/2-approximate offline algorithm. The semi-streaming matching and the novel edge cover algorithms proposed in this paper can process graphs with several billions of edges in under 30 minutes using 6 GB of memory, which is at least an order of magnitude improvement from the offline (non-streaming) algorithms. For the largest graph, the best alternative offline parallel approximation algorithm (GPA+ROMA) could not finish in three hours even while employing hundreds of processors and 1 TB of memory. We also demonstrate an application of the semi-streaming algorithm by computing a matching using linearly bounded memory on item intersection graphs derived from three machine learning datasets, whereas the existing offline algorithms could not complete on one of these datasets since their memory requirements exceeded 1TB.

Ferdous, S M.↗

DOE OSTI2025

Backpropagation-based learning with local derivative approximation and memory replay in biologically plausible neural systems

When learning, the brain modifies individual synaptic connections to reach a desired behavior. Animal and human brains have been shown to be incredibly capable of learning complex and varied functions across a wide variety of tasks. In recent years, artificial neural networks, inspired by human and animal brains, have shown great capabilities in learning a wide variety of difficult tasks. However, artificial neural networks primarily teach themselves through the use of backpropagation, a learning method which has no clear analogue within the brain. Additionally, Artificial Neural Networks primarily use continuous activation functions, which differ significantly from the spiking neuronal behavior present in the brain. In this paper, we discuss and demonstrate a biologically plausible learning method that approximates backpropagation through two techniques on Spiking Neural Networks. First, we show that the local temporal derivatives that are necessary for backpropagation can be approximately recovered through reconstruction using spike timings. Second, we show that through learning during a sleep phase, inspired by neuroscience research into memory replay, the localized parallel feedback path can learn to approximate the derivative through the forward path weight matrix, thus solving the weight transport problem. Lastly, we demonstrate that the combination of these two methods can approach or exceed the accuracy of backpropagation-based methods for a variety of neuromorphic vision tasks while maintaining biological plausibility.

42 ENGINEERING↗

DOE OSTI2025

An extraction scheme for future CEBAF FFA based energy upgrade

Jefferson lab is considering an energy increase from current 12 GeV to 22 GeV for its CEBAF accelerator. This will be accomplished by recirculating 5-6 additional turns through two parallel CEBAF LINACs using an FFA arc at each end of the racetrack. The total recirculation turns would be 10 times, the first four turns use present conventional arcs to make the 180-degree bends from one LINAC to the other. However, the last 5-6 turns will all share a single beam line inside two FFA arcs. This reduces the footprint and the cost of the project significantly. On the other hand, having the trajectories of last 5-6 recirculating beams close to each other makes it challenging to extract beams from different passes with different energies. In this paper we will explain our present extraction system for 12 GeV, our challenges and limitations, and a possible extraction solution for the 22 GeV upgrade with the goal of extracting beam at different turns/energies to different experimental halls.

Accelerator Physics↗

DOE OSTI2024

Extraction scheme for future CEBAF FFA based energy upgrade

Kazimi, Reza↗