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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,171 records · Page 65

All sources NASA NTRS DOE OSTI

DOE OSTI2020

A Hybrid-Learning Algorithm for Online Dynamic State Estimation in Multimachine Power Systems

With the increasing penetration of distributed generators in the smart grids, having knowledge of rapid real-time electromechanical dynamic states has become crucial to system stability control. Conventional Supervisory Control and Data Acquisition (SCADA)-based dynamic state estimation (DSE) techniques are limited by the slow sampling rates, while the emerging phasor measurement units (PMUs) technology enables rapid real-time measurements at network nodes. Using generator bus terminal voltages, we propose a hybrid-learning DSE (HL-DSE) algorithm to estimate the synchronous machine rotor angle and speed in real time. The HL-DSE takes the power system model into account and trains neuroestimators with real-time data in an online manner. Compared with traditional DSE methods, the HL-DSE overcomes limitations by using a data-driven approach in conjunction with the physical power system model. The time efficiency, accuracy, convergence, and robustness of the proposed algorithm are tested under noises and fault conditions in both small- and large-scale test systems. Simulation results show that the proposed HL-DSE is much more computationally efficient than widely used Kalman filter (KF)-based methods while maintaining comparable accuracy and robustness. In particular, HL-DSE is over 100 times faster than square-root unscented KF (SR-UKF) and 80 times faster than extended KF (EKF). The advantages and challenges of the HL-DSE are also discussed.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2016

Are Lock-Free Concurrent Algorithms Practically Wait-Free?

Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make progress. Unfortunately, designing wait-free algorithms is generally a very complex task, and the resulting algorithms are not always efficient. Although obtaining efficient wait-free algorithms has been a long-time goal for the theory community, most nonblocking commercial code is only lock-free. This article suggests a simple solution to this problem. We show that for a large class of lock-free algorithms, under scheduling conditions that approximate those found in commercial hardware architectures, lock-free algorithms behave as if they are wait-free. In other words, programmers can continue to design simple lock-free algorithms instead of complex wait-free ones, and in practice, they will get wait-free progress. Our main contribution is a new way of analyzing a general class of lock-free algorithms under a stochastic scheduler. Our analysis relates the individual performance of processes to the global performance of the system using Markov chain lifting between a complex per-process chain and a simpler system progress chain. We show that lock-free algorithms are not only wait-free with probability 1 but that in fact a general subset of lock-free algorithms can be closely bounded in terms of the average number of steps required until an operation completes. Here, to the best of our knowledge, this is the first attempt to analyze progress conditions, typically stated in relation to a worst-case adversary, in a stochastic model capturing their expected asymptotic behavior.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2014

redMaPPer. I. Algorithm and SDSS DR8 catalog

We describe redMaPPer, a new red sequence cluster finder specifically designed to make optimal use of ongoing and near-future large photometric surveys. The algorithm has multiple attractive features: (1) it can iteratively self-train the red sequence model based on a minimal spectroscopic training sample, an important feature for high-redshift surveys. (2) It can handle complex masks with varying depth. (3) It produces cluster-appropriate random points to enable large-scale structure studies. (4) All clusters are assigned a full redshift probability distribution P(z). (5) Similarly, clusters can have multiple candidate central galaxies, each with corresponding centering probabilities. (6) The algorithm is parallel and numerically efficient: it can run a Dark Energy Survey-like catalog in ∼500 CPU hours. (7) The algorithm exhibits excellent photometric redshift performance, the richness estimates are tightly correlated with external mass proxies, and the completeness and purity of the corresponding catalogs are superb. We apply the redMaPPer algorithm to ∼10, 000 deg{sup 2} of SDSS DR8 data and present the resulting catalog of ∼25,000 clusters over the redshift range z in [0.08, 0.55]. The redMaPPer photometric redshifts are nearly Gaussian, with a scatter σ {sub z} ≈ 0.006 at z ≈ 0.1, increasing to σ {sub z} ≈ 0.02 at z ≈ 0.5 due to increased photometric noise near the survey limit. The median value for |Δz|/(1 + z) for the full sample is 0.006. The incidence of projection effects is low (≤5%). Detailed performance comparisons of the redMaPPer DR8 cluster catalog to X-ray and Sunyaev-Zel'dovich catalogs are presented in a companion paper.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2015

SDSS-III Baryon Oscillation Spectroscopic Survey data release 12: Galaxy target selection and large-scale structure catalogues

The Baryon Oscillation Spectroscopic Survey (BOSS), part of the Sloan Digital Sky Survey (SDSS) III project, has provided the largest survey of galaxy redshifts available to date, in terms of both the number of galaxy redshifts measured by a single survey, and the effective cosmological volume covered. Key to analysing the clustering of these data to provide cosmological measurements is understanding the detailed properties of this sample. Potential issues include variations in the target catalogue caused by changes either in the targeting algorithm or properties of the data used, the pattern of spectroscopic observations, the spatial distribution of targets for which redshifts were not obtained, and variations in the target sky density due to observational systematics. We document here the target selection algorithms used to create the galaxy samples that comprise BOSS. We also present the algorithms used to create large-scale structure catalogues for the final Data Release (DR12) samples and the associated random catalogues that quantify the survey mask. The algorithms are an evolution of those used by the BOSS team to construct catalogues from earlier data, and have been designed to accurately quantify the galaxy sample. Furthermore, the code used, designated mksample, is released with this paper.

(cosmology:) large-scale structure of Universe↗

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 OSTI2015

SU-E-T-805: Verification of the Simplified Monte Carlo Method for Simulation in An Inhomogeneous Phantom

Purpose: A simplified Monte Carlo (SMC) method has been developed to obtain fast and accurate dose calculation in heterogeneous tissues to improve the accuracy of dose calculation. We have applied the SMC method to calculation of dose kernels for the pencil beam scanning. While the SMC method tracks individual primary protons in medium, it simplifies the dose calculation by using a measured depth-dose distribution instead of considering nuclear reactions and tracking secondary particles. To verify the accuracy of SMC calculation, we compared a dose-calculation Result using the SMC method with that using the Full Monte Carlo (FMC) method in an inhomogeneous phantom. Methods: As a model of the inhomogeneous media, we considered a phantom complied of a rectangular acrylic block of size 150*300*200 mm {sup 3} immersed in water within a virtual container with a size of 300*300*400 mm{sup 3}. Results: We found excellent agreement of overall dose distributions between the SMC and FMC methods. As for the laterally integrated depth-dose distributions, slight difference was found in front of the second Bragg-Peak between the two algorithms. While it took 25717.0 s on 2.7 GHz Intel Core i7 for the FMC method to complete the calculation, it took 15.4 s for the SMC method to complete it. The SMC method can calculate the dose distribution approximately 1675 times faster than the FMC method. Conclusion: The dose distribution obtained by SMC method agreed well that obtained by the FMC method in a simple inhomogeneous phantom. In contrast, calculation time by the SMC method has been reduced by three orders in magnitude compared with the FMC method.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2012

Simultaneous usage of pinhole and penumbral apertures for imaging small scale neutron sources from inertial confinement fusion experiments

Inertial confinement fusion experiments at the National Ignition Facility are designed to understand the basic principles of creating self-sustaining fusion reactions by laser driven compression of deuterium-tritium (DT) filled cryogenic plastic capsules. The neutron imaging diagnostic provides information on the distribution of the central fusion reaction region and the surrounding DT fuel by observing neutron images in two different energy bands for primary (13-17 MeV) and down-scattered (6-12 MeV) neutrons. From this, the final shape and size of the compressed capsule can be estimated and the symmetry of the compression can be inferred. These experiments provide small sources with high yield neutron flux. An aperture design that includes an array of pinholes and penumbral apertures has provided the opportunity to image the same source with two different techniques. This allows for an evaluation of these different aperture designs and reconstruction algorithms.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

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 OSTI2012

Is it sensible to 'deform' dose? 3D experimental validation of dose-warping

Purpose: Strategies for dose accumulation in deforming anatomy are of interest in radiotherapy. Algorithms exist for the deformation of dose based on patient image sets, though these are sometimes contentious because not all such image calculations are constrained by physical laws. While tumor and organ motion has been a key area of study for a considerable amount of time, deformation is of increasing interest. In this work, we demonstrate a full 3D experimental validation of results from a range of dose deformation algorithms available in the public domain. Methods: We recently developed the first tissue-equivalent, full 3D deformable dosimetric phantom-'DEFGEL.' To assess the accuracy of dose-warping based on deformable image registration (DIR), we have measured doses in undeformed and deformed states of the DEFGEL dosimeter and compared these to planned doses and warped doses. In this way we have directly evaluated the accuracy of dose-warping calculations for 11 different algorithms. We have done this for a range of stereotactic irradiation schemes and types and magnitudes of deformation. Results: The original Horn and Schunck algorithm is shown to be the best performing of the 11 algorithms trialled. Comparing measured and dose-warped calculations for this method, it is found that for a 10 Multiplication-Sign 10 mm{sup 2} square field, {gamma}{sub 3%/3mm}= 99.9%; for a 20 Multiplication-Sign 20 mm{sup 2} cross-shaped field, {gamma}{sub 3%/3mm}= 99.1%; and for a multiple dynamic arc (0.413 cm{sup 3} PTV) treatment adapted from a patient treatment plan, {gamma}{sub 3%/3mm}= 95%. In each case, the agreement is comparable to-but consistently {approx}1% less than-comparison between measured and calculated (planned) dose distributions in the absence of deformation. The magnitude of the deformation, as measured by the largest displacement experienced by any voxel in the volume, has the greatest influence on the accuracy of the warped dose distribution. Considering the square field case, the smallest deformation ({approx}9 mm) yields agreement of {gamma}{sub 3%/3mm}= 99.9%, while the most significant deformation ({approx}20 mm) yields agreement of {gamma}{sub 3%/3mm}= 96.7%. Conclusions: We have confirmed that, for a range of mass and density conserving deformations representative of those observable in anatomical targets, DIR-based dose-warping can yield accurate predictions of the dose distribution. Substantial differences can be seen between the results of different algorithms indicating that DIR performance should be scrutinized before application todose-warping. We have demonstrated that the DEFGEL deformable dosimeter can be used to evaluate DIR performance and the accuracy of dose-warping results by direct measurement.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2016

Livermore Big Artificial Neural Network Toolkit

LBANN is a toolkit that is designed to train artificial neural networks efficiently on high performance computing architectures. It is optimized to take advantages of key High Performance Computing features to accelerate neural network training. Specifically it is optimized for low-latency, high bandwidth interconnects, node-local NVRAM, node-local GPU accelerators, and high bandwidth parallel file systems. It is built on top of the open source Elemental distributed-memory dense and spars-direct linear algebra and optimization library that is released under the BSD license. The algorithms contained within LBANN are drawn from the academic literature and implemented to work within a distributed-memory framework.

Essen, BrianVan↗

DOE OSTI2016

Livermore Big Artificial Neural Network Toolkit

Essen, Brian Van↗

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 OSTI2021

Joint impedance and facies inversion of time-lapse seismic data for improving monitoring of CO 2 incidentally stored from CO 2 EOR

Time-lapse seismic monitoring is an effective and proven technology for mapping the distribution of CO 2 in a subsurface reservoir. When injected CO 2 displaces other reservoir fluids, porous-medium properties are changed and thus the seismic impedance changes, causing time-lapse seismic amplitude differences in the injection zones. The analysis and interpretation of images created from these amplitude differences can provide information about reservoir architecture and the CO 2 migration within the reservoir. Incorporating seismic inversion and rock physics into the interpretation of time-lapse seismic data can considerably improve the modeling and monitoring to detect and assess the location of CO 2 over time. The joint inversion method presented in this paper has an integral representation of the geology in the inversion algorithm using elastic facies, which provides information about the spatial distribution of the geologic heterogeneities controlling the movement of fluids in the reservoir. The method was successfully applied to time-lapse seismic data from a mature oil field undergoing CO 2 enhanced oil recovery. The estimated seismic acoustic impedances and facies reflect the characteristics of individual geologic facies and fluid conditions of the reservoir subject to CO 2 injection. Finally, the probabilities estimated by the joint impedance and facies inversion for the reservoir's litho-fluid facies can be used for forecasting CO 2 saturation and pressure changes within the target reservoir.

4D seismic↗

DOE OSTI2013

On Eliminating Synchronous Communication in Molecular Simulations to Improve Scalability

Molecular dynamics simulation, as a complementary tool to experimentation, has become an important methodology for the understanding and design of molecular systems as it provides access to properties that are difficult, impossible or prohibitively expensive to obtain experimentally. Many of the available software packages have been parallelized to take advantage of modern massively concurrent processing resources. The challenge in achieving parallel efficiency is commonly attributed to the fact that molecular dynamics algorithms are communication intensive. This paper illustrates how an appropriately chosen data distribution and asynchronous one-sided communication approach can be used to effectively deal with the data movement within the Global Arrays/ARMCI programming model framework. A new put_notify capability is presented here, allowing the implementation of the molecular dynamics algorithm without any explicit global or local synchronization or global data reduction operations. In addition, this push-data model is shown to very effectively allow hiding data communication behind computation. Rather than data movement or explicit global reductions, the implicit synchronization of the algorithm becomes the primary challenge for scalability. Without any explicit synchronous operations, the scalability of molecular simulations is shown to depend only on the ability to evenly balance computational load.

Straatsma, TP↗

DOE OSTI2023

Distribution System Model Calibration for GMLC 3.3.3 "Incipient Failure Identification for Common Grid Asset Classes" - Project Summary

Distribution system model calibration is a key enabling task for incipient failure identification within the distribution system. This report summarizes the work and publications by Sandia National Laboratories on the GMLC project titled “Incipient Failure Identification for Common Grid Asset Classes”. This project was a joint effort between Sandia National Laboratories, Lawrence Livermore National Laboratory, National Energy Technology Laboratory, and Oak Ridge National Laboratory. The included work covers distribution system topology identification, transformer groupings, phase identification, regulator and tap position estimation, and the open-source release and implementation of the developed algorithms.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2018

Identification of mixed sources with an organic scintillator-based radiation portal monitor

We have developed radionuclide identification algorithms for radiation portal monitor applications. One algorithm uses a spectral angle mapper to match the power spectral density of modified cumulative distribution functions of measured pulse height distributions to reference spectra, while the others rely on the decomposition of the observed spectrum as a linear mixture of known radionuclide spectra. Three algorithms were then tested for their ability to perform on-the-fly radionuclide identification on datasets acquired with a liquid organic scintillator-based pedestrian radiation portal monitor on moving special nuclear material and industrial radiological sources, as well as common medical isotopes. We quantified and compared the relative efficacies of the algorithms considered using F-score analysis. Measured radiation sources included 51 g of highly enriched uranium, 6.6 g of weapons grade plutonium, 241 Am, 133 Ba, 57 Co and 137 Cs sources with activities of several hundred kBq, as well as 260 kBq liquid solution samples of the medical isotopes 99m Tc, 111 In, 67 Ga, 123 I, 131 I, and 201 Tl. We achieved 100% positive identification, for three-second measurements of single sources moving at a source-transit speed of 1.2 m/s. For mixed sources with strongest and weakest sources having no more than a 5:1 ratio of detected counts, encouraging positive identification results were achieved with the un-mixing algorithms. Current radiation portal monitor designs suffer from a high incidence rate of nuisance radiation alarms caused in radiation portal monitor primary screenings by recent nuclear medicine patients and cargo containing large amounts of naturally occurring radioactive materials. Integrating reliable on-the-fly radionuclide identification into the radiation portal monitors could lower the number of nuisance alarms requiring time-consuming secondary inspections.

47 OTHER INSTRUMENTATION↗

DOE OSTI2012

Implementing Molecular Dynamics on Hybrid High Performance Computers - Particle-Particle Particle-Mesh

The use of accelerators such as graphics processing units (GPUs) has become popular in scientific computing applications due to their low cost, impressive floating-point capabilities, high memory bandwidth, and low electrical power requirements. Hybrid high-performance computers, machines with nodes containing more than one type of floating-point processor (e.g. CPU and GPU), are now becoming more prevalent due to these advantages. In this paper, we present a continuation of previous work implementing algorithms for using accelerators into the LAMMPS molecular dynamics software for distributed memory parallel hybrid machines. In our previous work, we focused on acceleration for short-range models with an approach intended to harness the processing power of both the accelerator and (multi-core) CPUs. To augment the existing implementations, we present an efficient implementation of long-range electrostatic force calculation for molecular dynamics. Specifically, we present an implementation of the particle-particle particle-mesh method based on the work by Harvey and De Fabritiis. We present benchmark results on the Keeneland InfiniBand GPU cluster. We provide a performance comparison of the same kernels compiled with both CUDA and OpenCL. We discuss limitations to parallel efficiency and future directions for improving performance on hybrid or heterogeneous computers.

97 MATHEMATICS AND COMPUTING↗