Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed algorithms”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Longitudinal Phase Space Tomography for the Booster Synchrotron

Efforts in the study of the longitudinal behavior of charged particles in the Fermilab Booster can be catalyzed with an image of the two-dimensional phase space distribution. In the past, tomography has been extensively employed in the reconstruction of the phase space in accelerators such as the Recycler at Fermilab and the Proton Synchrotron Booster at CERN. However, such a capability had yet to realize for the Fermilab Booster synchrotron. In this work, the first successful tomographic phase space reconstruction of a low-energy Booster bunch is presented along with validation metrics. A numerical turn-by-turn model of the longitudinal particle dynamics in the Booster has been implemented, which utilizes a fast, map-based particle transport algorithm. Using a sinogram generated from the Wall Current Monitor, the iterative reconstruction algorithm recovers a discretized image of the original phase space distribution at variable resolution. The reconstruction result shows low root-mean-square error and a rapid convergence toward the solution, providing strong evidence of accuracy. Future and ongoing work includes modeling high-energy bunches above transition and using tomography to infer certain machine parameters such as synchronous phase, peak gap voltage, and synchronous energy in addition to the phase space distribution.

Ebeid, Safi [Unlisted]↗
DOE OSTI2026

Longitudinal Phase Space Tomography for the Booster Synchrotron (Abstract Only)

Efforts in the study of the longitudinal behavior of charged particles in the Fermilab Booster can be catalyzed with an image of the two-dimensional phase space distribution. In the past, tomography has been extensively employed in the reconstruction of the phase space in accelerators such as the Recycler at Fermilab and the Proton Synchrotron Booster at CERN. However, such a capability had yet to realize for the Fermilab Booster synchrotron. In this work, the first successful tomographic phase space reconstruction of a low-energy Booster bunch is presented along with validation metrics. A numerical turn-by-turn model of the longitudinal particle dynamics in the Booster has been implemented, which utilizes a fast, map-based particle transport algorithm. Using a sinogram generated from the Wall Current Monitor, the iterative reconstruction algorithm recovers a discretized image of the original phase space distribution at variable resolution. The reconstruction result shows low root-mean-square error and a rapid convergence toward the solution, providing strong evidence of accuracy. Future and ongoing work includes modeling high-energy bunches above transition and using tomography to infer certain machine parameters such as synchronous phase, peak gap voltage, and synchronous energy in addition to the phase space distribution.

Ebeid, Safi [Unlisted, US]↗
DOE OSTI2025

DIMPLES: Distributed Influence Maximization for Pandemic pLanning on Exascale Systems

We study exascale parallel algorithms for the selection of intervention or monitoring strategies in massive realistic socio-technical networks through scalable Influence Maximization (InfMax) algorithms. We employ novel techniques to enable efficient scaling on up to 8k nodes of OLCF Frontier, with 65k AMD GPUs and 458k AMD CPU cores. Current state-of-the-art InfMax tools are limited to networks with only a few million actors (vertices) and a few hundred million interactions (edges). By overcoming these limitations, we show that our approach is capable of processing a realistic social contact network of the United States with 285 million nodes and about 8 billion edges. This two orders-of-magnitude improvement over the previous state-of-the-art is obtained by leveraging algorithmic advancements for the InfMax problem and designing several problem-specific approaches to overlap communication with computation, improve GPU efficiency, and lower the application’s memory requirements. We evaluate strong scaling for computing 10k most influential seeds using up to 8k nodes of an exascale system, and weak scaling from 128 to 8k system nodes for seed sets ranging from 625 to 40k seeds. We achieve the fastest-known runtime of 25 minutes while performing 48 million diffusion simulations totaling 2.31 petabytes to identify 40k influential seeds using 8k nodes, and take 5.75 minutes to identify 10k seeds while using 4k nodes.

Minutoli, Marco [Pacific Northwest National Labora↗
DOE OSTI2025

Kinetics Measurements in Resistive Electrolytes Using Ring-Disk Electrode: Ring as Current “Shield” Enables Uniform Disk Current Distribution

Rotating disk electrodes are commonly used for electrochemical kinetics measurements. A major disadvantage of these types of electrodes is their nonuniform secondary current distribution, especially when performing electroanalytical measurements in resistive electrolytes. Such nonuniform current distribution can render the values of kinetics constants extracted from the disk electrode to be highly inaccurate. Furthermore, one emerging class of electrolytes that suffer from low ionic conductivities is deep eutectic solvents (DES). DES are a promising class of electrolytes for various emerging applications; however, due to their resistive nature, the secondary current distribution when using them is typically highly nonuniform. For example, the Wagner number when measuring Cu²⁺/Cu⁺ kinetics in choline chloride–ethylene glycol DES (1:4 molar ratio of ChCl:EG) is very low (<0.1), indicating highly nonuniform current distribution over the disk electrode. We show here that the Cu²⁺/Cu⁺ exchange current density measured using disk electrodes is very inaccurate due to the aforementioned nonuniform current distribution. To obtain uniform disk current distribution, we employ here a coplanar concentric rotating ring-disk electrode (RRDE), where the ring serves the function of a current “shield.” Specifically, we show using modeling that the ring minimizes the current distribution nonuniformity at the disk by effectively shielding the disk against current spikes near the disk edge. This enables improved precision in electrode kinetics measurements for the Cu²⁺/Cu⁺ couple in resistive DES. To enable broad applicability of this technique, an analytical expression based on the Wagner number is integrated into an iterative algorithm to help users identify ring conditions to achieve uniform current distribution and thus improved electroanalytics at the disk.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2026

Flux Cube Reconstruction from Slitless Spectroscopy

Slitless spectroscopy enables efficient, large-area surveys without target preselection, yet it faces challenges from source blending, higher noise, and lost spatial–spectral information. We present an advanced, nonparametric, data-driven algorithm that leverages multiple dispersion angles to reconstruct three-dimensional flux distributions, providing low-resolution integral field unit capabilities from slitless data. By treating each pixel as an independent element, our method naturally handles source confusion without requiring prior assumptions regarding redshifts, templates, or model libraries. We validate the algorithm using simulated Roman Space Telescope wide-field slitless spectroscopy images that are equivalent to what is expected from the High-Latitude Time-Domain Survey. First, we demonstrate that a host-galaxy model reconstructed from multiple dispersion angles can be used to accurately subtract host light from a transient, recovering a Type Ia supernova spectrum with minimal bias. Second, we showcase a high-fidelity flux-cube reconstruction of a complex galaxy, successfully measuring the redshift and recovering continuum, emission, and absorption features. This approach highlights the potential of multi-dispersion-angle slitless data to provide spatially resolved spectral information in a nonparametric way, which is traditionally accessible only with integral field spectroscopy, opening a new window into large, unbiased, and spatially resolved studies of galaxy evolution.

Griggio, M. [Space Telescope Science Institute, Ba↗
DOE OSTI2024

Adaptive Online Model Update Algorithm for Predictive Control in Networked Systems

In this article, we introduce an adaptive on-line model update algorithm designed for predictive control applications in networked systems, particularly focusing on power distribution systems. Unlike traditional methods that depend on historical data for offline model identification, our approach utilizes real-time data for continuous model updates. This method integrates seamlessly with existing online control and optimization algorithms and provides timely updates in response to real-time changes. This methodology offers significant advantages, including a reduction in the communication network bandwidth requirements by minimizing the data exchanged at each iteration and enabling the model to adapt after disturbances. Furthermore, our algorithm is tailored for non-linear convex models, enhancing its applicability to practical scenarios. The efficacy of the proposed method is validated through a numerical study, demonstrating improved control performance using a synthetic IEEE test case.

data-driven model predictive control↗
DOE OSTI2025

CityLearn v2: energy-flexible, resilient, occupant-centric, and carbon-aware management of grid-interactive communities

As more distributed energy resources become part of the demand-side infrastructure, quantifying their energy flexibility on a community scale is crucial. CityLearn v1 provided an environment for benchmarking control algorithms. However, there is no standardized environment utilizing realistic building-stock datasets for distributed energy resource control benchmarking without co-simulation or third-party frameworks. CityLearn v2 extends CityLearn v1 by providing a stand-alone simulation environment that leverages the End-Use Load Profiles for the U.S. Building Stock dataset to create grid-interactive communities for resilient, multi-agent, and objective control of distributed energy resources with dynamic occupant feedback. While the v1 environment used pre-simulated building thermal loads, the v2 environment uses data-driven thermal dynamics and eliminates the need for co-simulation with building energy performance software. This work details the v2 environment and provides application examples that use reinforcement learning control to manage battery energy storage system, vehicle-to-grid control, and thermal comfort during heat pump power modulation.

Nweye, Kingsley↗
DOE OSTI2026

Determination of nuclear PDFs using Markov chain Monte Carlo methods

Global QCD analyses of nuclear parton distribution functions (nPDFs) have traditionally relied on the Hessian method for uncertainty estimation. However, the inherent Gaussian approximation and reliance on local curvature often prove insufficient for nPDF fits, which are frequently characterized by limited data constraints and non-Gaussian likelihoods. In this paper, we present the first nPDF determination based on Markov Chain Monte Carlo (MCMC) techniques, implemented within the nCTEQ framework using an adaptive Metropolis-Hastings algorithm. The MCMC approach enables a direct mapping of the posterior distribution and reveals a highly nontrivial parameter-space structure, including multiple modes and pronounced non-Gaussian behavior, particularly for the valence PDFs. We perform the first single-nucleus global analysis of lead PDFs using exclusively lead data and compare it to a multi-nuclei fit employing a standard analytic A dependence. The inclusion of lighter nuclei reduces quark uncertainties and modifies the shape of the lead PDFs, while leaving the gluon distribution largely unaffected. A complementary Hessian analysis exposes systematic limitations of the Gaussian approximation. Our results demonstrate that MCMC methods provide a more reliable framework for uncertainty quantification in nPDF determinations.

Derakhshanian, N. [Institute of Nuclear Physics Po↗
DOE OSTI2025

Quantum Reinforcement Learning for Volt-VAR Control in Power Distribution Systems

Volt-VAR control (VVC) is crucial in active distribution networks for optimizing voltage profiles and minimizing network losses. While traditional deep reinforcement learning (DRL) algorithms exhibit promise for VVC, they often require extensive computational resources to handle such a high-dimensional problem. As a potential solution, quantum reinforcement learning (QRL) algorithms integrate the computational capabilities of quantum computing into the DRL framework. However, existing QRL algorithms struggle with complex VVC problems due to the limitations of current quantum hardware. To bridge this gap, this paper proposes an innovative QRL algorithm featuring an end-to-end architecture that integrates a classical autoencoder, variational quantum circuits (VQCs), and classical post-processing layers. This design efficiently compresses high-dimensional grid states, enabling VQCs to leverage quantum advantages while producing multiple control device outputs tailored for VVC tasks. Numerical studies on three representative distribution systems verify the effectiveness and scalability of the proposed QRL algorithm, and demonstrate its enhanced performance over classical approaches with only approximately 1% of the parameters. Additionally, the robustness of our developed algorithm is validated through noisy quantum environments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Scalable quantum computational science: A perspective from block-encodings and polynomial transformations

Significant developments made in quantum hardware and error correction recently have been driving quantum computing toward practical utility. However, gaps remain between abstract quantum algorithmic development and practical applications in computational sciences. In this perspective article, we propose several properties that scalable quantum computational science methods should possess. We further discuss how block-encodings and polynomial transformations can potentially serve as a unified framework with the desired properties. Recent advancements on these topics are presented, including the construction and assembly of block-encodings, and various generalizations of quantum signal processing (QSP) algorithms to perform polynomial transformations. The scalability of QSP methods on parallel and distributed quantum architectures is also highlighted. Promising applications in simulation and observable estimation in chemistry, physics, and optimization problems are presented. We hope this perspective serves as a gentle introduction to state-of-the-art quantum algorithms for the computational science community and inspires future development of scalable quantum computational science methodologies that bridge theory and practice.

Bayesian inference↗
DOE OSTI2024

An exploration of online-simulation-driven portfolio scheduling in Workflow Management Systems

Workflow Management Systems used to automate the execution of scientific workflow applications on parallel and distributed computing platforms must make scheduling decisions at runtime. A large number of workflow scheduling algorithms have been proposed in the literature, but often these algorithms are evaluated based on simplifying assumptions that may not hold in practice. Furthermore, published algorithm evaluation and/or comparison results are necessarily only for a subset of all possible scenarios, and thus may not include scenarios relevant to particular use-cases. Consequently, it is difficult for Workflow Management Systems (WMSs) developers to decide which scheduling algorithm should be implemented. To obviate this difficulty, one possible approach is to implement a portfolio of scheduling algorithms and select the most effective algorithm at runtime. One method for performing this selection is to run an online simulation for each algorithm in the portfolio. The algorithm that leads to the best performance, in simulation, is selected for future use. The above simulation-driven portfolio scheduling (SDPS) approach has been proposed in a few parallel and distributed computing contexts. The main objective of this work is to evaluate the feasibility and potential merit of SDPS if implemented in WMSs. Here we perform this evaluation using simulated WMS executions, where the simulations are instantiated from real-world platform and workflow configurations. Our main finding is that SDPS is on par with or outperforms an approach in which a single algorithm is used, where this algorithm is the one that performs best on average across all our experimental scenarios. Furthermore, we find that SDPS remains an attractive proposition even in the presence of high levels of simulation error and for simulators with relatively low levels of sophistication. In many of our experimental scenarios we find that mitigating simulation error at runtime can further improve performance. Finally, we show that simulation overhead can be made sufficiently low for SDPS to be feasible in practice.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Constraining Galaxy-Halo connection using machine learning

We investigate the potential of machine learning (ML) methods to model small-scale galaxy clustering for constraining Halo Occupation Distribution (HOD) parameters. Our analysis reveals that while many ML algorithms report good statistical fits, they often yield likelihood contours that are significantly biased in both mean values and variances relative to the true model parameters. This highlights the importance of careful data processing and algorithm selection in ML applications for galaxy clustering, as even seemingly robust methods can lead to biased results if not applied correctly. ML tools offer a promising approach to exploring the HOD parameter space with significantly reduced computational costs compared to traditional brute-force methods if their robustness is established. Using our ANN-based pipeline, we successfully recreate some standard results from recent literature. Properly restricting the HOD parameter space, transforming the training data, and carefully selecting ML algorithms are essential for achieving unbiased and robust predictions. Among the methods tested, artificial neural networks (ANNs) outperform random forests (RF) and ridge regression in predicting clustering statistics, when the HOD prior space is appropriately restricted. We demonstrate these findings using the projected two-point correlation function (w p (r p )), angular multipoles of the correlation function (ξ ℓ (r)), and the void probability function (VPF) of Luminous Red Galaxies from Dark Energy Spectroscopic Instrument mocks. Our results show that while combining w p (r p ) and VPF improves parameter constraints, adding the multipoles ξ 0 , ξ 2 , and ξ 4 to w p (r p ) does not significantly improve the constraints.

cosmology↗
DOE OSTI2024

Trajectory Shaper: A Solution for Disrupted Cooperative Adaptive Cruise Control

Cooperative adaptive cruise control (CACC) can effectively reduce energy consumption, alleviate traffic congestion, and enhance safety. However, communication-related constraints and uncooperative vehicle users can disrupt CACC during real-world operations, significantly undermining the putative benefits of CACC. To alleviate the negative impacts of disrupted CACC, this study develops the trajectory shaper (TS) methods as backup solutions for two scenarios: (i) communication between vehicles is infeasible, and vehicles execute adaptive cruise control (ACC) using local sensor measurements; (ii) follower vehicles reject forming a cooperative platoon and execute their local distributed controllers using the information attained via communication. When communication is infeasible, a distributed TS is devised on each vehicle to modify the sensor measurements, enabling safe and efficient ACC operations. When communication is available but uncooperative agents are involved, the lead vehicle of the platoon executes a centralized TS to modify the information shared with uncooperative agents, achieving optimal platoon-level performance. The centralized and distributed TSs are implemented based on the model predictive control algorithms to yield optimal modifications on input information. Robustness is also factored to tackle model uncertainties during TS operations to ensure safety and efficiency. Numerical experiments validate the control performance of the proposed TSs.

Zhou, Anye [ORNL] (ORCID:0000000301455579)↗
DOE OSTI2025

Pricing Strategy of Electric Vehicle Aggregators Based on Locational Marginal Price to Minimize Photovoltaic (PV) Curtailment

The global climate crisis demands urgent action to mitigate global warming. Using renewable energy sources, such as solar and wind power, for electricity generation is crucial. This shift from centralized to distributed power systems, however, brings challenges, including voltage fluctuations and renewable energy curtailment. The rapid growth of the electric vehicle (EV) industry adds complexity, increasing overall electricity demand and straining the power supply during peak charging times. This paper proposes a scheduling strategy for EV aggregators to reduce renewable energy curtailment and stabilize grid operation by strategically scheduling EV charging. Using Multi -Agent Transport Simulation (MATSim), a traffic simulation tool, EV driving data in Denver, Colorado, USA, were modeled. The EV aggregator adjusts charging fees based on locational marginal prices, encouraging EVs to charge at different stations according to pricing. Simulations on an IEEE 33-bus system with distributed energy resources and EV charging stations validate the proposed algorithm, demonstrating its effectiveness in reducing curtailment by 12.55% and stabilizing grid operation.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2025

FY 2025 End of Year Report: Seismic Monitoring of Underground Vibration Sources using Distributed Acoustic Sensing (DAS) and Seismometers

This end-of-year report summarizes progress on using seismic monitoring to detect, associate, and locate anomalous vibration signals that may indicate potential containment breaches. The work focused on four key tasks: 1. Developing a database of continuous waveforms and ground-truth event data from multiple sensing modalities. 2. Refining and implementing detection and association algorithms to generate a catalog of anomalous underground activities. 3. Testing and improving distributed acoustic sensing amplitude-based geolocation methods to build an event location catalog. 4. Testing and refining seismic array polarization-based geolocation methods to build an event location catalog. This report provides a brief recap of results from the FY25 midyear report (Tasks 1 and 2) and presents new findings from geolocation methods (Tasks 3 and 4).

58 GEOSCIENCES↗
DOE OSTI2026

Computing an Optimal Entanglement Path with Throughput and Fidelity Considerations

Entanglement distribution is a core function of quantum networks essential for operations including teleportation, distributed quantum sensing, and multisite computation. Entanglement throughput and fidelity are two critical performance measures that depend on the quantum transmission along the links and swapping operations at the repeaters along the path. We study the problem of computing a end-to-end entanglement path that satisfies both fidelity and throughput requirements, leveraging qubit buffers at the nodes and considering the sequential swapping order. We show that the general problem of simultaneously satisfying both metrics to be NP-hard, and develop an algorithm to maximize throughput subject to a given fidelity threshold. We introduce the concepts of entanglement probability distribution and path domination and exploit them in the design of our algorithm. Extensive numerical results show that our algorithm can find optimal solutions in networks with thousands of nodes in less than a second. We also describe practical and possible implementation aspects of this algorithm in terms of devices and architecture support.

Xue, Guoliang [Arizona State University]↗
DOE OSTI2025

High-Fidelity Analysis of EV Integration on Real Utility Feeders in Colorado

Residential electric vehicle (EV) charging has the potential to alter long-held assumptions on load characteristics impacting distribution grid planning, operations, and design standards. This study identifies analysis and control methods to increase the affordability of residential EV charging both for Xcel Energy and their customers. The project also provides solutions for more reliable grid interconnection that can support a reliable utility business model prepared for increasing EV charging load in the coming years. For this project, we referenced Level 2 alternating current (AC) onboard charging profiles for various vehicle models and high-fidelity charging data collected at the experimental setup established at the EV Research Infrastructure Laboratory at the National Renewable Energy Laboratory (NREL). Next, we developed EV adoption models for 2030 and 2040 for the Boulder and Aurora regions in Colorado. Moreover, we evaluated different smart charging control algorithms and compared their performance. We developed time-of-use (TOU)-based and grid-aware active EV charging control methods and integrated them within the study region to understand field impacts. Diving deeper, we selected 10 feeders in Boulder and Aurora for high-fidelity grid modeling down to the house level. We executed detailed grid analysis comparing the smart charge management (SCM) algorithms we developed. Finally, we created a novel tool, Electric Vehicle Infrastructure--Distribution System Integration Tool (EVI-DiST), to integrate all the approaches in a single software environment to provide easy integration, fast simulation, and detailed evaluation capability for utility engineers and other stakeholders.

33 ADVANCED PROPULSION SYSTEMS↗