Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed algorithm”

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 1,297 records · Page 72

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↗

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↗

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↗

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, Brian Van↗

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↗

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↗

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↗

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↗

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↗

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↗

Joint Management and Optimization of Residential Natural Gas and Electricity Distribution Networks Coupled via Fuel Cells

The attractive features of natural gas as well as the growing electric power demand worldwide have created increasing interest in natural-gas-based distributed generation applications for electric distribution networks. Here, this paper investigates the interdependency between a residential natural gas network and an electric distribution network that are linked together via fuel cells. The modeling of the natural gas network is introduced first, and then the algorithm for gas flow study is presented. The optimal placement and sizing of fuel cell based distributed generation systems are formulated to minimize the losses in both the natural gas network and the electric distribution grid, subject to the constraints imposed by both networks. In addition, a probabilistic model for both gas and electricity demands is developed based on historical electricity and natural gas demand data. A K-means clustering method is used to determine the hourly load states to solve the joint probabilistic optimization problem. Simulation studies are carried out on an integrated system consisting of the IEEE 69-bus distribution network and a radial 27-node natural gas network to verify the developed optimization model and the proposed method.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Assessment of interpatient heterogeneity in tumor radiosensitivity for nonsmall cell lung cancer using tumor-volume variation data

Purpose: In our previous work, the authors showed that a distribution of cell surviving fractionsS{sub 2} in a heterogeneous group of patients could be derived from tumor-volume variation curves during radiotherapy for head and neck cancer. In this research study, the authors show that this algorithm can be applied to other tumors, specifically in nonsmall cell lung cancer. This new application includes larger patient volumes and includes comparison of data sets obtained at independent institutions. Methods: Our analysis was based on two data sets of tumor-volume variation curves for heterogeneous groups of 17 patients treated for nonsmall cell lung cancer with conventional dose fractionation. The data sets were obtained previously at two independent institutions by using megavoltage computed tomography. Statistical distributions of cell surviving fractionsS{sub 2} and clearance half-lives of lethally damaged cells T{sub 1/2} have been reconstructed in each patient group by using a version of the two-level cell population model of tumor response and a simulated annealing algorithm. The reconstructed statistical distributions of the cell surviving fractions have been compared to the distributions measured using predictive assays in vitro. Results: Nonsmall cell lung cancer presents certain difficulties for modeling surviving fractions using tumor-volume variation curves because of relatively large fractional hypoxic volume, low gradient of tumor-volume response, and possible uncertainties due to breathing motion. Despite these difficulties, cell surviving fractionsS{sub 2} for nonsmall cell lung cancer derived from tumor-volume variation measured at different institutions have similar probability density functions (PDFs) with mean values of 0.30 and 0.43 and standard deviations of 0.13 and 0.18, respectively. The PDFs for cell surviving fractions S{sub 2} reconstructed from tumor volume variation agree with the PDF measured in vitro. Conclusions: The data obtained in this work, when taken together with the data obtained previously for head and neck cancer, suggests that the cell surviving fractionsS{sub 2} can be reconstructed from the tumor volume variation curves measured during radiotherapy with conventional fractionation. The proposed method can be used for treatment evaluation and adaptation.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Sci—Thur PM: Planning and Delivery — 06: Real-Time Interactive Treatment Planning

Purpose: To describe and evaluate a novel system for generalized Real-Time Interactive Planning (RTIP) applied to head and neck (H and N) VMAT. Methods: The clinician interactively manipulates dose distributions using DVHs, isodoses, or rate of dose fall-off, which may be subjected to user-defined constraints. Dose is calculated using a fast Achievable Dose Estimate (ADE) algorithm, which simulates the limits of what can be achieved during treatment. After each manipulation contributing fluence elements are modified and the dose distribution updates in effectively real-time. For H and N VMAT planning, structure sets for 11 patients were imported into RTIP. Each dose distribution was interactively modified to minimize OAR dose while constraining target DVHs. The resulting RTIP DVHs were transferred to the Eclipse™ VMAT optimizer, and conventional VMAT optimization was performed. Results: Dose calculation and update times for the ADE algorithm ranged from 2.4 to 22.6 milliseconds, thus facilitating effectively real-time manipulation of dose distributions. For each of the 11 H and N VMAT cases, the RTIP process took ∼2–10 minutes. All RTIP plans exhibited acceptable PTV coverage, mean dose, and max dose. 10 of 11 RTIP plans achieved substantially improved sparing of one or more OARs without compromising dose to targets or other OARs. Importantly, 10 of the 11 RTIP plans required only one or two post-RTIP optimizations. Conclusions: RTIP is a novel system for manipulating and updating achievable dose distributions in real-time. H and N VMAT plans generated using RTIP demonstrate improved OAR sparing and planning efficiency. Disclosures: One author has a commercial interest in the presented materials.

60 APPLIED LIFE SCIENCES↗

Renewable energy integration and system operation challenge: control and optimization of millions of devices

The electric power infrastructure, originally designed and built on large-scale power plants, is evolving into a more resilient power generation and delivery system in which millions of smaller units of distributed energy generation resources units will be installed in sub-transmission and distribution networks. In order to control, manage and optimize the future grid, a hierarchical design is presented in this chapter which enables the distributed control on grid edge while inheriting the existing centralized control structure. This layered design of large-scale power system operation and control uses the following principle: reactive power control is treated as a primary control for voltage stability, and the real power control is primarily a grid-level control but can also be a supplementary control for voltage support in the case of insufficient reactive power control capacity. For the purpose of active control and operation at the distribution level, a recursive power network model is derived from nodal injection and branch power flow models. Based on the model, the proposed algorithms of hierarchical control, grid-edge inference and dynamic hosting allowance are developed and presented for multi-level controlled operation. And, a co-simulation architecture of integrated T&D system is presented to validate and demonstrate the feasibility and scalability of proposed algorithms.

Xu, Ying↗

Parallel Implementation of Nonadditive Gaussian Process Potentials for Monte Carlo Simulations

A strategy is presented to implement Gaussian process potentials in molecular simulations through parallel programming. Attention is focused on the three-body nonadditive energy, though all algorithms extend straightforwardly to the additive energy. The method to distribute pairs and triplets between processes is general to all potentials. Results are presented for a simulation box of argon, including full box and atom displacement calculations, which are relevant to Monte Carlo simulation. Data on speed-up are presented for up to 120 processes across four nodes. A 4-fold speed-up is observed over five processes, extending to 20-fold over 40 processes and 30-fold over 120 processes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Stochastic derivative-free optimization using a trust region framework

This study presents a trust region algorithm to minimize a function f when one has access only to noise-corrupted function values f¯. The model-based algorithm dynamically adjusts its step length, taking larger steps when the model and function agree and smaller steps when the model is less accurate. The method does not require the user to specify a fixed pattern of points used to build local models and does not repeatedly sample points. If f is sufficiently smooth and the noise is independent and identically distributed with mean zero and finite variance, we prove that our algorithm produces iterates such that the corresponding function gradients converge in probability to zero. As a result, we present a prototype of our algorithm that, while simplistic in its management of previously evaluated points, solves benchmark problems in fewer function evaluations than do existing stochastic approximation methods.

97 MATHEMATICS AND COMPUTING↗

Integrated Models for Electrical Distribution Network Planning and District-Scale Building Energy Use

The increase of greenhouse emissions caused by a rise in global energy consumption is pushing the scientific community to develop tools that address key environmental, techno-economic and social issues. One specific area of focus is to create tools that enable the design of high-performance energy districts, including grid-interactive efficient buildings and electrical distribution infrastructure. This paper outlines the approach of integrating a synthetic distribution network tool (RNM-US) with URBANopt™, a modular and customizable software development kit for thermal and electrical modelling of buildings and energy systems at a district scale. First, we describe the algorithms implemented to integrate RNM-US with URBANopt to automatically generate the distribution network for the district considered. Following, we present a case study for the potential uses of the RNM-US integrations with URBANopt, highlighting the capabilities for economic and technical analysis of the distribution network built in relation to the electricity needs of the modelled buildings.

30 DIRECT ENERGY CONVERSION↗

Unified Communication Optimization Strategies for Sparse Triangular Solver on CPU and GPU Clusters

This paper presents a unified communication optimization framework for sparse triangular solve (SpTRSV) algorithms on CPU and GPU clusters. The framework builds upon a 3D communication-avoiding (CA) layout of Px × Py × Pz processes that divides a sparse matrix into Pz submatrices, each handled by a Px × Py 2D grid with block-cyclic distribution. We propose three communication optimization strategies: First, a new 3D SpTRSV algorithm is developed, which trades the inter-grid communication and synchronization with replicated computation. This design requires only one inter-grid synchronization, and the inter-grid communication is efficiently implemented with sparse allreduce operations. Second, broadcast and reduction communication trees are used to reduce message latency of the intra-grid 2D communication on CPU clusters. Finally, we leverage GPU-initiated one-sided communication to implement the communication trees on GPU clusters. With these nested inter- and intra-grid communication optimization strategies, the proposed 3D SpTRSV algorithm can attain up to 3.45x speedups compared to the baseline 3D SpTRSV algorithm using up to 2048 Cori Haswell CPU cores. In addition, the proposed GPU 3D SpTRSV algorithm can achieve up to 6.5x speedups compared to the proposed CPU 3D SpTRSV algorithm with Pz up to 64. Finally it is remarkable that the proposed GPU 3D SpTRSV can scale to 256 GPUs using the Perlmutter system while the existing 2D SpTRSV algorithm can only scale up to 4 GPUs.

Sao, Piyush↗