Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Coded computing”

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

The accuracies of effective interactions in downfolding coupled-cluster approaches for small-dimensionality active spaces

Here, this paper evaluates the accuracy of the Hermitian form of the downfolding procedure using the double unitary coupled cluster (DUCC) ansatz on the benchmark systems of linear chains of hydrogen atoms, H6 and H8. The computational infrastructure employs the occupation-number-representation codes to construct the matrix representation of arbitrary second-quantized operators, allowing for the exact representation of exponentials of various operators. The tests demonstrate that external amplitudes from standard single-reference coupled cluster methods that sufficiently describe external (out-of-active-space) correlations reliably parameterize the Hermitian downfolded effective Hamiltonians in the DUCC formalism. The results show that this approach can overcome the problems associated with losing the variational character of corresponding energies in the corresponding SR-CC theories.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Development and Validation of SAM Multi-dimensional Flow Model for Thermal Mixing and Stratification Modeling

Thermal mixing and stratification in large pools or enclosures are very important phenomena that are critical to nuclear reactor safety. Because of the wide ranges of time and length scales associated with such phenomena, accurate modeling and simulation of thermal mixing and stratification remain as the key unresolved, challenging problems for reactor transient analyses. In traditional system analysis codes, simplified zero-dimensional (0-D) models are widely used for their high numerical efficiency, but they generally suffer from very limited prediction accuracies or range of applicability. Like traditional system analysis codes, the current version of the SAM code has implemented such simplified 0-D and one-dimensional mixing models. On the other hand, high-resolution Computational Fluid Dynamics (CFD) tools are often used to model complex thermal mixing and stratification phenomena. They are, however, generally numerically expensive, and they require large amounts of computational resources. It is therefore desirable to implement advanced and efficient thermal mixing and stratification modeling capabilities embedded in a system analysis code. This approach will improve the accuracy of reactor safety analyses when thermal mixing and stratification are involved, and also avoid using the large computational resources needed for high-resolution CFD analysis. Currently, with the support of the U.S. DOE Office of Nuclear Energy’s Nuclear Energy Advanced Modeling and Simulation program, an effort has been launched to develop and implement a multi-dimensional flow model in the system analysis code SAM, and demonstrate its applications to model thermal mixing and stratification phenomena in large enclosures. The main outcomes of this research and development activity are summarized in this report, which presents an attempt to include a built-in advanced multi-dimensional flow model in a system analysis code with the focus on overcoming the simulation challenges of thermal mixing and stratification phenomena. In this report, we start with the introduction of existing SAM code capabilities to simulate thermal mixing and stratification phenomena, which is followed by a short summary of the multi-dimensional model implemented in the SAM code, including both the physical model and the Finite Element Method code implementation. In this study, two options were implemented in the SAM code to model turbulent flows: a relatively simple built-in turbulence model and an interface to accept externally computed turbulent viscosities (e.g., from a high- resolution CFD simulation). Code validation studies on this newly added capability were then carried out to compare SAM simulation results with experimental data from the SUPERCAVNA facility, which was designed to study the complex flow recirculation and thermal stratification phenomena relevant to sodium fast reactor designs. In this study, one transient and two steady-state test cases were used for code validation. Different approaches have been used to model the complex turbulence flow fields in the SUPERCAVNA facility. A highly simplified zero-equation turbulence model was first used, but it was determined that it is too simple to capture the complex turbulence flow fields in these test cases. Subsequently, the code validation continued with the use of turbulent viscosity data from high-resolution STAR-CCM+ CFD simulations to improve the accuracy of the results. Using this approach, the SAM simulation results showed very good agreement with both the SUPERCAVNA experimental data and STAR-CCM+ simulation results. In this report, we demonstrate the development, implementation, and successful validation of a multi-dimensional flow model in the SAM code, which aims to improve the simulation accuracy for complex thermal mixing and stratification phenomena. Lessons have also been learned, including that in cases where the flow fields are not well predicted by the zero-equation model, the iinput of turbulent viscosities from an external source can enhance the overall predictive capabilities needed to accurately capture complex thermal-hydraulic phenomena. Therefore, future research will be needed to further improve the code’s capabilities, such as by developing a more efficient and robust approach to capture the turbulence effects in the SAM code.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

The Minos Computing Library: Efficient Parallel Programming for Extremely Heterogeneous Systems

Hardware specialization has become the silver bullet to achieve efficient high performance, from Systems-on-Chip systems, where hardware specialization can be ``extreme'', to large-scale HPC systems. As the complexity of the systems increases, so does the complexity of programming such architectures in a portable way. This work introduces the Minos Computing Library (MCL), as system software, programming model, and programming model runtime that facilitate programming extremely heterogeneous systems. MCL supports the execution of several multi-threaded applications within the same compute node, performs asynchronous execution of application tasks, efficiently balances computation across hardware resources, and provides performance portability. We show that code developed on a personal desktop automatically scales up to fully utilize powerful workstations with 8 GPUs and down to power-efficient embedded systems. MCL provides up to 17.5x speedup over OpenCL on NVIDIA DGX-1 systems and up to 1.88x speedup on single-GPU systems. In multi-application workloads, MCL dynamically resource allocation provides up to 2.43x performance improvement over manual, static allocation of computing resources.

Gioiosa, Roberto↗

NeuralRW-Loihi: Spiking Discrete Time Markov Chain Simulator for Intel Loihi v

SAND2024-01302O NeuralRW-Loihi: Spiking Discrete Time Markov Chain Simulator for Intel Loihi is a neuromorphic script that generates a random walk simulation of a discrete-time Markov Chain for the Loihi neuromorphic hardware. The code was used to produce the paper "Neuromorphic scaling advantages for energy-efficient random walk computations" by Smith et al., 2021. It was published in Nature Electronics. The software provides code for implementing the discrete time Markov chain random walks on Intel's Loihi Neuromorphic platform. In addition, it provides an example problem through a mini app.

Aimone, James↗

Evaluation of Attila and MCNP computational methods for dose and exposure estimation

Radiation transport calculations are often used to estimate dose or exposure to components and personnel surrounding a radiation source. The sources for these calculations are decaying radionuclides within various nuclear materials. Historically, dose calculations use MCNP (Monte Carlo N-Particle) transport code as the primary particle transport tool without a secondary computational tool to validate the results from the MCNP simulations [1]. The goal of this study is to make an independent check of the Monte Carlo solution from MCNP6 Version 6.2.1 with the discrete ordinates solution from Attila 10.2.0 Beta 3. As an example problem for this study, water-filled, stainless-steel vessels, modeled with an unstructured mesh (UM) with both MCNP and Attila [2], are exposed to 252Cf and 60Co point sources. This report also includes a discussion of the limitations of unstructured mesh in a MCNP calculation.

61 RADIATION PROTECTION AND DOSIMETRY↗

Machine-learning accelerated geometry optimization in molecular simulation

Geometry optimization is an important part of both computational materials and surface science because it is the path to finding ground state atomic structures and reaction pathways. These properties are used in the estimation of thermodynamic and kinetic properties of molecular and crystal structures. This process is slow at the quantum level of theory because it involves an iterative calculation of forces using quantum chemical codes such as density functional theory (DFT), which are computationally expensive and which limit the speed of the optimization algorithms. It would be highly advantageous to accelerate this process because then one could do either the same amount of work in less time or more work in the same time. Here, we provide a neural network (NN) ensemble based active learning method to accelerate the local geometry optimization for multiple configurations simultaneously. We illustrate the acceleration on several case studies including bare metal surfaces, surfaces with adsorbates, and nudged elastic band for two reactions. In all cases, the accelerated method requires fewer DFT calculations than the standard method. In addition, we provide an Atomic Simulation Environment (ASE)-optimizer Python package to make the usage of the NN ensemble active learning for geometry optimization easier.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A modified cosmic brane proposal for holographic Renyi entropy

We propose a new formula for computing holographic Renyi entropies in the presence of multiple extremal surfaces. Our proposal is based on computing the wave function in the basis of fixed-area states and assuming a diagonal approximation for the Renyi entropy. For Renyi index n ≥ 1, our proposal agrees with the existing cosmic brane proposal for holographic Renyi entropy. For n < 1, however, our proposal predicts a new phase with leading order (in Newton’s constant G) corrections to the cosmic brane proposal, even far from entanglement phase transitions and when bulk quantum corrections are unimportant. Recast in terms of optimization over fixed-area states, the difference between the two proposals can be understood to come from the order of optimization: for n < 1, the cosmic brane proposal is a minimax prescription whereas our proposal is a maximin prescription. We demonstrate the presence of such leading order corrections using illustrative examples. In particular, our proposal reproduces existing results in the literature for the PSSY model and high-energy eigenstates, providing a universal explanation for previously found leading order corrections to the n < 1 Renyi entropies.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Improving the performance of medical imaging applications using SYCL

As opposed to the Open Computing Language (OpenCL) programming model, in which host and device codes are generally written in different programming languages, SYCL can combine host and device codes for an application in a type-safe way to improve development productivity and performance portability. Hence, this report shows the experimental results of applying the SYCL programming model to medical imaging applications for a study on performance portability and programming productivity between OpenCL and SYCL. Rodinia is a widely used open-source benchmark suite for heterogeneous computing. We choose two medical imaging applications (Heart Wall and Particle Filter) in the benchmark suite, migrate the OpenCL implementations of the applications to the SYCL implementations, and evaluate their performance and productivity on Intel® microprocessors that contain a central processing unit (CPU) and an integrated graphics processing unit (GPU). The maturing SYCL compilers, which are based on a conformant implementation of the SYCL 1.2.1 Khronos specification, have been actively optimized for Intel® computing platforms. The experimental results are promising in terms of the raw performance and productivity. Although the SYCL implementation of the Heart Wall application does not execute successfully on a CPU, the SYCL implementations of the application can achieve comparable or better performance than the OpenCL implementation on Intel® integrated GPUs. For the Particle Filter application, the performance difference between the SYCL and OpenCL implementations is comparable on the GPUs for most cases, but the SYCL implementations are on average 4X faster than the OpenCL implementations on Intel® Xeon® CPUs. For programming productivity, we arguably use lines of code as a way to measure programming productivity in software. The SYCL programs reduce the lines of code of the OpenCL programs by 52% and 38% for the Heart Wall and Particle Filter, respectively. The results indicate that SYCL is a promising programming model for heterogeneous computing with the maturing compilers. We organize the remainder of the report as follows. Section II introduces the SYCL programming model, compares the major differences between an OpenCL program and a SYCL program, and describes the characteristics of the two applications. Section III describes the SYCL programming model in more details, and shows the SYCL implementation of a kernel function in the Particle Filter application as an example. In Section IV, we evaluate the performance of the applications on the CPUs and GPUs. Section V concludes the report.

59 BASIC BIOLOGICAL SCIENCES↗

Measurement and analysis of GPU-accelerated applications with HPCToolkit

To address the challenge of performance analysis on the US DOE’s forthcoming exascale supercomputers, Rice University has been extending its HPCToolkit performance tools to support measurement and analysis of GPU-accelerated applications. To help developers understand the performance of accelerated applications as a whole, HPCToolkit’s measurement and analysis tools attribute metrics to calling contexts that span both CPUs and GPUs. To measure GPU-accelerated applications efficiently, HPCToolkit employs a novel wait-free data structure to coordinate monitoring and attribution of GPU performance. To help developers understand the performance of complex GPU code generated from high-level programming models, HPCToolkit constructs sophisticated approximations of call path profiles for GPU computations. To support fine-grained analysis and tuning, HPCToolkit uses PC sampling and instrumentation to measure and attribute GPU performance metrics to source lines, loops, and inlined code. To supplement fine-grained measurements, HPCToolkit can measure GPU kernel executions using hardware performance counters. To provide a view of how an execution evolves over time, HPCToolkit can collect, analyze, and visualize call path traces within and across nodes. Finally, on NVIDIA GPUs, HPCToolkit can derive and attribute a collection of useful performance metrics based on measurements using GPU PC samples. Here, we illustrate HPCToolkit’s new capabilities for analyzing GPU-accelerated applications with several codes developed as part of the Exascale Computing Project.

97 MATHEMATICS AND COMPUTING↗

Generation and suppression of runaway electrons in MST tokamak plasmas

This paper discusses the behavior of runaway electrons in tokamak plasmas at low electron density, plasma current, and magnetic field using experimental data from the Madison Symmetric Torus and computational data from the NIMROD nonlinear resistive 3D MHD code. Density thresholds for the onset and suppression of runaway electrons are determined experimentally in steady tokamak plasmas, and in plasmas with a population of runaway electrons, resonant magnetic perturbations with different poloidal mode numbers are applied. Poloidal mode number m = 3 perturbations suppress the runaway electrons, while perturbations with m = 1 have little effect. This difference is consistent with the difference in computed magnetic topologies. The m = 1 RMP has minimal effect on the topology, while the m = 3 RMP produces a broad region of stochasticity, which can allow for rapid loss of the runaway electrons.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Simulations of multicomponent relativistic thermalization

Multicomponent relativistic fluids have been studied for decades. However, simulating the dynamics of the particles and fluids in such a mixture has been a challenge due to the fact that such simulations are computationally expensive in three spatial dimensions. Here, we report on the development and application of a multidimensional relativistic Monte Carlo code to explore the thermalization process in a relativistic multicomponent environment in a computationally inexpensive way. As an illustration we simulate the fully relativistic three-dimensional Brownian-motion-like solution to the thermalization of a high-mass particle (proton) in a bath of relativistic low-mass particles (electrons). Here, we follow the thermalization and ultimate equilibrium distribution of the Brownian-like particle as can happen in the cosmic plasma during big-bang nucleosynthesis. We also simulate the thermalization of energetic particles injected into the plasma as can occur, for example, by the decay of massive unstable particles during the big bang.

79 ASTRONOMY AND ASTROPHYSICS↗

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical optimization algorithms. Although LP decoders have been proposed for quantum codes, their performance and limitations remain relatively underexplored. In this work, we uncover a key limitation of LP decoding for quantum low-density parity-check (LDPC) codes: certain constant-weight error patterns lead to ambiguous fractional solutions that cannot be resolved through independent rounding. To address this issue, we incorporate a post-processing technique known as ordered statistics decoding (OSD), which significantly enhances LP decoding performance in practice. Our results show that LP decoding, when augmented with OSD, can outperform belief propagation with the same post-processing for intermediate code sizes of up to hundreds of qubits. These findings suggest that LP-based decoders, equipped with effective post-processing, offer a promising approach for decoding near-term quantum LDPC codes.

Gu, Shouzhen [Yale U.]↗

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical optimization algorithms. Although LP decoders have been proposed for quantum codes, their performance and limitations remain relatively underexplored. In this work, we uncover a key limitation of LP decoding for quantum low-density parity-check (LDPC) codes: certain constant-weight error patterns lead to ambiguous fractional solutions that cannot be resolved through independent rounding. To address this issue, we incorporate a post-processing technique known as ordered statistics decoding (OSD), which significantly enhances LP decoding performance in practice. Our results show that LP decoding, when augmented with OSD, can outperform belief propagation with the same post-processing for intermediate code sizes of up to hundreds of qubits. These findings suggest that LP-based decoders, equipped with effective post-processing, offer a promising approach for decoding near-term quantum LDPC codes.

Gu, Shouzhen [Yale U.]↗

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical optimization algorithms. Although LP decoders have been proposed for quantum codes, their performance and limitations remain relatively underexplored. In this work, we uncover a key limitation of LP decoding for quantum low-density parity-check (LDPC) codes: certain constant-weight error patterns lead to ambiguous fractional solutions that cannot be resolved through independent rounding. To address this issue, we incorporate a post-processing technique known as ordered statistics decoding (OSD), which significantly enhances LP decoding performance in practice. Our results show that LP decoding, when augmented with OSD, can outperform belief propagation with the same post-processing for intermediate code sizes of up to hundreds of qubits. These findings suggest that LP-based decoders, equipped with effective post-processing, offer a promising approach for decoding near-term quantum LDPC codes.

Gu, Shouzhen [Yale U.]↗

Multicode benchmark on simulated Ti K-edge x-ray absorption spectra of Ti-O compounds

X-ray absorption spectroscopy (XAS) is an element-specific materials characterization technique that is sensitive to structural and electronic properties. First-principles simulated XAS has been widely used as a powerful tool to interpret experimental spectra and draw physical insights. Recently, there has also been growing interest in building computational XAS databases to enable data analytics and machine learning applications. However, there are non-trivial differences among commonly used XAS simulation codes, both in underlying theoretical formalism and in technical implementation. Reliable and reproducible computational XAS databases require systematic benchmark studies. In this work, we benchmarked Ti K-edge XAS simulations of ten representative Ti-O binary compounds, which we refer to as the Ti-O-10 dataset, using three state-of-the-art codes: XSPECTRA, OCEAN and exciting. We systematically studied the convergence behavior with respect to the input parameters and developed a workflow to automate and standardize the calculations to ensure converged spectra. Our benchmark comparison considers a 35 eV spectral range starting from the K-edge onset, representative of widely used near-edge spectra. Quantitative comparison over this range is based on Spearman’s rank correlation score (r sp ). Our results show: (1) the two Bethe-Salpeter equation (BSE) codes (OCEAN and exciting) have excellent agreement with an average $r$ $sp$ of 0.998; (2) good agreement is obtained between the core-hole potential code (XSPECTRA) and BSE codes (OCEAN and exciting) with an average $r$ $sp$ of 0.990, and this smaller $r$ $sp$ reflects the noticeable differences in the main edge spectral shape that can be primarily attributed to the difference in the strength of the screened core-hole potential; (3) simulations from both methods overall reproduce well the main experimental spectral features of rutile and anatase, and the different treatments of the screened core-hole potential have visible impact on pre-edge intensities and the peak ratio of the main edge; (4) there exist moderate differences in the relative edge alignment of the three codes with a standard deviation of about 0.2 eV, which arise from multiple contributions including the frozen core approximation, final state effects, and different approximations used for the self-energy correction. In conclusion, our benchmark study provides important standards for first-principles XAS simulations with broad impact in data-driven XAS analysis.

36 MATERIALS SCIENCE↗

Automatic Code Generation for High-Performance Graph Algorithms

Graph problems are common across fields of scientific computing and social sciences. However, despite their importance, implementing graph algorithms effectively on modern computing systems is a challenging task that requires significant programming effort and generally results in customized implementations. Current computing and memory hierarchies are not architected for irregular computations resulting in challenges for graph algorithms to achieve high performance on those architectures. In this paper, we present GraphX, a novel compiler framework and DSL designed to simplify the development of efficient graph algorithms and achieve high performance on modern computing systems. GraphX consists of a DSL for efficient implementation of graph algorithms, various optimizations, such as support for sparse linear algebra and workspace transformations, optimized graph primitives, including semiring and masking, and a high-performance code generation engine. Using GraphX, users can implement graph algorithms using a semantically-rich language with graph-oriented operators. GraphX uses these semantics to automatically generate efficient code for target architectures, increasing performance and portability across architectures. The composable nature of GraphX makes it possible to extend the set of optimizations and architectures without modifying the source code. We demonstrate GraphX outperforms state-of-the-art graph libraries, such as LAGraph, up to $3.7 speedup in semiring operations, $2.19 speedup in an important sparse computational kernel, and $9.05 speedup in graph processing algorithms.

compiler, graph algorithms, semiring, masking, wor↗

Introduction to an MCGIDI Mini-App and Performance Comparisons with XSBench

In high-performance Monte Carlo (MC) radiation transport codes, cross section lookups often account for the majority of computational expens. In response to this observation, a number of nuclear data mini-apps have been developed to profile and optimize the lookup process. A review of these mini-apps can be found in Ref. In contrast to a fully fledged MC code, nuclear data mini-apps do not feature particle tracking; instead, the cross section lookup process is considered in isolation, a simplification that allows for easier implementation and evaluation of various lookup schemes and techniques. GIDI+, as described on its public repository1, is ...a collection of C++ libraries for accessing evaluated and processed nuclear data stored in the Generalized Nuclear Database Structure (GNDS). In addition to reading GNDS files, GIDI+ has functions to sum and collapse multi-group data as needed by deterministic transport codes, and to sample GNDS data as needed by Monte Carlo transport codes. Certain modes of Mercury, a LLNL-developed MC radiation transport code, utilize GIDI+ for cross section lookups. Specifically, Mercury uses the MCGIDI library contained within GIDI+ to perform lookups on GPUs. A mini-app exercising MCGIDI’s cross section lookup capabilities would prove useful for optimization, which in turn could improve the performance of client codes such as Mercury. Such a mini-app could also be used to assess the performance of MCGIDI compared to other nuclear data mini-apps. In this document, we introduce a nuclear data mini-app built with the MCGIDI library. The MCGIDI mini-app (MCGIDI-MA) was developed to closely resemble the methodology present in XSBench, a nuclear data mini-app developed at Argonne National Laboratory. The remainder of this section provides an overview on XSBench. Section 2 describes MCGIDI-MA and its usage. Section 3 contains performance results of MCGIDI-MA on LLNL’s Lassen and Quartz compute platforms, as well as comparisons to XSBench performance where appropriate. In Section 4, we present a summary of our findings.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Planar slicing for nonextrusion AM processes

Extrusion-based AM processes, including material extrusion and directed energy deposition, construct objects by continuously depositing a relatively small amount of molten feedstock to a specific location. Nonextrusion AM processes, on the other hand, tend to form each layer by linearly or areally projecting either energy onto a vat of photocurable liquid or a binding agent into a bed of loose powder. Such systems vary significantly from extrusion-based AM processes but do share similarities. The general approach to path planning is the same, but nonextrusion processes typically favor the use of bitmap representations, instead of polygons, for pathing computation and do not use a g-code file to command the printer. In this chapter, a high-level discussion of these differences will be covered.

Macdonald, Eric↗