SEARCH · Engineering Papers

Results for “parallel systems”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 631 records · Page 35

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Monte Carlo Explicitly Correlated Second-Order Many-Body Green’s Function Calculations of Semiconductor Band Gaps

A systematically converging series of ab initio, post-density-functional, size-consistent, electron-correlated approximations is desired for predictive computing of felectronic band structures of insulating, semiconducting, and metallic solids. A series that meets all of these desiderata (except the applicability to metals) is ab initio many-body Green's function theory based on Gaussian-type-orbital (GTO) basis sets. Here, its leading-order approximation, the second-order Green's function (GF2) method in the diagonal and frequency-independent approximations with the aug-cc-pVDZ basis set, is applied to the fundamental band gaps of three semiconductors (diamond, silicon, and silicon carbide in the zincblende structure) using cluster models. Corrections are made to the basis-set-incompleteness errors by the explicit-correlation (F12) ansatz (GF2-F12) for the valence band edges. The crystals are modeled as surface-passivated clusters of increasing sizes, whose wave functions are expanded by up to 2709 GTO basis functions. Immense computational costs of these calculations are overcome by the highly scalable stochastic algorithm of the Monte Carlo GF2-F12 method, whose operation cost per state increases only as a cubic power of system size, which has a tiny memory footprint and easily achieves near-perfect parallel efficiency on thousands of CPUs or on hundreds of GPUs. The correlated, F12-corrected highest-occupied and lowest-unoccupied molecular-orbital energy (HOMO-LUMO) gap is 5.78 ± 0.07 eV for C 87 H 76 as compared with the experimental value of the fundamental (indirect) band gap of bulk diamond at 5.48 eV. The correlated, F12-corrected HOMO-LUMO gaps for Si 75 H 76 and Si 32 C 43 H 76 are 2.56 ± 0.15 eV and 3.50 ± 0.12 eV, respectively, which are expected to decrease further with increasing cluster sizes. As a result, the experimental fundamental (indirect) band gaps of bulk silicon and silicon carbide are 1.17 eV and 2.42 eV, respectively.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2020

A broadband wavelet implementation for rapid ultrasound pulse-echo time-of-flight measurements

A broadband wavelet approach to ultrasonic pulse-echo time-of-flight measurements is described. The broadband approach significantly reduces the time required for frequency-dependent pulse-echo measurements, enabling studies of dynamic systems ranging from biological systems to solid-state phase transitions. The described broadband approach is demonstrated in parallel with the more traditional frequency stepping approach to perform ultrasound time-of-flight measurements inside a large volume Paris-Edinburgh press in-situ at a synchrotron source. The broadband wavelet data acquisition process was found to be 1-2 orders of magnitude faster than the steppedfrequency approach, with no compromise in data quality or determined results.

47 OTHER INSTRUMENTATION↗

DOE OSTI2023

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↗

DOE OSTI2022

Compressed basis GMRES on high-performance graphics processing units

Krylov methods provide a fast and highly parallel numerical tool for the iterative solution of many large-scale sparse linear systems. To a large extent, the performance of practical realizations of these methods is constrained by the communication bandwidth in current computer architectures, motivating the investigation of sophisticated techniques to avoid, reduce, and/or hide the message-passing costs (in distributed platforms) and the memory accesses (in all architectures). This article leverages Ginkgo’s memory accessor in order to integrate a communication-reduction strategy into the (Krylov) GMRES solver that decouples the storage format (i.e., the data representation in memory) of the orthogonal basis from the arithmetic precision that is employed during the operations with that basis. Given that the execution time of the GMRES solver is largely determined by the memory accesses, the cost of the datatype transforms can be mostly hidden, resulting in the acceleration of the iterative step via a decrease in the volume of bits being retrieved from memory. Together with the special properties of the orthonormal basis (whose elements are all bounded by 1), this paves the road toward the aggressive customization of the storage format, which includes some floating-point as well as fixed-point formats with mild impact on the convergence of the iterative process. We develop a high-performance implementation of the “compressed basis GMRES” solver in the Ginkgo sparse linear algebra library using a large set of test problems from the SuiteSparse Matrix Collection. We demonstrate robustness and performance advantages on a modern NVIDIA V100 graphics processing unit (GPU) of up to 50% over the standard GMRES solver that stores all data in IEEE double-precision.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Requirements Description of GAMSOR and GAMSRC

This report presents the modeling and simulation capabilities of Argonne National Laboratory’s GAMSOR and GAMSRC code that is used in present reactor analysis activities. These capabilities will then be used to establish the set of verification tasks necessary to verify GAMSOR for use on commercial projects. A similar approach was taken for the PERSENT, REBUS and DIF3D software packages. The GAMSOR program is a modified version of DIF3D used to obtain the coupled neutron gamma flux distributions for a given reactor system. GAMSOR was first developed in the 1980s and its work has progressed in parallel with DIF3D throughout its various development phases. While GAMSOR is compatible with DIF3D-FD and DIF3D-Nodal, DIF3D-VARIANT is most commonly used today and will be the focus of the present verification effort. As covered in [1], GAMSOR was built to provide more accurate heating distributions by explicitly solving for both the gamma and neutron heating distributions. Without this consideration, gamma heat is normally assumed to be deposited locally at the site of gamma production. This is acceptable for modeling some phenomena because the total energy production is preserved, but it can lead to inaccurate approximations of fluence-dependent behaviors such as fuel performance, swelling, cladding embrittlement, radiation induced creep, and power peaking. The outputs from GAMSOR are contained in multiple intermediate and final output files: FIXSRC, VARSRC, GTFLUX, GHFLUX, PWDINT, NPDINT, and GPDINT. DIF3D normally produces a PWDINT file containing power density results, with the assumption that gamma rays are absorbed where they are emitted (i.e., energy deposition is local with no modeled transport). With GAMSOR, neutron power density (NPDINT) and gamma power density (GPDINT) are both produced, with their summed power densities replacing the results in PWDINT for total heating (i.e., recoverable) power density.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2025

Mahakala: A Python-based Modular Ray-tracing and Radiative Transfer Algorithm for Curved Spacetimes

We introduce Mahakala, a Python-based, modular, radiative ray-tracing code for curved spacetimes. We employ Google's JAX framework for accelerated automatic differentiation, which can efficiently compute Christoffel symbols directly from the metric, allowing the user to easily and quickly simulate photon trajectories through non-Kerr spacetimes. JAX also enables Mahakala to run in parallel on both CPUs and GPUs. Mahakala natively uses the Cartesian Kerr–Schild coordinate system, which avoids numerical issues caused by the pole in spherical coordinate systems. We demonstrate Mahakala's capabilities by simulating 1.3 mm wavelength images (the wavelength of Event Horizon Telescope observations) of general relativistic magnetohydrodynamic simulations of low-accretion rate supermassive black holes. The modular nature of Mahakala allows us to quantitatively explore how different regions of the flow influence different image features. We show that most of the emission seen in 1.3 mm images originates close to the black hole and peaks near the photon orbit. We also quantify the relative contribution of the disk, forward jet, and counterjet to 1.3 mm images.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2020

Sage: parallel semi-asymmtric graph algorithms for NVRAMs

Non-volatile main memory (NVRAM) technologies provide an attractive set of features for large-scale graph analytics, including byte-addressability, low idle power, and improved memory-density. NVRAM systems today have an order of magnitude more NVRAM than traditional memory (DRAM). NVRAM systems could therefore potentially allow very large graph problems to be solved on a single machine, at a modest cost. However, a significant challenge in achieving high performance is in accounting for the fact that NVRAM writes can be much more expensive than NVRAM reads. In this paper, we propose an approach to parallel graph analytics using the Parallel Semi-Asymmetric Model (PSAM), in which the graph is stored as a read-only data structure (in NVRAM), and the amount of mutable memory is kept proportional to the number of vertices. Similar to the popular semi-external and semi-streaming models for graph analytics, the PSAM approach assumes that the vertices of the graph fit in a fast read-write memory (DRAM), but the edges do not. In NVRAM systems, our approach eliminates writes to the NVRAM, among other benefits. To experimentally study this new setting, we develop Sage, a parallel semi-asymmetric graph engine with which we implement provably-efficient (and often work-optimal) PSAM algorithms for over a dozen fundamental graph problems. We experimentally study Sage using a 48--core machine on the largest publicly-available real-world graph (the Hyperlink Web graph with over 3.5 billion vertices and 128 billion edges) equipped with Optane DC Persistent Memory, and show that Sage outperforms the fastest prior systems designed for NVRAM. Importantly, we also show that Sage nearly matches the fastest prior systems running solely in DRAM, by effectively hiding the costs of repeatedly accessing NVRAM versus DRAM.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Analysis of Threading Libraries for High Performance Computing

With the appearance of multi-/many core machines, applications and runtime systems have evolved in order to exploit the new on-node concurrency brought by new software paradigms. POSIX threads (Pthreads) was widely-adopted for that purpose and it remains as the most used threading solution in current hardware. Lightweight thread (LWT) libraries emerged as an alternative offering lighter mechanisms to tackle the massive concurrency of current hardware. In this article, we analyze in detail the most representative threading libraries including Pthread- and LWT-based solutions. In addition, to examine the suitability of LWTs for different use cases, we develop a set of microbenchmarks consisting of OpenMP patterns commonly found in current parallel codes, and we compare the results using threading libraries and OpenMP implementations. Moreover, we study the semantics offered by threading libraries in order to expose the similarities among different LWT application programming interfaces and their advantages over Pthreads. This article exposes that LWT libraries outperform solutions based on operating system threads when tasks and nested parallelism are required.

GLT↗

DOE OSTI2020

Scalable Knowledge Graph Analytics at 136 Petaflop/s

We are motivated by newly proposed methods for data mining large-scale corpora of scholarly publications, such as the full biomedical literature, which may consist of tens of millions of papers spanning decades of research. In this setting, analysts seek to discover how concepts relate to one another. They construct graph representations from annotated text databases and then formulate the relationship-mining problem as one of computing all-pairs shortest paths (APSP), which becomes a significant bottleneck. In this context, we present a new high-performance algorithm and implementation of the Floyd-Warshall algorithm for distributed-memory parallel computers accelerated by GPUs, which we call DSNAPSHOT (Distributed Accelerated Semiring All-Pairs Shortest Path). For our largest experiments, we ran DSNAPSHOT on a connected input graph with millions of vertices using 4, 096nodes (24,576GPUs) of the Oak Ridge National Laboratory's Summit supercomputer system. We find DSNAPSHOT achieves a sustained performance of 136×1015 floating-point operations per second (136petaflop/s) at a parallel efficiency of 90% under weak scaling and, in absolute speed, 70% of the best possible performance given our computation (in the single-precision tropical semiring or “min-plus” algebra). Looking forward, we believe this novel capability will enable the mining of scholarly knowledge corpora when embedded and integrated into artificial intelligence-driven natural language processing workflows at scale.

Kannan, Ramakrishnan {ramki}↗

DOE OSTI2024

Automated Calibration of Parallel and Distributed Computing Simulators: A Case Study

Many parallel and distributed computing research results are obtained in simulation, using simulators that mimic real-world executions on some target system. Each such simulator is configured by picking values for parameters that define the behavior of the underlying simulation models it implements. The main concern for a simulator is accuracy: simulated behaviors should be as close as possible to those observed in the real-world target system. This requires that values for each of the simulator's parameters be carefully picked, or “calibrated,” based on ground-truth real-world executions. Examining the current state of the art shows that simulator calibration, at least in the field of parallel and distributed computing, is often undocumented (and thus perhaps often not performed) and, when documented, is described as a labor-intensive, manual process. In this work we evaluate the benefit of automating simulation calibration using simple algorithms. Specifically, we use a real-world case study from the field of High Energy Physics and compare automated calibration to calibration performed by a domain scientist. Our main finding is that automated calibration is on par with or significantly outperforms the calibration performed by the domain scientist. Furthermore, automated calibration makes it straightforward to operate desirable tradeoffs between simulation accuracy and simulation speed.

Mc donald, Jesse↗

DOE OSTI2022

Effects of Intrusive Confining Units on Groundwater Flow at Pahute Mesa, Nevada National Security Site

Geological, geophysical, hydrogeological, and hydrological evidence indicates that feeder dikes to lava flows play a role as confining units in the groundwater flow system underlying the Pahute Mesa area of underground nuclear testing at the Nevada National Security Site (NNSS). Of geological significance, the Pahute Mesa testing area is largely situated within the Silent Canyon caldera, which includes both tuffs and lavas that were fed by (and are connected to) intrusive rock units such as feeder dikes prior to and during volcanic eruptions (Orkild et al., 1968; Byers et al., 1976). Groundwater modeling results presented in this report support extension of “pool-dam” and “breach scenario” concepts presented in Jackson and Fenelon (2018) and Jackson et al. (2021) to low-permeability intrusive confining units (ICUs) such as feeder dikes that are expected to dissect and ring the caldera. As laterally extensive, steeply-dipping, and sub-parallel planar structures, ICUs can be expected to further compartmentalize groundwater flow in the volcanic aquifers systems at Pahute Mesa beyond the stratigraphically-defined tuff confining units (TCUs). ICUs provide an explanation for changes in water levels before and after the Cheshire test, detonated 2/14/76 (USDOE, 2015), and the unusually high horizontal gradient southwest of Cheshire. These ICU concepts are supported by groundwater modeling results presented in this report. The evidence and groundwater modeling results indicate that the downgradient extent of radionuclide contamination in some areas of Pahute Mesa could be overestimated by ignoring the confining effects of ICUs. On the other hand, contaminant extent could be underestimated by not considering transient flow effects and/or the re-equilibrated flow field caused by breaching of an ICU by an underground nuclear test.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2022

Effects of Intrusive Confining Units on Groundwater Flow at Pahute Mesa, Nevada National Security Site

Geological, geophysical, hydrogeological, and hydrological evidence indicates that feeder dikes to rhyolitic lava flows may play a role as confining units in the groundwater flow system underlying the Pahute Mesa (PM) area of underground nuclear testing at the Nevada National Security Site (NNSS) (Figure 1). Of geological significance, the PM testing area is largely situated within the Silent Canyon caldera complex (SCCC), which includes both tuffs and lavas that were fed by (and are connected to) intrusive rock units such as feeder dikes prior to and during volcanic eruptions (Orkild et al., 1968; Byers et al., 1976a). Groundwater modeling results presented in this report support extension of “pool-dam” and “breach scenario” concepts presented in Jackson and Fenelon (2018) and Jackson et al. (2021) to low-permeability intrusive confining units (ICUs) such as feeder dikes that are expected to dissect and ring silicic calderas. As laterally extensive, steeply-dipping, and sub-parallel planar structures, ICUs may further compartmentalize groundwater flow in some areas of the volcanic aquifer system at PM. ICUs may explain unusually high horizontal hydraulic gradient southwest of Cheshire. Breaching of an ICU within which the Cheshire test was emplaced may explain changes in water levels before and after the Cheshire test was detonated in the U-20n emplacement hole on 2/14/76 (USDOE, 2015b). This analysis of the effects of ICUs on groundwater flow at PM addresses a need to evaluate uncertainty in the conceptual model or structural aspects of hydrologic source term (HST) or corrective action unit (CAU) models for groundwater flow and contaminant transport (FFACO, 1996, as amended). At Cheshire and possibly other test locations at PM, downgradient extent of radionuclide contamination may be overpredicted by not including the confining effects of ICUs. On the other hand, contaminant extent may be underpredicted by not considering transient flow effects and/or the re-equilibrated flow field caused by breaching of an ICU by an underground nuclear test. Near Cheshire, the effects of ICUs may be most apparent and impactful to the groundwater flow system at PM because of an unusual combination of thickness, extent, and frequency of dikes transecting the saturated CHLFA4 aquifer and feeding into the overlying unsaturated rhyolite lava of Windy Wash. Chapters 2, 3, and 4 present geological, geophysical, hydrogeological, and hydrological evidence for ICUs at PM. Chapters 5 and 6 examine effects of ICUs on groundwater flow including analysis by groundwater modeling.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2021

Toward Well-Provenanced Computer System Benchmarking: An Update

This report provides an update on the current design, implementation, and usage of bueno, a Python framework enabled by container technology that supports gradations of reproducibility for wellprovenanced benchmarking of sequential and parallel programs. The ultimate goal of the bueno project is to provide convenient access to mechanisms that aid in the automated generation, collection, and dissemination of data relevant for experimental reproducibility in computer system benchmarking.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Stage-local partitioned two-step runge-kutta methods for large systems of ordinary differential equations

We introduce stage-local partitioned two-step Runge-Kutta methods are an extension of standard two-step Runge-Kutta methods, which are an alternative to the standard additive two-step Runge-Kutta methods currently existing in the literature. Furthermore, these new schemes are designed with an eye towards truly N-partitioned systems and leverage local stage approximations to make several computationally interesting approximations viable. Specifically, the focus on local stage approximations makes possible the construction of truly asynchronous schemes, in the parallel sense, possible. In addition, we show that an implicit-explicit approach to these schemes can lead to methods that require the inversion of only local nonlinear systems.

Applied Dynamical Systems↗

DOE OSTI2021

Computational Complexity of Neuromorphic Algorithms

Neuromorphic computing has several characteristics that make it an extremely compelling computing paradigm for post Moore computation. Some of these characteristics include intrinsic parallelism, inherent scalability, collocated processing and memory, and event-driven computation. While these characteristics impart energy efficiency to neuromorphic systems, they do come with their own set of challenges. One of the biggest challenges in neuromorphic computing is to establish the theoretical underpinnings of the computational complexity of neuromorphic algorithms. In this paper, we take the first steps towards defining the space and time complexity of neuromorphic algorithms. Specifically, we describe a model of neuromorphic computation and state the assumptions that govern the computational complexity of neuromorphic algorithms. Next, we present a theoretical framework to define the computational complexity of a neuromorphic algorithm. We explicitly define what space and time complexities mean in the context of neuromorphic algorithms based on our model of neuromorphic computation. Finally, we leverage our approach and define the computational complexities of six neuromorphic algorithms: constant function, successor function, predecessor function, projection function, neuromorphic sorting algorithm and neighborhood subgraph extraction algorithm.

Date, Prasanna↗

DOE OSTI2025

Performance Analysis and Simulaion of the Hydraulic Scram System in TREAT Reactor

The Transient Reactor Test Facility (TREAT) at Idaho National Laboratory (INL) serves a vital role in nuclear fuel safety research, enabling transient experiments that simulate reactivity excursions and accident scenarios. Central to these operations is the transient control rod drive system (TCRDS), which drives rapid motion of the transient control rods such that TREAT can simulate rapid power changes typical of reactor accidents. The reliability and performance of this system are critical for protecting both fuel specimens and reactor infrastructure. This study presents the initial phase of a two-year investigation into the dynamics and reliability of the TREAT hydraulic TCRDS. Conducted in collaboration with INL, the research employs a combined computational and experimental approach to analyze the system's response time, pressure transients, and potential failure modes. Emphasis is placed on understanding how fluid characteristics influence the TCRDS’s ability to achieve both rapid power changes and mechanical stability. The TRDS and the skid that powers it will be analyzed throughout this investigation. Computational modeling using computational fluid dynamics (CFD) will simulate the hydraulic response under varying conditions. In parallel, experimental testing planned at INL will validate these models and capture key performance metrics. This paper outlines the system design, analytical framework, and modeling strategies that form the foundation for later testing. Ultimately, this work aims to support improvements to the TCRDS’s design and reliability, contributing to the broader goal of enhancing nuclear fuel safety and sustaining TREAT’s mission as a premier nuclear fuel test facility.

21 - SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLAN↗

DOE OSTI2025

SAGIPS: a physics-inspired scalable asynchronous generative inverse-problem solver

Abstract Solving large-scale inverse problems using deep-learning algorithms have become an essential part of modern research and industrial applications. The complexity of the underlying inverse problem may require the utilization of high performance computing systems which poses a challenge on the algorithmic design of the inverse problem solver. Most deep learning algorithms require, due to their design, custom parallelization techniques in order to be resource efficient while showing a reasonable convergence. In this paper we introduce a S calable A synchronous G enerative I nverse P roblem S olver (SAGIPS) on high-performance computing systems. We present a workflow that utilizes an asynchronous ring-allreduce algorithm to transfer the gradients of the generator network across multiple GPUs. Experiments with a scientific proxy application demonstrate that SAGIPS shows near linear weak scaling, together with a convergence quality that is comparable to traditional methods. The approach presented here allows leveraging Generative Adverserial Network across multiple GPUs, promising advancements in solving complex inverse problems at scale.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Sensor assemblies and methods for emulating interaction of entities within water systems

Sensor assemblies are provided for use in modeling water systems. These sensor assemblies can be used as sensor fish. These assemblies can include a circuit board supporting processing circuitry components on either or both opposing component support surfaces of the circuit board and a housing above the circuit board and the components, with the housing being circular about the circuit board in at least one cross section, and wherein the supporting surfaces of the circuit board are substantially parallel with the plane of the housing in the one cross section. Methods for emulating interaction of entities within water systems are provided. The methods can include introducing a sensor assembly into a water system. The sensor assembly can include: a circuit board supporting processing circuitry components on either or both of opposing component support surfaces of the circuit board; a housing about the circuit board and the components, the housing being circular about the circuit board in at least one cross section; and wherein the support surfaces of the circuit board are substantially parallel with the plane of the housing in the one cross section.

Deng, Z. Daniel↗