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 361 records · Page 20

Neural chaos: A spectral stochastic neural operator

Building surrogate models for operators with uncertainty quantification capabilities is essential for many engineering applications where randomness–such as variability in material properties, boundary conditions, and initial conditions–is unavoidable. Polynomial Chaos Expansion (PCE) is widely recognized as a go-to method for constructing stochastic surrogates in both intrusive and non-intrusive ways, and it has recently been used in the context of operator learning. However, its application becomes challenging for complex or high-dimensional processes, as achieving accuracy requires higher-order polynomials, which can increase computational demand and/or the risk of overfitting. Furthermore, PCE requires specialized treatments to manage random variables that are not independent, and these treatments may be problem-dependent or may fail with increasing complexity. Here, in this work, we adopt the same formalism as the spectral expansion used in PCE; however, we replace the classical polynomial basis functions with neural network (NN) basis functions to leverage their expressivity. To achieve this, we propose an algorithm that identifies NN-parameterized basis functions in a purely data-driven manner, without any prior assumptions about the joint distribution of the random variables involved, whether independent or dependent, or about their marginal distributions. The proposed algorithm identifies each NN-parameterized basis function sequentially, ensuring they are orthogonal with respect to the data distribution. The basis functions are constructed directly on the joint stochastic variables without requiring a tensor product structure or assuming independence of the random variables. This approach may offer greater flexibility for complex stochastic models, while simplifying implementation compared to the tensor product structures typically used in PCE to handle random vectors. This is particularly advantageous given the current state of open-source packages, where building and training neural networks can be done with just a few lines of code and extensive community support. We demonstrate the effectiveness of the proposed scheme through several numerical examples of varying complexity and provide comparisons with classical PCE.

Polynomial chaos expansion↗

Networked Microgrids for Self-healing Power Systems

This paper proposes a transformative architecture for the normal operation and self-healing of networked microgrids (MGs). MGs can support and interchange electricity with each other in the proposed infrastructure. The networked MGs are connected by a physical common bus and a designed two-layer cyber communication network. The lower layer is within each MG where the energy management system (EMS) schedules the MG operation; the upper layer links a number of EMSs for global optimization and communication. In the normal operation mode, the objective is to schedule dispatchable distributed generators (DGs), energy storage systems (ESs) and controllable loads to minimize the operation costs and maximize the supply adequacy of each MG. When a generation deficiency or fault happens in a MG, the model switches to the self-healing mode and the local generation capacities of other MGs can be used to support the on-emergency portion of the system. A consensus algorithm is used to distribute portions of the desired power support to each individual MG in a decentralized way. The allocated portion corresponds to each MG’s local power exchange target which is used by its EMS to perform the optimal schedule. The resultant aggregated power output of networked MGs will be used to provide the requested power support. Test cases demonstrate the effectiveness of the proposed methodology.

Consensus Algorithm↗

Decentralized Microgrid Protection Through Relative Fault Direction Classification: Preprint

Protection in inverter-based resources (IBRs) dominated microgrids generally face significant challenges due to the low fault current and inconsistent fault behaviors from IBRs. Recently, machine learning-based approaches have attracted considerable attention to address these challenges. This paper introduces a novel decentralized protection strategy for microgrids. The proposed method decomposes the protection challenge into several distributed learning tasks, enabling individual relays to autonomously determine the direction of faults using a binary classification framework based on support vector machine (SVM) algorithms. Following the distributed fault direction estimation, classifier outcomes are shared among neighboring relays, facilitating a local decision-making process to ascertain the presence of faults within the neighborhood. Finally, a tripping signal is generated based on the classifier results of each relay to operate the circuit breaker. To test and validate this approach, a 100% renewable microgrid model is simulated in MATLAB/Simulink. In the numerical analysis, the application of SVM classifiers in our approach yields impressive results: an average relay classification accuracy of 98%, and a 96% accuracy in circuit breaker control. These findings highlight the potential of machine-learning-based approaches in enhancing the efficiency and reliability of microgrid protection systems.

decentralized algorithm↗

Maximal clique enumeration with data-parallel primitives

The enumeration of all maximal cliques in an undirected graph is a fundamental problem arising in several research areas. We consider maximal clique enumeration on shared-memory, multi-core architectures and introduce an approach consisting entirely of data-parallel operations, in an effort to achieve efficient and portable performance across different architectures. We study the performance of the algorithm via experiments varying over benchmark graphs and architectures. Overall, we observe that our algorithm achieves up to a 33-time speedup and 9-time speedup over state-of-the-art distributed and serial algorithms, respectively, for graphs with higher ratios of maximal cliques to total cliques. Further, we attain additional speedups on a GPU architecture, demonstrating the portable performance of our data-parallel design.

97 MATHEMATICS AND COMPUTING↗

CO component estimation based on the independent component analysis

Fast Independent Component Analysis (FastICA) is a component separation algorithm based on the levels of non-Gaussianity. Here we apply FastICA to the component separation problem of the microwave background, including carbon monoxide (CO) line emissions that are found to contaminate the PLANCK High Frequency Instrument (HFI) data. Specifically, we prepare 100 GHz, 143 GHz, and 217 GHz mock microwave sky maps, which include galactic thermal dust, NANTEN CO line, and the cosmic microwave background (CMB) emissions, and then estimate the independent components based on the kurtosis. We find that FastICA can successfully estimate the CO component as the first independent component in our deflection algorithm because its distribution has the largest degree of non-Gaussianity among the components. Thus, FastICA can be a promising technique to extract CO-like components without prior assumptions about their distributions and frequency dependences.

79 ASTRONOMY AND ASTROPHYSICS↗

Scaling Deep Learning on GPU and Knights Landing clusters

The speed of deep neural networks training has become a big bottleneck of deep learning research and development. For example, training GoogleNet by ImageNet dataset on one Nvidia K20 GPU needs 21 days. To speed up the training process, the current deep learning systems heavily rely on the hardware accelerators. However, these accelerators have limited on-chip memory compared with CPUs. To handle large datasets, they need to fetch data from either CPU memory or remote processors. We use both self-hosted Intel Knights Landing (KNL) clusters and multi-GPU clusters as our target platforms. From an algorithm aspect, current distributed machine learning systems are mainly designed for cloud systems. These methods are asynchronous because of the slow network and high fault-tolerance requirement on cloud systems. We focus on Elastic Averaging SGD (EASGD) to design algorithms for HPC clusters. Original EASGD used round-robin method for communication and updating. The communication is ordered by the machine rank ID, which is inefficient on HPC clusters. First, we redesign four efficient algorithms for HPC systems to improve EASGD's poor scaling on clusters. Async EASGD, Async MEASGD, and Hogwild EASGD are faster \textcolor{black}{than} their existing counterparts (Async SGD, Async MSGD, and Hogwild SGD, resp.) in all the comparisons. Finally, we design Sync EASGD, which ties for the best performance among all the methods while being deterministic. In addition to the algorithmic improvements, we use some system-algorithm codesign techniques to scale up the algorithms. By reducing the percentage of communication from 87% to 14%, our Sync EASGD achieves 5.3x speedup over original EASGD on the same platform. We get 91.5% weak scaling efficiency on 4253 KNL cores, which is higher than the state-of-the-art implementation.

60 APPLIED LIFE SCIENCES↗

Optimization and Control Theory for Smart (Power) Grids [Slides]

The national interest in a broad class of problems loosely characterized as the smart grid is rapidly growing. At its core, the smart grid is the modernization of our existing electric power systems through improvements in efficiency, increased robustness and resiliency, integration of time-variable renewable generation, and reduction of environmental impacts. To date, the focus of most commercial entities has been on development of hardware such as smart meters and green technologies. However, with the exception of a handful of academic researchers, there has been limited research on optimization, control and more broadly, the information science required to effectively utilize this hardware. Our proposal targets development of the basic information science that will effectively bridge this gap. Using our expertise in information theory, network analysis, infrastructure analysis and power engineering, we will develop new algorithms for optimal design of the nation's next generation power transmission and distribution system that address the realities and challenges of the future grid. We focus on three core information science challenges in Grid Design, Grid Control and Grid Stability by considering a set of challenging problems. First, we study efficient and robust integration of geographically widespread renewable generation by solving large, cutting-edge optimization problems that incorporate difficult constraints imposed by the transmission of electrical power. Second, we consider two load balancing problems in the low-voltage distribution grid: development of robust and efficient distributed control techniques and algorithms based on queuing theory. These tools will enable high penetration of small-scale distributed generation and plug-in hybrid vehicles with limited or no communications. We will also develop efficient control algorithms for maintaining an operational distribution grid via switching of redundant lines. Third, we will develop a preventive toolbox capable of detecting instabilities and failures prior to their occurrence. Damaging failures and cascading outages, which can result in billions of dollars worth of damage, have substantial economic consequences. We will focus on estimating the probability of these outages, identifying their signatures and precursors, and developing detection algorithms for alerting the transmission grid operator. The new challenges in IS&T for smart grids require coherent advances in analysis and control, stability and reliability metrics, state estimation, data aggregation and assimilation, and communication middleware for the grid as well as understanding consumer response.

24 POWER TRANSMISSION AND DISTRIBUTION↗

New Results on Communication- and Memory-Aware Load Balancing Model and Algorithms

While load balancing in distributed-memory computing has been well-studied, we present an innovative approach to this problem: a unified, reduced-order model that combines three key components to describe “work” in a distributed system: computation, communication, and memory. Our model enables an optimizer to explore complex tradeoffs in task placement, such as augmented parallelism, at the expense of data replication increasing memory usage. We propose a fully distributed, heuristic-based load balancing optimization algorithm, and demonstrate that it quickly finds close-to-optimal solutions. We formalize the complex optimization problem as a mixed-integer linear program, and compare it to our strategy. Finally, we show that when applied to an electromagnetics code, our approach obtains up to 2.3x speedups for the imbalanced execution.

97 MATHEMATICS AND COMPUTING↗

Topology Reconfiguration and distributed Volt Var Control (TR-dVVC) v1

Topology Reconfiguation is a simple algorithm to choose a network configuration with the least losses in a system with high penetration of renewable energy. It uses a linearized optimal power flow algorithm to identify the optimal setpoints of PV in a system, then performs an exhaustive search of switch configurations to find the loss minimizing solution, it repeats this process until convergence. At the end, the operator has a switch schedule for a 24 hour period that should minimize losses. VVC is a distributed algorithm in which PV units drive voltage at points within the network to 1 per unit through reactive power control. The VVC algorithm relies on extremum seeking control to provide the control. The software package is a simulation of VVC on a standard IEEE 34 bus three phase network.

MacDonald, Jason↗

Π4U: A high performance computing framework for Bayesian uncertainty quantification of complex models

We present Π4U,{sup 1} an extensible framework, for non-intrusive Bayesian Uncertainty Quantification and Propagation (UQ+P) of complex and computationally demanding physical models, that can exploit massively parallel computer architectures. The framework incorporates Laplace asymptotic approximations as well as stochastic algorithms, along with distributed numerical differentiation and task-based parallelism for heterogeneous clusters. Sampling is based on the Transitional Markov Chain Monte Carlo (TMCMC) algorithm and its variants. The optimization tasks associated with the asymptotic approximations are treated via the Covariance Matrix Adaptation Evolution Strategy (CMA-ES). A modified subset simulation method is used for posterior reliability measurements of rare events. The framework accommodates scheduling of multiple physical model evaluations based on an adaptive load balancing library and shows excellent scalability. In addition to the software framework, we also provide guidelines as to the applicability and efficiency of Bayesian tools when applied to computationally demanding physical models. Theoretical and computational developments are demonstrated with applications drawn from molecular dynamics, structural dynamics and granular flow.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Validity of automated x-ray photoelectron spectroscopy algorithm to determine the amount of substance and the depth distribution of atoms

The author reports a systematic study of the range of validity of a previously developed algorithm for automated x-ray photoelectron spectroscopy analysis, which takes into account the variation in both peak intensity and the intensity in the background of inelastically scattered electrons. This test was done by first simulating spectra for the Au4d peak with gold atoms distributed in the form of a wide range of nanostructures, which includes overlayers with varying thickness, a 5 A layer of atoms buried at varying depths and a substrate covered with an overlayer of varying thickness. Next, the algorithm was applied to analyze these spectra. The algorithm determines the number of atoms within the outermost 3 {lambda} of the surface. This amount of substance is denoted AOS{sub 3{lambda}} (where {lambda} is the electron inelastic mean free path). In general the determined AOS{sub 3{lambda}} is found to be accurate to within {approx}10-20% depending on the depth distribution of the atoms. The algorithm also determines a characteristic length L, which was found to give unambiguous information on the depth distribution of the atoms for practically all studied cases. A set of rules for this parameter, which relates the value of L to the depths where the atoms are distributed, was tested, and these rules were found to be generally valid with only a few exceptions. The results were found to be rather independent of the spectral energy range (from 20 to 40 eV below the peak energy) used in the analysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

SU-G-BRC-05: Conundrum for VMAT Cranial Multiple Lesions Treated with HD120 MLC

Purpose: To commission a custom 6MV-SRS-AAA Eclipse beam model for VMAT multiple lesions cranial SRS treatment on a Varian TrueBeam STx. Methods: Six clinical plans were created using a customized beam model with dosimetric-leaf-gap(DLG) optimized for clinical treatments. Each plan had 4–6 non-isocentric targets with size from 0.2 to 7.1cc. All fields were measured with EBT3 film in the coronal plane in a solid water phantom and with an AS1000 EPID using gantry rotation. In addition, an end-to-end test was performed with coronal and sagittal films in an anthropomorphic phantom verifying dosimetry and localization accuracy. Portal dose distributions were generated with a custom portal dosimetry algorithm(PDIP). Measured dose distributions were compared with calculations using average dose difference (DD), and gamma function, γ. Using a 1.25mm grid, the γ criteria, local DD ≤ 3% and 2mm distance-to-agreement, were applied in regions with dose 50% of maximum. Results: The respective DD and γ for all films were <±2% and >94.2%. The portal dose γ scores for all the plans were >94.9%. However, local regions with underdose >10%, were observed when targets were treated with the 5mm leaves. The same plans re-optimized with two isocenters such that all lesions were under the 2.5mm leaves did not show this effect. The DD and localization error of the end-to-end test were within 3.4% and 1.0mm respectively. Conclusion: The custom AAA beam model is capable of calculating acceptable dosimetry for targets using only the 2.5 mm leaves. This restricts lesions to within ±4cm of isocenter. The observed underdose beneath the 5mm leaves is attributed to a limitation in Eclipse that uses a single DLG representing the DLG’s of both 2.5mm and 5mm leaves. If lesions are >4cm from isocenter, a multiple isocenter technique should be considered to allow the use of only the 2.5mm leaves.

60 APPLIED LIFE SCIENCES↗

Double-Crystal Rocking Curve Simulation Using 2D Spectral Angular Diagrams of X-Ray Radiation

A new approach to numerical simulation of double-crystal rocking curves is proposed. This approach is based on the use of experimental spectral angular diagrams of X-ray intensity distribution. Special calculation algorithms, which take into account the instrumental function of X-ray diffractometer and possible effects of dispersion and Bragg reflection asymmetry, have been developed and applied. A specific feature of the proposed approach is the possibility of visualizing the 2D spectral angular diagram of X-ray beam after its interaction with each element of the scheme. The approach makes it possible to perform calculations for a wide range of radiation sources (from an X-ray tube with any anode to a synchrotron radiation source) and X-ray optical elements (slits and monochromators). A comparison of simulation results and experimental data for a Si(110) crystal sample has confirmed adequacy of the proposed approach and its applicability for simulating diffraction patterns recorded in real experiments.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Variable Time-Step Implementation for Rapid Quasi-Static Time-Series (QSTS) Simulations of Distributed PV

Distribution system analysis with high penetrations of distributed PV require quasi-static time-series (QSTS) analysis to model the variability introduced on the distribution system, but current QSTS algorithms are prohibitively burdensome and computationally intensive. This paper proposes a variable timestep algorithm to calculate the critical time periods when QSTS simulations should be solved at higher or lower time-resolution and to backtrack for any critical periods that were missed. This variable time-step solver is a new method of performing timeseries simulations with high accuracy while performing the simulation more than 50 times faster. The scalability of the algorithm is demonstrated using a real utility distribution system model with thousands of buses.

14 SOLAR ENERGY↗

Distributed non-equilibrium Green’s function algorithms for the simulation of nanoelectronic devices with scattering

Through the non-equilibrium Green’s function (NEGF) formalism, quantum-scale device simulation can be performed with the inclusion of electron-phonon scattering. Yet, the simulation of realistically sized devices under the NEGF formalism typically requires prohibitive amounts of memory and computation time. Two of the most demanding computational problems for NEGF simulation involve mathematical operations with structured matrices called semiseparable matrices. In this work, we present parallel approaches for these computational problems which allow for efficient distribution of both memory and computation based upon the underlying device structure. This is vital when simulating realistically sized devices due to the aforementioned computational burdens. First, we consider determining a distributed compact representation for the retarded Green’s function matrix G R . This compact representation is exact and allows for any entry in the matrix to be generated through the inherent semiseparable structure. The second parallel operation allows for the computation of electron density and current characteristics for the device. Specifically, matrix products between the distributed representation for the semiseparable matrix G R and the self-energy scattering terms in Σ < produce the less-than Green’s function G < . As an illustration of the computational efficiency of our approach, we stably generate the mobility for nanowires with cross-sectional sizes as large as 4.5 nm, assuming an atomistic model with scattering.

47 OTHER INSTRUMENTATION↗

SU-E-T-07: 4DCT Robust Optimization for Esophageal Cancer Using Intensity Modulated Proton Therapy

Purpose: To develop a 4DCT robust optimization method to reduce the dosimetric impact from respiratory motion in intensity modulated proton therapy (IMPT) for esophageal cancer. Methods: Four esophageal cancer patients were selected for this study. The different phases of CT from a set of 4DCT were incorporated into the worst-case dose distribution robust optimization algorithm. 4DCT robust treatment plans were designed and compared with the conventional non-robust plans. Result doses were calculated on the average and maximum inhale/exhale phases of 4DCT. Dose volume histogram (DVH) band graphic and ΔD95%, ΔD98%, ΔD5%, ΔD2% of CTV between different phases were used to evaluate the robustness of the plans. Results: Compare to the IMPT plans optimized using conventional methods, the 4DCT robust IMPT plans can achieve the same quality in nominal cases, while yield a better robustness to breathing motion. The mean ΔD95%, ΔD98%, ΔD5% and ΔD2% of CTV are 6%, 3.2%, 0.9% and 1% for the robustly optimized plans vs. 16.2%, 11.8%, 1.6% and 3.3% from the conventional non-robust plans. Conclusion: A 4DCT robust optimization method was proposed for esophageal cancer using IMPT. We demonstrate that the 4DCT robust optimization can mitigate the dose deviation caused by the diaphragm motion.

60 APPLIED LIFE SCIENCES↗

Crystal structure solution from experimentally determined atomic pair distribution functions

An extension of the Liga algorithm for structure solution from atomic pair distribution functions (PDFs), to handle periodic crystal structures with multiple elements in the unit cell, is described. The procedure is performed in three separate steps. First, pair distances are extracted from the experimental PDF. In the second step the Liga algorithm is used to find unit-cell sites consistent with these pair distances. Finally, the atom species are assigned over the cell sites by minimizing the overlap of their empirical atomic radii. The procedure has been demonstrated on synchrotron X-ray PDF data from 16 test samples. The structure solution was successful for 14 samples, including cases with enlarged supercells. The algorithm success rate and the reasons for the failed cases are discussed, together with enhancements that should improve its convergence and usability.

36 MATERIALS SCIENCE↗