Search NASA⌕ Search

SEARCH · Search NASA

Results for “asynchronous methods”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Scalable Asynchronous Domain Decomposition Solvers

We discuss how parallel implementations of linear iterative solvers generally alternate between phases of data exchange and phases of local computation. Increasingly large problem sizes and more heterogeneous compute architectures make load balancing and the design of low latency network interconnects that are able to satisfy the communication requirements of linear solvers very challenging tasks. In particular, global communication patterns such as inner products become increasingly limiting at scale. We explore the use of asynchronous communication based on one-sided Message Passing Interface primitives in the context of domain decomposition solvers. In particular, a scalable asynchronous two-level Schwarz method is presented. We discuss practical issues encountered in the development of a scalable solver and show experimental results obtained on a state-of-the-art supercomputer system that illustrate the benefits of asynchronous solvers in load balanced as well as load imbalanced scenarios. Using the novel method, we can observe speedups of up to four times over its classical synchronous equivalent.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Data exchange and processing synchronization in distributed systems

Systems, methods, techniques and apparatuses of asynchronous communication is distributed systems are disclosed. One exemplary embodiment is a method determining, with a plurality of agent nodes structured to communicate asynchronously in a distributed system, a first set of iterations including an iteration determined by each of the plurality of agent nodes; determining, with a first agent node of the plurality of agent nodes, a local vector clock; receiving, with the first agent node, a first iteration of the first set of iterations and a remote vector clock determined based on the first iteration; updating, with the first agent node, the local vector clock based on the received remote vector clock; and determining a first iteration of a second set of iterations based on the first set of iterations after determining all iterations of the first set of iterations have been received based on the local vector clock.

Cintuglu, Mehmet H.↗
DOE OSTI2022

aphBO-2GP-3B: a budgeted asynchronous parallel multi-acquisition functions for constrained Bayesian optimization on high-performing computing architecture

High-fidelity complex engineering simulations are often predictive, but also computationally expensive and often require substantial computational efforts. The mitigation of computational burden is usually enabled through parallelism in high-performance cluster (HPC) architecture. Optimization problems associated with these applications is a challenging problem due to the high computational cost of the high-fidelity simulations. In this paper, an asynchronous parallel constrained Bayesian optimization method is proposed to efficiently solve the computationally expensive simulation-based optimization problems on the HPC platform, with a budgeted computational resource, where the maximum number of simulations is a constant. The advantage of this method are three-fold. Firstly, the efficiency of the Bayesian optimization is improved, where multiple input locations are evaluated parallel in an asynchronous manner to accelerate the optimization convergence with respect to physical runtime. This efficiency feature is further improved so that when each of the inputs is finished, another input is queried without waiting for the whole batch to complete. Second, the proposed method can handle both known and unknown constraints. Third, the proposed method samples several acquisition functions based on their rewards using a modified GP-Hedge scheme. The proposed framework is termed aphBO-2GP-3B, which means asynchronous parallel hedge Bayesian optimization with two Gaussian processes and three batches. The numerical performance of the proposed framework aphBO-2GP-3B is comprehensively benchmarked using 16 numerical examples, compared against other 6 parallel Bayesian optimization variants and 1 parallel Monte Carlo as a baseline, and demonstrated using two real-world high-fidelity expensive industrial applications. The first engineering application is based on finite element analysis (FEA) and the second one is based on computational fluid dynamics (CFD) simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Explaining Neural Spike Activity for Simulated Bio-plausible Network through Deep Sequence Learning

With significant improvements in large-scale simulations of brain models, there is a growing need to develop tools for rapid analysis and interpreting the simulation results. In this work, we explore the potential of sequential deep learning models to understand and explain the network dynamics among the neurons extracted from a large-scale neural simulation in STACS (Simulation Tool for Asynchronous Cortical Stream). Our method employs a representative neuroscience model that abstracts the cortical dynamics with a reservoir of randomly connected spiking neurons with a low stable spike firing rate throughout the simulation duration. We subsequently analyze the spike dynamics of the simulated spiking neural network through an autoencoder model and an attention-based mechanism.

Kulkarni, Shruti↗
DOE OSTI2023

Projective Hedging Algorithms for Multistage Stochastic Programming, Supporting Distributed and Asynchronous Implementation

Here we propose a decomposition algorithm for multistage stochastic programming that resembles the progressive hedging method of Rockafellar and Wets but is provably capable of several forms of asynchronous operation. We derive the method from a class of projective operator splitting methods fairly recently proposed by Combettes and Eckstein, significantly expanding the known applications of those methods. Our derivation assures convergence for convex problems whose feasible set is compact, subject to some standard regularity conditions and a mild “fairness” condition on subproblem selection. The method’s convergence guarantees are deterministic and do not require randomization, in contrast to other proposed asynchronous variations of progressive hedging. Computational experiments described in an online appendix show the method to outperform progressive hedging on large-scale problems in a highly parallel computing environment.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Towards high data-rate diffusive molecular communications: A review on performance enhancement strategies

Diffusive molecular communications (DiMC) have recently gained attention as a candidate for nano- to micro- and macro-scale communications due to its simplicity and energy efficiency. As signal propagation is solely enabled by Brownian motion mechanics, DiMC faces severe inter-symbol interference (ISI), which limits reliable and high data-rate communications. Herein, recent literature on DiMC performance enhancement strategies is surveyed; key research directions are identified. Signaling design and associated design constraints are presented. Here, studies on fundamental information theoretic limits of DiMC channel are reviewed. Classical and novel transceiver designs are discussed with an emphasis on methods for ISI mitigation and performance-complexity tradeoffs. Key parameter estimation strategies such as synchronization and channel estimation are considered in conjunction with asynchronous and timing error robust receiver methods. Finally, source and channel coding in the context of DiMC is presented.

42 ENGINEERING↗
DOE OSTI2020

Evaluating asynchronous Schwarz solvers on GPUs

With the commencement of the exascale computing era, we realize that the majority of the leadership supercomputers are heterogeneous and massively parallel. Even a single node can contain multiple co-processors such as GPUs and multiple CPU cores. For example, ORNL’s Summit accumulates six NVIDIA Tesla V100 GPUs and 42 IBM Power9 cores on each node. Synchronizing across compute resources of multiple nodes can be prohibitively expensive. Hence, it is necessary to develop and study asynchronous algorithms that circumvent this issue of bulk-synchronous computing. In this study, we examine the asynchronous version of the abstract Restricted Additive Schwarz method as a solver. We do not explicitly synchronize, but allow the communication between the sub-domains to be completely asynchronous, thereby removing the bulk synchronous nature of the algorithm. We accomplish this by using the one-sided Remote Memory Access (RMA) functions of the MPI standard. We study the benefits of using such an asynchronous solver over its synchronous counterpart. We also study the communication patterns governed by the partitioning and the overlap between the sub-domains on the global solver. Finally, we show that this concept can render attractive performance benefits over the synchronous counterparts even for a well-balanced problem.

Nayak, Pratik↗
DOE OSTI2024

Beam Synchronous for the Rest of Us!

Fermilab’s Tevatron Clock (TCLK) infrastructure has been an integral part of the accelerator control network since the 1980’s. This 10MHz Manchester encoded protocol has enabled flexible, real-time event distribution for thousands of devices connected to the timing network with a high degree of reliability. Forthcoming upgrades to the Fermilab complex (PIP-II, LBNF, ACORN) necessitate higher levels of precision to maintain inter-bunch timing for Instrumentation and Control purposes. This presents as an opportunity to refine the event distribution protocol for tighter synchronization between machines, experiments, and eventually far-site operations. This paper outlines a method by which beam-synchronous events may be distributed through asynchronous serial protocols via integration with local LLRF and global PPS reference signals. This method is ideal for synchrotron machines with aggressive frequency sweeps (such as Fermilab's 38~53MHz Booster) and allows for precision timing to be maintained across machines without specialized hardware.

43 PARTICLE ACCELERATORS↗
DOE OSTI2020

Development of an Encoding Method on an Co-simulation Platform for Mitigating the Impact of Unreliable Communication

This report presents a hardware-in-the-loop (HIL) based modeling approach for simulating impacts of unreliable communication on the performance of centralized volt-var control and for developing an encoding method to mitigate the impacts. First, an asynchronous real-time HIL simulation platform is introduced to enable multi-rate co-simulation of a distribution system with many inverter-based distributed energy resources (DERs). The distribution system is modeled by milliseconds phasor-based models and the DERs are modeled by micro-seconds power electronic models. Communication connections between a centralized volt-var controller (modeled externally to the HIL testbed) and smart inverters are built by implementing Modbus links and the Long Term Evolution network. On this co-simulation platform, an enhanced, augmented Lagrangian multiplier based encoded data recovery (EALM-EDR) algorithm for mitigating the impact of unreliable communication is developed and validated. Simulation results demonstrate the efficacy of using the HIL-based co-simulation platform as a power grid digital twin for developing algorithms that coordinate a large number of heterogeneous control systems through wired and wireless communication links.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Packetized energy management control systems and methods of using the same

Aspects of the present disclosure include anonymous, asynchronous, and randomized control schemes for distributed energy resources (DERs). Such control schemes may include packetized energy management (PEM) control schemes for managing DERs that may provide near-optimal tracking performance under imperfect information and consumer quality of service (QoS) constraints.

Frolik, Jeffrey↗
DOE OSTI2021

Asynchronous distributed-memory task-parallel algorithm for compressible flows on unstructured 3D Eulerian grids

Here, we discuss the implementation of a finite element method, used to numerically solve the Euler equations of compressible flows, using an asynchronous runtime system (RTS). The algorithm is implemented for distributed-memory machines, using stationary unstructured 3D meshes, combining data-, and task-parallelism on top of the Charm++ RTS. Charm++’s execution model is asynchronous by default, allowing arbitrary overlap of computation and communication. Task-parallelism allows scheduling parts of an algorithm independently of, or dependent on, each other. Built-in automatic load balancing enables continuous redistribution of computational load by migration of work units based on real-time CPU load measurement. The RTS also features automatic checkpointing, fault tolerance, resilience against hardware failure, and supports power-, and energy-aware computation. We demonstrate scalability up to 25 x 10 9 cells at $\mathscr{O}$10 4 compute cores and the benefits of automatic load balancing for irregular workloads. The full source code with documentation is available at https://quinoacomputing.org.

42 ENGINEERING↗
DOE OSTI2025

Stage-local partitioned two-step runge-kutta methods for large systems of ordinary differential equations

We introduce stage-local partitioned two-step Runge-Kutta methods are an extension of standard two-step Runge-Kutta methods, which are an alternative to the standard additive two-step Runge-Kutta methods currently existing in the literature. Furthermore, these new schemes are designed with an eye towards truly N-partitioned systems and leverage local stage approximations to make several computationally interesting approximations viable. Specifically, the focus on local stage approximations makes possible the construction of truly asynchronous schemes, in the parallel sense, possible. In addition, we show that an implicit-explicit approach to these schemes can lead to methods that require the inversion of only local nonlinear systems.

Applied Dynamical Systems↗
DOE OSTI2021

Asynchronous quadratic control for constrained hidden markov jump linear systems with incomplete MTPM and MOCPM

Abstract This paper investigates the quadratic optimal control problem for constrained Markov jump linear systems with incomplete mode transition probability matrix (MTPM). Considering original system mode is not accessible, observed mode is utilized for asynchronous controller design where mode observation conditional probability matrix (MOCPM), which characterizes the emission between original modes and observed modes is assumed to be partially known. An LMI optimization problem is formulated for such constrained hidden Markov jump linear systems with incomplete MTPM and MOCPM. Based on this, a feasible state-feedback controller can be designed with the application of free-connection weighting matrix method. The desired controller, dependent on observed mode, is an asynchronous one which can minimize the upper bound of quadratic cost and satisfy restrictions on system states and control variables. Furthermore, clustering observation where observed modes recast into several clusters, is explored for simplifying the computational complexity. Numerical examples are provided to illustrate the validity.

Zhu, Jin↗
DOE OSTI2022

Non-disruptive error field identification based on magnetic island healing

Here a technique to identify intrinsic error fields (EFs) in tokamaks with minimized risk of disruption is demonstrated on the DIII-D tokamak. The method extends the conventional driven magnetic island ‘compass scan’ approach by modifying asynchronous control waveforms to enable prompt healing of the island instability. Healing of the island is achieved by reducing the imposed non-axisymmetric coil current and raising the density (here via gas fueling). The method is also shown to support multiple island threshold measurements per pulse, thus reducing the number of dedicated pulses necessary to conduct an EF identification. Non-linear modeling with the TM1 code reproduces the experimental results and approximately recovers the critical density required for island healing. Island healing is explained in the non-linear modeling by an increase in the viscous coupling between the static island and the nearby flowing plasma, thus healing the island as it accelerates into the plasma frame. Due to both simplicity and risk minimization, this technique is suitable for plasma-based EF identification in the early commissioning stages of future disruption-averse tokamaks such as ITER and SPARC.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Optimized asynchronous training of neural networks using a distributed parameter server with eager updates

A method of training a neural network includes, at a local computing node, receiving remote parameters from a set of one or more remote computing nodes, initiating execution of a forward pass in a local neural network in the local computing node to determine a final output based on the remote parameters, initiating execution of a backward pass in the local neural network to determine updated parameters for the local neural network, and prior to completion of the backward pass, transmitting a subset of the updated parameters to the set of remote computing nodes.

Hamidouche, Khaled↗
DOE OSTI2021

Optimized allocation method of the VSC-MTDC system for frequency regulation reserves considering the cost

In recent years, the interconnection of asynchronous power grids through the VSC-MTDC system has been proposed and extensively studied in light of the potential benefits of economical bulk power exchanges and frequency regulation reserves sharing. This paper proposed an optimized allocation method for sharing frequency regulation reserves among the interconnected power systems and the corresponding frequency regulation control of the VSC-MTDC system under emergency frequency deviation events. Firstly, the frequency regulation reserve classification is proposed. In the classification, the available frequency response capacity reserves of each interconnection are divided into commercial reserves and regular reserves. While the commercial reserves are procured through long-term contracts, the regular reserves are purchased based on market prices of frequency regulation services. Secondly, based on the proposed frequency regulation reserve classification, a novel frequency regulation control is then introduced for the VSC-MTDC system. This control method could minimize the costs of the disturbed power grid for the needed frequency response supports from the other power grids. Simulation verifications are performed on a modified IEEE 39 bus system and a highly reduced power system model representing the North American grids. The simulation verification indicates that the developed frequency regulation control significantly reduced ancillary service costs of the disturbed power grid.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Performance Improvements for the Griffin Transport Solvers

Griffin is a Multiphysics Object-Oriented Simulation Environment based reactor multiphysics analysis application jointly developed by Idaho National Laboratory and Argonne National Laboratory. Griffin includes a variety of deterministic radiation transport solvers for fixed source, k-eigenvalue, adjoint, and subcritical multiplication, as well as transient solvers for point-kinetics, improved quasi-static, and spatial dynamics. A code assessment performed in FY-20 identified two significant issues with the transport solvers in Griffin: first, the primary heterogeneous SN (discrete ordinates) transport solver based on continuous finite element methods required significant mesh refinement and higher memory usage compared to solvers based on the method of characteristic for equivalent accuracy. Second, the homogeneous PN (spherical harmonics expansion) transport solver did not adequately support polynomial refinement, which is a feature usually required for problems with spatial homogenization and pronounced streaming, typical in fast or gas-cooled reactor systems. To address the first issue, the development effort focused on the more promising discontinuous finite element method (DFEM)-based SN transport solver in Griffin. The addition of an asynchronous parallel transport sweeper and coarse mesh finite difference (CMFD) acceleration have rendered a superior heterogeneous SN transport capability for multiphysics problems that requires far less computing resources in terms of both CPU time and memory usage. This is demonstrated with typical thermal- and fast-spectrum reactor benchmark problems, including 2D Transient Reactor Test, 3D Advanced Burner Test Reactor (ABTR), and 2D and 3D Empire microreactor. For the second issue, the development effort focused on a new transport solver based on the hybrid finite element PN method (HFEM-PN), equivalent to the variational nodal method, as well as a new diffusion solver based on HFEM-Diffusion. This solver is intended for homogenized domains with multiphysics coupling (i.e., supports mesh displacement, seamless temperature feedback, etc.). Initial calculations with the HFEM-Diffusion implementation show very good parallel efficiency for the residual evaluations with the 2D ABTR benchmark. A future development effort will be centered on further improvements to the CMFD, HFEM-PN, and DFEM diffusion solvers to ensure Griffin meets performance and software quality assurance requirements for advanced reactor design and analysis.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗