Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel performance”

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 451 records · Page 25

An extension to V ORO ++ for multithreaded computation of Voronoi cells

V ORO ++ is a software library written in C++ for computing the Voronoi tessellation, a technique in computational geometry that is widely used for analyzing systems of particles. V ORO ++ was released in 2009 and is based on computing the Voronoi cell for each particle individually. Here, we take advantage of modern computer hardware, and extend the original serial version to allow for multithreaded computation of Voronoi cells via the OpenMP application programming interface. We test the performance of the code, and demonstrate that it can achieve parallel efficiencies greater than 95% in many cases. Further, the multithreaded extension follows standard OpenMP programming paradigms, allowing it to be incorporated into other programs. We provide an example of this using the VoroTop software library, performing a multithreaded Voronoi cell topology analysis of up to 102.4 million particles.

97 MATHEMATICS AND COMPUTING↗

Summary of CTF Modeling and Numerical Improvements for Boiling Water Reactor Simulation

This report documents geometry and numerical improvements made to CTF for the modeling of boiling water reactor (BWR) geometry and operating conditions. These activities are part of a larger program to extend the Virtual Environment for Reactor Applications (VERA) to better support BWR modeling and simulation. The activities documented in this report added features to CTF, including support for mixed-fuel cores, modeling of the upper plenum, and modeling of the lower tie plate form losses. A review of the spacer grid modeling approach was also performed, and a plan was discussed for future improvement. The parallelization of the model was improved, leading to a roughly 2× improvement in CTF runtime and a 1.6× improvement in total VERA runtime. An in-depth review of the governing equations and their linearization was performed and is documented in this report. Once implemented, this new linearization will allow CTF to take much larger timesteps, leading to more significant reductions in CTF and VERA runtimes.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Experimental Investigation of Low-Frequency Distributed Acoustic Sensor Responses to Two Parallel Propagating Fractures

Low-frequency distributed acoustic sensing (LF-DAS) is a diagnostic tool for hydraulic fracture propagation with far-field monitoring using fiber optic sensors. LF-DAS senses strain rate variation caused by stress field change due to fracture propagation. Fiber optic sensors are installed in the monitoring wells in the vicinity of a fractured well. From the strain responses, fracture propagation can be evaluated. To understand subsurface conditions with multiple propagating fractures, a laboratory-scale hydraulic fracture experiment was performed simulating the LF-DAS response to fracture propagation with embedded distributed optical fiber strain sensors under these conditions. The experiment was performed using a transparent cube of epoxy with two parallel radial initial flaws centered in the cube. Fluid was injected into the sample to generate fractures along the initial flaws. The experiment used distributed high-definition fiber optic strain sensors with tight spatial resolutions. The sensors were embedded at two different locations on opposite sides of the initial flaws, serving as observation/monitoring locations. We also employed finite element modeling to numerically solve the linear elastic equations of equilibrium continuity and stress–strain relationships. The measured strains from the experiment were compared to simulation results from the finite element model. The experimentally derived strain and strain-rate waterfall plots from this study show the responses to both fractures propagating, while the fracture at the lower position took most of the fluid during the experiment. Interestingly, a fracture first began propagating from the upper flaw of the two flaws, but once the lower fracture was initiated, it grew much faster than the upper fracture. Both fibers were intercepted by the lower fracture, further verifying the strain signature as a fracture is approaching and intersecting an offset fiber.

Chemistry↗

The Kokkos OpenMPTarget Backend: Implementation and Lessons Learned

As the supercomputing landscape diversifies, solutions such as Kokkos to write vendor agnostic applications and libraries have risen in popularity. Kokkos provides a programming model designed for performance portability, which allows developers to write a single source implementation that can run efficiently on various architectures. At its heart, Kokkos maps parallel algorithms to architecture and vendor specific backends written in lower level programming models such as CUDA and HIP. Another approach to writing vendor agnostic parallel code is using OpenMP’s directives based approach, which lets developers annotate code to express parallelism. It is implemented at the compiler level and is supported by all major high performance computing vendors, as well as the primary Open Source toolchains GNU and LLVM. Since its inception, Kokkos has used OpenMP to parallelize on CPU architectures. In this paper, we explore leveraging OpenMP for a GPU backend and discuss the challenges we encountered when mapping the Kokkos APIs and semantics to OpenMP target constructs. As an exemplar workload we chose a simple conjugate gradient solver for sparse matrices. We find that performance on NVIDIA and AMD GPUs varies widely based on details of the implementation strategy and the chosen compiler. Furthermore, the performance of the OpenMP implementations decreases with increasing complexity of the investigated algorithms.

Gayatri, Rahulkumar↗

A Flexible Forwarding Scheme to Improve Latency-Bound Irregular P2P Communication in MPI

We propose an algorithm to efficiently perform latency-bound communication scenarios that consist of many small messages. In these parallel scenarios, processes typically pass around a lot of small-sized messages of a few KBs of size. Performing communication operations with P2P MPI routines or collective MPI routines (including neighborhood collectives) in such scenarios may not always yield the optimal results and may not resolve the latency bottleneck. To this end, we develop a regular structure called virtual process topology (VPT) on which the messages can be communicated in a structured and controlled manner. Using parameters of this topology, one can tune the rate of aggression in tackling the latency costs. We demonstrate that our communication algorithm is preferable to MPI P2P and collective routines for latency-bound communication and it can easily be adapted only by replacing calls to MPI routines in a parallel application. We show how to adapt existing topology-aware mapping heuristics to address the volume overhead due to communicating messages on the VPT. Moreover, we propose a novel swap-based mapping heuristic to address this overhead by optimizing the maximum volume handled by a process. Experiments on synthetic communication graphs as well as real-world applications such as parallel Canonical Polyadic sparse tensor decomposition and parallel sparse matrix-dense matrix multiplication show that our approach is a powerful way of overcoming the bottlenecks posed by sparse and latency-bound irregular communication.

communication algorithm↗

From NWChem to NWChemEx: Evolving with the Computational Chemistry Landscape

Since the advent of the first computers, chemists have been at the forefront of using computers to understand and solve complex chemical problems. As the hardware and software have evolved, so have the theoretical and computational chemistry methods and algorithms. Parallel computers clearly changed the common computing paradigm in the late 1970s and 80s, and the field has again seen a paradigm shift with the advent of graphical processing units. This review explores the challenges and some of the solutions in transforming software from the terascale to the petascale and now to the upcoming exascale computers. While discussing the field in general, NWChem and its redesign, NWChemEx, will be highlighted as one of the early codesign projects to take advantage of massively parallel computers and emerging software standards to enable large scientific challenges to be tackled.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Scalable and automated CRISPR-based strain engineering using droplet microfluidics

Abstract We present a droplet-based microfluidic system that enables CRISPR-based gene editing and high-throughput screening on a chip. The microfluidic device contains a 10 × 10 element array, and each element contains sets of electrodes for two electric field-actuated operations: electrowetting for merging droplets to mix reagents and electroporation for transformation. This device can perform up to 100 genetic modification reactions in parallel, providing a scalable platform for generating the large number of engineered strains required for the combinatorial optimization of genetic pathways and predictable bioengineering. We demonstrate the system’s capabilities through the CRISPR-based engineering of two test cases: (1) disruption of the function of the enzyme galactokinase ( galK ) in E. coli and (2) targeted engineering of the glutamine synthetase gene ( glnA ) and the blue-pigment synthetase gene ( bpsA ) to improve indigoidine production in E. coli .

42 ENGINEERING↗

The effects of multispecies Hohlraum walls on stimulated Brillouin scattering, Hohlraum dynamics, and beam propagation

We report experiments and simulations have been conducted to investigate the efficacy of Ta 2 O 5 -lined Hohlraum walls at reducing stimulated Brillouin backscattering (SBS) as well as any subsequent effects on the Hohlraum dynamics and capsule implosions in indirect drive experiments at the National Ignition Facility. Using a 1.1 MJ 400 TW, 351 nm, shaped laser pulse, we measure a 5× reduction in SBS power in the peak of the pulse from the wall on the outer 50° cone beams. The SBS spectrum indicates a reduction in the high-Z spectral signature when using multispecies wall materials. Detailed hydrodynamic simulations were performed using different heat conduction models with flux limiters. Additional simulations were performed on the plasma maps using the 3D parallel paraxial code pF3D to compare backscatter powers between the pure Au and Ta 2 O 5 -lined Hohlraums. Further analysis, using hydrodynamically equivalent plasmas, shows that the SBS reduction is clearly a result of the added ion Landau damping caused by the oxygen ions and not from differences in plasma conditions. The experimental and simulation results also show an increase in the wall plasma expansion when using the Ta 2 O 5 liner leading to a 70% more oblate implosion.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

It’s Time to Talk About HPC Storage: Perspectives on the Past and Future

High-performance computing (HPC) storage systems are a key component of the success of HPC to date. Recently, we have seen major developments in storage-related technologies, as well as changes to how HPC platforms are used, especially in relation to artificial intelligence and experimental data analysis workloads. Additionally, these developments merit a revisit of HPC storage system architectural designs. In this article, we discuss the drivers, identify key challenges to status quo posed by these developments, and discuss directions future research might take to unlock the potential of new technologies for the breadth of HPC applications.

97 MATHEMATICS AND COMPUTING↗

Optimizing Error-Bounded Lossy Compression for Scientific Data With Diverse Constraints

Vast volumes of data are produced by today's scientific simulations and advanced instruments. These data cannot be stored and transferred efficiently because of limited I/O bandwidth, network speed, and storage capacity. Error-bounded lossy compression can be an effective method for addressing these issues: not only can it significantly reduce data size, but it can also control the data distortion based on user-defined error bounds. In practice, many scientific applications have specific requirements or constraints for lossy compression, in order to guarantee that the reconstructed data are valid for post hoc analysis. For example, some datasets contain irrelevant data that should be isolated in particular and users often have intuition regarding value ranges, geospatial regions, and other data subsets that are crucial for subsequent analysis. Existing state-of-the-art error-bounded lossy compressors, however, do not consider these constraints during compression, resulting in inferior compression ratios with respect to user's post hoc analysis, due to the fact that the data itself provides little or no value for post hoc analysis. In this work we address this issue by proposing an optimized framework that can preserve diverse constraints during the error-bounded lossy compression, e.g., cleaning the irrelevant data, efficiently preserving different precision for multiple value intervals, and allowing users to set diverse precision over both regular and irregular regions. We perform our evaluation on a supercomputer with up to 2,100 cores. Experiments with six real-world applications show that our proposed diverse constraints based error-bounded lossy compressor can obtain a higher visual quality or data fidelity on reconstructed data with the same or even higher compression ratios compared with the traditional state-of-the-art compressor SZ. Furthermore, our experiments also demonstrate very good scalability in compression performance compared with the I/O throughput of the parallel file system.

97 MATHEMATICS AND COMPUTING↗

RAPIDS: Reconciling Availability, Accuracy, and Performance in Managing Geo-Distributed Scientific Data

In modern science, big data plays an increasingly important role. Many scientific applications, such as running simulations on supercomputers or conducting experiments on advanced instruments, produce huge amount of data at unprecedented speed. Analyzing and understanding such big data is the key for scientists to make scientific breakthroughs. However, data might become unavailable for scientists to access when outages or maintenance of the storage system occur, which severely hinders scientific discovery. To improve the data availability, data duplication and erasure coding (EC) are often used. But as the scientific data gets larger, using these two methods can cause considerable storage and network overhead.In this paper, we propose RAPIDS, a hybrid approach that combines the multigrid-based error-bounded lossy compression with erasure coding, to significantly reduce the storage and network overhead required for maintaining high data availability. Our experiments show that RAPIDS reduces the storage overhead by up to 7.5x and network overhead by up to 3x to achieve the same level of availability compared to the regular EC method. We improve RAPIDS by building two models to optimize the fault tolerance configurations and data gathering strategy. We demonstrate that RAPIDS significantly improves performance when running on many CPU cores in parallel or on GPUs.

Wan, Lipeng↗

Parallel Dislocation Simulator

ParaDiS, or Parallel Dislocation Simulator, is a simulation tool that performs direct numerical simulation of dislocation ensembles, the carriers of plasticity, to predict the strength in crystalline materials from the fundamental physics of defect motion, evolution, and interaction. The code has been successfully deployed on high performance computing architectures and used to study the origins of strength and strain hardening for cubic crystals, the strength of micro-pillars, and irradiated materials at LLNL. The ParaDiS code has been successfully deployed on more than one hundred thousand CPU's with over ten million active degrees of freedom.

Bulatov, Vasily↗

Robust Event Simulation Variants Endowed to Ns-3 for General Exploration

Sandia's ns-3 contributions are modifications to the open source ns-3 network simulator that enable simulation speedup. One improvement, for example, removes the need for simulating the transmission and receipt of packets between nodes that are too distant to actually be able to communicate. In large-scale simulations this optimization has shown significant gains in performance. Additional contributions will pave the way for parallel discrete simulation (PDES) in ns-3. SAND2020-12456 O Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Dickson, Joseph↗

Performance of the Initial Implementation of the Shift Monte Carlo Code in SCALE 6.3

The Shift Monte Carlo code will be introduced in SCALE 6.3 as an alternative to the KENO V.a, KENO-VI, and Monaco codes. Calculations were performed to establish the performance of Shift for criticality safety analyses within the criticality safety analyses sequence (CSAS) based on models in the Verified, Archived Library of Inputs and Data (VALID). This test suite contains over 600 critical experiment models covering a broad range of fissile materials and neutron energy spectra. The comparisons presented include calculated k eff values and runtime performance for serial calculations and a selection of parallel calculations. Comparisons are presented for multigroup (MG) and continuous-energy (CE) calculations for KENO V.a and KENO-VI models. Results generated with a beta version of SCALE 6.3 indicate excellent agreement in k eff values between KENO and Shift. The largest differences in the average k eff value calculated for the 15 categories of KENO V.a models are 0.00020 ± 0.00011 Δ k for MG calculations and 0.00011 ± 0.00005 Δ k for CE calculations. Similar comparisons in three categories using KENO-VI result in the largest differences for MG calculations: as 0.00004 ± 0.00003 Δ k , and -0.00002 ± 0.00003 Δ k for CE. The preliminary results also indicate that Shift is faster than KENO on a per particle basis, especially for fast spectrum systems. The uncertainty per history is also higher, however, so the Monte Carlo figure of merit is higher for KENO for thermal and intermediate spectrum systems. As expected, Shift generally has better speedup than KENO for parallel calculations, regardless of neutron energy spectrum.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

PIPER: Performance Insight for Programmers and Exascale Runtimes (Final Technical Report)

This project concentrated on the development of novel performance tools and analysis techniques for large scale parallel systems and applications, eventually targeting exascale platforms. Activities conducted included work to novel root cause detection approaches and an auto-tuning framework for parallel systems. The work has led to several software solutions, which are available as open source.

97 MATHEMATICS AND COMPUTING↗

GentenMPI: Distributed Memory Sparse Tensor Decomposition

GentenMPl is a toolkit of sparse canonical polyadic (CP) tensor decomposition algorithms that is designed to run effectively on distributed-memory high-performance computers. Its use of distributed-memory parallelism enables it to efficiently decompose tensors that are too large for a single compute node's memory. GentenMPl leverages Sandia's decades-long investment in the Trilinos solver framework for much of its parallel-computation capability. Trilinos contains numerical algorithms and linear algebra classes that have been optimized for parallel simulation of complex physical phenomena. This work applies these tools to the data science problem of sparse tensor decomposition. In this report, we describe the use of Trilinos in GentenMPl, extensions needed for sparse tensor decomposition, and implementations of the CP-ALS (CP via alternating least squares) and GCP-SGD (generalized CP via stochastic gradient descent) sparse tensor decomposition algorithms. We show that GentenMPl can decompose sparse tensors of extreme size, e.g., a 12.6-terabyte tensor on 8192 computer cores. We demonstrate that the Trilinos backbone provides good strong and weak scaling of the tensor decomposition algorithms.

97 MATHEMATICS AND COMPUTING↗

Search for the Muon EDM at Muon $g-2$

After 6 years of taking data, the Muon $g-2$ Experiment measured the anomalous magnetic moment of the muon $a_μ$ to a final precision of 127 ppb. In parallel to this analysis, it is possible to perform a measurement of the muon electric dipole moment (EDM) using the straw tracker detectors. In the Standard Model (SM) EDMs are predicted to be vanishingly small. A non-zero muon EDM would constitute physics beyond the SM (BSM) and be a source of charge-parity violation. The current limit on the muon EDM was set at the predecessor experiment at Brookhaven National Laboratory, giving $|d_\mu|<1.8\times10^{-19}\ e\cdot$cm Fermilab aims to improve this by an order of magnitude, which will help to constrain BSM theories. This poster will cover the importance, methodology, and status of this measurement.

Bailey, Lucy [University Coll. London]↗

Measurement-Based Quantum Thermal Machines with Feedback Control

We investigated coupled-qubit-based thermal machines powered by quantum measurements and feedback. We considered two different versions of the machine: (1) a quantum Maxwell’s demon, where the coupled-qubit system is connected to a detachable single shared bath, and (2) a measurement-assisted refrigerator, where the coupled-qubit system is in contact with a hot and cold bath. In the quantum Maxwell’s demon case, we discuss both discrete and continuous measurements. We found that the power output from a single qubit-based device can be improved by coupling it to the second qubit. We further found that the simultaneous measurement of both qubits can produce higher net heat extraction compared to two setups operated in parallel where only single-qubit measurements are performed. In the refrigerator case, we used continuous measurement and unitary operations to power the coupled-qubit-based refrigerator. We found that the cooling power of a refrigerator operated with swap operations can be enhanced by performing suitable measurements.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗