Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel, scaling”

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 487 records · Page 27

Model-to-model interface for multiscale materials modeling

A low-level model-to-model interface is presented that will enable independent models to be linked into an integrated system of models. The interface is based on a standard set of functions that contain appropriate export and import schemas that enable models to be linked with no changes to the models themselves. These ideas are presented in the context of a specific multiscale material problem that couples atomistic-based molecular dynamics calculations to continuum calculations of fluid ow. These simulations will be used to examine the influence of interactions of the fluid with an adjacent solid on the fluid ow. The interface will also be examined by adding it to an already existing modeling code, Large-scale Atomic/Molecular Massively Parallel Simulator (LAMMPS) and comparing it with our own molecular dynamics code.

74 ATOMIC AND MOLECULAR PHYSICS↗

SST-GPU: An Execution -Driven CUDA Kernel Scheduler and Streaming-Multiprocessor Compute Model

Programmable accelerators have become commonplace in modern computing systems. Advances in programming models and the availability of massive amounts of data have created a space for massively parallel acceleration where the context for thousands of concurrent threads are resident on-chip. These threads are grouped and interleaved on a cycle-by-cycle basis among several massively parallel computing cores. The design of future supercomputers relies on an ability to model the performance of these massively parallel cores at scale. To address the need for a scalable, decentralized GPU model that can model large GPUs, chiplet-based GPUs and multi-node GPUs, this report details the first steps in integrating the open-source, execution driven GPGPU-Sim into the SST framework. The first stage of this project, creates two elements: a kernel scheduler SST element accepts work from SST CPU models and schedules it to an SM-collection element that performs cycle-by-cycle timing using SSTs Mem Hierarchy to model a flexible memory system.

97 MATHEMATICS AND COMPUTING↗

Balar: A SST GPU Component for Performance Modeling and Profiling

Programmable accelerators have become commonplace in modern computing systems. Advances in programming models and the availability of massive amounts of data have created a space for massively parallel accelerators capable of maintaining context for thousands of concurrent threads resident on-chip. These threads are grouped and interleaved on a cycle-by-cycle basis among several massively parallel computing cores. One path for the design of future supercomputers relies on an ability to model the performance of these massively parallel cores at scale. The SST framework has been proven to scale up to run simulations containing tens of thousands of nodes. A previous report described the initial integration of the open-source, execution-driven GPU simulator, GPGPU-Sim, into the SST framework. This report discusses the results of the integration and how to use the new GPU component in SST. It also provides examples of what it can be used to analyze and a correlation study showing how closely the execution matches that of a Nvidia V100 GPU when running kernels and mini-apps.

97 MATHEMATICS AND COMPUTING↗

Cardinal: A Lower Length-scale Simulator for Fluoride Cooled High Temperature Reactors

The new DOE-NE “Center of Excellence for Thermal-fluids applications in Nuclear Energy” inaugurated in April 2018 considers and researches novel new solution strategies for historically challenging flow issues that still plague the current fleet of deployed Light Water Reactor (LWR) nuclear reactors as well as predicting various fluid flow and fluid related issues with advanced reactor technologies. Our advanced thermal-fluids research and development approach synergistically combines three natural, though overlapping, length and time scales in a hierarchal multi-scale approach to avoid the temptation and pitfalls of attempting to develop a single “solve all” algorithm for physical fluid flow problems that will span 109 in spatial and temporal scales. The demonstrate the multi-scale philosophy of the center we focus first on Fluoride Cooled High Temperature Reactors (FHRs), and in particular on the Berkeley’s PB-FHR design Mark-I design. The Fluoride salt cooled High temperature Reactor (FHR) is a class of advanced nuclear reactors that combine the robust coated particle fuel form from high temperature gas cooled reactors, direct reactor auxiliary cooling system (DRACS) passive decay removal of liquid metal fast reactors, and the transparent, high volumetric heat capacitance liquid fluoride salt working fluids - Flibe - from molten salt reactors. This combination of fuel and coolant enables FHRs to operate in a high-temperature low-pressure design space that has beneficial safety and economic implications. The PB-FHR reactor relies on a pebble bed approach and pebble bed reactors are in a sense the poster child for multiscale analysis. The lower length-scale simulator for pebble reactor cores comprises three physics: neutronics (OpenMC), thermal-fluids (Nek5000) and fuel performance (BISON). As part of center of excellence ongoing research efforts we have developed “Cardinal”, a new tool platform for lower length-scale simulation. Cardinal tightly couples all three physics and leverages advances in MOOSE such as the MultiApp system and the concept of MOOSE-wrapped Apps. Moreover it is designed from the ground-up to scale on massively parallel architectures and perform well on world-class super-computing architectures. In this report we describe the design of Cardinal and present a demo of the application of Cardinal to an FHR.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

SST-GPU: A Scalable SST GPU Component for Performance Modeling and Profiling

Programmable accelerators have become commonplace in modern computing systems. Advances in programming models and the availability of unprecedented amounts of data have created a space for massively parallel accelerators capable of maintaining context for thousands of concurrent threads resident on-chip. These threads are grouped and interleaved on a cycle-by-cycle basis among several massively parallel computing cores. One path for the design of future supercomputers relies on an ability to model the performance of these massively parallel cores at scale. The SST framework has been proven to scale up to run simulations containing tens of thousands of nodes. A previous report described the initial integration of the open-source, execution-driven GPU simulator, GPGPU-Sim, into the SST framework. This report discusses the results of the integration and how to use the new GPU component in SST. It also provides examples of what it can be used to analyze and a correlation study showing how closely the execution matches that of a Nvidia V100 GPU when running kernels and mini-apps.

97 MATHEMATICS AND COMPUTING↗

Thermal Neutron Scattering Cross Sections for Graphitic Amorphous Carbon

Carbon materials are commonly found in both nuclear reactors and experimental systems. Various carbon structures occur in nuclear applications ranging from crystalline and nuclear graphite to the amorphous carbon seen in next-generation advanced reactor designs. Amorphous carbon is based on a randomized graphite-like structure and offers the unique ability to disperse impurities throughout the bulk composition. A graphite-like amorphous carbon system was modeled using the classical molecular dynamics (MD) code LAMMPS (Large-scale Atomic/Molecular Massively Parallel Simulator). An improved version of the temperature-dependent Adaptive Intermolecular Reactive Empirical Bond Order (AIREBO) potential was used to model the carbon-carbon atomic interactions for the temperature at 300 K along with densities 1.60, 1.70, 1.85, and 2.23 g/cm 3 . From the normalized velocity autocorrelation function (VACF), the phonon density of state (DOS) was then calculated as the Fourier transform of the normalized VACF. This DOS was then used as the primary input for the evaluation of the thermal scattering law (TSL, i.e. S(α,β)) and associated neutron thermal scattering cross sections. The TSL was analyzed using the Full Law Analysis Scattering System Hub (FLASSH). The amorphous structure results in shifts of the phonon DOS to lower energy modes than typically displayed for ideal crystalline graphite. This impact on the DOS is directly reflected in the TSL. Furthermore, the typical features and the optical graphitic peak at 0.25 eV for the ideal graphite DOS disappear for graphite-like amorphous carbon, which shows good agreement with the expected structure.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Thermal Scattering Law Data Development for Paraffin Wax

Paraffin wax is often used as a nuclear moderator to slow down the fast neutrons in experimental critical assemblies [1]. It is a colorless and soft solid material that consists primarily of straight-chain alkanes (n-alkanes), which are hydrocarbons with the general formula CnH2n+2 [2-3]. The length of the hydrocarbon chain ranges from C20 to C30 and higher [2]. It is distinguished by its solid state at room temperature and begins to melt above approximately 310 K [4]. Paraffin wax is a commonly employed substance in the manufacture of shielding. One of its noteworthy characteristics is its ability to effectively absorb the neutrons. Also, it possesses a high macroscopic cross section, which enables it to efficiently moderate neutrons. As a result, paraffin wax is extensively utilized in various applications where moderation and shielding of neutrons are needed. For simulations, it is necessary to evaluate its thermal scattering law (TSL) and cross sections. Computationally, classical molecular dynamics (CMD) simulations provide the capability of simulating atomic details. For example, several unary, binary, and few multi component mixtures have been investigated of the paraffin model by using molecular dynamics simulations [5-12]. An assessment of thermal neutron scattering in a heavy paraffinic oil treated both as a solid and a viscous fluid containing 25% linear branched paraffin (C30H62), 35% one ring cycloalkane (C30H60), 15% two rings cycloalkane (C30H58), and 25% aromatic (C30H60) chains has been studied using CMD simulations for producing TSL data [13]. Nevertheless, there is lack of TSL and cross section data for paraffin wax as most of the reported analyses focus on the unary and binary mixture of n-alkanes, which is not consistent with actual paraffin wax [2]. In this work, we applied the equilibrium CMD simulations technique to explore the structure and dynamical properties of wax, which are fundamental input to calculate the TSL. A paraffin wax system was modeled using the CMD code LAMMPS (Large-scale Atomic/Molecular Massively Parallel Simulator) [14-15] with the semi-empirical COMPASS [16] force field. The density of state (DOS) was calculated from the normalized velocity autocorrelation function (VACF), which is the Fourier transform of the normalized VACF. The DOS was used for the calculation of the TSL and thermal scattering cross sections. The paraffin wax atomic system was constructed by using the MedeA material design platform [17], and was benchmarked using available properties (i.e., density, bond lengths, angles, diffusivity, and viscosity).

Nuclear Criticality Safety Program (NCSP)↗

Fused Deposition Modeling Additive Manufacturing of Carbonized Structures via Waste-Enhanced Filaments

This report details the development, characterization, and use of coal-enhanced composite materials in additive manufacturing applications. High coal loading formulations—containing up to 70 wt.% coal—were successfully extruded and processed using commercially available 3D printers. Extensive experimental testing was conducted to assess the mechanical, thermal, and microstructural properties of the composites. In parallel, multi-scale computational modeling was employed to elucidate atomistic interactions and evaluate the effects of printing-induced defects on structural performance. Large-scale printability trials demonstrated the feasibility of fabricating complex components for tooling and construction applications, including wind turbine blade molds and modular wall sections. Techno-economic analyses demonstrated the cost-effectiveness and scalability of coal-enhanced composites for large-scale additive manufacturing applications such as wind turbine blade tooling.

01 COAL, LIGNITE, AND PEAT↗

Modeling and simulation of soft-particle colloids under dynamic environmental gradients.

Controlled assembly in soft-particle colloidal suspensions is a technology poised to advance manufacturing methods for nano-scale templating, coating, and bio-conjugate devices. Applications for soft-particle colloids include photovoltaics, nanoelectronics, functionalized thin-film coatings, and a wide range of bio-conjugate devices such as sensors, assays, and bio-fuel cells. This presentation covers the topics of modeling and simulation of soft-particle colloidal systems over dewetting, evaporation, and irradiation gradients, including deposition of particles to surfaces. By tuning particle/solvent and environmental parameters, we transition from the regime of self-assembly to that of controlled assembly, and enable finer resolution of features at both the nano-scale and meso-scale. We report models of interparticle potentials and order parametrization techniques including results from simulations of colloids utilizing soft-particle field potentials. Using LAMMPS (Large-Scale Atomic/Molecular Massively Parallel Simulator), we demonstrate effects of volume fraction, shear and drag profiles, adsorbed and bulk polymer parameters, solvent chi parameter, and deposition profiles. Results are compared to theoretical models and correlation to TEM images from soft-particle irradiation experiments.

36 MATERIALS SCIENCE↗

Modeling dislocations in a polycrystal using the generalized finite element method.

Modeling the interaction of dislocations with internal boundaries and free surfaces is essential to understanding the effect of material microstructure on dislocation motion. However, discrete dislocation dynamics methods rely on infinite domain solutions of dislocation fields which makes modeling of heterogeneous materials difficult. A finite domain dislocation dynamics capability is under development that resolves both the dislocation array and polycrystalline structure in a compatible manner so that free surfaces and material interfaces are easily treated. In this approach the polycrystalline structure is accommodated using the GFEM, and the displacement due to the dislocation array is added to the displacement approximation. Shown in figure 1 are representative results from simulations of randomly placed and oriented dislocation sources in a cubic nickel polycrystal. Each grain has a randomly assigned (unique) material basis, and available glide planes are chosen accordingly. The change in basis between neighboring grains has an important effect on the motion of dislocations since the resolved shear on available glide planes can change dramatically. Dislocation transmission through high angle grain boundaries is assumed to occur by absorption into the boundary and subsequent nucleation in the neighboring grain. Such behavior is illustrated in figure 1d. Nucleation from the vertically oriented source in the bottom right grain is due to local stresses from dislocation pile-up in the neighboring grain. In this talk, the method and implementation is presented as well as some representative results from large scale (i.e., massively parallel) simulations of dislocation motion in cubic nano-domain nickel alloy. Particular attention will be paid to the effect of grain size on polycrystalline strength.

36 MATERIALS SCIENCE↗

Computational Astrophysics Consortium (2006 - 2013)

The Computational Astrophysics Consortium was a SciDAC Science Application Project that operated during the period 2006 - 2013. The collaboration was headed by Stan Woosley at UC Santa Cruz, and (initially) included partners at UC Berkeley (UCB), LLNL, LANL, LBNL, Stonybrook, Arizona, Stanford, and Johns Hopkins. This report summarizes activities at UCB over the project period. More detailed information about the project accomplishments can be found in the collaboration final report submitted by PI Stan Woosley, and attached to this document. The CAC effort at UCB was originally led by PI Chris Mckee, and included participating faculty members Jon Arons, Peter Nugent, and Eliot Quataert. In 2010, Daniel Kasen moved from UCSC to a faculty position at UCB, and took over as UCB institution PI. The project supported several graduate students (Michael Childress, Siva Dharba, Andrew Myers, Janos Botyanszki, Jeffery Silverman) and postdocs (Dovi Poznanski, Antonino Cucchiarra, Jeffrey Oishi, Bradley Cenko, Eric Hsiao and Jason Dexter). Several codes were further developed by the UCB CAC group. The Orion code is a 3-dimensional radiation hydrodynamics code, used by McKee’s group and often applied to problems in star formation. As part of the CAC, an adaptive ray tracing ionization scheme was implemented, and a chemistry solver was incorporated for coupling the ionization state of the gas to its thermodynamics. The Sedona code is 3-dimensional monte carlo radiation transport code for calculation the light curves and spectra. As part of the CAC, the physics of the code was improved and domain decomposition techniques were implemented for scaling on massively parallel systems.

79 ASTRONOMY AND ASTROPHYSICS↗

FatMan vs. LittleBoy: Scaling up Linear Algebraic Operations in Scale-out Data Platforms

Linear algebraic operations such as matrix manipulations form the kernel of many machine learning and other crucial algorithms. Scaling up as well as scaling out such algorithms are highly desirable to enable efficient processing over millions of data points. To this end, we present a matrix manipulation approach to effectively scale-up each node in a scale-out data parallel platform such as Apache Spark. Specifically, we enable hardware acceleration for matrix multiplications in a distributed Spark setup without user intervention. Our approach supports both dense and sparse distributed matrices, and provides flexible control of acceleration by matrix density. We demonstrate the benefit of our approach for generalized matrix multiplication operations over large matrices with up to four billion elements. To connect the effectiveness of our approach with machine learning applications, we performed Gramian matrix computation via generalized matrix multiplications. Our experiments show that our approach achieves more than 2x performance speed-up, and up to 96.1% computation improvement, compared to a state of the art Spark MLlib for dense matrices.

Lim, Seung-Hwan↗

Optimizing Grain Boundary Structures with LAMMPS Using Evolutionary Algorithms

Grain boundary structure optimization is an important part of materials modeling. Current methods for grain boundary structure optimization involve inefficient, time-consuming processes that do not fully explore the interface parameter space. Evolutionary algorithms have recently been demonstrated to be effective at determining both stable and metastable grain boundary interface structures. In this work, we demonstrate the use of GBOpt, a grain boundary structure optimization software designed to use the Large-scale Atomic/Molecular Massively Parallel Simulation (LAMMPS) software to efficiently determine grain boundary structures. We demonstrate that a only a few manipulations, namely atom insertion, atom removal, and relative grain displacement, are sufficient to explore much of the grain boundary structure parameter space. The efficacy of this approach is demonstrated on an FCC Ni system, and a BCC Fe system. The computational cost is compared against the gamma-surface sampling approach to demonstrate performance improvement.

Evolutionary algorithms↗

Energy Conversion by Parallel Electric Fields During Guide Field Reconnection in Scaled Laboratory and Space Experiments

Here, we present direct and scaled comparisons between laboratory and in situ space observations of magnetic reconnection with a guide field, comparing results from the Magnetospheric Multiscale Mission and the Magnetic Reconnection eXperiment (MRX). While Magnetospheric Multiscale Mission observations obtain high–resolution and fully kinetic data, MRX observations fully cover the 2–D reconnection plane near the current sheet, removing uncertainties in situating the measurements compared to the reconnection region. Through scaling transformations, we show a quantitative agreement in magnetic field and current density profiles, which agree within a factor of 2 from each other. The introduction of the guide field causes the energy conversion J·E in the current sheet to be dominated by J || E || in both cases. However, parallel electric fields reported by recent spacecraft crossings are significantly (5–10 times) larger than values obtained on MRX, highlighting an important issue for understanding energy conversion by reconnection.

30 DIRECT ENERGY CONVERSION↗

Massively parallel GPU enabled third-order cluster perturbation excitation energies for cost-effective large scale excitation energy calculations

We present here a massively parallel implementation of the recently developed CPS(D-3) excitation energy model that is based on cluster perturbation theory. The new algorithm extends the one developed in Baudin et al. [J. Chem. Phys., 150, 134110 (2019)] to leverage multiple nodes and utilize graphical processing units for the acceleration of heavy tensor contractions. Furthermore, we show that the extended algorithm scales efficiently with increasing amounts of computational resources and that the developed code enables CPS(D-3) excitation energy calculations on large molecular systems with a low time-to-solution. More specifically, calculations on systems with over 100 atoms and 1000 basis functions are possible in a few hours of wall clock time. This establishes CPS(D-3) excitation energies as a computationally efficient alternative to those obtained from the coupled-cluster singles and doubles model.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗

Small File Aggregation with PLFS [Slides]

Today’s computational science demands have resulted in ever larger parallel computers, and storage systems have grown to match these demands. Parallel file systems used in this environment are increasingly specialized to extract the highest possible performance for large I/O operations, at the expense of other potential workloads. While some applications have adapted to I/O best practices and can obtain good performance on these systems, the natural I/O patterns of many applications result in the generation of a huge number of small files, the creation of which is poorly served by current parallel file systems at very large scale. This paper describes a new technique for optimizing small file access in parallel file systems for these very large scale systems. The idea is to use a virtual parallel log-structure file system on the compute nodes in order to aggregate large numbers of small files in compute node memory and then stream their data sequentially to a much smaller number of physical files on an underlying parallel file system. The technique is implemented and evaluated using PLFS as the aggregating middleware. We evaluate our system with micro-benchmarks on a local OSX filesystem and with an MPI extension of the standard Postmark to provide results at scale on both Lustre and PanFS parallel filesystems. We observe as much as a 33x improvement in small file create rates on a single host, and 30x improvement in small file write rates, compared to a baseline Lustre configuration on a leadership computing platform using 16,384 cores and achieve an unprecedented create rate of 200 million files per second.

97 MATHEMATICS AND COMPUTING↗

A time-parallel multiple-shooting method for large-scale quantum optimal control

Quantum optimal control plays a crucial role in quantum computing by providing the interface between compiler and hardware. Solving the optimal control problem is particularly challenging for multi-qubit gates, due to the exponential growth in computational complexity with the system's dimensionality and the deterioration of optimization convergence. To ameliorate the computational complexity of time-integration, this paper introduces a multiple-shooting approach in which the time domain is divided into multiple windows and the intermediate states at window boundaries are treated as additional optimization variables. Further, this enables parallel computation of state evolution across time-windows, significantly accelerating objective function and gradient evaluations. Since the initial state matrix in each window is only guaranteed to be unitary upon convergence of the optimization algorithm, the conventional gate trace infidelity is replaced by a generalized infidelity that is convex for non-unitary state matrices. Continuity of the state across window boundaries is enforced by equality constraints. A quadratic penalty optimization method is used to solve the constrained optimal control problem, and an efficient adjoint technique is employed to calculate the gradients in each iteration. We demonstrate the effectiveness of the proposed method through numerical experiments on quantum Fourier transform gates in systems with 2, 3, and 4 qubits, noting a speedup of 80x for evaluating the gradient in the 4-qubit case, highlighting the method's potential for optimizing control pulses in multi-qubit quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Pervasive Parallel Processing Framework for Data Visualization and Analysis at Extreme Scale

The evolution of the computing world from teraflop to petaflop has been relatively effortless, with several of the existing programming models scaling effectively to the petascale. The migration to exascale, however, poses considerable challenges. All industry trends infer that the exascale machine will be built using processors containing hundreds to thousands of cores per chip. It can be inferred that efficient concurrency on exascale machines requires a massive amount of concurrent threads, each performing many operations on a localized piece of data. Currently, visualization libraries and applications are based off what is known as the visualization pipeline. In the pipeline model, algorithms are encapsulated as filters with inputs and outputs. These filters are connected by setting the output of one component to the input of another. Parallelism in the visualization pipeline is achieved by replicating the pipeline for each processing thread. This works well for today’s distributed memory parallel computers but cannot be sustained when operating on processors with thousands of cores. Our project investigates a new visualization framework designed to exhibit the pervasive parallelism necessary for extreme scale machines. Our framework achieves this by defining algorithms in terms of worklets, which are localized stateless operations. Worklets are atomic operations that execute when invoked unlike filters, which execute when a pipeline request occurs. The worklet design allows execution on a massive amount of lightweight threads with minimal overhead. Only with such fine-grained parallelism can we hope to fill the billions of threads we expect will be necessary for efficient computation on an exascale machine.

97 MATHEMATICS AND COMPUTING↗