DUNE Computing [Slides]
DUNE’s main purpose is to understand neutrino properties. This presentation covers: The experiment, Computational challenges, Results from prototypes, and Towards common solutions.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
SEARCH · Engineering Papers
Results for “Computer experiments”
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.
Subsurface Noble Gas Sampling Manual
The intent of this document is to provide information about best available approaches for performing subsurface soil gas sampling during an On Site Inspection or OSI. This information is based on field sampling experiments, computer simulations and data from the NA-22 Noble Gas Signature Experiment Test Bed at the Nevada Nuclear Security Site (NNSS). The approaches should optimize the gas concentration from the subsurface cavity or chimney regime while simultaneously minimizing the potential for atmospheric radioxenon and near-surface Argon-37 contamination. Where possible, we quantitatively assess differences in sampling practices for the same sets of environmental conditions. We recognize that all sampling scenarios cannot be addressed. However, if this document helps to inform the intuition of the reader about addressing the challenges resulting from the inevitable deviations from the scenario assumed here, it will have achieved its goal.
58 GEOSCIENCES↗
Towards Quantum Gravity in the Lab on Quantum Processors
The holographic principle and its realization in the AdS/CFT correspondence led to unexpected connections between general relativity and quantum information. This set the stage for studying aspects of quantum gravity models, which are otherwise difficult to access, in table-top quantum-computational experiments. Recent works have designed a special teleportation protocol that realizes a surprising communication phenomenon most naturally explained by the physics of a traversable wormhole. In this work, we have carried out quantum experiments based on this protocol on state-of-the-art quantum computers. The target quantum processing units (QPUs) included the Quantinuum's trapped-ion System Model H1-1 and five IBM superconducting QPUs of various architectures, with public and premium user access. We report the observed teleportation signals from these QPUs with the best one reaching 80% of theoretical predictions. We outline the experimental challenges we have faced in the course of implementation, as well as the new theoretical insights into quantum dynamics the work has led to. We also developed QGLab – an open-source end-to-end software solution that facilitates conducting the wormhole-inspired teleportation experiments on state-of-the-art and emergent generations of QPUs supported by the Q i s k i t and t k e t SDKs. We consider our study and deliverables as an early practical step towards the realization of more complex experiments for the indirect probing of quantum gravity in the lab.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Scalable In Situ Computation of Lagrangian Representations via Local Flow Maps
In situ computation of Lagrangian flow maps to enable post hoc time-varying vector field analysis has recently become an active area of research. However, the current literature is largely limited to theoretical settings and lacks a solution to address scalability of the technique in distributed memory. To improve scalability, we propose and evaluate the benefits and limitations of a simple, yet novel, performance optimization. Our proposed optimization is a communication-free model resulting in local Lagrangian flow maps, requiring no message passing or synchronization between processes, intrinsically improving scalability, and thereby reducing overall execution time and alleviating the encumbrance placed on simulation codes from communication overheads. To evaluate our approach, we computed Lagrangian flow maps for four time-varying simulation vector fields and investigated how execution time and reconstruction accuracy are impacted by the number of GPUs per compute node, the total number of compute nodes, particles per rank, and storage intervals. Our study consisted of experiments computing Lagrangian flow maps with up to 67M particle trajectories over 500 cycles and used as many as 2048 GPUs across 512 compute nodes. In all, our study contributes an evaluation of a communication-free model as well as a scalability study of computing distributed Lagrangian flow maps at scale using in situ infrastructure on a modern supercomputer.
Sane, Sudhanshu↗
XCP- Computational Summer Workshop: Equation of State Overview [Slides]
An overview of Equation of State (EOS) theory, some relevant physics, experiments, computational methods, and the SESAME database will be presented. The goal will be to describe what types of data and modeling are required to make an EOS that typically spans up to ~10 9 GPa in pressure and 10 9 K in temperature.
42 ENGINEERING↗
Optimization of the configuration of manufacturing systems
Software for optimizing the configuration of manufacturing systems so as to reduce expenditures in all stages of the product life cycle is considered. Mathematical expressions are given for the three crossover operators used in the genetic optimization algorithm. A computational experiment indicates the most effective crossover operator.
42 ENGINEERING↗
Multi-armed bandit with sub-exponential rewards
Not provided.
Operations Research & Management Science↗
Equation of state of boron nitride combining computation, modeling, and experiment
The equation of state (EOS) of materials at warm dense conditions poses significant challenges to both theory and experiment. We report a combined computational, modeling, and experimental investigation leveraging new theoretical and experimental capabilities to investigate warm-dense boron nitride (BN). The simulation methodologies include path integral Monte Carlo (PIMC), several density functional theory (DFT) molecular dynamics methods [plane-wave pseudopotential, Fermi operator expansion (FOE), and spectral quadrature (SQ)], activity expansion (actex), and all-electron Green's function Korringa-Kohn-Rostoker (mecca), and compute the pressure and internal energy of BN over a broad range of densities and temperatures. Our experiments were conducted at the Omega laser facility and the Hugoniot response of BN to unprecedented pressures (1200–2650 GPa). The EOSs computed using different methods cross validate one another in the warm-dense matter regime, and the experimental Hugoniot data are in good agreement with our theoretical predictions. By comparing the EOS results from different methods, we assess that the largest discrepancies between theoretical predictions are ≲ 4% in pressure and ≲ 3% in energy and occur at 10 6 K, slightly below the peak compression that corresponds to the K -shell ionization regime. At these conditions, we find remarkable consistency between the EOS from DFT calculations performed on different platforms and using different exchange-correlation functionals and those from PIMC using free-particle nodes. This provides strong evidence for the accuracy of both PIMC and DFT in the high-pressure, high-temperature regime. Moreover, the recently developed SQ and FOE methods produce EOS data that have significantly smaller statistical error bars than PIMC, and so represent significant advances for efficient computation at high temperatures. The shock Hugoniot predicted by PIMC, actex, and mecca shows a maximum compression ratio of 4.55 ± 0.05 for an initial density of 2.26 g/cm 3 , higher than the Thomas-Fermi predictions by about 5%. In addition, we construct tabular EOS models that are consistent with the first-principles simulations and the experimental data. Our findings clarify the ionic and electronic structure of BN over a broad range of temperatures and densities and quantify their roles in the EOS and properties of this material. The tabular models may be utilized for future simulations of laser-driven experiments that include BN as a candidate ablator material.
36 MATERIALS SCIENCE↗
Review on modeling of the anode solid electrolyte interphase (SEI) for lithium-ion batteries
A passivation layer called the solid electrolyte interphase (SEI) is formed on electrode surfaces from decomposition products of electrolytes. The SEI allows Li + transport and blocks electrons in order to prevent further electrolyte decomposition and ensure continued electrochemical reactions. The formation and growth mechanism of the nanometer thick SEI films are yet to be completely understood owing to their complex structure and lack of reliable in situ experimental techniques. Significant advances in computational methods have made it possible to predictively model the fundamentals of SEI. This review aims to give an overview of state-of-the-art modeling progress in the investigation of SEI films on the anodes, ranging from electronic structure calculations to mesoscale modeling, covering the thermodynamics and kinetics of electrolyte reduction reactions, SEI formation, modification through electrolyte design, correlation of SEI properties with battery performance, and the artificial SEI design. Multi-scale simulations have been summarized and compared with each other as well as with experiments. Computational details of the fundamental properties of SEI, such as electron tunneling, Li-ion transport, chemical/mechanical stability of the bulk SEI and electrode/(SEI/) electrolyte interfaces have been discussed. This review shows the potential of computational approaches in the deconvolution of SEI properties and design of artificial SEI. We believe that computational modeling can be integrated with experiments to complement each other and lead to a better understanding of the complex SEI for the development of a highly efficient battery in the future.
25 ENERGY STORAGE↗
Projective Hedging Algorithms for Multistage Stochastic Programming, Supporting Distributed and Asynchronous Implementation
Here we propose a decomposition algorithm for multistage stochastic programming that resembles the progressive hedging method of Rockafellar and Wets but is provably capable of several forms of asynchronous operation. We derive the method from a class of projective operator splitting methods fairly recently proposed by Combettes and Eckstein, significantly expanding the known applications of those methods. Our derivation assures convergence for convex problems whose feasible set is compact, subject to some standard regularity conditions and a mild “fairness” condition on subproblem selection. The method’s convergence guarantees are deterministic and do not require randomization, in contrast to other proposed asynchronous variations of progressive hedging. Computational experiments described in an online appendix show the method to outperform progressive hedging on large-scale problems in a highly parallel computing environment.
97 MATHEMATICS AND COMPUTING↗
Computational Modeling To Adapt Neutralizing Antibody
Monoclonal antibodies (mAbs) is the leading therapy for viral infections because it provides immediate protection and can be administered at higher levels than in a natural immune response. Finding mAbs that neutralize a broad spectrum of viral targets has proven difficult because many species and strains exist and blanket targeting is a slow and laborious process to experimentally screen 108 variants. A new method is needed to rapidly redesign mAbs for homologous targets. This project speeds up redesign using structure-based computational design to reduce the mAbs search space to a manageable level and screen mutants at a much higher rate than in experiments. Computation will also provide critical knowledge about the fundamental interactions. The project will adapt S230, a human antibody that neutralizes SARS-CoV, to neutralize SARS-COV-2.
60 APPLIED LIFE SCIENCES↗
Nonlinear elasticity with the Shifted Boundary Method
Here, we propose a new unfitted/immersed computational framework for nonlinear solid mechanics, which bypasses the complexities associated with the generation of CAD representations and subsequent body-fitted meshing. This approach allows to speed up the cycle of design and analysis in complex geometry and requires relatively simple computer graphics representations of the surface geometries to be simulated, such as the Standard Tessellation Language (STL format). Complex data structures and integration on cut elements are avoided by means of an approximate boundary representation and a modification (shifting) of the boundary conditions to maintain optimal accuracy. An extensive set of computational experiments in two and three dimensions is included.
97 MATHEMATICS AND COMPUTING↗
Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations
We develop new approximate compilation schemes that significantly reduce the expense of compiling the Quantum Approximate Optimization Algorithm (QAOA) for solving the Max-Cut problem. Our main focus is on compilation with trapped-ion simulators using Pauli-X operations and all-to-all Ising Hamiltonian HIsing evolution generated by Molmer-Sorensen or optical dipole force interactions, though some of our results also apply to standard gate-based compilations. Our results are based on principles of graph sparsification and decomposition; the former reduces the number of edges in a graph while maintaining its cut structure, while the latter breaks a weighted graph into a small number of unweighted graphs. Though these techniques have been used as heuristics in various hybrid quantum algorithms, there have been no guarantees on their performance, to the best of our knowledge. This work provides the first provable guarantees using sparsification and decomposition to improve quantum noise resilience and reduce quantum circuit complexity. For quantum hardware that uses edge-by-edge QAOA compilations, sparsification leads to a direct reduction in circuit complexity. For trapped-ion quantum simulators implementing all-to-all HIsing pulses, we show that for a (1−ϵ) factor loss in the Max-Cut approximation (ϵ>0), our compilations improve the (worst-case) number of HIsing pulses from O(n2) to O(nlog(n/ϵ)) and the (worst-case) number of Pauli-X bit flips from O(n2) to O(nlog(n/ϵ)ϵ2) for n-node graphs. This is an asymptotic improvement for any constant ϵ>0. We demonstrate that significant improvements to the approximation ratio are obtained using decomposition in simulated trapped-ion experiments with dephasing noise. We further present a generic argument showing that sparsification results in an exponentially improved circuit fidelity lower bound in digital computing schemes based on one- and two-qubit gates, which are relevant to a wide variety of hardwares such as superconducting qubits and certain neutral atom or trapped ion setups, and more sophisticated noise models. We anticipate these approximate compilation techniques will be useful tools in a variety of future quantum computing experiments.
Moondra, Jai [Georgia Institute of Technology]↗
Modular performance prediction for scientific workflows using Machine Learning
Scientific workflows provide an opportunity for declarative computational experiment design in an intuitive and efficient way. A distributed workflow is typically executed on a variety of resources, and it uses a variety of computational algorithms or tools to achieve the desired outcomes. Such a variety imposes additional complexity in scheduling these workflows on large scale computers. As computation becomes more distributed, insights into expected workload that a workflow presents become critical for effective resource allocation. In this paper, we present a modular framework that leverages Machine Learning for creating precise performance predictions of a workflow. The central idea is to partition a workflow in such a way that makes the task of forecasting each atomic unit manageable and gives us a way to combine the individual predictions efficiently. We recognize a combination of an executable and a specific physical resource as a single module. This gives us a handle to characterize workload and machine power as a single unit of prediction. Overall, our modular technique of creating atomic modules and deployment of longest-path approach to estimate workflow performance, allows the framework to adapt to highly complex nested directed acyclic workflows and scale to new scenarios, since it does not make assumptions of underlying workflow structure. We present performance estimation results of independent workflow modules executed on the XSEDE SDSC Comet cluster using various Machine Learning algorithms. The results provide insights into the behavior and effectiveness of different algorithms in the context of scientific workflow performance prediction.
97 MATHEMATICS AND COMPUTING↗
A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty
Practical solution of stochastic programming problems generally requires the use of parallel computing resources. Here, we describe the open source package mpi-sppy, in which efficient and scalable parallelization is a central feature. We report computational experiments that demonstrate the ability to solve very large stochastic programming problems - including mixed-integer variants - in minutes of wall clock time, efficiently leveraging significant parallel computing resources. We report results for the largest publicly available instances of stochastic mixed-integer unit commitment problems, solving to provably tight optimality gaps. In addition, we introduce a novel software architecture that facilitates combinations of methods for accelerating convergence that can be combined in plug-and-play manner. Finally, the mpi-sppy package is written in Python, leverages the widely used Pyomo (http://www.pyomo.org) library for modeling mathematical programs, builds on existing MPI implementations to ensure efficiency and scalability, and is available via http://github.com/Pyomo/mpi-sppy.
97 MATHEMATICS AND COMPUTING↗
Evaluating integration and performance of containerized climate applications on a Hewlett Packard Enterprise Cray system
Containers have taken over large swaths of cloud computing as the most convenient way of packaging and deploying applications. The features that containers offer for packaging and deploying applications translate to high performance computing (HPC) as well. At The National Oceanic and Atmospheric Administration, containers provide an easy way to build and distribute complex HPC applications, allowing faster collaboration, portability, and experiment computer environment reproducibility amongst the scientific community. The challenge arises when applications rely on message passing interface (MPI). This necessitates investigation into how to properly run these applications with their own unique requirements and produce performance on par with native runs. We investigate the MPI performance for benchmarks and containerized climate models for various containers covering selection of compiler and MPI library combinations from the Cray provided programming environments on the Cray XC supercomputer GAEA. Performance from the benchmarks and the climate models shows that for the most part containerized applications perform on par with the natively built applications when the system optimized Cray MPICH libraries are bound into the container, and the hybrid model containers have poor performance in comparison. We also describe several challenges and our solutions in running these containers, particularly challenges with heterogeneous jobs for the containerized model runs.
Abraham, Subil↗
GPU-Accelerated Machine Learning Inference as a Service for Computing in Neutrino Experiments
Machine learning algorithms are becoming increasingly prevalent and performant in the reconstruction of events in accelerator-based neutrino experiments. These sophisticated algorithms can be computationally expensive. At the same time, the data volumes of such experiments are rapidly increasing. The demand to process billions of neutrino events with many machine learning algorithm inferences creates a computing challenge. We explore a computing model in which heterogeneous computing with GPU coprocessors is made available as a web service. The coprocessors can be efficiently and elastically deployed to provide the right amount of computing for a given processing task. With our approach, Services for Optimized Network Inference on Coprocessors (SONIC), we integrate GPU acceleration specifically for the ProtoDUNE-SP reconstruction chain without disrupting the native computing workflow. With our integrated framework, we accelerate the most time-consuming task, track and particle shower hit identification, by a factor of 17. This results in a factor of 2.7 reduction in the total processing time when compared with CPU-only production. For this particular task, only 1 GPU is required for every 68 CPU threads, providing a cost-effective solution.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
The Silver Lining
Clouds are shareable scientific instruments that create the potential for reproducibility by ensuring that all investigators have access to a common execution platform on which computational experiments can be repeated and compared. By virtue of the interface they present, they also lead to the creation of digital artifacts compatible with the cloud, such as images or orchestration templates, that go a long way-and sometimes all the way-to representing an experiment in a digital, repeatable form. In this article, I describe how we developed these natural advantages of clouds in the Chameleon testbed and argue that we should leverage them to create a digital research marketplace that would make repeating experiments as natural and viable part of research as sharing ideas via reading papers is today.
Cloud computing↗