Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “asynchronous”

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 55 records · Page 3

Synchronous and asynchronous optimized Schwarz methods for one-way subdivision of bounded domains

Convergence of both synchronous and asynchronous optimized Schwarz algorithms for the shifted Laplacian operator on a bounded rectangular domain, in a one-way subdivision of the computational domain, with overlap, is shown. Convergence results are obtained under very mild conditions on the size of the subdomains and on the amount of overlap. A couple of results are also given, relating the convergence rate of the asynchronous method to changes in the size of the domain. Numerical experiments illustrate the theoretical results.

97 MATHEMATICS AND COMPUTING↗

Asynchronicity in opposed-piston RCMs: Does it matter?

Rapid Compression Machines (RCMs) are widely utilized to study combustion phenomena at engine-relevant conditions, and significant efforts are typically made to create a quiescent environment, particularly for investigations of autoignition chemistry. Opposed-piston configurations can be advantageous due to shorter compression times and reduced surface area to volume ratios. Each side must be actuated simultaneously, but this can be challenging in practice. These devices, like most RCMs, utilize hydraulics for actuation, speed control and arrestation of the piston at the end of the stroke; there is no mechanical control or linkage of the two piston trajectories. To quantify the magnitudes and effects of piston asynchronous behavior, this work employs both detailed experimental measurements and, for the first time, high-fidelity, Direct Numerical Simulation (DNS). The boundary conditions are carefully considered applying insight from high-resolution linear variable differential transformer (LVDT) measurements of the piston trajectory and a zero-dimensional kinematics model of the piston-shaft assembly. Sufficient resolution in the piston crevice region is used. The complicated fluid dynamical behavior that can evolve during piston compression and the ensuing delay processes due to offset timings from t offset = 0-10 ms is elucidated. It is found that near t offset = 6 ms and beyond, the boundary layer on the face of the first-seating piston can be sufficiently perturbed, due initially to reemergence of gas from the crevice of the firstseating piston, so that the adiabatic core can become degraded at long ignition delay times. Substantial mixing of colder gas into the interior of the reaction chamber can alter the measurements, similar to effects previously observed for improper piston crevice configuration. In conclusion, experimental techniques to mitigate asynchronous behavior are discussed and demonstrated.

33 ADVANCED PROPULSION SYSTEMS↗

TomocuPy – efficient GPU-based tomographic reconstruction with asynchronous data processing

Fast 3D data analysis and steering of a tomographic experiment by changing environmental conditions or acquisition parameters require fast, close to real-time, 3D reconstruction of large data volumes. Here a performance-optimized TomocuPy package is presented as a GPU alternative to the commonly used central processing unit (CPU) based TomoPy package for tomographic reconstruction. TomocuPy utilizes modern hardware capabilities to organize a 3D asynchronous reconstruction involving parallel read/write operations with storage drives, CPU–GPU data transfers, and GPU computations. In the asynchronous reconstruction, all the operations are timely overlapped to almost fully hide all data management time. Since most cameras work with less than 16-bit digital output, the memory usage and processing speed are furthermore optimized by using 16-bit floating-point arithmetic. As a result, 3D reconstruction with TomocuPy became 20–30 times faster than its multi-threaded CPU equivalent. Full reconstruction (including read/write operations and methods initialization) of a 2048 3 tomographic volume takes less than 7 s on a single Nvidia Tesla A100 and PCIe 4.0 NVMe SSD, and scales almost linearly increasing the data size. To simplify operation at synchrotron beamlines, TomocuPy provides an easy-to-use command-line interface. Efficacy of the package was demonstrated during a tomographic experiment on gas-hydrate formation in porous samples, where a steering option was implemented as a lens-changing mechanism for zooming to regions of interest.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An 802pW 93% Peak Efficiency Buck Converter with 5.5×10 6 Dynamic Range Featuring Fast DVFS and Asynchronous Load-Transient Control

Here this paper presents a buck converter with sub-nW quiescent power, high efficiency, and a wide dynamic range for ultra-low-power (ULP) IoT SoCs. To optimize the SoC power consumption, the buck converter supports fast dynamic voltage and frequency scaling (DVFS) and enables fast load-transient response (FLTR) through asynchronous control. In addition, the buck converter is fully self-contained with all features integrated on chip including a proposed adaptive deadtime controller. Fabricated in 65nm CMOS, measurement results show the buck converter has an 802pW quiescent power at 1.5V input voltage and a 93% peak efficiency. The measured dynamic range is from 0.5nW to 2.75mW, which is over 6 orders of magnitude. The measured voltage droop is 54mV for a 45nA-to-1mA load current step thanks to the asynchronous load-transient detector. The buck converter achieves the highest efficiency and widest dynamic range among all the state-of-the-art sub-nW switching voltage regulators, which makes it well suited for power management in ULP SoCs.

42 ENGINEERING↗

Real-Time Distribution System State Estimation with Asynchronous Measurements

We report state estimation is a fundamental task in power systems. Although distribution systems are increasingly equipped with sensing devices and smart meters, measurements are typically reported at different rates and asynchronously; these aspects pose severe strains on workhorse state estimation algorithms, which are designed to process batches of data collected in a synchronous manner from all the measurement units. In this paper, we develop a novel state estimation algorithm to continuously update the estimate of the state based on measurements received in an asynchronous manner from measurement units. The synthesis of the algorithm hinges on a proximal-point type method, implemented in an online fashion, and capable of processing measurements received sequentially from sensors. A performance analysis is presented by providing bounds on the estimation error in terms of the mean and variance that hold at each iteration and asymptotically. The scheme is also compared with a more traditional Weighted Least Squares estimator that compensates for the lack of measurement data by using, as pseudo measurements, the measurement retrieved during a certain time window. Numerical simulations on the IEEE 37-bus feeder corroborate the analytical findings.

24 POWER TRANSMISSION AND DISTRIBUTION↗

An Asynchronous Bundle-Trust-Region Method for Dual Decomposition of Stochastic Mixed-Integer Programming

Here, we present an asynchronous bundle-trust-region algorithm within the context of Lagrangian dual decomposition for stochastic mixed-integer programs. The approach solves the Lagrangian master problem by using a bundle method with a trust-region constraint. This scheme enables asynchronous computations and can thus help mitigate severe load imbalance issues (associated with the solution of scenario subproblems) and improve parallel efficiency. We provide a convergence analysis and an implementation of the proposed scheme. We also present extensive numerical results on eighty instances of a large-scale stochastic unit commitment problem, and demonstrate that the proposed approach provides significant reductions in solution time and achieves strong scaling.

97 MATHEMATICS AND COMPUTING↗

Modifying the Asynchronous Jacobi Method for Data Corruption Resilience

Moving scientific computation from high-performance computing (HPC) and cloud computing (CC) environments to devices on the edge, i.e., physically near instruments of interest, has received tremendous interest in recent years. Such edge computing environments can operate on data in situ, offering enticing benefits over data aggregation to HPC and CC facilities that include avoiding costs of transmission, increased data privacy, and real-time data analysis. Because of the inherent unreliability of edge computing environments, new fault-tolerant approaches must be developed before the benefits of edge computing can be realized. Motivated by algorithm-based fault tolerance, a variant of the asynchronous Jacobi (ASJ) method is developed that achieves resilience to data corruption by rejecting solution approximations from neighbor devices according to a bound derived from convergence theory. Numerical results on a two-dimensional Poisson problem show that the new rejection criterion, along with a novel approximation to the shortest path length on which the criterion depends, restores convergence for the ASJ variant in the presence of certain types data corruption. Numerical results are obtained for when the singular values in the analytic bound are approximated. Additional linear systems are also explored, one with a more dense sparsity pattern and one that includes advection. All results indicate that successful resilience to data corruption depends on whether the bound tightens fast enough to reject corrupted data before the iteration evolution deviates significantly from that predicted by the convergence theory defining the bound. This observation generalizes to future work on algorithm-based fault tolerance for other asynchronous algorithms, including upcoming approaches that leverage Krylov subspaces.

97 MATHEMATICS AND COMPUTING↗

Addressing Global Data Dependencies in Heterogeneous Asynchronous Runtime Systems on GPUs

Large-scale parallel applications with complex global data dependencies beyond those of reductions pose significant scalability challenges in an asynchronous runtime system. Internodal challenges include identifying the all-to-all communication of data dependencies among the nodes. Intranodal challenges include gathering together these data dependencies into usable data objects while avoiding data duplication. This paper addresses these challenges within the context of a large-scale, industrial coal boiler simulation using the Uintah asynchronous many-task runtime system on GPU architectures. We show significant reduction in time spent analyzing data dependencies through refinements in our dependency search algorithm. Multiple task graphs are used to eliminate subsequent analysis when task graphs change in predictable and repeatable ways. Using a combined data store and task scheduler redesign reduces data dependency duplication ensuring that problems fit within host and GPU memory. Furthermore, these modifications did not require any changes to application code or sweeping changes to the Uintah runtime system. We report results running on the DOE Titan system on 119K CPU cores and 7.5K GPUs simultaneously. Our solutions can be generalized to other task dependency problems with global dependencies among thousands of nodes which must be processed efficiently at large scale.

97 MATHEMATICS AND COMPUTING↗

Asynchronous domain decomposition methods for nonlinear PDEs

One- and two-level parallel asynchronous methods for the numerical solution of nonlinear systems of equations, especially those arising from (nonlinear) partial differential equations, are studied. The proposed methods are based on domain decomposition techniques. Local convergence theorems are presented in several cases, with appropriate hypotheses. Computational results on a shared memory multiprocessor machine for various problems exhibiting nonlinearities are reported, illustrating the potential of these asynchronous methods, especially for heterogeneous clusters.

97 MATHEMATICS AND COMPUTING↗

A fully distributed asynchronous approach for multi-area coordinated network-constrained unit commitment

This paper discusses a consensus-based alternating direction method of multipliers (ADMM) approach to solve the multi-area coordinated network-constrained unit commitment (NCUC) problem in a distributed manner. Due to political and technical difficulties, it is neither practical nor feasible to solve the multi-area coordination problem in a centralized fashion, which requires full access to all data of individual areas. In comparison, in the proposed fully-distributed approach, local NCUC problems of individual areas can be solved independently, and only limited information is exchanged among adjacent areas for facilitating multi-area coordination. Furthermore, as traditional ADMM can only guarantee convergence for convex problems, this paper discusses several strategies to mitigate oscillations, enhance convergence performance, and derive good-enough feasible solutions, including: (i) A tie-line power flow based area coordination strategy is designed to reduce the number of global consensus variables; (ii) Different penalty parameters \r{ho} are assigned to individual consensus variables and are updated via certain rules during the iterative procedure, which would reduce the impact of initial values of \r{ho} on convergence performance; (iii) Heuristic rules are adopted to fix certain unit commitment variables for avoiding oscillations during the iterative procedure; and (iv) An asynchronous distributed strategy is studied, which solves NCUC subproblems of small areas multiple times and exchanges information with adjacent areas more frequently within one complete run of slower NCUC subproblems of large areas. Numerical cases illustrate effectiveness of the proposed asynchronous fully-distributed NCUC approach, and investigate key factors that would affect its convergence performance.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Ability to Simulate Absorption and Melt Pool Dynamics for Laser Melting of Bare Aluminum Plate: Results and Insights from the 2022 Asynchronous AM-Bench Challenge

The 2022 Asynchronous AM-Bench challenge was designed to test the ability of simulations to accurately predict laser power absorption as well as various melt pool behaviors (width, depth, and solidification) during laser melting of solid metal during stationary and scanned laser illumination. In this challenge, participants were asked to predict a series of experimental outcomes. Experimental data were obtained from a series of experiments performed at the Advanced Photon Source at Argonne National Laboratories in 2019. These experiments combined integrating sphere radiometry with high-speed X-ray imaging, allowing for the simultaneous recording of absolute laser power absorption and two-dimensional, projected images of the melt pool. All challenge problems were based on experiments using bare aluminum solid metal. Participants were provided with pertinent experimental information like laser power, scan speed, laser spot size, and material composition. Additionally, participants were given absorptance and X-ray imaging data from stationary and scanned laser experiments on solid Ti–6Al–4V that could be used for testing their models before attempting challenge problems. In total, this challenge received 56 submissions from eight different research groups for eight individual challenge problems. The data for this challenge, and associated information, are available for download from the NIST Public Data Repository. This paper summarizes the results from the 2022 Asynchronous AM-Bench challenge as well as discusses the lessons learned to help inform future challenges.

36 MATERIALS SCIENCE↗

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↗

Low-Dose Hyper-Radiosensitivity Is Not a Common Effect in Normal Asynchronous and G2-Phase Fibroblasts of Cancer Patients

Purpose: In our previous study, using the micronucleus assay, a low-dose hyper-radiosensitivity (HRS)-like phenomenon was observed for normal fibroblasts of 2 of the 40 cancer patients investigated. In this article we report, for the first time, the survival response of primary fibroblasts from 25 of these patients to low-dose irradiation and answer the question regarding the effect of G2-phase enrichment on HRS elicitation. Methods and Materials: The clonogenic survival of asynchronous as well as G2-phase enriched fibroblast populations was measured. Separation of G2-phase cells and precise cell counting was performed using a fluorescence-activated cell sorter. Sorted and plated cells were irradiated with single doses (0.1-4 Gy) of 6-MV x-rays. For each patient, at least 4 independent experiments were performed, and the induced-repair model was fitted over the whole data set to confirm the presence of HRS effect. Results: The HRS response was demonstrated for the asynchronous and G2-phase enriched cell populations of 4 patients. For the rest of patients, HRS was not defined in either of the 2 fibroblast populations. Thus, G2-phase enrichment had no effect on HRS elicitation. Conclusions: The fact that low-dose hyper-radiosensitivity is not a common effect in normal human fibroblasts implies that HRS may be of little consequence in late-responding connective tissues with regard to radiation fibrosis.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Asynchronous Crystal Cell Expansion during Lithiation of K + -Stabilized α-MnO 2

alpha-MnO2 is a promising material for Li-ion batteries and has unique tunneled structure that facilitates the diffusion of Li+. The overall electrochemical performance of a-MnO2 is determined by the tunneled structure stability during its interaction with Li+, the mechanism of which is, however, poorly understood. In this paper, a novel tetragonal-orthorhombic-tetragonal symmetric transition during lithiation of K+-stabilized a-MnO2 is observed using in situ transmission electron microscopy. Atomic resolution imaging indicated that 1 x 1 and 2 x 2 tunnels exist along c ([001]) direction of the nanowire. The morphology of a partially lithiated nanowire observed in the ?100? projection is largely dependent on crystallographic orientation ([100] or [010]), indicating the existence of asynchronous expansion of alpha-MnO(2)s tetragonal unit cell along a and b lattice directions, which results in a tetragonal-orthorhombic-tetragonal (TOT) symmetric transition upon lithiation. Such a TOT transition is confirmed by diffraction analysis and Mn valence quantification. Density functional theory (DFT) confirms that Wyckoff 8h sites inside 2 x 2 tunnels are the preferred sites for Li+ occupancy. The sequential Li+ filling at 8h sites leads to asynchronous expansion and symmetry degradation of the host lattice as well as tunnel instability upon lithiation. These findings provide fundamental understanding for appearance of stepwise potential variation during the discharge of Li/alpha-MnO2 batteries as well as the origin for low practical capacity and fast capacity fading of alpha-MnO2 as an intercalated electrode.

36 MATERIALS SCIENCE↗

Significance of microbial asynchronous anabolism to soil carbon dynamics driven by litter inputs

Soil organic carbon (SOC) plays an important role in the global carbon cycle. However, it remains largely unknown how plant litter inputs impact magnitude, composition and source configuration of the SOC stocks over long term through microbial catabolism and anabolism, mostly due to uncoupled research on litter decomposition and SOC formation. This limits our ability to predict soil system responses to changes in land-use and climate. Here, we examine how microbes act as a valve controlling carbon sequestrated from plant litters versus released to the atmosphere in natural ecosystems amended with plant litters varying in quantity and quality. We find that litter quality – not quantity – regulates long-term SOC dynamics under different plausible scenarios. Long-term changes in bulk SOC stock occur only when the quality of carbon inputs causes asynchronous change in a microbial physiological trait, defined as ‘‘microbial biosynthesis acceleration’’ (MBA). This is the first theoretical demonstration that the response of the SOC stocks to litter inputs is critically determined by the microbial physiology. Our work suggests that total SOC at an equilibrium state may be an intrinsic property of a given ecosystem, which ultimately is controlled by the asynchronous MBA between microbial functional groups.

54 ENVIRONMENTAL SCIENCES↗

Formation of the wide asynchronous binary asteroid population

We propose and analyze a new mechanism for the formation of the wide asynchronous binary population. These binary asteroids have wide semimajor axes relative to most near-Earth and main belt asteroid systems. Confirmed members have rapidly rotating primaries and satellites that are not tidally locked. Previously suggested formation mechanisms from impact ejecta, from planetary flybys, and directly from rotational fission events cannot satisfy all of the observations. The newly hypothesized mechanism works as follows: (1) these systems are formed from rotational fission, (2) their satellites are tidally locked, (3) their orbits are expanded by the binary Yarkovsky-O'Keefe-Radzievskii-Paddack (BYORP) effect, (4) their satellites desynchronize as a result of the adiabatic invariance between the libration of the secondary and the mutual orbit, and (5) the secondary avoids resynchronization because of the YORP effect. This seemingly complex chain of events is a natural pathway for binaries with satellites that have particular shapes, which define the BYORP effect torque that acts on the system. After detailing the theory, we analyze each of the wide asynchronous binary members and candidates to assess their most likely formation mechanism. Finally, we suggest possible future observations to check and constrain our hypothesis.

79 ASTRONOMY AND ASTROPHYSICS↗

Readout Chip for an L1 Tracking Trigger Using Asynchronous Logic

Adding a silicon based tracker to the level 1 trigger systems for LHC detectors can substantially increase the ability of these systems to find events with patterns of high Pt tracks. This is especially true for high luminosity running where there may be several hundred interactions per crossing. Cooling and mass constraints require that the readout chips have low power and generate little electrical noise. The LHC crossing clock and experiment trigger latency requires that a trigger be able to be made in less than 100 LHC crossings of 25 ns each. One way to minimize power and noise is to use asynchronous logic. We present a readout chip design for both level 1 trigger and event readout that is entirely asynchronous. The only clock used is the LHC crossing clock.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

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↗