Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “complex 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 811 records · Page 45
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

PPPL Laboratory Directed Research and Development (Project Final Reports, FY2018 - FY2020)

The U.S. Department of Energy’s (DOE) Princeton Plasma Physics Laboratory (PPPL) is a collaborative national center for fusion energy science, basic sciences, and advanced technology. The Laboratory has three major missions: (1) to develop the scientific knowledge and advanced engineering to enable fusion to power the U.S. and the world; (2) to advance the science of nanoscale fabrication for technologies of tomorrow; and (3) to further the development of the scientific understanding of the plasma universe from laboratory to astrophysical scales. PPPL’s Laboratory Directed Research and Development (LDRD) program supports and encourages creativity and innovation and contributes to its long-term viability. New scientific and technical research areas emerge and are nurtured through the program. Furthermore, new capabilities are developed to enable the Laboratory to meet its and DOE’s missions. The program is used to systematically diversify the Laboratory’s programs and mission. In the last few years, the program has started projects in nanomaterial synthesis, microelectronics, advanced x-ray spectroscopy, high-energy-density physics, superconducting magnet technology, machine learning and artificial intelligence, 3D magnetic fields to optimize fusion plasmas, integration of permanent magnets with simple high-field magnets to reduce the cost of producing complex 3D magnetic fields, advanced computational methods for predictive understanding and control of fusion plasma, development of quantum computing algorithms for plasma physics, liquid metal plasma-facing components for fusion reactors, virtual engineering, and plasma-based space propulsion. The program is also the vehicle to recruit and train talented scientists and engineers with the new skills needed to perform the Laboratory’s mission. Many of the new hires through the program go on to become world-class scientists and engineers in their fields. This report provides descriptions and accomplishments of those LDRD projects that were completed during fiscal years 2018 through 2020.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Cold Plasma Measurements

We have continued the simulation campaign in support of our ongoing magnetospheric cold plasma research project. This project aims to develop the next-generation particle instruments to measure the properties of the cold particle populations in the Earth’s magnetosphere. For this purpose, simulations have been performed with a Particle-In-Cell (PIC) code called the Curvilinear PIC (CPIC). The code is formulated in curvilinear geometry and couples the standard PIC algorithm with algorithms for the generation and adaptation of the underlaying computational mesh. It conforms to complex objects like spacecraft and it can place more grid points in regions where higher resolution is needed. The code also features a scalable solver based on the multigrid algorithm and it is fully parallelized via domain decomposition and MPI.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

An Efficient Storage-Driven Machine Learning Model for Performance in the Era of Multimodal Scientific Data

Scientific workflows are increasingly relying on machine learning (ML), simulation, and hybrid techniques to predict, understand, and optimize the behavior of complex experiments. High-performance computing has greatly improved researchers’ ability to acquire diverse data modalities in these workflows. Recent studies suggest that the performance of machine learning models can be improved by integrating data from various sources. Unfortunately, these workloads pose unprecedent pressure on the network storage to meet the demands associated with accessing these multimodal data. To mitigate the impact of intensive IO, we propose a solution that utilizes a multi-tier High-Performance Computing (HPC) distributed storage and data processing framework, placing computation where the data resides for better performance. By adopting this project, the scientific community will gain new opportunities to explore multimodal storage-driven possibilities, integrating multiple scientific data sources with advanced streaming frameworks. Additionally, our framework effectively utilizes computing resources and bridges the gaps identified by HPC experts. Our proposed approach tackles scalability and persistence challenges by leveraging native persistency, which has posed difficulties in traditional approaches. Furthermore, we seek to enhance fault-tolerance and load-balance of computations by leveraging real-time streaming in diverse scientific computing environments, thereby propelling advanced scientific computing research into the next generation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Optimizing Distributed Training on Frontier for Large Language Models

Large language models (LLMs) have demonstrated remarkable success as foundational models, benefiting various downstream applications through fine-tuning. Loss scaling studies have demonstrated the superior performance of larger LLMs compared to their smaller counterparts. Nevertheless, training LLMs with billions of parameters poses significant challenges and requires considerable computational resources. For example, training a one trillion parameter GPT-style model on 20 trillion tokens requires a staggering 120 million exaflops. This research explores efficient distributed training strategies to extract this computation from Frontier, the world's first exascale supercomputer. We enable and investigate various model and data parallel training techniques, such as tensor parallelism, pipeline parallelism, and sharded data parallelism, to facilitate training a trillion-parameter model on Frontier. We empirically assess these techniques and their associated parameters to determine their impact on memory footprint, communication latency, and GPU's computational efficiency. We analyze the complex interplay among these techniques and find a strategy to combine them to achieve high throughput through hyperparameter tuning. We have identified efficient strategies for training large LLMs of varying sizes through empirical analysis and hyperparameter tuning. For 22 Billion, 175 Billion, and 1 Trillion parameters, we achieved GPU throughputs of 38.38%, 36.14%, and 31.96%, respectively. For the training of the 175 Billion parameter model and the 1 Trillion parameter model, we achieved 100% weak scaling efficiency on 1024 and 3072 Mi250X GPUs, respectively. We also achieved strong scaling efficiencies of 89% and 87% for these two models. We trained these models only tens of iterations instead of training till completion.

Yin, Junqi↗
DOE OSTI2023

A Fully Explicit Integrator for Modeling Astrophysical Reactive Flows

Simulating complex astrophysical reacting flows is computationally expensive—reactions are stiff and typically require implicit integration methods. The reaction update is often the most expensive part of a simulation, which motivates the exploration of more economical methods. In this research note, we investigate how the explicit Runge–Kutta–Chebyshev (RKC) method performs compared to an implicit method when applied to astrophysical reactive flows. These integrators are applied to simulations of X-ray bursts arising from unstable thermonuclear burning of accreted fuel on the surface of neutron stars. We show that the RKC method performs with similar accuracy to our traditional implicit integrator, but is more computationally efficient when run on CPUs.

GPU computing↗
DOE OSTI2023

X-Ray Energy Deposition Model for Simulating Asteroid Response to a Nuclear Planetary Defense Mitigation Mission

Abstract In the event of a potentially catastrophic asteroid impact, with sufficient warning time, deploying a nuclear device remains a powerful option for planetary defense if a kinetic impactor or other means of deflection proves insufficient. Predicting the effectiveness of a potential nuclear deflection or disruption mission depends on accurate multiphysics simulations of the device's X-ray energy deposition into the asteroid and the resulting material ablation. The relevant physics in these simulations span many orders of magnitude, require a variety of different complex physics packages, and are computationally expensive. Having an efficient and accurate way of modeling this system is necessary for exploring a mission's sensitivity to the asteroid's range of physical properties. To expedite future simulations, we present a completed X-ray energy deposition model developed using the radiation-hydrodynamics code Kull that can be used to initiate a nuclear mitigation mission calculation. The model spans a wide variety of possible mission initial conditions: four different asteroid-like materials at a range of porosities, two different source spectra, and a broad range of radiation fluences, source durations, and angles of incidence. Using blowoff momentum as the primary metric, the model-initiated simulation results match the full radiation-hydrodynamics results to within 10%.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Decentralized Distributed Proximal Policy Optimization (DD-PPO) for High Performance Computing Scheduling on Multi-User Systems

Resource allocation in High Performance Computing (HPC) environments presents a complex and multifaceted challenge for job scheduling algorithms. Beyond the efficient allocation of system resources, schedulers must account for and optimize multiple performance metrics, including job wait time and system throughput. Traditional heuristic-based scheduling algorithms increasingly struggle and lack the efficiency needed to meet the demands and address the complexity and scale of modern HPC systems. Consequently, recent research efforts have focused on leveraging advancements in Artificial Intelligence (AI) and Deep Learning (DL), particularly Reinforcement Learning (RL), to develop more adaptable and intelligent scheduling strategies. Previous RL-based scheduling approaches have explored a range of algorithms, from Deep Q-Networks (DQN) to Proximal Policy Optimization (PPO), and more recently, hybrid methods that integrate Graph Neural Networks (GNNs) with RL techniques. However, a common limitation across these methods is their reliance on relatively small datasets, with few methods being evaluated using large-scale, multi-million-job trace datasets representative of real-world HPC workloads. Moreover, existing RL schedulers face scalability issues due to centralized policy updates, which hinder training efficiency and performance when applied to large datasets. This study introduces a novel RL-based scheduler utilizing Decentralized Distributed Proximal Policy Optimization (DD-PPO) algorithm, which supports large-scale distributed training across multiple workers without requiring parameter synchronization at every step. By eliminating reliance on centralized updates to a shared policy, the DD-PPO scheduler enhances scalability, training efficiency, and sample utilization. Experimental validation using a large real-world dataset containing over 11.5 million job traces collected from petascale HPC systems over six years assesses the influence of dataset scale on training effectiveness and compares DD-PPO performance to traditional and advanced scheduling approaches. The experimental results demonstrate improved scheduling performance in comparison to both heuristic-based schedulers and existing RL-based scheduling algorithms.

AI↗
DOE OSTI2020

Higher-order phonon scattering: advancing the quantum theory of phonon linewidth, thermal conductivity and thermal radiative properties

Phonon scattering plays a central role in the quantum theory of phonon linewidth, which in turn governs important properties including infrared spectra, Raman spectra, lattice thermal conductivity, thermal radiative properties, and also signifi- cantly affects other important processes such as hot electron relaxation. Since Maradudin and Fein’s classic work in 1962, three-phonon scattering had been considered as the dominant intrinsic phonon scattering mechanism and has seen tremendous advances. However, the role of the higher-order four-phonon scattering had been persistently unclear and so was ignored. The tremendous complexity of the formalism and computational challenges stood in the way, prohibiting the direct and quantitative treatment of four-phonon scattering. In 2016, a rigorous four-phonon scattering formalism was developed, and the prediction was realized using empirical potentials. In 2017, the method was extended using first-principles calculated force constants, and the thermal conductivities of boron arsenides (BAs), Si and diamond were predicted. The predictions for BAs were later confirmed by several independent experiments. Four-phonon scattering has since been investigated in a range of materials and established as an important intrinsic scattering mechanism for thermal transport and radiative properties. Specifically, four-phonon scattering is important when the fourth-order scattering potential or phase space becomes relatively large. The former scenario includes: (i) nearly all materials when the temperature is high; (ii) strongly anharmonic (low thermal conductivity) materials, including most rocksalt compounds, halides, hydrides, chalcogenides and oxides. The latter scenario includes: (iii) materials with large acoustic–optical phonon band gaps, such as XY compounds with a large atomic mass ratio between X and Y; (iv) two- dimensional materials with reflection symmetry, such as single-layer graphene, single-layer boron nitride and carbon nanotubes; and (v) phonons with a large density of states, such as optical phonons, which are important for Raman, infrared and thermal radiative properties. Four-phonon scattering is expected to gain broad interest in various technologically important materials for thermoelectrics, thermal barrier coatings, thermal energy storage, phase change, nuclear power, ultra-high temperature ceramics, infrared spectra, Raman spectra, radiative transport, hot electron relaxation and radiative cooling. Four-phonon scattering has been, and will continue to be, established as an important intrinsic phonon scattering mechanism beyond three-phonon scattering. The prediction of four-phonon scattering will transition from a breakthrough to a new routine in the next decade.

Feng, Tianli↗
DOE OSTI2025

XFEM Development for Modeling Crack Growth in Prototypical Welded Components

Nuclear power plant components are subjected to harsh operating environments that can lead to multiple degradation mechanisms in which fracture can play a prominent role. Predicting crack growth is important for assessing the integrity of welded components. The extended finite element method (XFEM) is an important tool for modeling such crack growth, and XFEM capabilities have been developed within the MOOSE framework. This report documents work in the MOOSE XFEM module to model fractures in three-dimensional representations of components using a topologically two-dimensional mesh to define cutting planes. Crack growth algorithms have been implemented to evolve the cutting mesh based on equations for stress corrosion cracking. Additionally, several usability and robustness improvements have been developed to enable three-dimensional fracture simulations. The cutting algorithms were demonstrated on a three-dimensional model of a prototypical reactor component undergoing stress corrosion cracking driven by idealized weld residual stresses. This is an incremental step toward using this capability to model more complex components with residual stresses computed through welding process simulations.

42 - ENGINEERING↗
DOE OSTI2023

Computational projects with the Landau–Zener problem in the quantum mechanics classroom

The Landau–Zener problem, where a minimum energy separation is passed with constant rate in a two-state quantum-mechanical system, is an excellent model quantum system for a computational project. It requires a low-level computational effort, but has a number of complex numerical and algorithmic issues that can be resolved through dedicated work. It can be used to teach computational concepts, such as accuracy, discretization, and extrapolation, and it reinforces quantum concepts of time-evolution via a time-ordered product and of extrapolation to infinite time via time-dependent perturbation theory. Additionally, we discuss the concept of compression algorithms, which are employed in many advanced quantum computing strategies, and easy to illustrate with the Landau–Zener problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Multi-fidelity information fusion and resource allocation

This project created and demonstrated a framework for the efficient and accurate prediction of complex systems with only a limited amount of highly trusted data. These next generation computational multi-fidelity tools fuse multiple information sources of varying cost and accuracy to reduce the computational and experimental resources needed for designing and assessing complex multi-physics/scale/component systems. These tools have already been used to substantially improve the computational efficiency of simulation aided modeling activities from assessing thermal battery performance to predicting material deformation. This report summarizes the work carried out during a two year LDRD project. Specifically we present our technical accomplishments; project outputs such as publications, presentations and professional leadership activities; and the project’s legacy.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

Quantum Time-Space Tradeoffs for Matrix Problems

We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices 𝐴, including the discrete Fourier transform matrix, we prove that quantum circuits with at most 𝑇 input queries and 𝑆 qubits of memory require 𝑇 = Ω⁢(𝑛 2 /𝑆) to compute matrix-vector product 𝐴⁢𝑥 for 𝑥 ∈{0,1 𝑛 . We similarly prove that matrix multiplication for 𝑛 ×𝑛 binary matrices requires 𝑇 = Ω⁢(𝑛 3 /$\sqrt{𝑆}$). Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for 𝑛 × 𝑛 Boolean matrix multiplication to 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/4 ) from 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/2 ). Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.

lower bounds↗
DOE OSTI2025

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Compositionally complex carbide ceramics: A perspective on irradiation damage

Extensive experimental and computational studies have demonstrated outstanding physical and chemical properties of the novel materials of compositionally complex carbides (CCCs), enabling their promising applications in advanced fission and fusion energy systems. This perspective provides a comprehensive overview of radiation damage behavior reported in the literature to understand the fundamental mechanisms related to the impact of multi-principal metal components on phase stability, irradiation-induced defect clusters, irradiation hardening, and thermal conductivity of compositionally complex carbides. Several future research directions are recommended to critically evaluate the feasibility of designing and developing new ceramic materials for extreme environments using the transformative “multi-principal component” concept. Compared to the existing materials for nuclear applications including stainless steels, nickel alloys, ZrC, SiC, and potentially high-entropy alloys, as well as certain other compositionally complex ceramic families. CCCs appear to be more resistant to amorphization, growth of irradiation defect clusters, and void swelling.

36 MATERIALS SCIENCE↗
DOE OSTI2024

DECA: Discrete Event inspired Cellular Automata for grain structure prediction in additive manufacturing

Microstructure largely dictates macroscopic material properties and is strongly affected by processing. Therefore, the simulation of microstructure evolution in response to thermal fields during processing is of significant interest within the computational materials science community. Additive manufacturing (AM) has emerged as a technique for producing complex geometries and unique microstructures. Yet, complex and rapid thermal cycles in AM pose computational challenges for existing microstructure models. This work proposes a discrete event inspired cellular automata (CA) approach, titled DECA, to accelerate simulation of grain structure evolution in AM. In contrast to conventional time-stepped CA models, this model directly solves the times capture events would take place allowing for stepping in events rather than time (a technique also found in the field of discrete-event simulation). In comparison to purely serial discrete-event models, DECA allows for temporary violation of the causality constraint, but detects and corrects these violations, leading to an emergent phenomenon dubbed causality rippling, in which previously calculated capture events are overwritten. The amount of repeated calculations, defined by the capture ratio, is taken as a measure of computational inefficiency, and the model parameters that affect this ratio are evaluated. The new DECA approach was found to be more computationally efficient than conventional time-stepped CA models while guaranteeing an accurate solution, which can only be achieved in the conventional models for vanishingly small time steps. Finally, opportunities for parallelization and scaling of the new approach are discussed.

36 MATERIALS SCIENCE↗
DOE OSTI2023

A Perspective on Sustainable Computational Chemistry Software Development and Integration

The power of quantum chemistry to predict the ground and excited state properties of complex chemical systems has driven the development of computational quantum chemistry software, integrating advances in theory, applied mathematics, and computer science. The emergence of new computational paradigms associated with exascale technologies also poses significant challenges that require a flexible forward strategy to take full advantage of existing and forthcoming computational resources. In this context, the sustainability and interoperability of computational chemistry software development are among the most pressing issues. In this perspective, we discuss software infrastructure needs and investments with an eye to fully utilize exascale resources and provide unique computational tools for next-generation science problems and scientific discoveries.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Enhancing the Q-Factor of a Practical Qubit Niobium Three-Dimensional λ/4-Resonator Through Surface Treatment

Quantum computing stands as a revolutionary frontier in information technology, with the potential to solve complex problems far beyond the capacity of classical computers. At the heart of this disruptive innovation are qubits, forming the fundamental backbone of quantum computing. A leading-edge solution for constructing robust, enduring qubits involves embedding a Josephson junction within a high Q-factor, superconducting three-dimensional cavity. Further, our recent innovation lies in developing a uniquely optimized, quarter-wave resonator-based superconducting cavity, functioning at 6 GHz, specifically tailored for quantum computers. In this work, we elucidate our advancement towards elevating the Q-factor tenfold, an achievement made possible through the enhancement of machining precision, the application of rigorous postprocessing techniques—including mechanical, chemical, and surface treatments—as well as the refinement of our testing methods.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗