Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed computation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,333 records · Page 74

Large-scale integration of artificial atoms in hybrid photonic circuits

A central challenge in developing quantum computers and long-range quantum networks is the distribution of entanglement across many individually controllable qubits. Colour centres in diamond have emerged as leading solid-state ‘artificial atom’ qubits because they enable on-demand remote entanglement, coherent control of over ten ancillae qubits with minute-long coherence times and memory-enhanced quantum communication. A critical next step is to integrate large numbers of artificial atoms with photonic architectures to enable large-scale quantum information processing systems. So far, these efforts have been stymied by qubit inhomogeneities, low device yield and complex device requirements. Here we introduce a process for the high-yield heterogeneous integration of ‘quantum microchiplets’—diamond waveguide arrays containing highly coherent colour centres—on a photonic integrated circuit (PIC). We use this process to realize a 128-channel, defect-free array of germanium-vacancy and silicon-vacancy colour centres in an aluminium nitride PIC. Photoluminescence spectroscopy reveals long-term, stable and narrow average optical linewidths of 54 megahertz (146 megahertz) for germanium-vacancy (silicon-vacancy) emitters, close to the lifetime-limited linewidth of 32 megahertz (93 megahertz). We show that inhomogeneities of individual colour centre optical transitions can be compensated in situ by integrated tuning over 50 gigahertz without linewidth degradation. The ability to assemble large numbers of nearly indistinguishable and tunable artificial atoms into phase-stable PICs marks a key step towards multiplexed quantum repeaters and general-purpose quantum processors

36 MATERIALS SCIENCE↗

The git based ATLAS data acquisition configuration service in LHC Run 3

The ATLAS experiment at the LHC at CERN uses a large, distributed trigger and data acquisition system composed of many computing nodes, networks, and hardware modules. Its configuration service is used to provide descriptions of control, monitoring, diagnostic, recovery, dataflow and data quality configurations, interconnections, and parameters for modules, chips, and channels of various online systems, detectors, and the whole ATLAS experiment. Those descriptions have historically been stored in more than one thousand interconnected XML files, which are updated by various experts many times per day. Maintaining error-free and consistent sets of such files and providing reliable and fast access to current and historical configurations is a major challenge. This paper gives details of the configuration service upgrade on the modern Git version control system backend for LHC Run 3 and its exploitation experience. It may be interesting for developers using human-readable file formats, where consistency of the files, performance, access control, traceability of modifications, and effective archiving are key requirements.

Soloviev, Igor [Univ. of California, Irvine, CA (U↗

Rewiring the specificity of extracytoplasmic function sigma factors

Significance Bacterial phenotypes require the concerted expression of multiple genes, usually coordinated by a transcriptional regulator. Although the functions of many genes in sequenced bacterial genomes can be inferred, the regulatory networks that coordinate their expression are only known in a few model systems. Using a bioinformatic and experimental approach, we solve the DNA-specificity code of extracytoplasmic function sigma factors (ECF σs), a major class of bacterial regulators. We develop and use a high-stringency pipeline to predict the genes regulated by 67% of ECF σs in >10,000 species, providing a comprehensive look at the role of a broadly distributed family of gene regulatory proteins. This conceptual and computational framework is potentially applicable to other bacterial regulators.

59 BASIC BIOLOGICAL SCIENCES↗

Serpent and MCNP Calculations of the Energy Deposition in the Transformational Challenge Reactor

This paper focuses on the calculation of the energy deposition in the Transformational Challenge Reactor by two major Monte Carlo codes: Serpent and MCNP. The first software computation relies on Kinetic Energy Released per unit Mass (KERMA) factors while the second one relies on Q-values. The results from these two independent computation methodologies are in very good agreement; however, Serpent runs much faster than MCNP (for the same computational model) and allows for a detailed energy deposition distribution from a 1-mm-side square mesh with a relative statistical error between 0.5% and 1%. This detailed energy deposition is suitable for multiphysics analyses aimed at design optimizations. In order to calculate the energy deposition, Serpent needs enhanced ACE files (distributed by the software developers). Unlike other Monte Carlo software that uses inputs based on Python or Java languages, the Serpent input syntax is very similar to that of MCNP; a Python script can convert a MCNP input to a Serpent input in seconds. For simulations not requiring the calculation of the energy deposition, Serpent can also read nuclear data from MCNP ACE files, which eventually improves the comparison of the results of the two codes.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Investigation of Anchor Link Magnetohydrodynamic Effects in the Toroidally Symmetric Lead-Lithium (TSLL) Blanket Concept

This paper presents a comprehensive study on the magnetohydrodynamic (MHD) flow in a slotted channel with a cylindrical anchor link, which is an imperative component of the toroidally symmetric lead-lithium (TSLL) blanket concept. Following the validation of the MHD solver implemented in COMSOL and a proposed subtraction approach to compute the anchor link pressure drop, the effects of computational domain size on the pressure drop and velocity distribution are examined. The results show that the pressure drop associated with the anchor link and the maximum flow velocity follow an asymptotic trend as the domain width increases, with wall-induced pressure drop being more dominant than that of the anchor link. The velocity distribution analysis revealed the formation of an internal boundary layer extending along the magnetic field direction, which is a unique feature of the investigated MHD flow. An estimation of the total MHD pressure drop associated with the array of anchor links under the TSLL blanket conditions suggests ~0.3 MPa, which is significantly lower than the recommended maximum allowable blanket pressure drop of 2 MPa. In conclusion, this work offers valuable insights into the anchor link–associated MHD phenomena and serves as a foundation for further development of the TSLL blanket concept for future fusion reactors.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Semi-inclusive deep-inelastic scattering on a polarized spin-1 target. II. Deuteron and spectator nucleon tagging

We develop the theoretical framework for semi-inclusive deep-inelastic scattering on a polarized spin-1 target and apply it to scattering on the polarized deuteron with spectator nucleon tagging. In Part I (previous article), we present the general form of the semi-inclusive cross section and polarization observables for the spin-1 target. In Part II (this article), we consider deep-inelastic scattering on the polarized deuteron with spectator nucleon tagging as a special case of target fragmentation. Methods of light-front quantization are employed to separate nuclear and hadronic structure in the high-energy process and achieve a composite description. The light-front wave function of the polarized deuteron is obtained from a rotationally covariant three-dimensional wave function in the center-of-mass frame of the proton-neutron system. The tagged structure functions are computed in the impulse approximation. The momentum and spin distribution of the active nucleon are controlled by the deuteron polarization and the detected spectator momentum (𝐷/𝑆 wave ratio). The cross section and spin asymmetries are evaluated for general deuteron polarization (vector and tensor, longitudinal and transverse) as functions of the spectator momentum. Tensor-polarized spin asymmetries of order unity are achieved for spectator momenta of approximately 300 MeV, which select configurations with a large 𝐷 wave. Sum rules for the tagged spin structure functions are derived. The results can be used for simulations of spectator tagging in future polarized fixed-target experiments (Jefferson Lab) or at the Electron-Ion Collider.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Coordinate versus momentum cuts and effects of collective flow on critical fluctuations

We analyze particle number fluctuations in the crossover region near the critical endpoint of a first-order phase transition by utilizing molecular dynamics simulations of the classical Lennard-Jones fluid. We extend our previous study [V. A. Kuznietsov , ] by incorporating longitudinal collective flow. The scaled variance of particle number distribution inside different coordinate and momentum space acceptances is computed through ensemble averaging and found to agree with earlier results obtained using time averaging, validating the ergodic hypothesis for fluctuation observables. Presence of a sizable collective flow is found to be essential for observing large fluctuations from the critical point in momentum space acceptances. We discuss our findings in the context of heavy-ion collisions. Published by the American Physical Society 2024

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Transversity GPDs of the proton from lattice QCD

We present the first calculation of the x dependence of the isovector transversity generalized parton distributions (GPDs) for the proton within lattice QCD. We compute the matrix elements with nonlocal operators containing a Wilson line. The calculation implements the Breit symmetric frame. The proton momenta are chosen as 0.83, 1.25, and 1.67 GeV, and the values of the momentum transfer squared are 0.69 and 1.02 GeV 2 . These combinations include cases with zero and nonzero skewness. The calculation is performed using one ensemble of twisted-mass fermions with a clover term: two degenerate-mass light quarks, a strange quark, and a charm quark. The lattice results are renormalized nonperturbatively and finally matched to the light-cone GPDs using one-loop perturbation theory within the framework of large-momentum effective theory. The final GPDs are given in the $\overline{MS}$ scheme at a scale of 2 GeV. In addition to the individual GPDs, we form the combination of the transversity GPDs that is related to the transverse spin structure of the proton. Finally, we extract the lowest two moments of the GPDs and draw a number of important qualitative conclusions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cosmological inference from an emulator based halo model. II. Joint analysis of galaxy-galaxy weak lensing and galaxy clustering from HSC-Y1 and SDSS

Here, we present high-fidelity cosmology results from a blinded joint analysis of galaxy-galaxy weak lensing (ΔΣ) and projected galaxy clustering (w p ) measured from the Hyper Suprime-Cam Year-1 (HSC-Y1) data and spectroscopic Sloan Digital Sky Survey (SDSS) galaxy catalogs in the redshift range 0.15 < z < 0.7. We define luminosity-limited samples of SDSS galaxies to serve as the tracers of w p in three spectroscopic redshift bins, and as the lens samples for ΔΣ. For the ΔΣ measurements, we select a single sample of 4×10 6 source galaxies over 140 deg 2 from HSC-Y1 with photometric redshifts (photo z) greater than 0.75, enabling a better handle of photo- z errors by comparing the ΔΣ amplitudes for the three lens redshift bins. The deep, high-quality HSC-Y1 data enable significant detections of the ΔΣ signals, with integrated signal-to-noise ratio S/N ~ 15 in the range 3 ≤ R/[h –1 Mpc] ≤ 30 for the three lens samples, despite the small area coverage. For cosmological parameter inference, we use an input galaxy-halo connection model built on the dark emulator package (which uses an ensemble set of high-resolution N-body simulations and enables fast, accurate computation of the clustering observables) with a halo occupation distribution that includes nuisance parameters to marginalize over modeling uncertainties. We model the ΔΣ and wp measurements on scales from R≃3 and 2h –1 Mpc , respectively, up to 30 h –1 Mpc (therefore excluding the baryon acoustic oscillations information) assuming a flat Λ CDM cosmology, marginalizing over about 20 nuisance parameters and demonstrating the robustness of our results to them. With various tests using mock catalogs described in Miyatake et al. [preceding paper, Phys. Rev. D 106, 083519 (2022)], we show that any bias in the clustering amplitude S 8 ≡ σ 8 (Ω m /0.3) 0.5 due to uncertainties in the galaxy-halo connection is less than ~ 50 % of the statistical uncertainty of S 8 , unless the assembly biaseffect is unexpectedly large. Our best-fit models have S 8 = 0.795$_{-0.042}^{+0.049}$ (mode and 68% credible interval) for the flat Λ CDM model; we find tighter constraints on the quantity S 8 (α = 0.17)≡σ 8 (Ω m /0.3) 0.17 = 0.745$_{-0.031}^{+0.039}$.

79 ASTRONOMY AND ASTROPHYSICS↗

Analysis of a Fluidized-Bed Particle/Supercritical-CO2 Heat Exchanger in a Concentrating Solar Power System

Concentrating solar power (CSP) development has focused on increasing the energy conversion efficiency and lowering the capital cost. To improve performance, CSP research is moving to high-temperature and high-efficiency designs. One technology approach is to use inexpensive, high-temperature heat transfer fluids and storage, integrated with a high-efficiency power cycle such as the supercritical carbon dioxide (sCO 2 ) Brayton power cycle. The sCO 2 Brayton power cycle has strong potential to achieve performance targets of 50% thermal-to-electric efficiency and dry cooling at an ambient temperature of up to 40 °C and to reduce the cost of power generation. Solid particles have been proposed as a possible high-temperature heat transfer or storage medium that is inexpensive and stable at high temperatures above 1000 °C. The particle/sCO 2 heat exchanger (HX) provides a connection between the particles and sCO 2 fluid in emerging sCO 2 power cycles. This article presents heat transfer modeling to analyze the particle/sCO 2 HX design and assess design tradeoffs including the HX cost. The heat transfer process was modeled based on a particle/sCO 2 counterflow configuration, and empirical heat transfer correlations for the fluidized bed and sCO 2 were used to calculate heat transfer area and estimate the HX cost. A computational fluid dynamics simulation was applied to characterize particle distribution and fluidization. This article shows a path to achieve the cost and performance objectives for a particle/sCO 2 HX design by using fluidized-bed technology.

14 SOLAR ENERGY↗

BULKI-Store v0.3.2

BULKI-Store is a distributed object storage system optimized for high-performance computing environments. Built with a Rust core and Python bindings, it efficiently manages scientific and machine learning datasets across HPC clusters. The system employs a client-server architecture with MPI integration, enabling seamless scaling on supercomputers like Perlmutter. BULKI-Store's object-oriented approach provides intuitive data organization with rich metadata support, contrasting with traditional file-based solutions. Key optimizations include selective checkpoint loading, unified checkpoint files, and object chunking for large data transfers. For machine learning workloads, BULKI-Store offers advantages through fine-grained access patterns, dynamic data sharing between training instances, and reduced memory pressure. Memory management features include strategic Python GC calls, minimized data copies, and batch processing capabilities. The system leverages Rayon's thread pool for asynchronous data prefetching and supports multiple CPU architectures (ARM64, x86, AMD, RISC-V). By combining performance optimizations with developer-friendly APIs, BULKI-Store addresses the complex data management challenges of modern HPC applications while maintaining compatibility across heterogeneous computing environments.

Zhang, Wei [Lawrence Berkeley National Laboratory ↗

Quantum Stochastic Programming [SWR-26-040]

The Quantum Stochastic Programming tool contains quantum computing algorithms for two-stage stochastic optimization, with a focus on the Unit Commitment (UC) problem in power systems. The algorithms combine Discrete Quantum Annealing (DQA) with Quantum Amplitude Estimation (QAE) to compute expected-value objective functions over a probability distribution of wind-power scenarios. Based on: arXiv 2402.15029 - "Quantum algorithms for the two-stage stochastic unit commitment problem"

Maack, Jonathan [National Laboratory of the Rockie↗

Efficient learning of t -doped stabilizer states with single-copy measurements

One of the primary objectives in the field of quantum state learning is to develop algorithms that are time-efficient for learning states generated from quantum circuits. Earlier investigations have demonstrated time-efficient algorithms for states generated from Clifford circuits with at most log &#x2061; ( n ) non-Clifford gates. However, these algorithms necessitate multi-copy measurements, posing implementation challenges in the near term due to the requisite quantum memory. On the contrary, using solely single-qubit measurements in the computational basis is insufficient in learning even the output distribution of a Clifford circuit with one additional T gate under reasonable post-quantum cryptographic assumptions. In this work, we introduce an efficient quantum algorithm that employs only nonadaptive single-copy measurement to learn states produced by Clifford circuits with a maximum of O ( log &#x2061; n ) non-Clifford gates, filling a gap between the previous positive and negative results.

Physics↗

Reliability of Lumped Thermodynamic Hydrogen Fueling Model under Slow-Fill Conditions

This study verifies the reliability of lumped thermodynamic fuel cell electric vehicle (FCEV) tank model under considerably slow-fill conditions. Many countries put efforts into research and development of FCEVs. As part of the efforts, thermodynamic hydrogen fueling models have been developed to understand the hydrogen temperature in the onboard tanks of FCEVs during the fueling process. Most of the models treat the hydrogen inside the tanks to be a lumped system and assume the hydrogen temperature to be uniform throughout the tanks. In other words, the hydrogen temperature is treated as average bulk temperature. This study certifies whether treating the hydrogen temperature in a tank as the bulk gas temperature is suitable by evaluating the temperature distributions inside the tank by a three-dimensional computational fluid dynamics (3D CFD) model.

DIRECT ENERGY CONVERSION,HYDROGEN↗

When ancient numerical demons meet physics-informed machine learning: adjoint-based gradients for implicit differentiable modeling

Recent advances in differentiable modeling, a genre of physics-informed machine learning that trains neural networks (NNs) together with process-based equations, have shown promise in enhancing hydrological models' accuracy, interpretability, and knowledge-discovery potential. Current differentiable models are efficient for NN-based parameter regionalization, but the simple explicit numerical schemes paired with sequential calculations (operator splitting) can incur numerical errors whose impacts on models' representation power and learned parameters are not clear. Implicit schemes, however, cannot rely on automatic differentiation to calculate gradients due to potential issues of gradient vanishing and memory demand. Here we propose a “discretize-then-optimize” adjoint method to enable differentiable implicit numerical schemes for the first time for large-scale hydrological modeling. The adjoint model demonstrates comprehensively improved performance, with Kling–Gupta efficiency coefficients, peak-flow and low-flow metrics, and evapotranspiration that moderately surpass the already-competitive explicit model. Therefore, the previous sequential-calculation approach had a detrimental impact on the model's ability to represent hydrological dynamics. Furthermore, with a structural update that describes capillary rise, the adjoint model can better describe baseflow in arid regions and also produce low flows that outperform even pure machine learning methods such as long short-term memory networks. The adjoint model rectified some parameter distortions but did not alter spatial parameter distributions, demonstrating the robustness of regionalized parameterization. Despite higher computational expenses and modest improvements, the adjoint model's success removes the barrier for complex implicit schemes to enrich differentiable modeling in hydrology.

58 GEOSCIENCES↗

Toward designing effective exascale scientific computing workflows: experiences and best practices

Many fields within scientific computing have embraced advances in big-data analysis and machine learning, which often requires the deployment of large, distributed and complicated workflows that may combine training neural networks, performing simulations, running inference, and performing database queries and data analysis in asynchronous, parallel and pipelined execution frameworks. Such a shift has brought into focus the need for scalable, efficient workflow management solutions with reproducibility, error and provenance handling, traceability, and checkpoint-restart capabilities, among other needs. Here, we discuss challenges and best-practices for deploying exascale-generation computational science workflows on resources at the Oak Ridge Leadership Computing Facility (OLCF). We present our experiences with large-scale deployment of distributed workflows on the Summit supercomputer, including for bioinformatics and computational biophysics, materials science, and deep learning model optimization. We also present problems and solutions created by working within a Python-centric software base on traditional HPC systems, and discuss steps that will be required before the convergence of HPC, AI, and data science can be fully realized. Our results point to a wealth of exciting new possibilities for harnessing this convergence to tackle new scientific challenges.

Coletti, Mark↗

Xyce Parallel Electronic Simulator Users' Guide Version 7.4

This manual describes the use of the Xyce Parallel Electronic Simulator. Xyce has been designed as a SPICE-compatible, high-performance analog circuit simulator, and has been written to support the simulation needs of the Sandia National Laboratories electrical designers. This development has focused on improving capability over the current state-of-the-art in the following areas: • Capability to solve extremely large circuit problems by supporting large-scale parallel computing platforms (up to thousands of processors). This includes support for most popular parallel and serial computers. • A differential-algebraic-equation (DAE) formulation, which better isolates the device model package from solver algorithms. This allows one to develop new types of analysis without requiring the implementation of analysis-specific device models. • Device models that are specifically tailored to meet Sandia’s needs, including some radiation-aware devices (for Sandia users only). • Object-oriented code design and implementation using modern coding practices. Xyce is a parallel code in the most general sense of the phrase — a message passing parallel implementation — which allows it to run efficiently a wide range of computing platforms. These include serial, shared-memory and distributed-memory parallel platforms. Attention has been paid to the specific nature of circuit-simulation problems to ensure that optimal parallel efficiency is achieved as the number of processors grows.

42 ENGINEERING↗

CG-Kit: Code Generation Toolkit for performant and maintainable variants of source code applied to Flash-X hydrodynamics simulations

CG-Kit is a new Code Generation tool-Kit that we have developed as a part of the solution for portability and maintainability for multiphysics computing applications. The development of CG-Kit is rooted in the urgent need created by the shifting landscape of high-performance computing platforms and the algorithmic complexities of a particular large-scale multiphysics application: Flash-X. To efficiently use computing resources on a heterogeneous node, an application must have a map of computation to resources and a mechanism to move the data and computation to the resources according to the map. Most existing performance portability solutions are focussed on abstracting the expression of computations so that a unified source code can be specialized to run on different resources. However, such an approach is insufficient for a code like Flash-X, which has a multitude of code components that can be assembled in various permutations and combinations to form different instances of applications. Similar challenges apply to any code that has composability, where a single specified way of apportioning work among devices may not be optimal. Additionally, use cases arise where the optimal control flow of computation may differ for different devices while the underlying numerics remain identical. This combination leads to unique challenges including handling an existing large code base in Fortran and/or C/C++, subdivision of code into a great variety of units supporting a wide range of physics and numerical methods, different parallelization techniques for distributed and shared memory systems and accelerator devices, and heterogeneity of computing platforms requiring coexisting variants of parallel algorithms. All of these challenges demand that scientific software developers apply existing knowledge about domain applications, algorithms, and computing platforms to determine custom abstractions and granularity for code generation. There is a critical lack of tools to tackle those problems. CG-Kit is designed to fill this gap by providing a user with the ability to express their desired control flow and computation-to-resource map in the form a pseudocode-like recipe. It consists of standalone tools that can be combined into highly specific and, we argue, highly effective portability and maintainability toolchains. Here we present the design of our new tools: parametrized source trees, control flow graphs, and recipes. The tools are implemented in Python. They are agnostic to the programming language of the source code targeted for code generation. In conclusion, we demonstrate the capabilities of the toolkit with two examples, first, multithreaded variants of the basic AXPY operation, and second, variants of parallel algorithms within a hydrodynamics solver, called Spark, from Flash-X that operates on block-structured adaptive meshes.

Algorithmic portability↗