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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Asynchronous aging and turnover of human circulating and tissue-resident memory T cells across sites

Memory T cells are maintained in tissues as circulating effector-memory (T EM ) and tissue-resident (T RM ) populations for protective immunity, though the role of site and subset in memory persistence remains undefined. Here, in this work, we investigated age-associated dynamics of human T cells in lymphoid organs, mucosal sites, and blood over 10 decades of life using retrospective radiocarbon ( 14 C) birth dating, along with cellular, transcriptome, and epigenetic profiling. Memory T cells across peripheral sites exhibited continuous turnover with mean lifespans of 1–2 years, while the spleen contained longer-lived T cells. Over age, T EM cells expressed senescent markers and a GZMK transcriptional signature, while T RM cells maintained site-specific resident phenotypes without exhibiting features of senescence. Both T EM and T RM cells showed age-associated DNA hypomethylation, though T RM cells exhibited more epigenetically regulated genes. Together, our findings reveal asynchronous aging of human memory T cells by subset and site, as well as persistence of T RM cells without immunosenescence.

T cells↗
DOE OSTI2024

Hybrid additive manufacturing of AISI 316L via asynchronous powder and hot-wire laser directed energy deposition

Hybrid Additive Manufacturing (AM) offers a way to leverage the advantages of different AM technologies, enabling the efficient production of sizeable parts without compromising material properties or geometric complexity capabilities. This study presents an asynchronous hybrid Directed Energy Deposition (DED) strategy employing laser powder DED and laser hot-wire DED. AISI 316L parts comprising multiple powder and wire segments were fabricated with optional machining on AISI 316L substrates to investigate how quality is impacted by (i) alternative process sequences (laser powder DED followed by laser hot-wire DED and vice versa), (ii) machined vs. as-printed interfacial conditions, and (iii) material deposition on top vs. alongside previously built segments. Optical microscopy, X-ray computed tomography, and Vickers hardness were used to characterize the morphology and microstructure of the parts, localized porosity and lack of fusion defects, bulk density, and mechanical properties. Interfacial machining was necessary for dimensional control but promoted lack of fusion voids, resulting in a 99.71 ± 0.01% dense part. As-printed interfaces resulted in a denser part (99.82 ± 0.02%) at the expense of dimensional accuracy. The hardness of the parts with as-printed and machined interfaces was 196 ± 0.37 HV and 192 ± 0.40 HV, respectively, compared to 156 ± 1.4 HV for the substrate. Depositing powder alongside or on top of wire sections resulted in interfaces with a hardness of 217 ± 2.2 HV, compared to 185 ± 3.4 HV for the wire-powder interfaces.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Hydrodynamic spin-orbit coupling in asynchronous optically driven micro-rotors

Abstract Vortical flows of rotating particles describe interactions ranging from molecular machines to atmospheric dynamics. Yet to date, direct observation of the hydrodynamic coupling between artificial micro-rotors has been restricted by the details of the chosen drive, either through synchronization (using external magnetic fields) or confinement (using optical tweezers). Here we present a new active system that illuminates the interplay of rotation and translation in free rotors. We develop a non-tweezing circularly polarized beam that simultaneously rotates hundreds of silica-coated birefringent colloids. The particles rotate asynchronously in the optical torque field while freely diffusing in the plane. We observe that neighboring particles orbit each other with an angular velocity that depends on their spins. We derive an analytical model in the Stokes limit for pairs of spheres that quantitatively explains the observed dynamics. We then find that the geometrical nature of the low Reynolds fluid flow results in a universal hydrodynamic spin-orbit coupling. Our findings are of significance for the understanding and development of far-from-equilibrium materials.

47 OTHER INSTRUMENTATION↗
DOE OSTI2023

Asynchronous domain dynamics and equilibration in layered oxide battery cathode

To improve lithium-ion battery technology, it is essential to probe and comprehend the microscopic dynamic processes that occur in a real-world composite electrode under operating conditions. The primary and secondary particles are the structural building blocks of battery cathode electrodes. Their dynamic inconsistency has profound but not well-understood impacts. In this research, we combine operando coherent multi-crystal diffraction and optical microscopy to examine the chemical dynamics in local domains of layered oxide cathode. Our results not only pinpoint the asynchronicity of the lithium (de)intercalation at the sub-particle level, but also reveal sophisticated diffusion kinetics and reaction patterns, involving various localized processes, e.g., chemical onset, reaction front propagation, domains equilibration, particle deformation and motion. These observations shed new lights onto the activation and degradation mechanisms of state-of-the-art battery cathode materials.

25 ENERGY STORAGE↗
DOE OSTI2023

Asynchronous x-ray multiprobe data acquisition for x-ray transient absorption spectroscopy

Laser pump X-ray Transient Absorption (XTA) spectroscopy offers unique insights into photochemical and photophysical phenomena. X-ray Multiprobe data acquisition (XMP DAQ) is a technique that acquires XTA spectra at thousands of pump-probe time delays in a single measurement, producing highly self-consistent XTA spectral dynamics. In this work, we report two new XTA data acquisition techniques that leverage the high performance of XMP DAQ in combination with High Repetition Rate (HRR) laser excitation: HRR-XMP and Asynchronous X-ray Multiprobe (AXMP). HRR-XMP uses a laser repetition rate up to 200 times higher than previous implementations of XMP DAQ and proportionally increases the data collection efficiency at each time delay. This allows HRR-XMP to acquire more high-quality XTA data in less time. AXMP uses a frequency mismatch between the laser and x-ray pulses to acquire XTA data at a flexibly defined set of pump-probe time delays with a spacing down to a few picoseconds. AXMP introduces a novel pump-probe synchronization concept that acquires data in clusters of time delays. Further, the temporally inhomogeneous distribution of acquired data improves the attainable signal statistics at early times, making the AXMP synchronization concept useful for measuring sub-nanosecond dynamics with photon-starved techniques like XTA. In this paper, we demonstrate HRR-XMP and AXMP by measuring the laser-induced spectral dynamics of dilute aqueous solutions of Fe(CN) 6 4₋ and [Fe II (bpy) 3 ] 2+ (bpy: 2,2'-bipyridine), respectively.

47 OTHER INSTRUMENTATION↗
DOE OSTI2020

Quantum gates on asynchronous atomic excitations

A method for realising a universal system of quantum gates based on asynchronous excitations of two-level atoms in optical cavities is proposed. The entangling operator of the CSign type is implemented without beam splitters, approximately, using the incommensurability of the Rabi oscillation periods in a cavity with single and double excitations. (quantum technology)

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Lamellar: A Rust-based Asynchronous Tasking and PGAS Runtime for High Performance Computing

Cybersecurity is one of the largest concerns in modern computing, impacting and dictating how governments, private corporations, and individuals interact with and live in an increasingly digital world. The NSA has recently released a memo [ 1] on “Software Memory Safety” where they highlight that both Microsoft and Google have stated around 70% of software vulnerabilities were due to memory safety issues. Although languages such as C and C++ provide freedom and flexibility with memory management, guaran- teeing safety falls mostly on the developer. The NSA recommends using “memory safe” languages whenever possible. In this paper we introduce Lamellar, an asynchronous tasking and PGAS HPC runtime written in Rust, one such "memory safe" language. We describe the entire Lamellar stack, from network interfaces to high- level abstractions such as distributed LamellarArrays and Active Messages. We conclude by showing comparable performance to legacy PGAS runtimes (e.g. OpenSHMEM) on a subset of the BALE kernel suite while maintaining strong memory safety principles.

HPC Software Systems, Rust Programming Language, P↗
DOE OSTI2021

Asynchronous and Load-Balanced Union-Find for Distributed and Parallel Scientific Data Visualization and Analysis

We present a novel distributed union-find algorithm that features asynchronous parallelism and k-d tree based load balancing for scalable visualization and analysis of scientific data. Applications of union-find include level set extraction and critical point tracking, but distributed union-find can suffer from high synchronization costs and imbalanced workloads across parallel processes. In this study, we prove that global synchronizations in existing distributed union-find can be eliminated without changing final results, allowing overlapped communications and computations for scalable processing. We also use a k-d tree decomposition to redistribute inputs, in order to improve workload balancing. We benchmark the scalability of our algorithm with up to 1,024 processes using both synthetic and application data. Here, we demonstrate the use of our algorithm in critical point tracking and super-level set extraction with high-speed imaging experiments and fusion plasma simulations, respectively.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Asynchronous Truncated Multigrid-Reduction-in-Time

In this paper, we present the new “asynchronous truncated multigrid-reduction-in-time” (AT-MGRIT) algorithm for introducing time parallelism to the solution of discretized time-dependent problems. The new algorithm is based on the multigrid-reduction-in-time (MGRIT) approach, which, in certain settings, is equivalent to another common multilevel parallel-in-time method, Parareal. In contrast to Parareal and MGRIT that both consider a global temporal grid over the entire time interval on the coarsest level, the AT-MGRIT algorithm uses truncated local time grids on the coarsest level, each grid covering certain temporal subintervals. Further, these local grids can be solved completely in an independent way from each other, which reduces the sequential part of the algorithm and, thus, increases parallelism in the method. Here, we study the effect of using truncated local coarse grids on the convergence of the algorithm, both theoretically and numerically, and show, using challenging nonlinear problems, that the new algorithm consistently outperforms classical Parareal/MGRIT in terms of time to solution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A Surrogate-Based Asynchronous Decomposition Technique for Realistic Security-Constrained Optimal Power Flow Problems

Here we present a decomposition approach for obtaining good feasible solutions for the security-constrained, alternating-current, optimal power flow (SC-AC-OPF) problem at an industrial scale and under real-world time and computational limits. The approach was designed while preparing and participating in ARPA-E’s Grid Optimization Competition (GOC) Challenge 1. The challenge focused on a near-real-time version of the SC-AC-OPF problem, where a base operating point is optimized, taking into account possible single-element contingencies, after which the system adapts its operating point following the response of automatic frequency droop controllers and voltage regulators. Our solution approach for this problem relies on state-of-the-art nonlinear programming algorithms, and it employs nonconvex relaxations for complementarity constraints, a specialized two-stage decomposition technique with sparse approximations of recourse terms and contingency ranking and prescreening. The paper describes and justifies our approach and outlines the features of its implementation, including functions and derivatives evaluation, warm-starting strategies, and asynchronous parallelism. We discuss the results of the independent benchmark of our approach by ARPA-E’s GOC team in Challenge 1, where it was found to consistently produce high-quality solutions across a wide range of network sizes and difficulty, and conclude by outlining future extensions of the approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Asynchronous Ballistic Reversible Computing using Superconducting elements

Computing uses energy. At the bare minimum, erasing information in a computer increases the entropy. Landauer has calculated %7E k B T log(2) Joules is dissipated per bit of energy erased. While the success of Moores law has allowed increasing computing power and efficiency for many years, these improvements are coming to an end. This project asks if there is a way to continue those gains by circumventing Landauer through reversible computing. We explore a new reversible computing paradigm, asynchronous ballistic reversible computing or ABRC. The ballistic nature of data in ABRC matches well with superconductivity which provides a low-loss environment and a quantized bit encoding the fluxon. We discuss both these and our development of a superconducting fabrication process at Sandia. We describe a fully reversible 1-bit memory cell based on fluxon dynamics. Building on this model, we propose several other gates which may also offer reversible operation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Optimization of Asynchronous Communication Operations through Eager Notifications

UPC++ is a C++ library implementing the Asynchronous Partitioned Global Address Space (APGAS) model. We propose an enhancement to the completion mechanisms of UPC++ used to synchronize communication operations that is designed to reduce overhead for on-node operations. Our enhancement permits eager delivery of completion notification in cases where the data transfer semantics of an operation happen to complete synchronously, for example due to the use of shared-memory bypass. This semantic relaxation allows removing significant overhead from the critical path of the implementation in such cases. We evaluate our results on three different representative systems using a combination of microbenchmarks and five variations of the the HPCChallenge RandomAccess benchmark implemented in UPC++ and run on a single node to accentuate the impact of locality. We find that in RMA versions of the benchmark written in a straightforward manner (without manually optimizing for locality), the new eager notification mode can provide up to a 25% speedup when synchronizing with promises and up to a 13.5x speedup when synchronizing with conjoined futures. We also evaluate our results using a graph matching application written with UPC++ RMA communication, where we measure overall speedups of as much as 11% in single-node runs of the unmodified application code, due to our transparent enhancements.

Kamil, Amir↗
DOE OSTI2023

Framework for Extensible, Asynchronous Task Scheduling (FEATS) in Fortran

Most parallel scientific programs contain compiler directives (pragmas) such as those from OpenMP, explicit calls to runtime library procedures such as those implementing the Message Passing Interface (MPI), or compiler-specific language extensions such as those provided by CUDA. By contrast, the recent Fortran standards empower developers to express parallel algorithms without directly referencing lower-level parallel programming models. Fortran’s parallel features place the language within the Partitioned Global Address Space (PGAS) class of programming models. When writing programs that exploit data-parallelism, application developers often find it straightforward to develop custom parallel algorithms. Problems involving complex, heterogeneous, staged calculations, however, pose much greater challenges. Such applications require careful coordination of tasks in a manner that respects dependencies prescribed by a directed acyclic graph. When rolling one’s own solution proves difficult, extending a customizable framework becomes attractive. The paper presents the design, implementation, and use of the Framework for Extensible Asynchronous Task Scheduling (FEATS), which we believe to be the first task-scheduling tool written in modern Fortran. We describe the benefits and compromises associated with choosing Fortran as the implementation language, and we propose ways in which future Fortran standards can best support the use case in this paper.

Richardson, Brad↗
DOE OSTI2020

On the Marriage of Asynchronous Many Task Runtimes and Big Data: A Glance

The rise of the accelerator-based architectures and reconfigurable computing have showcased the weakness of software stack toolchains that still maintain a static view of the hardware instead of relying on a symbiotic relationship between static (e.g., compilers) and dynamic tools (e.g., runtimes). In the past decades, this need has given rise to adaptive runtimes with increasingly finer computational tasks. These finer tasks help to take advantage of the hardware by switching out when a long latency operation is encountered (because of the deeper memory hierarchies and new memory technologies that might target streaming instead of random access), thus trading off idle time for unrelated work. Examples of these finer task runtimes are Asynchronous Many Task (AMT) runtimes, in which highly efficient computational graphs run on a variety of hardware. Due to its inherent latency tolerant characteristics, Latency-sensitive applications, such as Graph Analytics and Big Data can effectively use these runtimes. This paper aims to present an example of how the careful design of an AMT can exploit the hardware substrate when faced with high latency applications such as the ones given in the Big Data domain. Moreover, with its introspection and adaptive capabilities, we aim to show the power of these runtimes when facing the changing requirements of the application workloads. We use the Performance Open Community Runtime (P-OCR) as our vehicle to demonstrate the concepts presented here.

adaptive runtime, big data analysis↗
DOE OSTI2021

Method and apparatus for asynchronous scheduling

A method and apparatus of asynchronous scheduling in a graphics device includes sending one or more instructions from an instruction scheduler to one or more instruction first-in/first-out (FIFO) devices. An instruction in the one or more FIFO devices is selected for execution by a single-instruction/multiple-data (SIMD) pipeline unit. It is determined whether all operands for the selected instruction are available for execution of the instruction, and if all the operands are available, the selected instruction is executed on the SIMD pipeline unit. The self-timed arithmetic pipeline unit (SIMD pipeline unit) is effectively encapsulated in a synchronous, (e.g., clocked by global clock), scheduler and register file environment.

Kalamatianos, John↗
DOE OSTI2023

System state estimation with asynchronous measurements

The present disclosure provides techniques for estimating network states using asynchronous measurements by leveraging network inertia. For example, a device configured in accordance with the techniques of the present disclosure may receive electrical parameter values corresponding to at least one first location within a power network and determine, based on the electrical parameter values and a previous estimated state of the power network, an estimated value of unknown electrical parameters that correspond to a second location within the power network. The device may further cause at least one device within the power network to modify operation based on the estimated value of the unknown electrical parameters. The leveraging of network inertia may obviate the need for probabilistic models or pseudo-measurements.

Cavraro, Guido↗
DOE OSTI2023

Controlling the operating speed of stages of an asynchronous pipeline

An asynchronous pipeline includes a first stage and one or more second stages. A controller provides control signals to the first stage to indicate a modification to an operating speed of the first stage. The modification is determined based on a comparison of a completion status of the first stage to one or more completion statuses of the one or more second stages. In some cases, the controller provides control signals indicating modifications to an operating voltage applied to the first stage and a drive strength of a buffer in the first stage. Modules can be used to determine the completion statuses of the first stage and the one or more second stages based on the monitored output signals generated by the stages, output signals from replica critical paths associated with the stages, or a lookup table that indicates estimated completion times.

Sadowski, Greg↗
DOE OSTI2025

Asynchronous-many-task systems: Challenges and opportunities - Scaling an AMR astrophysics code on exascale machines using Kokkos and HPX

Dynamic and adaptive mesh refinement is pivotal in high-resolution, multi-physics, multi-model simulations, necessitating precise physics resolution in localized areas across expansive domains. Today’s supercomputers’ extreme heterogeneity presents a significant challenge for dynamically adaptive codes, highlighting the importance of achieving performance portability at scale. Our research focuses on astrophysical simulations, particularly stellar mergers, to elucidate early universe dynamics. Here, we present Octo-Tiger, leveraging Kokkos, HPX, and SIMD for portable performance at scale in complex, massively parallel adaptive multi-physics simulations. Octo-Tiger supports diverse processors, accelerators, and network backends. Experiments demonstrate exceptional scalability across several heterogeneous supercomputers including Perlmutter, Frontier, and Fugaku, encompassing major GPU architectures and x86, ARM, and RISC-V CPUs. Parallel efficiency of 47.59% (110,080 cores and 6880 hybrid A100 GPUs) on a full-system run on Perlmutter (26% HPCG peak performance) and 51.37% (using 32,768 cores and 2048 MI250X) on Frontier are achieved.

97 MATHEMATICS AND COMPUTING↗