Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Accelerators, 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 1,009 records · Page 56

Production and Acceleration of Antinuclei in Supernova Shockwaves

We compute the energy spectra of antideuterons ( d-bar ) and antihelium ( (He)-bar ) in cosmic rays (CRs) in a scenario where hadronic interactions inside supernova remnants (SNRs) can produce a diffusively shock-accelerated “source component” of secondary antinuclei. The key parameters that specify the SNR environment and the interstellar CR transport are tightly constrained with the new measurements provided by the AMS experiment on the B/C ratio and on the p-bar /p ratio. The best-fit models obtained from the two ratios are found to be inconsistent with each other, as the p-bar /p data require enhanced secondary production. Thus, we derive conservative (i.e., B/C-driven) and speculative ( p-bar /p-driven) upper limits to the SNR flux contributions for the d-bar and (He)-bar spectra in CRs, along with their standard secondary component expected from CR collisions in the interstellar gas. We find that the source component of antinuclei can be appreciable at kinetic energies above a few ∼10 GeV n{sup −1}, but it is always sub-dominant below a few GeV n{sup −1}, that is the energy window where dark matter (DM) annihilation signatures are expected to exceed the level of secondary production. We also find that the total (standard + SNR) flux of secondary d-bar and (He)-bar is tightly constrained by the data. Thus, the presence of interaction processes in SNRs does not critically affect the total background for DM searches.

79 ASTRONOMY AND ASTROPHYSICS↗

Computation of absolute hydration and binding free energy with free energy perturbation distributed replica-exchange molecular dynamics.

Distributed Replica (REPDSTR) is a powerful parallelization technique enabling simulations of a group of replicas in a parallel/parallel fashion, where each replica is distributed to different nodes of a large cluster [Theor. Chem. Acc. 2003, 109, 140]. Here, we use the framework provided by REPDSTR to combine a staged free energy perturbation protocol with replica-exchange molecular dynamics (FEP/REMD). The structure of REPDSTR, which allows multiple parallel input/output (I/O), facilitates the treatment of replica-exchange to couple the N window simulations corresponding to different values of the thermodynamic coupling parameters. As a result, each of the N synchronous window simulations benefit from the sampling carried out by the N-1 others. As illustrative examples of the FEP/REMD strategy, calculations of the absolute hydration and binding free energy of small molecules were performed using the biomolecular simulation program CHARMM adapted for the IBM Blue Gene/P platform. The computations show that a FEP/REMD strategy significantly improves the sampling and accelerates the convergence of absolute free energy computations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Modeling laser-plasma acceleration in the wakefield frame

A simulation of laser-plasma acceleration in the boosted frame of the wake, moving at near lightspeed. Space has contracted and time has stretched, separating events in time. Relatively few time steps are needed to model them, requiring less computer time.

43 PARTICLE ACCELERATORS↗

Machine learning accelerated discrete element modeling of granular flows

Granular flows are widely encountered in many industrial processes and natural phenomena. Discrete Element Modeling (DEM) is a useful tool for understanding and troubleshooting devices, which handle granular materials. However, its applicability is significantly limited by the huge computational cost associated with detecting and computing collisions. In this research, the computation speed of DEM was accelerated by orders of magnitude using a convolutional neural network to replace the direct calculation of particle-particle and particle-boundary collisions. The MFiX software was used to generate the training and testing dataset. Additionally, a GPU accelerated TensorFlow model was used to train the neural network and test the results. The model fluctuations caused by different training steps were reduced with a multi-scale loss function. The accuracy was improved with more frames within one training step. The modeling of a rotating drum and a hopper demonstrated the accuracy and efficiency of this machine learning accelerated DEM in the simulation of granular flows.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

GPU-acceleration of tensor renormalization with PyTorch using CUDA

We show that numerical computations based on tensor renormalization group (TRG) methods can be significantly accelerated with PyTorch on graphics processing units (GPUs) by leveraging NVIDIA's Compute Unified Device Architecture (CUDA). Here we find improvement in the runtime and its scaling with bond dimension for two-dimensional systems. Our results establish that the utilization of GPU resources is essential for future precision computations with TRG.

97 MATHEMATICS AND COMPUTING↗

Challenges for the CMS computing model in the first year

CMS is in the process of commissioning a complex detector and a globally distributed computing infrastructure simultaneously. This represents a unique challenge. Even at the beginning there is not sufficient analysis or organized processing resources at CERN alone. In this presentation we discuss the unique computing challenges CMS expects to face during the first year of running and how they influence the baseline computing model decisions. During the early accelerator commissioning periods, CMS will attempt to collect as many events as possible when the beam is on in order to provide adequate early commissioning data. Some of these plans involve overdriving the Tier-0 infrastructure during data collection with recovery when the beam is off. In addition to the larger number of triggered events, there will be pressure in the first year to collect and analyze more complete data formats as the summarized formats mature. The large event formats impact the required storage, bandwidth, and processing capacity across all the computing centers. While the understanding of the detector and the event selections is being improved, there will likely be a larger number of reconstruction passes and skims performed by both central operations and individual users. We discuss how these additional stresses impact the allocation of resources and the changes from the baseline computing model.

99 GENERAL AND MISCELLANEOUS↗

Accelerated discovery of elpasolite scintillators

Elpasolite scintillators are a large family of halides which includes compounds reported to meet the NA22 program goals of <3% energy resolution at 662 keV1. This work investigated the potential to produce quality elpasolite compounds and alloys of useful sizes at reasonable cost, through systematic experimental and computational investigation of crystal structure and properties across the composition space. Discovery was accelerated by computational methods and models developed previously to efficiently identify cubic members of the elpasolite halides, and to evaluate stability of anion and cation exchange alloys.

36 MATERIALS SCIENCE↗

Efficient Heterogeneous Execution on Large Multicore and Accelerator Platforms: Case Study Using a Block Tridiagonal Solver

The algorithmic and implementation principles are explored in gainfully exploiting GPU accelerators in conjunction with multicore processors on high-end systems with large numbers of compute nodes, and evaluated in an implementation of a scalable block tridiagonal solver. The accelerator of each compute node is exploited in combination with multicore processors of that node in performing block-level linear algebra operations in the overall, distributed solver algorithm. Optimizations incorporated include: (1) an efficient memory mapping and synchronization interface to minimize data movement, (2) multi-process sharing of the accelerator within a node to obtain balanced load with multicore processors, and (3) an automatic memory management system to efficiently utilize accelerator memory when sub-matrices spill over the limits of device memory. Results are reported from our novel implementation that uses MAGMA and CUBLAS accelerator software systems simultaneously with ACML for multithreaded execution on processors. Overall, using 940 nVidia Tesla X2090 accelerators and 15,040 cores, the best heterogeneous execution delivers a 10.9-fold reduction in run time relative to an already efficient parallel multicore-only baseline implementation that is highly optimized with intra-node and inter-node concurrency and computation-communication overlap. Detailed quantitative results are presented to explain all critical runtime components contributing to hybrid performance.

Park, Alfred J↗

Scaling SQL to the Supercomputer for Interactive Analysis of Simulation Data

AI and simulation workloads consume and generate large amounts of data that need to be searched, transformed and merged with other data. With the goal of treating data as a first-class citizen inside a traditionally compute-centric HPC environment, we explore how the use of accelerators and high-speed interconnects can speed up tasks which otherwise constitute bottlenecks in computational discovery workflows. BlazingSQL is SQL engine that runs natively on NVIDIA GPUs and supports internode communication for fast analytics on terabyte-scale tabular data sets. We show how a fast interconnect improves query performance if leveraged through the Unified Communication X (UCX) middleware. We envision that future computing platforms will integrate accelerated database query capabilities for immediate and interactive analysis of large simulation data.

Glaser, Jens↗

The PetscSF Scalable Communication Layer

PetscSF, the communication component of the Portable, Extensible Toolkit for Scientific Computation (PETSc), is designed to provide PETSc's communication infrastructure suitable for exascale computers that utilize GPUs and other accelerators. PetscSF provides a simple application programming interface (API) for managing common communication patterns in scientific computations by using a star-forest graph representation. PetscSF supports several implementations based on MPI and NVSHMEM, whose selection is based on the characteristics of the application or the target architecture. An efficient and portable model for network and intra-node communication is essential for implementing large-scale applications. The Message Passing Interface, which has been the de facto standard for distributed memory systems, has developed into a large complex API that does not yet provide high performance on the emerging heterogeneous CPU-GPU-based exascale systems. Here, we discuss the design of PetscSF, how it can overcome some difficulties of working directly with MPI on GPUs, and we demonstrate its performance, scalability, and novel features.

97 MATHEMATICS AND COMPUTING↗

Performance Portability of Molecular Docking Miniapp On Leadership Computing Platforms

Rapidly changing computer architectures, such as those found at high-performance computing (HPC) facilities, present the need for mini-applications (miniapps) that capture essential algorithms used in large applications to test program performance and portability, aiding transitions to new systems. The COVID-19 pandemic has fueled a flurry of activity in computational drug discovery, including the use of supercomputers and GPU acceleration for massive virtual screens for therapeutics. Recent work targeting COVID-19 at the Oak Ridge Leadership Computing Facility (OLCF) used the GPU-accelerated program AutoDock-GPU to screen billions of compounds on the Summit supercomputer. In this paper we present the development of a new miniapp, miniAutoDock-GPU, that can be used to evaluate the performance and portability of GPU-accelerated protein-ligand docking programs on different computer architectures. These tests are especially relevant as facilities transition from petascale systems and prepare for upcoming exascale systems that will use a variety of GPU vendors. The key calculations, namely, the Lamarckian genetic algorithm combined with a local search using a Solis-Wets based random optimization algorithm, are implemented. We developed versions of the miniapp using several different programming models for GPU acceleration, including a version using the CUDA runtime API for NVIDIA GPUs, and the Kokkos middle-ware API which is facilitated by C++ template libraries. A third version, currently in progress, uses the HIP programming model. These efforts will help facilitate the transition to exascale systems for this important emerging HPC application, as well as its use on a wide range of heterogeneous platforms.

Thavappiragasam, Mathialakan↗

Theoretical and Computational Studies of Rare Earth Substitutes: A Test-bed for Accelerated Materials Development

Hard permanent magnets in wide use typically involve expensive Rare Earth elements. In this effort, we investigated candidate permanent magnet materials which contain no Rare Earths, while simultaneously exploring improvements in theoretical methodology which enable the better prediction of magnetic properties relevant for the future design and optimization of permanent magnets. This included a detailed study of magnetocrystalline anisotropy energies, and the use of advanced simulation tools to better describe magnetic properties at elevated temperatures.

36 MATERIALS SCIENCE↗

5-dimensional braneworld with gravitating Nambu–Goto matching conditions

We continue the investigation of a recent proposal on alternative matching conditions for self-gravitating defects which generalize the standard matching conditions. The reasoning for this study is the need for consistency of the various codimension defects and the existence of a meaningful equation of motion at the probe limit, things that seem to lack from the standard approach. These matching conditions arise by varying the brane–bulk action with respect to the brane embedding fields (and not with respect to the bulk metric at the brane position) in a way that takes into account the gravitational back-reaction of the brane to the bulk. They always possess a Nambu–Goto probe limit and any codimension defect is seemingly consistent for any second order bulk gravity theory. Here, we consider in detail the case of a codimension-1 brane in five-dimensional Einstein gravity, derive the generic alternative junction conditions and find the Z{sub 2}-symmetric braneworld cosmology, as well as its bulk extension. Compared to the standard braneworld cosmology, the new one has an extra integration constant which accounts for the today matter and dark energy contents, therefore, there is more freedom for accommodating the observed cosmic features. One branch of the solution possesses the asymptotic linearized LFRW regime. We have constrained the parameters so that to have a recent passage from a long deceleration era to a small today acceleration epoch and we have computed the age of the universe, consistent with current data, and the time-varying dark energy equation of state. For a range of the parameters it is possible for the presented cosmology to provide a large acceleration in the high energy regime.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Accelerating discoveries at DIII-D with the Integrated Research Infrastructure

DIII-D research is being accelerated by leveraging high performance computing (HPC) and data resources available through the National Energy Research Scientific Computing Center (NERSC) Superfacility initiative. As part of this initiative, a high-resolution, fully automated, whole discharge kinetic equilibrium reconstruction workflow was developed that runs at the NERSC for most DIII-D shots in under 20 min. This has eliminated a long-standing research barrier and opened the door to more sophisticated analyses, including plasma transport and stability. These capabilities would benefit from being automated and executed within the larger Department of Energy Advanced Scientific Computing Research program’s Integrated Research Infrastructure (IRI) framework. The goal of IRI is to empower researchers to meld DOE’s world-class research tools, infrastructure, and user facilities seamlessly and securely in novel ways to radically accelerate discovery and innovation. For transport, we are looking at producing flux matched profiles and also using particle tracing to predict fast ion heat deposition from neutral beam injection before a shot takes place. Our starting point for evaluating plasma stability focuses on the pedestal limits that must be navigated to achieve better confinement. This information is meant to help operators run more effective experiments, so it needs to be available rapidly inside the DIII-D control room. So far this has been achieved by ensuring the data is available with existing tools, but as more novel results are produced new visualization tools must be developed. In addition, all of the high-quality data we have generated has been collected into databases that can unlock even deeper insights. This has already been leveraged for model and code validation studies as well as for developing AI/ML surrogates. The workflows developed for this project are intended to serve as prototypes that can be replicated on other experiments and can be run to provide timely and essential information for ITER, as well as next stage fusion power plants.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Hardware Architectures for Data-Intensive Computing Problems: A Case Study for String Matching

DNA analysis is an emerging application of high performance bioinformatic. Modern sequencing machinery are able to provide, in few hours, large input streams of data, which needs to be matched against exponentially growing databases of known fragments. The ability to recognize these patterns effectively and fastly may allow extending the scale and the reach of the investigations performed by biology scientists. Aho-Corasick is an exact, multiple pattern matching algorithm often at the base of this application. High performance systems are a promising platform to accelerate this algorithm, which is computationally intensive but also inherently parallel. Nowadays, high performance systems also include heterogeneous processing elements, such as Graphic Processing Units (GPUs), to further accelerate parallel algorithms. Unfortunately, the Aho-Corasick algorithm exhibits large performance variability, depending on the size of the input streams, on the number of patterns to search and on the number of matches, and poses significant challenges on current high performance software and hardware implementations. An adequate mapping of the algorithm on the target architecture, coping with the limit of the underlining hardware, is required to reach the desired high throughputs. In this paper, we discuss the implementation of the Aho-Corasick algorithm for GPU-accelerated high performance systems. We present an optimized implementation of Aho-Corasick for GPUs and discuss its tradeoffs on the Tesla T10 and he new Tesla T20 (codename Fermi) GPUs. We then integrate the optimized GPU code, respectively, in a MPI-based and in a pthreads-based load balancer to enable execution of the algorithm on clusters and large sharedmemory multiprocessors (SMPs) accelerated with multiple GPUs.

Tumeo, Antonino↗