Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Parallel application”

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 955 records · Page 53

Electronic Structure Theory Calculations Using Modern Architectures: KNL vs Haswell

The time to solution and parallel efficiency of several commonly used electronic structure methods (Hartree–Fock, density functional theory, second order perturbation theory, resolution of the identity second order perturbation theory, coupled cluster) are evaluated on both the Intel Xeon Haswell and the Intel Xeon Phi Knights Landing (KNL) architectures. The Haswell completes the benchmark calculations with a faster time to solution than the KNL for all molecules and methods tested. While the Haswell exhibits an average speedup of at least 3.5 relative to the KNL for all nonthreaded computations, the KNL has a better parallel efficiency than the Haswell with increasing core counts. The architectures are further tested using a more computationally costly coupled cluster method on a transition state reaction. The Haswell appears to be the best choice to minimize the time to solution, though for very large systems and high levels of theory that require memory intensive processes the superior memory hierarchy and larger on node memory of the KNL can make it a better choice. These results are used to showcase aspects of novel architectures that will increase efficiency for quantum chemistry applications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Hanford Site Composite Analysis: LLBG-200-W B Vadose Zone Model

The objectives of the vadose modeling for the updated Hanford Site Composite Analysis (CA) are to simulate the flow and transport of water and radionuclide releases from the surface to the water table and to provide radionuclide transfer rates to the CA saturated zone model (CP-57037, Model Package Report: Plateau to River Groundwater Model, Version 8.3). Water additions include natural recharge and water discharged to the ground as a result of industrial processes associated with Hanford Site operations. Contaminant sources include radionuclides in water discharged to the ground during operations and radionuclides disposed “dry” in solid waste burial grounds or other means. The following 16 radionuclides were selected for this modeling effort: carbon-14 (C-14), chlorine-36 (Cl-36), tritium (H-3), iodine-129 (I-129), neptunium-237 (Np-237), rhenium-187 (Re-187), strontium-90 (Sr-90), technetium-99 (Tc-99), uranium-232 (U-232), uranium-233 (U-233), uranium-234 (U-234), uranium-235 (U-235), uranium-236 (U-236), uranium-238 (U-238), radium-226 (Ra-226), and thorium-230 (Th-230). The simulation time starts in 1943 and ends at 12070, which is 10,000 years after assumed Hanford Site closure in 2070. The parallel version of the Subsurface Transport Over Multiple Phases (STOMP 1 ) simulator, officially named the exascale Subsurface Transport Over Multiple Phases (eSTOMP), is used to simulate flow and transport for the vadose models. The documentation for the STOMP code is comprehensive. The theoretical and numerical approaches applied in the STOMP code are documented in a published theory guide (PNNL-12030, STOMP Subsurface Transport Over Multiple Phases Version 2.0 Theory Guide). The code has undergone a rigorous verification procedure against analytical solutions, laboratory-scale experiments, and field-scale demonstrations. The application guide (PNNL-11216, STOMP Subsurface Transport Over Multiple Phases Application Guide) provides instructive examples in the application of the code to classical groundwater problems. The user’s guide (PNNL-15782, STOMP: Subsurface Transport Over Multiple Phases Version 4.0: User’s Guide) describes the general use, input file formatting, compilation, and execution of the code. The primary output of the vadose zone modeling is radionuclide transfer rates to the groundwater for input into the saturated zone model. The rates will be summed over the 100 by 100 m saturated zone model grid cells that fall within the vadose zone model source domain.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Neutron-induced capture-to-fission cross section ratio measured at LANSCE

Capture-to-fission cross section ratios are used as an alternative to absolute cross section measurements. This is due to the simplification on the calculations and the reduction of the uncertainties with respect to an absolute measurement of the cross section by eliminating experimental complications like self-absorption, beam/target overlap and non-uniformities. Different capture-to-fission reactions have been measured through the years at the Los Alamos Neutron Science Center (LANSCE) at Los Alamos National Laboratory (LANL) using the Detector for Advanced Neutron Capture Experiments (DANCE) combined with different fission detectors. Some of these are a Parallel Plate Avalanche Counter (PPAC) to detect fission fragments (FF), and the NEUtron detector array at DANCE (NEUANCE) to detect fission neutrons. As DANCE detects the γ-rays produced in capture and fission reactions, the fission instrument placed inside the DANCE cavity is used to tag the fission γ-rays for background identification and subtraction. Some examples of capture-to-fission ratio measurements performed with DANCE in the last years are the 233 U, 235 U and 239 Pu. The measurement technique, the different setups, and other potential applications of the instruments will be explained.

Nuclear Criticality Safety Program (NCSP)↗

Visualization at exascale: Making it all work with VTK-m

The VTK-m software library enables scientific visualization on exascale-class supercomputers. Exascale machines are particularly challenging for software development in part because they use GPU accelerators to provide the vast majority of their computational throughput. Algorithmic designs for GPUs and GPU-centric computing often deviate from those that worked well on previous generations of high-performance computers that relied on traditional CPUs. Fortunately, VTK-m provides scientific visualization algorithms for GPUs and other accelerators. VTK-m also provides a framework that simplifies the implementation of new algorithms and adds a porting layer to work across multiple processor types. This paper describes the main challenges encountered when making scientific visualization available at exascale. Here, we document the surprises and obstacles faced when moving from pre-exascale platforms to the final exascale designs and the performance on those systems including scaling studies on Frontier, an exascale machine with over 37,000 AMD GPUs. We also report on the integration of VTK-m with other exascale software technologies. Finally, we show how VTK-m helps scientific discovery for applications such as fusion and particle acceleration that leverage an exascale supercomputer.

97 MATHEMATICS AND COMPUTING↗

Molecular Origin of Strain-Induced Chain Alignment in PDPP-Based Semiconducting Polymeric Thin Films

Donor–acceptor (D–A) type semiconducting polymers have shown great potential for the application of deformable and stretchable electronics in recent decades. However, due to their heterogeneous structure with rigid backbones and long solubilizing side chains, the fundamental understanding of their molecular picture upon mechanical deformation still lacks investigation. Here, the molecular orientation of diketopyrrolopyrrole (DPP)-based D–A polymer thin films is probed under tensile deformation via both experimental measurements and molecular modeling. The detailed morphological analysis demonstrates highly aligned polymer crystallites upon deformation, while the degree of backbone alignment is limited within the crystalline domain. Besides, the aromatic ring on polymer backbones rotates parallel to the strain direction despite the relatively low overall chain anisotropy. Additionally, the effect of side-chain length on the DPP chain alignment is observed to be less noticeable. These observations are distinct from traditional linear-chain semicrystalline polymers like polyethylene due to distinct characteristics of backbone/side-chain combination and the crystallographic characteristics in DPP polymers. Furthermore, a stable and isotropic charge carrier mobility is obtained from fabricated organic field-effect transistors. This study deconvolutes the alignment of different components within the thin-film microstructure and highlights that crystallite rotation and chain slippage are the primary deformation mechanisms for semiconducting polymers.

36 MATERIALS SCIENCE↗

Randomized Cholesky Preconditioning for Graph Partitioning Applications

A graph is a mathematical representation of a network; we say it consists of a set of vertices, which are connected by edges. Graphs have numerous applications in various fields, as they can model all sorts of connections, processes, or relations. For example, graphs can model intricate transit systems or the human nervous system. However, graphs that are large or complicated become difficult to analyze. This is why there is an increased interest in the area of graph partitioning, reducing the size of the graph into multiple partitions. For example, partitions of a graph representing a social network might help identify clusters of friends or colleagues. Graph partitioning is also a widely used approach to load balancing in parallel computing. The partitioning of a graph is extremely useful to decompose the graph into smaller parts and allow for easier analysis. There are different ways to solve graph partitioning problems. For this work, we focus on a spectral partitioning method which forms a partition based upon the eigenvectors of the graph Laplacian (details presented in Acer, et. al.). This method uses the LOBPCG algorithm to compute these eigenvectors. LOBPCG can be accelerated by an operator called a preconditioner. For this internship, we evaluate a randomized Cholesky (rchol) preconditioner for its effectiveness on graph partitioning problems with LOBPCG. We compare it with two standard preconditioners: Jacobi and Incomplete Cholesky (ichol). This research was conducted from August to December 2021 in conjunction with Sandia National Laboratories.

97 MATHEMATICS AND COMPUTING↗

Evaluating Performance Portability with the CMS Heterogeneous Pixel Reconstruction code

In the past years the landscape of tools for expressing parallel algorithms in a portable way across various compute accelerators has continued to evolve significantly. There are many technologies on the market that provide portability between CPU, GPUs from several vendors, and in some cases even FPGAs. These technologies include C++ libraries such as Alpaka and Kokkos, compiler directives such as OpenMP, the SYCL open specification that can be implemented as a library or in a compiler, and standard C++ where the compiler is solely responsible for the offloading. Given this developing landscape, users have to choose the technology that best fits their applications and constraints. For example, in the CMS experiment the experience so far in heterogeneous reconstruction algorithms suggests that the full application contains a large number of relatively short computational kernels and memory transfer operations. In this work we use a stand-alone version of the CMS heterogeneous pixel reconstruction code as a realistic use case of HEP reconstruction software that is capable of leveraging GPUs effectively. We summarize the experience of porting this code base from CUDA to Alpaka, Kokkos, SYCL, std::par, and OpenMP offloading. We compare the event processing throughput achieved by each version on NVIDIA and AMD GPUs as well as on a CPU, and compare those to what a native version of the code achieves on each platform.

Andriotis, Nikolaos↗

Geothermal Heat Recovery Complex: Large-Scale, Deep Direct-Use System in a Low-Temperature Sedimentary Basin (Final Report)

A feasibility study of using deep direct-use (DDU) geothermal energy to heat agricultural research facilities (ARFs) was conducted at the University of Illinois at Urbana-Champaign (U of IL) and its similar application to military facilities in the Illinois Basin (ILB). The geothermal energy system (GES) investigated utilizes low-temperature (30–90°C; 90–190°F) geothermal fluid (i.e., brine) from an extraction well that is part of a deep, two-well (doublet) system that extends to the bottom of the ILB. The geothermal reservoir modeled, the Mt. Simon Sandstone (MSS), is about 1,280 m (4,200 feet) deep and 457 m thick (1,500 feet) beneath the U of IL. The DDU GES surface infrastructure includes heat exchangers connected in-parallel to pipelines carrying the geothermal fluid and fresh cold and hot water. Analysis of the GES indicated that the MSS can provide a baseload of 2 MMBtu/hr to heat the ARFs by extracting 954 m³/d (6,000 barrels/day [bbl/d]) of geothermal fluid that has a temperature of 44–46 °C (111–115 °F). In addition to analyzing the levelized cost of heat (LCOH) and life cycle costs, the environmental effects of the DDU GES were evaluated, including reduced greenhouse gas (GHG) emissions and water consumption. Multiple system designs were evaluated and then ranked based on their maximum heating performance, energy efficiency, and cost recovery. This feasibility study identified the key components of the fully-integrated DDU technology that can be implemented, both technically and economically. The results and information from this study provides end-users and policy makers with guidance for additional research on the specific components of DDU technology such that its widespread use can provide an uninterruptible energy source, increase resilience from extreme weather conditions, reduce U.S. dependency on fossil fuels, and reduce greenhouse gas (GHG) emissions. The site-specific part of this study gives U of IL administrators a realistic and pragmatic assessment of the financial resources necessary to add a DDU GES in the MSS to the campus’ energy portfolio.

15 GEOTHERMAL ENERGY↗

A-SST Initial Specification

The U.S. Army Research Office (ARO), in partnership with IARPA, are investigating innovative, efficient, and scalable computer architectures that are capable of executing next-generation large scale data-analytic applications. These applications are increasingly sparse, unstructured, non-local, and heterogeneous. Under the Advanced Graphic Intelligence Logical computing Environment (AGILE) program, Performer teams will be asked to design computer architectures to meet the future needs of the DoD and the Intelligence Community (IC). This design effort will require flexible, scalable, and detailed simulation to assess the performance, efficiency, and validity of their designs. To support AGILE, Sandia National Labs will be providing the AGILE-enhanced Structural Simulation Toolkit (A-SST). This toolkit is a computer architecture simulation framework designed to support fast, parallel, and multi-scale simulation of novel architectures. This document describes the A-SST framework, some of its library of simulation models, and how it may be used by AGILE Performers.

97 MATHEMATICS AND COMPUTING↗

A scalable exponential-DG approach for nonlinear conservation laws: With application to Burger and Euler equations

In this work, we propose an Exponential DG framework for partial differential equations. We decompose 7 governing equations into linear and nonlinear parts to which we apply the discontinuous Galerkin 8 (DG) spatial discretization. In particular, we construct the linear part using Jacobian that effectively 9 capture stiff characteristics in the system. The former is integrated analytically, whereas the latter 10 is approximated. This approach i) is stable with a large Courant number (Cr > 1); ii) supports 11 high-order solutions both in time and space; iii) is computationally favorable compared to IMEX 12 DG methods with no preconditioner; iv) becomes comparable to explicit RKDG methods on uniform 13 mesh and beneficial on non-uniform grid for Euler equations; v) is scalable in a modern massively 14 parallel computing architecture due to its explicit nature of exponential time integrators and com15 pact communication stencil of DG method. Numerical results demonstrate the performance of our 16 proposed methods through various examples. We also discuss the stability and convergence analysis 17 for our exponential DG scheme in the context of Burgers equation.

42 ENGINEERING↗

Combining Sparse Approximate Factorizations with Mixed-precision Iterative Refinement

The standard LU factorization-based solution process for linear systems can be enhanced in speed or accuracy by employing mixed-precision iterative refinement. Most recent work has focused on dense systems. We investigate the potential of mixed-precision iterative refinement to enhance methods for sparse systems based on approximate sparse factorizations. In doing so, we first develop a new error analysis for LU- and GMRES-based iterative refinement under a general model of LU factorization that accounts for the approximation methods typically used by modern sparse solvers, such as low-rank approximations or relaxed pivoting strategies. We then provide a detailed performance analysis of both the execution time and memory consumption of different algorithms, based on a selected set of iterative refinement variants and approximate sparse factorizations. Our performance study uses the multifrontal solver MUMPS, which can exploit block low-rank factorization and static pivoting. We evaluate the performance of the algorithms on large, sparse problems coming from a variety of real-life and industrial applications showing that mixed-precision iterative refinement combined with approximate sparse factorization can lead to considerable reductions of both the time and memory consumption.

97 MATHEMATICS AND COMPUTING↗

Transforming microseismic clouds into near real-time visualization of the growing hydraulic fracture

SUMMARY Microseismic observations during unconventional reservoir stimulation are typically seen as a proxy for clusters of hydraulic fractures and the extent of the stimulated reservoir. Such straightforward interpretation is often misleading and fails to provide a physically reasonable image of the fracturing process. This paper demonstrates the application of a physics-based machine learning algorithm which enables a rapid and accurate fracture mapping from the microseismic data. Our training and validation data set relies on a history-matched geomechanical modelling workflow implemented in GEOS software for the Hydraulic Fracturing Test Site 1 (HFTS-1) project. For this study we augmented the simulated fracture growth through geostatistical modelling of induced seismicity, so that the synthetic microseismic catalogue matches the main statistical properties of the field observations. We formulated the problem of mapping the actual fracture in the clutter of events to parallel common video segmentation workflows: several past video frames (microseismic density snapshots) are passed through a deep convolutional network to classify whether a given voxel is associated with a fracture or intact rock. We found that for accurate fracture mapping, the network’s input and architecture must be augmented to incorporate the fluid injection parameters (pressure, rate, concentration of proppant, and location of the perforation within the cluster). The error rate for the network reached as little as 10 per cent of the fracture area, while a conventional microseismic interpretation approach yielded ∼300 per cent. Our approach also yields must faster predictions than conventional methods (minutes instead of weeks), and could enable engineers to make rapid decisions regarding engineering parameters (pumping rate, viscosity) in real time during stimulation.

58 GEOSCIENCES↗

An Algorithmic and Software Pipeline for Very Large Scale Scientific Data Compression with Error Guarantees

Efficient data compression is becoming increasingly critical for storing scientific data because many scientific applications produce vast amounts of data. This paper presents an end-to-end algorithmic and software pipeline for data compression that guarantees both error bounds on primary data (PD) and derived data, known as Quantities of Interest (QoI).We demonstrate the effectiveness of the pipeline by compressing fusion data generated by a large-scale fusion code, XGC, which produces tens of petabytes of data in a single day. We demonstrate that the compression is conducted by setting aside computational resources known as staging nodes, and does not impact the simulation performance. For efficient parallel I/O, the pipeline uses ADIOS2, which many codes such as XGC already use for their parallel I/O. We show that our approach can compress the data by two orders of magnitude while guaranteeing high accuracy on both the PD and the QoIs. Further, the amount of resources required by compression is a few percent of the resources required by simulation while ensuring that the compression time for each stage is less than the corresponding simulation time.This pipeline consists of three main steps. The first step decomposes the data using domain decomposition into small subdomains. Each subdomain is then compressed independently to achieve a high level of parallelism. The second step uses existing techniques that guarantee error bounds on the primary data for each subdomain. The third step uses a post-processing optimization technique based on Lagrange multipliers to reduce the QoI errors for data corresponding to each subdomain. The Lagrange multipliers generated can be further quantized or truncated to increase the compression level. All of the above characteristics of our approach make it highly practical to apply on-the-fly compression while guaranteeing errors on QoIs that are critical to the scientists.

Banerjee, Tania↗

LLM Benchmarking with LLaMA2: Evaluating Code Development Performance Across Multiple Programming Languages

The rapid evolution of large language models (LLMs) has opened new possibilities for automating various tasks in software development. This paper evaluates the capabilities of the LLaMA 2-70B model in automating these tasks for scientific applications written in commonly used programming languages. Using representative test problems, we assess the model's capacity to generate code, documentation, and unit tests, as well as its ability to translate existing code between commonly used programming languages. Our comprehensive analysis evaluates the compilation, runtime behavior, and correctness of the generated and translated code. Additionally, we assess the quality of automatically generated code, documentation, and unit tests. Here, our results indicate that while LLaMA 2-70B frequently generates syntactically correct and functional code for simpler numerical tasks, it encounters substantial difficulties with more complex, parallelized, or distributed computations, requiring considerable manual corrections. We identify key limitations and suggest areas for future improvements to better leverage AI-driven automation in scientific computing workflows.

97 MATHEMATICS AND COMPUTING↗

Topological phases and bulk-edge correspondence of magnetized cold plasmas

Abstract Plasmas have been recently studied as topological materials. However, a comprehensive picture of topological phases and topological phase transitions in cold magnetized plasmas is still missing. Here we systematically map out all the topological phases and establish the bulk-edge correspondence in cold magnetized plasmas. We find that for the linear eigenmodes, there are 10 topological phases in the parameter space of density n , magnetic field B , and parallel wavenumber k z , separated by the surfaces of Langmuir wave-L wave resonance, Langmuir wave-cyclotron wave resonance, and zero magnetic field. For fixed B and k z , only the phase transition at the Langmuir wave-cyclotron wave resonance corresponds to edge modes. A sufficient and necessary condition for the existence of this type of edge modes is given and verified by numerical solutions. We demonstrate that edge modes exist not only on a plasma-vacuum interface but also on more general plasma-plasma interfaces. This finding broadens the possible applications of these exotic excitations in space and laboratory plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Direction-optimizing Label Propagation and its Application for Community Detection

Label Propagation is a machine learning algorithm typically used for classification. It has also been found to be an effective method for detecting communities in networks. It has two attractive features as a community detection method: it has nearly linear runtime and it requires no \textit{a priori} community information. We propose a new Direction Optimizing Label Propagation Algorithm (DOLPA) that relies on the use of {\em frontiers} and alternates between label {\em push} and label {\em pull} operations to enhance the performance of LPA. Specifically, DOLPA has parameters for tuning the processing order of vertices in a graph. This reduces the number of edges visited and improves the quality of solution. We apply DOLPA to community detection and present the design and implementation of the algorithm as well as its shared-memory parallelization using OpenMP. Empirically, we evaluate our algorithm using synthetic graphs as well as real-world networks. Compared with the state-of-art \textit{Parallel Label Propagation} algorithm, we achieve at least two times the F-Score while reducing the runtime by 50\% for synthetic graphs with overlapping communities. We also compare DOLPA against the state-of-art parallel implementation of the Louvain method using the same graphs and show that DOLPA achieves about three times the F-Score at 10\% the runtime. On real-world graphs, we get a speedup of up to $10\times$ using 64 threads.

Liu, X↗

Differences In High Burnup Fuel Management Strategies to Minimize FFRD and Increase Economic Viability

The nuclear industry is pursuing approval of an increase in the length of the pressurized water reactor (PWR) cycle from 18 months to 24 months to reduce reactor downtime and enhance the economic competitiveness of nuclear energy. Such an increase in reactor cycle length will require that the maximum rod average burnup exceeds the current regulatory limit of 62 GWd/MTU, and it could peak at approximately 75 GWd/MTU, posing potential reactor safety and performance concerns. One such concern is that fuel fragmentation, relocation, and dispersal (FFRD) could occur during a severe loss-of coolant accident (LOCA) in which a fuel rod balloons and bursts, and pulverized fuel fragments are dispersed throughout the reactor’s primary coolant system. Previous analyses have identified which reactor operating conditions leave the core more susceptible to FFRD and have shown that FFRD susceptibility is strongly linked to fuel rod burnup and linear heat rate (LHR) history. The work described in this report uses an optimization strategy known as parallel simulated annealing (PSA) and a coarse mesh Purdue Advanced Reactor Core Simulator (PARCS) reactor physics model to develop two core fuel loading patterns, each with a different optimization objective. One core optimization maximized the core’s cycle length while still respecting regulatory limits on the radial peaking factor and soluble boron concentration with a peak rod average burnup of 75 GWd/MTU. The second optimization was aimed at minimizing FFRD susceptibility while still targeting a 24-month cycle length and respecting regulatory limits. PARCS model predictions were verified using the high-fidelity Virtual Environment for Reactor Applications (VERA). The two core designs were compared to highlight core design strategies to minimize FFRD susceptibility and to maximize economic viability.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

gRNA-SeqRET: a universal tool for targeted and genome-scale gRNA design and sequence extraction for prokaryotes and eukaryotes

High-throughput genetic screening is frequently employed to rapidly associate gene with phenotype and establish sequence-function relationships. With the advent of CRISPR technology, and the ability to functionally interrogate previously genetically recalcitrant organisms, non-model organisms can be investigated using pooled guide RNA (gRNA) libraries and sequencing-based assays to quantitatively assess fitness of every targeted locus in parallel. To aid the construction of pooled gRNA assemblies, we have developed an in silico design workflow for gRNA selection using the gRNA Sequence Region Extraction Tool (gRNA-SeqRET). Built upon the previously developed CCTop, gRNA-SeqRET enables automated, scalable design of gRNA libraries that target user-specified regions or whole genomes of any prokaryote or eukaryote. Additionally, gRNA-SeqRET automates the bulk extraction of any regions of sequence relative to genes or other features, aiding in the design of homology arms for insertion or deletion constructs. We also assess in silico the application of a designed gRNA library to other closely related genomes and demonstrate that for very closely related organisms Average Nucleotide Identity (ANI) > 95% a large fraction of the library may be of relevance. The gRNA-SeqRET web application pipeline can be accessed at https://grna.jgi.doe.gov. The source code is comprised of freely available software tools and customized Python scripts, and is available at https://bitbucket.org/berkeleylab/grnadesigner/src/master/ under a modified BSD open-source license (https://bitbucket.org/berkeleylab/grnadesigner).

59 BASIC BIOLOGICAL SCIENCES↗