Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Massive 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 19 records

4th Big Data for Nuclear Power Plants Workshop 2023

The Ohio State University and Idaho National Laboratory organized the 4 th Big Data for Nuclear Power Plants Workshop in November, 2023 in Columbus, Ohio. Workshop topics were chosen to understand the challenges and gaps that need to be addressed to maximize the impact of data on the nuclear industry, as well as the associated applications and risks. Discussions were focused around six specific application areas: Operation and Maintenance; Machine Learning in Nuclear Materials and Advanced Manufacturing; Cybersecurity; High-Performance Computing and Massive Computation; Big Data and Digital Twins; and Nuclear Non-Proliferation. The opportunities, challenges, and risks identified in the six focus areas explored in this workshop are diverse, but some common themes emerge, such as the importance of data integrity, quality, coverage, privacy, and traceability. Big data and AI/ML tools can be leveraged to reduce costs, optimize human tasking, and reduce human error across various application areas. In order for the nuclear industry to benefit from big data and advanced analytic capabilities, it is essential to address challenges and risks, such as data privacy, model reliability, and computational resource availability. Learning from other industries that have successfully implemented big data and AI/ML technologies, like the aerospace industry, can help the nuclear industry successfully integrate these technologies.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Enabling Scalable VQE Simulation on Leading HPC Systems

Large-scale simulations of quantum circuits pose significant challenges, especially in the context of quantum chemistry, due to the number of qubits, circuit depth, and the number of circuits needed per problem. High-performance computing (HPC) systems offer massive computational capabilities that could help overcome these obstacles. We developed a high-performance quantum circuit simulator, called NWQ-Sim, and demonstrate its capability to simulate large quantum chemistry problems on NERSC's Perlmutter supercomputer. Integrating NWQ-Sim with XACC, we have executed QPE and VQE algorithms for downfolded quantum chemistry systems at unprecedented scales. Our work demonstrates the potential of leveraging HPC resources to advance quantum chemistry and other applications of near-term quantum devices.

Wang, Meng↗

Massively parallel, computationally guided design of a proenzyme

Proteins have shown promise as therapeutics and diagnostics, but their effectiveness is limited by our inability to spatially target their activity. To overcome this limitation, we developed a computationally guided method to design inactive proenzymes or zymogens, which are activated through cleavage by a protease. Since proteases are differentially expressed in various tissues and disease states, including cancer, these proenzymes could be targeted to the desired microenvironment. We tested our method on the therapeutically relevant protein carboxypeptidase G2 (CPG2). We designed Pro-CPG2s that are inhibited by 80 to 98% and are partially to fully reactivatable following protease treatment. The developed methodology, with further refinements, could pave the way for routinely designing protease-activated protein-based therapeutics and diagnostics that act in a spatially controlled manner. Confining the activity of a designed protein to a specific microenvironment would have broad-ranging applications, such as enabling cell type-specific therapeutic action by enzymes while avoiding off-target effects. While many natural enzymes are synthesized as inactive zymogens that can be activated by proteolysis, it has been challenging to redesign any chosen enzyme to be similarly stimulus responsive. Here, we develop a massively parallel computational design, screening, and next-generation sequencing-based approach for proenzyme design. For a model system, we employ carboxypeptidase G2 (CPG2), a clinically approved enzyme that has applications in both the treatment of cancer and controlling drug toxicity. Detailed kinetic characterization of the most effectively designed variants shows that they are inhibited by ∼80% compared to the unmodified protein, and their activity is fully restored following incubation with site-specific proteases. Introducing disulfide bonds between the pro- and catalytic domains based on the design models increases the degree of inhibition to 98% but decreases the degree of restoration of activity by proteolysis. A selected disulfide-containing proenzyme exhibits significantly lower activity relative to the fully activated enzyme when evaluated in cell culture. Structural and thermodynamic characterization provides detailed insights into the prodomain binding and inhibition mechanisms. The described methodology is general and could enable the design of a variety of proproteins with precise spatial regulation.

59 BASIC BIOLOGICAL SCIENCES↗

Developing Multiphysics, Integrated, High-Fidelity, Massively Parallel Computational Capabilities for Fusion Applications Using MOOSE

As the need for fusion as a clean, sustainable, and abundant energy source grows internationally, so does the need for multiphysics, computational tools to model, study, and predict the complex interactions between plasma, materials, and engineering processes. These tools have a crucial role to play in solving scientific and engineering challenges and accelerating fusion energy deployment. To address these needs, modeling capabilities should enable massively parallel, multiphysics, fully integrated high-fidelity simulations of fusion systems. Additional attributes, such as being open source and modular while maintaining high software quality assurance standards will maximize impact by ensuring accessibility for all and wide acceptance, rapid expansion and development, as well as reliability, efficiency, and robustness. In this paper, we describe how the Multiphysics Object-Oriented Simulation Environment (MOOSE) framework, which has a track record of success in the fission space thanks to the attributes listed above, can be leveraged in the fusion energy field. We highlight key successes of the MOOSE application in the fission space and describe how MOOSE has been and is being applied to fusion applications in the United States---e.g., Tritium Migration Analysis Program, version 8 (TMAP8), MOOSE Fusion Module, Fusion ENergy Integrated multiphys-X (FENIX)---and the United Kingdom---e.g., AURORA, Achlys, Apollo. These efforts aim to establish a suite of tools that can be further extended to accelerate fusion energy deployment.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Softwarized Federations of Science Instruments with Edge-Continuum Containers

Significant expansion of capabilities of DOE science complex of supercomputers, instruments and networks is expected as powerful experimental facilities, exascale computers and terabit networks are added. Combined with the advances in edge and cloud computing technologies, DOE science users now have the promise of unprecedented execution of complex, continuum workflows, namely, small and latency-sensitive computations at the edge and site, massive computations at remote HPC systems, and everything in between on the cloud. But, bringing this capability to the science user requires overcoming the overwhelming complexity of forming the federations of systems, and efficiently and effectively orchestrating the workflows while ensuring high utilization of the expensive facilities. Current manual configuration of the federated systems simply will not scale, since the coordination across sites may take weeks to months, often leading to under-utilized and hard-to-diagnose compositions. A powerful, composable software stack will be developed to (i) wrap the systems so that federations can be composed fast in software, and (ii) containerize computations to be orchestrated across the edge, site, cloud and HPC resources.

Rao, Nageswara S.↗

Finding Electronic Structure Machine Learning Surrogates without Training

A myriad of phenomena in materials science and chemistry rely on quantum-level simulations of the electronic structure in matter. While moving to larger length and time scales has been a pressing issue for decades, such large-scale electronic structure calculations are still challenging despite modern software approaches and advances in high-performance computing. The silver lining in this regard is the use of machine learning to accelerate electronic structure calculations – this line of research has recently gained growing attention. The grand challenge therein is finding a suitable machine-learning model during a process called hyperparameter optimization. This, however, causes a massive computational overhead in addition to that of data generation. We accelerate the construction of machine-learning surrogate models by roughly two orders of magnitude by circumventing excessive training during the hyperparameter optimization phase. We demonstrate our workflow for Kohn-Sham density functional theory, the most popular computational method in materials science and chemistry.

36 MATERIALS SCIENCE↗

Los Alamos National Laboratory High Performance Computing Overview [Slides]

We need such big computers because without testing, we don't understand the health of the AGING stockpile. Our big computers store a wealth of test data. We model weapons as they were tested and see if we can match the results to validate models, and we then use validated models along with dismantlement information on aging to certify the stockpile. Sometimes the results of tests can’t be explained well, so even that part requires massive computations, but applying the model to future use is an astonishing amount of computing.

97 MATHEMATICS AND COMPUTING↗

Towards modelling AR Sco: generalized particle dynamics and strong radiation-reaction regimes

Numerical simulations of relativistic plasmas have become more feasible, popular, and crucial for various astrophysical sources with the availability of computational resources. The necessity for high-accuracy particle dynamics is especially highlighted in pulsar modelling due to the extreme associated electromagnetic fields and particle Lorentz factors. Including the radiation-reaction force in the particle dynamics adds even more complexity to the problem, but is crucial for such extreme astrophysical sources. We have also realized the need for such modelling concerning magnetic mirroring and particle injection models proposed for AR Sco, the first white dwarf pulsar. This paper demonstrates the benefits of using higher-order explicit numerical integrators with adaptive time-step methods to solve the full particle dynamics with radiation-reaction forces included. We show that for standard test scenarios, namely various combinations of uniform E- and B-fields and a static dipole B-field, the schemes we use are equivalent to and in extreme field cases outperform standard symplectic integrators in accuracy. We show that the higher-order schemes have massive computational time improvements due to the adaptive time-steps we implement, especially in non-uniform field scenarios and included radiation reaction where the particle gyro-radius rapidly changes. When balancing accuracy and computational time, we identified the adaptive Dormand–Prince eighth-order scheme to be ideal for our use cases. The schemes we use maintain accuracy and stability in describing the particle dynamics and we indicate how a charged particle enters radiation-reaction equilibrium and conforms to the analytical Aristotelian Electrodynamics expectations.

79 ASTRONOMY AND ASTROPHYSICS↗

Efficient Treatment of Large Active Spaces through Multi-GPU Parallel Implementation of Direct Configuration Interaction

In this study, we have extended our graphical processing unit (GPU)-accelerated direct configuration interaction program to multiple devices, reducing iteration times for configuration spaces of 165 million determinants to only 3 s using NVIDIA P100 GPUs. Similar improvements in the one- and two-particle reduced density matrix formation allow for fast analytical energy gradients and electronic properties. Our parallel algorithm enables the calculation of arbitrarily large configuration spaces (limited only by available system memory), with iteration times of 13 min for an active space of 18 electrons in 18 orbitals (2.4 billion determinants) using six consumer grade NVIDIA 1080Ti GPUs. These advances enable routine molecular dynamics simulations, geometry optimizations, and absorption spectrum calculations for molecules with large configuration spaces, a task that has heretofore required massive computational effort. In this work, we demonstrate the utility of our program by generating the absorption spectrum for diphenyl acetylene at the floating occupation molecular orbital complete active space configuration interaction level of theory. Lastly, several active spaces were investigated to assess the dependence of spectral features on orbital space dimension.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

High-throughput ab initio reaction mechanism exploration in the cloud with automated multi-reference validation

Quantum chemical calculations on atomistic systems have evolved into a standard approach to studying molecular matter. These calculations often involve a significant amount of manual input and expertise, although most of this effort could be automated, which would alleviate the need for expertise in software and hardware accessibility. Here, we present the AutoRXN workflow, an automated workflow for exploratory high-throughput electronic structure calculations of molecular systems, in which (i) density functional theory methods are exploited to deliver minimum and transition-state structures and corresponding energies and properties, (ii) coupled cluster calculations are then launched for optimized structures to provide more accurate energy and property estimates, and (iii) multi-reference diagnostics are evaluated to back check the coupled cluster results and subject them to automated multi-configurational calculations for potential multi-configurational cases. All calculations are carried out in a cloud environment and support massive computational campaigns. Key features of all components of the AutoRXN workflow are autonomy, stability, and minimum operator interference. We highlight the AutoRXN workflow with the example of an autonomous reaction mechanism exploration of the mode of action of a homogeneous catalyst for the asymmetric reduction of ketones.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Spatiotemporal mapping of mesoscopic liquid dynamics

The study of liquid dynamics at mesoscopic scales is still strewn with difficulty due to limitations in theory and experiment. Historically, significant attention has been given to the analysis of space-time correlation functions and their frequency-Fourier transforms at a few discrete wave numbers. The massive computing power afforded by modern high performance computing clusters and the advent of a wide-angle neutron spin-echo spectrometer, however, have unlocked a more intuitive and fruitful approach to this problem. Using molecular dynamics simulations, here we demonstrate the benefits of spatiotemporally mapping intermediate scattering functions on a dense grid of correlation times and wave numbers. Four model systems are investigated: a Lennard-Jones liquid, a coarse-grained bead-spring polymer, a molten sodium chloride, and a poly(ethylene oxide) melt. We show that the spatiotemporal mapping approach is particularly useful for elucidating the mesoscopic dynamics in these liquids, where several underlying mechanisms, such as molecular relaxations, hydrodynamic modes, and nonhydrodynamic excitations, are potentially at play. Therefore, compared to the traditional method, direct visualization of density space-time correlation functions on two-dimensional color maps permits appraisals of complicated dynamical behavior at mesoscales in a global manner. For example, the scaling relations between space and time for different types of molecular motions can be straightforwardly identified on these plots, without any model-dependent analysis. Additionally, we show how theoretical ideas regarding collective mesoscopic dynamics, such as the classical hydrodynamic theory, the convolution approximation, and a recently proposed phenomenological model, can be discussed in terms of the global features of spatiotemporal maps of intermediate scattering functions. The new perspective offered by the spatiotemporal mapping method should prove useful for the study of liquid dynamics in general.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A parallel evolutionary multiple-try metropolis Markov chain Monte Carlo algorithm for sampling spatial partitions

We develop an Evolutionary Markov Chain Monte Carlo (EMCMC) algorithm for sampling spatial partitions that lie within a large, complex, and constrained spatial state space. Our algorithm combines the advantages of evolutionary algorithms (EAs) as optimization heuristics for state space traversal and the theoretical convergence properties of Markov Chain Monte Carlo algorithms for sampling from unknown distributions. Local optimality information that is identified via a directed search by our optimization heuristic is used to adaptively update a Markov chain in a promising direction within the framework of a Multiple-Try Metropolis Markov Chain model that incorporates a generalized Metropolis-Hastings ratio. We further expand the reach of our EMCMC algorithm by harnessing the computational power afforded by massively parallel computing architecture through the integration of a parallel EA framework that guides Markov chains running in parallel.

97 MATHEMATICS AND COMPUTING↗

Quasiparton distributions in massive QED2: Toward quantum computation

We analyze the quasiparton distributions of the lightest 𝜂′ meson in massive two-dimensional quantum electrodynamics (QED2) by exact diagonalization. The Hamiltonian and boost operators are mapped onto spin qubits in a spatial lattice with open boundary conditions. The lowest excited state in the exact diagonalization is shown to interpolate continuously between an anomalous 𝜂′ state at strong coupling, and a nonanomalous heavy meson at weak coupling, with a cusp at the critical point. The boosted 𝜂′ state follows relativistic kinematics but with large deviations in the luminal limit. The spatial quasiparton distribution function and amplitude for the 𝜂′ state are computed numerically for increasing rapidity both at strong and weak coupling, and compared to the exact light front results. The numerical results from the boosted form of the spatial parton distributions, compare fairly with the inverse Fourier transformation of the luminal parton distributions, derived in the lowest Fock space approximation. Our analysis points out some of the limitations facing the current lattice program for the parton distributions.

Lattice field theory↗

Systems and methods for rapid processing and storage of data

Systems and methods of building massively parallel computing systems using low power computing complexes in accordance with embodiments of the invention are disclosed. A massively parallel computing system in accordance with one embodiment of the invention includes at least one Solid State Blade configured to communicate via a high performance network fabric. In addition, each Solid State Blade includes a processor configured to communicate with a plurality of low power computing complexes interconnected by a router, and each low power computing complex includes at least one general processing core, an accelerator, an I/O interface, and cache memory and is configured to communicate with non-volatile solid state memory.

Stalzer, Mark A.↗

Subspace recursive Fermi-operator expansion strategies for large-scale DFT eigenvalue problems on HPC architectures

Quantum mechanical calculations for material modeling using Kohn–Sham density functional theory (DFT) involve the solution of a nonlinear eigenvalue problem for N smallest eigenvector-eigenvalue pairs, with N proportional to the number of electrons in the material system. Here, these calculations are computationally demanding and have asymptotic cubic scaling complexity with the number of electrons. Large-scale matrix eigenvalue problems arising from the discretization of the Kohn–Sham DFT equations employing a systematically convergent basis traditionally rely on iterative orthogonal projection methods, which are shown to be computationally efficient and scalable on massively parallel computing architectures. However, as the size of the material system increases, these methods are known to incur dominant computational costs through the Rayleigh–Ritz projection step of the discretized Kohn–Sham Hamiltonian matrix and the subsequent subspace diagonalization of the projected matrix. This work explores the potential of polynomial expansion approaches based on recursive Fermi-operator expansion as an alternative to the subspace diagonalization of the projected Hamiltonian matrix to reduce the computational cost. Subsequently, we perform a detailed comparison of various recursive polynomial expansion approaches to the traditional approach of explicit diagonalization on both multi-node central processing unit and graphics processing unit architectures and assess their relative performance in terms of accuracy, computational efficiency, scaling behavior, and energy efficiency.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗