Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Supercomputer”

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,279 records · Page 71

The Terrestrial Biosphere Model Farm

Model Intercomparison Projects (MIPs) are fundamental to our understanding of how the land surface responds to changes in climate. However, MIPs are challenging to conduct, requiring the organization of multiple, decentralized modeling teams throughout the world running common protocols. We explored centralizing these models on a single supercomputing system. We ran nine offline terrestrial biosphere models through the Terrestrial Biosphere Model Farm: CABLE, CENTURY, HyLand, ISAM, JULES, LPJ-GUESS, ORCHIDEE, SiB-3, and SiB-CASA. All models were wrapped in a software framework driven with common forcing data, spin-up, and run protocols specified by the Multi-scale Synthesis and Terrestrial Model Intercomparison Project (MsTMIP) for years 1901–2100. We ran more than a dozen model experiments. We identify three major benefits and three major challenges. The benefits include: (a) processing multiple models through a MIP is relatively straightforward, (b) MIP protocols are run consistently across models, which may reduce some model output variability, and (c) unique multimodel experiments can provide novel output for analysis. The challenges are: (a) technological demand is large, particularly for data and output storage and transfer; (b) model versions lag those from the core model development teams; and (c) there is still a need for intellectual input from the core model development teams for insight into model results. A merger with the open-source, cloud-based Predictive Ecosystem Analyzer (PEcAn) ecoinformatics system may be a path forward to overcoming these challenges.

54 ENVIRONMENTAL SCIENCES↗

A GPU‐Based Ocean Dynamical Core for Routine Mesoscale‐Resolving Climate Simulations

Abstract We describe an ocean hydrostatic dynamical core implemented in Oceananigans optimized for Graphical Processing Unit (GPU) architectures. On 64 A100 GPUs, equivalent to 16 computational nodes in current state‐of‐the‐art supercomputers, our dynamical core can simulate a decade of near‐global ocean dynamics per wall‐clock day at an 8‐km horizontal resolution; a resolution adequate to resolve the ocean's mesoscale eddy field. Such efficiency, achieved with relatively modest hardware resources, suggests that climate simulations on GPUs can incorporate fully eddy‐resolving ocean models. This removes a major source of systematic bias in current IPCC coupled model projections, the parameterization of ocean eddies, and represents a major advance in climate modeling. We discuss the computational strategies, focusing on GPU‐specific optimization and numerical implementation details that enable such high performance.

Silvestri, Simone [Massachusetts Institute of Tech↗

High Performance, High Fidelity: A GPU‐Accelerated Doubly‐Periodic Configuration of the Simple Cloud‐Resolving E3SM Atmosphere Model Version 1 (DP‐SCREAMv1)

The development of the Simplified Cloud Resolving Energy Exascale Earth System Atmosphere Model (SCREAMv1) enables global storm-resolving simulations on modern GPU-based supercomputers. However, the high computational cost of SCREAMv1 limits its routine use for process-level studies, creating a need for efficient proxy configurations. This study addresses this gap by introducing DP-SCREAMv1, a doubly periodic cloud-resolving model designed to be fully consistent with SCREAMv1 while enabling high-resolution, long-duration simulations at significantly reduced computational expense by simulating a limited doubly periodic domain rather than the entire globe. Built on a C++/Kokkos architecture, DP-SCREAMv1 achieves exceptional performance scalability on GPU systems and includes a rich library of cases for validation and scientific exploration. In this work, we demonstrate short wall-clock times at SCREAMv1's default resolution and show that DP-SCREAMv1 supports routine execution of large-domain, high-resolution experiments that were previously challenging in practice. Furthermore, we show that DP-SCREAMv1 enables routine execution of “Giga-LES” style simulations and facilitates large-domain, high-resolution simulations that were recently considered burdensome to perform. These results document an efficient, fully consistent process-level configuration for SCREAMv1 (DP-SCREAMv1) and illustrate its use for long-duration and large-domain experiments at cloud-resolving to eddy-permitting resolution.

Environmental sciences↗

iVirus: facilitating new insights in viral ecology with software and community data sets imbedded in a cyberinfrastructure

Microbes affect nutrient and energy transformations throughout the world’s ecosystems, yet they do so under viral constraints. In complex communities, viral metagenome (virome) sequencing is transforming our ability to quantify viral diversity and impacts. Although some bottlenecks, for example, few reference genomes and nonquantitative viromics, have been overcome, the void of centralized data sets and specialized tools now prevents viromics from being broadly applied to answer fundamental ecological questions. Here we present iVirus, a community resource that leverages the CyVerse cyberinfrastructure to provide access to viromic tools and data sets. The iVirus Data Commons contains both raw and processed data from 1866 samples and 73 projects derived from global ocean expeditions, as well as existing and legacy public repositories. Through the CyVerse Discovery Environment, users can interrogate these data sets using existing analytical tools (software applications known as ‘Apps’) for assembly, open reading frame prediction and annotation, as well as several new Apps specifically developed for analyzing viromes. Because Apps are web based and powered by CyVerse supercomputing resources, they enable scalable analyses for a broad user base. Finally, a use-case scenario documents how to apply these advances toward new data. This growing iVirus resource should help researchers utilize viromics as yet another tool to elucidate viral roles in nature.

59 BASIC BIOLOGICAL SCIENCES↗

Controllable 0–π Josephson junctions containing a ferromagnetic spin valve

Superconductivity and ferromagnetism are antagonistic forms of order, and rarely coexist. Many interesting new phenomena occur, however, in hybrid superconducting/ferromagnetic systems. For example, a Josephson junction containing a ferromagnetic material can exhibit an intrinsic phase shift of π in its ground state for certain thicknesses of the material. Such ‘π-junctions’ were first realized experimentally in 2001, and have been proposed as circuit elements for both high-speed classical superconducting computing and for quantum computing. Here we demonstrate experimentally that the phase state of a Josephson junction containing two ferromagnetic layers can be toggled between 0 and pi by changing the relative orientation of the two magnetizations. These controllable 0–π junctions have immediate applications in cryogenic memory, where they serve as a necessary component to an ultralow power superconducting computer. Such a fully superconducting computer is estimated to be orders of magnitude more energy-efficient than current semiconductor-based supercomputers. Here, phase-controllable junctions also open up new possibilities for superconducting circuit elements such as superconducting ‘programmable logic’, where they could function in superconducting analogues to field-programmable gate arrays.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

$\alpha$-Clustering in atomic nuclei from first principles with statistical learning and the Hoyle state character

A long-standing crucial question with atomic nuclei is whether or not α clustering occurs there. An α particle (helium-4 nucleus) comprises two protons and two neutrons, and may be the building block of some nuclei. This is a very beautiful and fascinating idea, and is indeed plausible because the α particle is particularly stable with a large binding energy. However, direct experimental evidence has never been provided. Here, we show whether and how α(-like) objects emerge in atomic nuclei, by means of state-of-the-art quantum many-body simulations formulated from first principles, utilizing supercomputers including K/Fugaku. The obtained physical quantities exhibit agreement with experimental data. The appearance and variation of the α clustering are shown by utilizing density profiles for the nuclei beryllium-8, -10 and carbon-12. With additional insight by statistical learning, an unexpected crossover picture is presented for the Hoyle state, a critical gateway to the birth of life.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Milestone in predicting core plasma turbulence: successful multi-channel validation of the gyrokinetic code GENE

On the basis of several recent breakthroughs in fusion research, many activities have been launched around the world to develop fusion power plants on the fastest possible time scale. In this context, high-fidelity simulations of the plasma behavior on large supercomputers provide one of the main pathways to accelerating progress by guiding crucial design decisions. When it comes to determining the energy confinement time of a magnetic confinement fusion device, which is a key quantity of interest, gyrokinetic turbulence simulations are considered the approach of choice – but the question, whether they are really able to reliably predict the plasma behavior is still open. The present study addresses this important issue by means of careful comparisons between state-of-the-art gyrokinetic turbulence simulations with the GENE code and experimental observations in the ASDEX Upgrade tokamak for an unprecedented number of simultaneous plasma observables.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Identification of stable adsorption sites and diffusion paths on nanocluster surfaces: an automated scanning algorithm

The diverse coordination environments on the surfaces of discrete, three-dimensional (3D) nanoclusters contribute significantly to their unique catalytic properties. Identifying the numerous adsorption sites and diffusion paths on these clusters is however tedious and time-consuming, especially for large, asymmetric nanoclusters. Here, we present a simple, automated method for constructing approximate 2D potential energy surfaces for the adsorption of atomic species on the surfaces of 3D nanoclusters with minimal human intervention. These potential energy surfaces fully characterize the important adsorption sites and diffusion paths on the nanocluster surfaces with accuracies similar to current approaches and at comparable computational cost. Our method can treat complex nanoclusters, such as alloy nanoclusters, and accounts for cluster relaxation and adsorbate-induced reconstruction, important for obtaining accurate energetics. Moreover, its highly parallelizable nature is ideal for modern supercomputer architectures. We showcase our method using two clusters: Au 18 and Pt 55 . For Au 18 , diffusion of atomic hydrogen between the most stable sites occurs via non-intuitive paths, underlining the necessity of exploring the complete potential energy surface. By enabling the rapid and unbiased assessment of adsorption and diffusion on large, complex nanoclusters, which are particularly difficult to handle manually, our method will help advance materials discovery and the rational design of catalysts.

36 MATERIALS SCIENCE↗

Accelerating multiscale electronic stopping power predictions with time-dependent density functional theory and machine learning

Knowing the rate at which particle radiation releases energy in a material, the “stopping power,” is key to designing nuclear reactors, medical treatments, semiconductor and quantum materials, and many other technologies. While the nuclear contribution to stopping power, i.e., elastic scattering between atoms, is well understood in the literature, the route for gathering data on the electronic contribution has for decades remained costly and reliant on many simplifying assumptions, including that materials are isotropic. We establish a method that combines time-dependent density functional theory (TDDFT) and machine learning to reduce the time to assess new materials to hours on a supercomputer and provide valuable data on how atomic details influence electronic stopping. Our approach uses TDDFT to compute the electronic stopping from first principles in several directions and then machine learning to interpolate to other directions at a cost of 10 million times fewer core-hours. We demonstrate the combined approach in a study of proton irradiation in aluminum and employ it to predict how the depth of maximum energy deposition, the “Bragg Peak,” varies depending on the incident angle—a quantity otherwise inaccessible to modelers and far outside the scales of quantum mechanical simulations. The lack of any experimental information requirement makes our method applicable to most materials, and its speed makes it a prime candidate for enabling quantum-to-continuum models of radiation damage. The prospect of reusing valuable TDDFT data for training the model makes our approach appealing for applications in the age of materials data science.

36 MATERIALS SCIENCE↗

Boundaries of quantum supremacy via random circuit sampling

Abstract Google’s quantum supremacy experiment heralded a transition point where quantum computers can evaluate a computational task, random circuit sampling, faster than classical supercomputers. We examine the constraints on the region of quantum advantage for quantum circuits with a larger number of qubits and gates than experimentally implemented. At near-term gate fidelities, we demonstrate that quantum supremacy is limited to circuits with a qubit count and circuit depth of a few hundred. Larger circuits encounter two distinct boundaries: a return of a classical advantage and practically infeasible quantum runtimes. Decreasing error rates cause the region of a quantum advantage to grow rapidly. At error rates required for early implementations of the surface code, the largest circuit size within the quantum supremacy regime coincides approximately with the smallest circuit size needed to implement error correction. Thus, the boundaries of quantum supremacy may fortuitously coincide with the advent of scalable, error-corrected quantum computing.

97 MATHEMATICS AND COMPUTING↗

Accelerated, scalable and reproducible AI-driven gravitational wave detection

The development of reusable artificial intelligence (AI) models for wider use and rigorous validation by the community promises to unlock new opportunities in multi-messenger astrophysics. Here we develop a workflow that connects the Data and Learning Hub for Science, a repository for publishing AI models, with the Hardware-Accelerated Learning (HAL) cluster, using funcX as a universal distributed computing service. Using this workflow, an ensemble of four openly available AI models can be run on HAL to process an entire month's worth (August 2017) of advanced Laser Interferometer Gravitational-Wave Observatory data in just seven minutes, identifying all four binary black hole mergers previously identified in this dataset and reporting no misclassifications. This approach combines advances in AI, distributed computing and scientific data infrastructure to open new pathways to conduct reproducible, accelerated, data-driven discovery. By combining a repository for artificial intelligence models and a supercomputing cluster, an entire month's worth of advanced LIGO data is analysed in just 7 min, finding all binary black hole mergers previously identified in this dataset and reporting no misclassifications.

79 ASTRONOMY AND ASTROPHYSICS↗

Atomistic insights into metal hardening

For thousands of years, humans have exploited the natural property of metals to get stronger or harden when mechanically deformed. Ultimately rooted in the motion of dislocations, mechanisms of metal hardening have remained in the cross-hairs of physical metallurgists for over a century. Here, we performed atomistic simulations at the limits of supercomputing that are sufficiently large to be statistically representative of macroscopic crystal plasticity yet fully resolved to examine the origins of metal hardening at its most fundamental level of atomic motion. We demonstrate that the notorious staged (inflection) hardening of metals is a direct consequence of crystal rotation under uniaxial straining. At odds with widely divergent and contradictory views in the literature, we observe that basic mechanisms of dislocation behaviour are the same across all stages of metal hardening.

36 MATERIALS SCIENCE↗

Characterizing quantum supremacy in near-term devices

A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of supercomputers. Such a demonstration of what is referred to as quantum supremacy requires a reliable evaluation of the resources required to solve tasks with classical approaches. Here, we propose the task of sampling from the output distribution of random quantum circuits as a demonstration of quantum supremacy. We extend previous results in computational complexity to argue that this sampling task must take exponential time in a classical computer. We introduce cross-entropy benchmarking to obtain the experimental fidelity of complex multiqubit dynamics. This can be estimated and extrapolated to give a success metric for a quantum supremacy demonstration. We study the computational cost of relevant classical algorithms and conclude that quantum supremacy can be achieved with circuits in a two-dimensional lattice of 7 × 7 qubits and around 40 clock cycles. This requires an error rate of around 0.5% for two-qubit gates (0.05% for one-qubit gates), and it would demonstrate the basic building blocks for a fault-tolerant quantum computer.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Predicting disruptive instabilities in controlled fusion plasmas through deep learning

Nuclear fusion power delivered by magnetic-confinement tokamak reactors holds the promise of sustainable and clean energy1. The avoidance of large-scale plasma instabilities called disruptions within these reactors is one of the most pressing challenges, because disruptions can halt power production and damage key components. Disruptions are particularly harmful for large burning-plasma systems such as the multibillion-dollar International Thermonuclear Experimental Reactor (ITER) project currently under construction, which aims to be the first reactor that produces more power from fusion than is injected to heat the plasma. Here we present a method based on deep learning for forecasting disruptions. Our method extends considerably the capabilities of previous strategies such as first-principles-based and classical machine-learning approaches. In particular, it delivers reliable predictions for machines other than the one on which it was trained—a crucial requirement for future large reactors that cannot afford training disruptions. Our approach takes advantage of high-dimensional training data to boost predictive performance while also engaging supercomputing resources at the largest scale to improve accuracy and speed. Trained on experimental data from the largest tokamaks in the United States (DIII-D) and the world (Joint European Torus, JET), our method can also be applied to specific tasks such as prediction with long warning times: this opens up the possibility of moving from passive disruption prediction to active reactor control and optimization. These initial results illustrate the potential for deep learning to accelerate progress in fusion-energy science and, more generally, in the understanding and prediction of complex physical systems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Quantum supremacy using a programmable superconducting processor

The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2 53 (about 10 16 ). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. Finally, this dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy for this specific computational task, heralding a much-anticipated computing paradigm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Certified randomness using a trapped-ion quantum processor

Although quantum computers can perform a wide range of practically important tasks beyond the abilities of classical computers, realizing this potential remains a challenge. An example is to use an untrusted remote device to generate random bits that can be certified to contain a certain amount of entropy. Certified randomness has many applications but is impossible to achieve solely by classical computation. Here we demonstrate the generation of certifiably random bits using the 56-qubit Quantinuum H2-1 trapped-ion quantum computer accessed over the Internet. Our protocol leverages the classical hardness of recent random circuit sampling demonstrations: a client generates quantum ‘challenge’ circuits using a small randomness seed, sends them to an untrusted quantum server to execute and verifies the results of the server. We analyse the security of our protocol against a restricted class of realistic near-term adversaries. Using classical verification with measured combined sustained performance of 1.1 × 10 18 floating-point operations per second across multiple supercomputers, we certify 71,313 bits of entropy under this restricted adversary and additional assumptions. Our results demonstrate a step towards the practical applicability of present-day quantum computers.

computer science↗

FAIR principles for AI models with a practical application for accelerated high energy diffraction microscopy

Abstract A concise and measurable set of FAIR (Findable, Accessible, Interoperable and Reusable) principles for scientific data is transforming the state-of-practice for data management and stewardship, supporting and enabling discovery and innovation. Learning from this initiative, and acknowledging the impact of artificial intelligence (AI) in the practice of science and engineering, we introduce a set of practical, concise, and measurable FAIR principles for AI models. We showcase how to create and share FAIR data and AI models within a unified computational framework combining the following elements: the Advanced Photon Source at Argonne National Laboratory, the Materials Data Facility, the Data and Learning Hub for Science, and funcX, and the Argonne Leadership Computing Facility (ALCF), in particular the ThetaGPU supercomputer and the SambaNova DataScale ® system at the ALCF AI Testbed. We describe how this domain-agnostic computational framework may be harnessed to enable autonomous AI-driven discovery.

47 OTHER INSTRUMENTATION↗

SARS-CoV2 billion-compound docking

Abstract This dataset contains ligand conformations and docking scores for 1.4 billion molecules docked against 6 structural targets from SARS-CoV2, representing 5 unique proteins: MPro, NSP15, PLPro, RDRP, and the Spike protein. Docking was carried out using the AutoDock-GPU platform on the Summit supercomputer and Google Cloud. The docking procedure employed the Solis Wets search method to generate 20 independent ligand binding poses per compound. Each compound geometry was scored using the AutoDock free energy estimate, and rescored using RFScore v3 and DUD-E machine-learned rescoring models. Input protein structures are included, suitable for use by AutoDock-GPU and other docking programs. As the result of an exceptionally large docking campaign, this dataset represents a valuable resource for discovering trends across small molecule and protein binding sites, training AI models, and comparing to inhibitor compounds targeting SARS-CoV-2. The work also gives an example of how to organize and process data from ultra-large docking screens.

60 APPLIED LIFE SCIENCES↗