Leveraging Quantum Computing for Accelerated Classical Algorithms in Power Systems Optimization
Explore the source record for details and available documents.
24 POWER TRANSMISSION AND DISTRIBUTION↗
SEARCH · Engineering Papers
Results for “distributed computation”
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.
Distributionally robust facility location problem under decision-dependent stochastic demand
While the traditional facility location problem considers exogenous demand, in some applications, locations of facilities could affect the willingness of customers to use certain types of services, e.g., carsharing, and therefore they also affect realizations of random demand. Moreover, a decision maker may not know the exact distribution of such endogenous demand and how it is affected by location choices. In this paper, we consider a distributionally robust facility location problem, in which we interpret the moments of stochastic demand as functions of facility-location decisions. We reformulate a two-stage decision-dependent distributionally robust optimization model as a monolithic formulation, and then derive exact mixed-integer linear programming reformulation as well as valid inequalities when the means and variances of demand are piecewise linear functions of location solutions. We conduct extensive computational studies, in which we compare our model with a decision-dependent deterministic model, as well as stochastic programming and distributionally robust models without the decision-dependent assumption. Here, the results show superior performance of our approach with remarkable improvement in profit and quality of service under various settings, in addition to computational speed-ups given by formulation enhancements. These results draw attention to the need of considering the impact of location decisions on customer demand within this strategic-level planning problem.
97 MATHEMATICS AND COMPUTING↗
Aggregation and Grid Security Workshop Report
The Aggregation and Grid Security Workshop - held on June 17-18, 2025, National Laboratory of the Rockies (NLR) in Golden, Colorado - brought together approximately 40 external stakeholders from the energy sector, including VPP owner/operators, aggregators, OEMs, utilities, testing & certification labs, trade associations, and cybersecurity vendors. Led by key facilitators, the workshop focused on addressing cybersecurity challenges and enhancing grid resilience for aggregated Distributed Energy Resources (DERs) and Virtual Power Plants (VPPs). The workshop was catalyzed by recognition that traditional, rearward-looking regulatory frameworks are insufficient to keep pace with technological change. There is a "missing understanding" of risk, an "absent security basis" for managing it, and an "untenable responsibility" due to unclear ownership and requirements. The workshop aimed to shift the mindset from reacting to past crises to proactively preparing for emerging threats, fostering forward resilience through risk simulation and collaborative action. This report summarizes the outcomes of the workshop, marking it a significant step toward a secure, reliable and affordable energy future.
14 SOLAR ENERGY↗
Electronic Spectroscopy and Dissociation Dynamics of Vinyl-Substituted Criegee Intermediates: 2-Butenal Oxide and Comparison with Methyl Vinyl Ketone Oxide and Methacrolein Oxide Isomers
The 2-butenal oxide Criegee intermediate [(CH 3 CH=CH)CHOO], an isomer of the four-carbon unsaturated Criegee intermediates derived from isoprene ozonolysis, is characterized on its first π * ←π electronic transition and by the resultant dissociation dynamics to O ( 1 D) + 2-butenal [(CH 3 CH=CH)CHO] products. The electronic spectrum of 2-butenal oxide under jet-cooled conditions is observed to be broad and unstructured with peak absorption at 373 nm, spanning to half maxima at 320 and 420 nm, and in good accord with the computed vertical excitation energies and absorption spectra obtained for its lowest energy conformers. The distribution of total kinetic energy released to products is ascertained through velocity map imaging of the O ( 1 D) products. About half of the available energy, deduced from the theoretically computed asymptotic energy, is accommodated as internal excitation of the 2-butenal fragment. A reduced impulsive model is introduced to interpret the photodissociation dynamics, which accounts for the geometric changes between 2-butenal oxide and the 2-butenal fragment, and vibrational activation of associated modes in the 2-butenal product. Application of the reduced impulsive model to the photodissociation of isomeric methyl vinyl ketone oxide reveals greater internal activation of the methyl vinyl ketone product arising from methyl internal rotation and rock, which is distinctly different than the dissociation dynamics of 2-butenal oxide or methacrolein oxide.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
pyTCR: A tropical cyclone rainfall model for python
pyTCR is a climatology software package developed in the Python programming language. It integrates the capabilities of several legacy physical models and increases computational efficiency to allow rapid estimation of tropical cyclone (TC) rainfall consistent with the large-scale environment. Specifically, pyTCR implements a horizontally distributed and vertically integrated model [Zhu et al., 2013] for simulating rainfall driven by TCs. Along storm tracks, rainfall is estimated by computing the cross-boundary-layer, upward water vapor transport caused by different mechanisms including frictional convergence, vortex stretching, large-scale baroclinic effect (i.e., wind shear), topographic forcing, and radiative cooling [Lu et al., 2018]. The package provides essential functionalities for modeling and interpreting spatio-temporal TC rainfall data. pyTCR requires a limited number of model input parameters, making it a convenient and useful tool for analyzing rainfall mechanisms driven by TCs. To sample rare (most intense) rainfall events that are often of great societal interest, pyTCR adapts and leverages outputs from a statistical-dynamical TC downscaling model [Lin et al., 2023] capable of rapidly generating a large number of synthetic TCs given a certain climate. As a result, pyTCR significantly reduces computational effort and improves the efficiency in capturing extreme TC rainfall events at the tail of the distributions from limited datasets. Furthermore, the TC downscaling model is forced entirely by large-scale environmental conditions from reanalysis data or coupled General Circulation Models (GCMs), simplifying the projection of TC-induced rainfall and wind speed under future climate using pyTCR. Finally, pyTCR can be coupled with hydrological and wind models to assess risks associated with independent and compound events (e.g., storm surges and freshwater flooding).
54 ENVIRONMENTAL SCIENCES↗
Xyce™ Parallel Electronic Simulator Users’ Guide, Version 7.10
This manual describes the use of the Xyce Parallel Electronic Simulator. Xyce has been designed as a SPICE-compatible, high-performance analog circuit simulator, and has been written to support the simulation needs of the Sandia National Laboratories electrical designers. This development has focused on improving capability over the current state-of-the-art in the following areas: • Capability to solve extremely large circuit problems by supporting large-scale parallel computing platforms (up to thousands of processors). This includes support for most popular parallel and serial computers. • A differential-algebraic-equation (DAE) formulation, which better isolates the device model package from solver algorithms. This allows one to develop new types of analysis without requiring the implementation of analysis-specific device models. • Device models that are specifically tailored to meet Sandia’s needs, including some radiation-aware devices (for Sandia users only). • Object-oriented code design and implementation using modern coding practices. Xyce is a parallel code in the most general sense of the phrase — a message passing parallel implementation — which allows it to run efficiently a wide range of computing platforms. These include serial, shared-memory and distributed-memory parallel platforms. Attention has been paid to the specific nature of circuit-simulation problems to ensure that optimal parallel efficiency is achieved as the number of processors grows.
97 MATHEMATICS AND COMPUTING↗
Distribution of blackouts in the power grid and the Motter and Lai model
Carreras, Dobson, and colleagues have studied empirical data on the sizes of the blackouts in real grids and modeled them with computer simulations using the direct current approximation. They have found that the resulting blackout sizes are distributed as a power law and suggested that this is because the grids are driven to the self-organized critical state. In contrast, more recent studies found that the distribution of cascades is bimodal resulting in either a very small blackout or a very large blackout, engulfing a finite fraction of the system. Here we reconcile the two approaches and investigate how the distribution of the blackouts changes with model parameters, including the tolerance criteria and the dynamic rules of failure of the overloaded lines during the cascade. Finally, we study the same problem for the Motter and Lai model and find similar results, suggesting that the physical laws of flow on the network are not as important as network topology, overload conditions, and dynamic rules of failure.
24 POWER TRANSMISSION AND DISTRIBUTION↗
COVID19 Disease Map, a computational knowledge repository of virus–host interaction mechanisms
We need to effectively combine the knowledge from surging literature with complex datasets to propose mechanistic models of SARS-CoV-2 infection, improving data interpretation and predicting key targets of intervention. Here, we describe a large-scale community effort to build an open access, interoperable and computable repository of COVID-19 molecular mechanisms. The COVID-19 Disease Map (C19DMap) is a graphical, interactive representation of disease-relevant molecular mechanisms linking many knowledge sources. Notably, it is a computational resource for graph-based analyses and disease modelling. To this end, we established a framework of tools, platforms and guidelines necessary for a multifaceted community of biocurators, domain experts, bioinformaticians and computational biologists. The diagrams of the C19DMap, curated from the literature, are integrated with relevant interaction and text mining databases. We demonstrate the application of network analysis and modelling approaches by concrete examples to highlight new testable hypotheses. This framework helps to find signatures of SARS-CoV-2 predisposition, treatment response or prioritisation of drug candidates. Such an approach may help deal with new waves of COVID-19 or similar pandemics in the long-term perspective.
59 BASIC BIOLOGICAL SCIENCES↗
Multi-Agent Control of Lane-Switching Automated Vehicles for Energy Efficiency
The proliferation of automatic control systems and their connectivity accents the performance of their interactions. In particular, connected and automated vehicles could become high-impact examples thanks to their energy use and productivity effects. Ideally, a controller might collectively optimize all agents' control moves for a given objective. However, limits on computational complexity, incomplete knowledge of the central planner, and risks of a single point of failure make distributed control attractive as well. This paper proposes a collaborative heuristic to approach the performance of centralized control with decentralized-like computational effort. The related centralized controller is also described in detail and evaluated as a baseline. A collaboration-intensive obstacle avoidance scenario involving electric vehicles is simulated to demonstrate benefits over fully decentralized control. While centralized optimization performed best with an 8.6 % energy reduction, the collaborative decentralized scheme reached a favorable computation-performance tradeoff with a 6.7 % energy reduction.
Dollar, R. Austin↗
Optimizing Distributed Training on Frontier for Large Language Models
Large language models (LLMs) have demonstrated remarkable success as foundational models, benefiting various downstream applications through fine-tuning. Loss scaling studies have demonstrated the superior performance of larger LLMs compared to their smaller counterparts. Nevertheless, training LLMs with billions of parameters poses significant challenges and requires considerable computational resources. For example, training a one trillion parameter GPT-style model on 20 trillion tokens requires a staggering 120 million exaflops. This research explores efficient distributed training strategies to extract this computation from Frontier, the world's first exascale supercomputer. We enable and investigate various model and data parallel training techniques, such as tensor parallelism, pipeline parallelism, and sharded data parallelism, to facilitate training a trillion-parameter model on Frontier. We empirically assess these techniques and their associated parameters to determine their impact on memory footprint, communication latency, and GPU's computational efficiency. We analyze the complex interplay among these techniques and find a strategy to combine them to achieve high throughput through hyperparameter tuning. We have identified efficient strategies for training large LLMs of varying sizes through empirical analysis and hyperparameter tuning. For 22 Billion, 175 Billion, and 1 Trillion parameters, we achieved GPU throughputs of 38.38%, 36.14%, and 31.96%, respectively. For the training of the 175 Billion parameter model and the 1 Trillion parameter model, we achieved 100% weak scaling efficiency on 1024 and 3072 Mi250X GPUs, respectively. We also achieved strong scaling efficiencies of 89% and 87% for these two models. We trained these models only tens of iterations instead of training till completion.
Yin, Junqi↗
Dark Radiation Constraints on Heavy QCD Axions
The naturalness problem of PQ symmetry motivates study of the heavy QCD axion, with masses m a > 1 MeV generated at scales above the QCD scale, and low values of the PQ symmetry breaking scale, ƒ a . We compute the abundance of such axions in a model-independent way, assuming only that they freeze-out after reheating from inflation, and are not subsequently diluted by new physics. If these axions decay between neutrino decoupling and the last scatter era of the Cosmic Microwave Background (CMB), they dilute the neutrinos and their abundance is constrained by CMB measurements of the energy density in dark radiation, N eff . We accurately compute this bound using a numerical code to evolve the axion momentum distribution, including many key processes and effects previously ignored. We assume that the only relevant axion decays are to final states involving Standard Model particles. We determine regions of (m a , ƒ a ) that will give a signal in N eff at CMB Stage 4 experiments. We similarly compute the N eff bound and CMB Stage 4 signal for heavy axions that can decay to light mirror photons. Finally, we compute the bounds on heavy axions with mass below 1 MeV that decay after the era of CMB last scatter, from their contribution to cold or hot dark matter or N eff at this era.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
D2ABS: A Framework for Dynamic Dependence Analysis of Distributed Programs
Not provided.
Computer Science↗
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↗
ScaWL: Scaling k-WL (Weisfeiler-Lehman) Algorithms in Memory and Performance on Shared and Distributed-Memory Systems
The k-dimensional Weisfeiler-Lehman (k-WL) algorithm—developed as an efficient heuristic for testing if two graphs are isomorphic—is a fundamental kernel for node embedding in the emerging field of graph neural networks. Unfortunately, the k-WL algorithm has exponential storage requirements, limiting the size of graphs that can be handled. This work presents a novel k-WL scheme with a storage requirement orders of magnitude lower while maintaining the same accuracy as the original k-WL algorithm. Due to the reduced storage requirement, our scheme allows for processing much bigger graphs than previously possible on a single compute node. For even bigger graphs, we provide the first distributed-memory implementation. Our k-WL scheme also has significantly reduced communication volume and offers high scalability. Our experimental results demonstrate that our approach is significantly faster and has superior scalability compared to five other implementations employing state-of-the-art techniques.
algorithims↗
HydraGNN_Predictive_GFM_2024 - Ensemble of predictive graph foundation models for ground state atomistic materials modeling
We provide the ensemble of fifteen pre-trained graph foundation models (GFMs) for atomistic materials modeling applications. Each one of the fifteen GFMs has been trained on five open-source datasets that (once aggregated) amount to over 154 million atomistic structures, which cover over two-thirds of the natural elements of the periodic table and that comprises a broad set of organic and inorganic compounds. This vast set of atomistic structures comprises ground state configurations that are dynamically stable (i.e., equilibrated structures with atomic forces approximately close to zero values) as well as dynamically unstable structures (i.e., non-equilibrium structures with non-negligible non-zero values of atomic forces). The ensemble of datasets aggregated does NOT include excited states. The datasets have been curated to remove atomistic structures with spectral norm of the force tensor above 100 eV/angstrom. Moreover, a linear term of the energy was computed for each dataset using a linear regression model that uses the chemical concentration of each natural element as regressor. The linear term predicted by the linear regression model has been subtracted from each original energy value to perform a re-alignment of the energy values across different electronic structures approximation theories performed to generate the diverse multi-source, multi-fidelity datasets. The folder "ADIOS_files" contains the set of pre-processed datasets in Adaptable I/O System (ADIOS) format (https://www.exascaleproject.org/research-project/adios/) that have been used for the development and training of GFMs in this work. The "ADIOS_files" directory contains 6 sub-directories named as follows: - ANI1x-v3.bp - MPTrj-v3.bp - OC2020-20M-v3.bp - OC2020-v3.bp - OC2022-v3.bp - qm7x-v3.bp Each sub-directory contains the pre-processed datasets converted in Adaptable I/O System (ADIOS) format (https://www.exascaleproject.org/research-project/adios/) that have been used to the development, training, and performance testing of the ensemble go predictive graph foundation models. Each GFM was developed using HydraGNN (https://github.com/ORNL/HydraGNN) as underlying graph neural network (GNN) architecture. The multi-task learning (MTL) capability of HydraGNN was used to simultaneously train the GFMs on labeled values for direct predictions of energy (a total system property of an atomistic structure that measures the chemical stability) and atomic forces (an atomic level property of an atomistic structure that measures the dynamical stability). The hyper parameters of the GFM have been tuned using scalable hyperparameter optimization (HPO) algorithms implemented in the software DeepHyper (https://github.com/deephyper/deephyper). The pre-training of each HPO trial was performed using distributed data parallelism (DDP) to scale the training across 128 compute nodes of the exascale OLCF supercomputer Frontier. Each HPO trial was trained only for 10 epochs and an early stopping was performed to avoid wasting significant computational resources on GNN architectures that were clearly underperforming. For each HPO trial, the 'omnistat' tool developed by (AMD Research - Advanced Micro Device) was used to measure the total energy consumption in kWh. The ensemble of GFMs was obtained by selecting the fifteen best performing HPO trials. Four models have been selected for their clear advantage in accuracy, and these are the GFMs with IDs 229, 156, 147, 260. Additional eleven models have been selected based on judicious balance between accuracy and energy consumption needed for training, and these are the GFMs with IDs 165, 78, 137, 1, 175, 171, 181, 67, 179, 167, 351. Each selected GFM of the ensemble was continued to cumulate a total of at most 30 epochs. In some cases, the total number of epochs actually performed was les than 30 due to two combined factors: (1) the size of the GFM (i.e., the number of model parameters to train) and (2) the total wall-clock time for which the computational resources could be allocated on OLCF-Frontier. The "Ensemble_of_models" directory contains 15 sub-directories named as follows: - gfm_0.229 - gfm_0.156 - gfm_0.147 - gfm_0.260 - gfm_0.165 - gfm_0.78 - gfm_0.137 - gfm_0.1 - gfm_0.175 - gfm_0.171 - gfm_0.181 - gfm_0.67 - gfm_0.179 - gfm_0.167 - gfm_0.351 Each one of these sub-directories refers to one of the fifteen HPO trials that have been selected to continue the pre-training with at most 30 epochs. With each sub-directory associated with a specific HPO trial, the following files can be found: - config.json: file for argument parsing to develop and train an HydraGNN architecture - gfm_0.ID_epoch_N.pk: file with model parameters for HPO ID trial after N epochs of training The ensemble of fifteen GFM architectures was used for (1) ensemble averaging to stabilize the predictions of energy and atomic forces after pre-training for post-processing analysis and (2) ensemble uncertainty quantification (UQ). The code used to develop, pre-train, and load the pre-trained models for post-processing analysis is available on the ORNL-GitHub at the following link: https://github.com/ORNL/HydraGNN/tree/Predictive_GFM_2024
36 MATERIALS SCIENCE↗
Surrogate Model for Distribution Networks Influenced by Weather
Here, we propose a method for generating reduced representations of time series and for constructing low dimensional surrogate models for time dependent calculations of power and voltage in distribution networks. We employ Fourier polynomials. The surrogate model strategy is aimed at reducing the computational cost of time dependent simulations, albeit, at the expense of fidelity. The reduced representation is achieved by identifying a small and most consequential subset of degrees of freedom. In power and voltage distribution networks dynamics that are heavily influenced by strong cyclic weather events, e.g., the hourly, diurnal and seasonal cycles, the weather/climate time series spectrum exposes these most energetic components. Once the degrees of freedom are identified their amplitudes are optimized using training data. The key challenge in using spectral methods in power network surrogates is addressing the computation of quotients. For this we propose a numerically-stable deconvolution strategy.
Weather events↗
Variable Precision Computing (VPC) (Final Report)
The overall goal of the Variable Precision Computing project is exploring and identifying ways to reduce internodal communication cost in production physics simulation experiments running on a distributed-memory systems by compressing data, either in a lossy or lossless way, thus resulting in a significant computational performance increase. Among the several approaches proposed, the one discussed here has been proposed, designed and implemented by me. It concerns the application of information theory-derived metrics to classical molecular dynamics and computational fluid dynamics simulation experiments.
97 MATHEMATICS AND COMPUTING↗
A Computationally Efficient Linear Semi-Lagrangian Scheme for the Advection of Microphysical Variables in Cloud-Resolving Models
An efficient semi-Lagrangian (SL) numerical scheme for the advection of positive-definite microphysical variables in cloud-resolving models is proposed. The scheme is a linear combination of SL schemes of the first and second order. The proposed scheme is compared with two high-order, monotonic, nonlinear Eulerian schemes, in two 2D tests. In the first test, advection of a positive scalar field with large gradients is performed within complicated idealized steering flows. In the second test, a hail storm is simulated using the 2D Hebrew University Cloud Model, describing the interactions between 15 size distributions of different microphysical quantities (each distribution is described by 43 mass bins). The proposed scheme is computationally efficient, has a low numerical diffusion and a high level of mass conservation accuracy, and preserves the sum of multiple advected variables as well as the linear relationships between the advected scalar variables. Although the proposed SL scheme is not exactly positive definite, the negative values and their number, which may appear only in the case of very strong gradients, are negligible. The scheme produces results similar to those of nonlinear Eulerian advection schemes while reducing computation time by approximately a factor of 10.
54 ENVIRONMENTAL SCIENCES↗