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 433 records · Page 24

Co-synthesis of Hydrogen and High-Value Carbon Products from Methane Pyrolysis

The ARPA-E Methane Pyrolysis Project successfully developed a scalable technology for hydrogen production with low-CO x emission through methane pyrolysis, co-producing high-value carbon nanotubes (CNTs). The project focused on optimizing reactor design, enhancing catalyst performance, and assessing techno-economic feasibility to create a commercially viable and environmentally sustainable process. The fluidized bed reactor achieved over 90% methane (CH 4 ) conversion by using a 5% CO 2 co-feed, which stabilizes carbon yields and minimizes catalyst deactivation. This setup allowed for continuous operation across ten cycles, each consisting of a 14-minute pyrolysis phase followed by a 10-minute dislodging phase to remove a fraction of the accumulated carbon, resulting in stable performance and high-quality CNT production. In parallel, monolith reactors coated with Fe demonstrated a sustained methane conversion of 73% while producing CNTs with high crystallinity. Although promising for continuous operation, monolith reactors face challenges in coating durability and scalability, highlighting areas for further optimization in commercial applications. Catalyst formulation played a key role in enhancing process efficiency. The core catalyst used was 5%Fe/Al 2 O 3 (wt%), optimized through wet impregnation, which improved CNT morphology, yielding longer and more uniform CNTs. The catalyst's performance was further enhanced by adding promoters: 2.5 wt% Ni increased methane conversion close to the thermodynamic limit, while 2.5 wt% Mn improved CNT alignment and crystallinity, and 1.5 wt% NaCl boosted CNT morphology but slightly lowered methane conversion. These adjustments allowed the reactor to maintain high methane conversion while producing high-quality CNTs, enabling stable performance over multiple cycles. To address carbon buildup and ensure uninterrupted operation, a pneumatic conveying tube was implemented for effective carbon dislodging in the fluidized bed configuration. CO 2 and H 2 O co-feeds were also introduced to enhance carbon removal, with CO 2 boosting CNT yield by approximately 15%. This setup enabled stable reactor operation across multiple cycles, preventing clogging and minimizing catalyst wear, making the process suitable for industrial scaling. Techno-economic analysis (TEA) projected hydrogen production costs between $\$$1.00 and $\$$1.64 per kilogram, with CNT values assumed at $\$$375/ton and $\$$100/ton. The life cycle assessment showed that CO 2 emissions could be as low as 0.64 kg CO 2 e/kg H 2 at 95% methane conversion assuming an electricity input of 50 kg CO 2 e/MWh. Even at 50% methane conversion, emissions remained below 1 kg CO 2 e/kg H 2 , demonstrating the process's low-emission potential and making it a viable alternative to traditional steam methane reforming. Overall, the results from this project demonstrate the feasibility of a pyrolysis process where carbon is continuously removed from the catalyst surface and hydrogen is continuously produced until a catalyst regeneration step is required to fully clean the catalyst surface and renew catalyst performance. Major open challenges are related to avoiding the loss of catalyst material in the dislodged carbon during fluidized bed conditions, since our best result demonstrated a carbon purity of ~70 wt. % (rest being iron and alumina). A monolith reactor was used to favor dislodgement of carbon compared to fluidized bed conditions but our results do not demonstrate an advantage of the monolith configuration. Catalyst performance was similar to fluidized bed conditions with slower deactivation rates overall, but we could not observe carbon dislodging in any of the tens of experiments that were run at Stanford. Our results show that the most relevant areas of improvement are related to the fundamental understanding of the iron-carbon interface for dislodging, and the development of catalyst that can produce CNTs via a base-growth mechanism such that catalyst is not lost in the dislodgement steps. The final report documents all findings and methodologies in detail, providing a valuable resource for the scientific community. By building on these results, researchers can further advance methane pyrolysis technology, moving toward a more sustainable, scalable pathway for hydrogen production. This work lays the foundation for future research and commercial efforts to reduce emissions in hydrogen production while generating valuable carbon products.

08 HYDROGEN↗

Investigating the Interaction Between Circulating Tumor Cells and Local Hydrodynamics via Experiment and Simulations

Introduction: The biological and mechanical properties of circulating tumor cells (CTCs) in combination with the hemodynamics affect the preference of metastatic sites in the vasculature. Despite the extensive literature on the effects of biological properties on cell adhesion, the effects of hydrodynamic forces on primary attachment remains an active area of research. Here, using simulations in conjunction with experimentation, we provide new insight into the interplay of CTCs dynamics and local hydrodynamics. Methods: A flow experiment of CTC attachment was performed within a bioprinted, double branching endothelialized vessel. Simulations of fluid flow and CTC transport in the reconstructed and idealized bifurcated vessel were respectively performed by HARVEY, our in-house massively parallel computational fluid dynamics solver. HARVEY is based on the lattice Boltzmann and finite element methods to model the fluid and cells dynamics. The immersed boundary method is employed for resolving the fluid–structure interaction. Results: CTC attachment was quantified experimentally at all regions of the complex vessel. The results demonstrate a clear preference for CTCs to attach at the branch points. To elucidate the effect of the vessel topology on the location of attachment, a fluid-only simulation was performed assessing the differences in the hydrodynamics along the vessel. CTC transport in idealized bifurcated vessels was subsequently studied to examine the effects of cell deformability on the local hydrodynamics patterns and, thus, the preference of attachment sites. Conclusions: The current work provides evidence on the correlation of the hydrodynamics forces arising from the vessel topology and CTC properties on the attachment regions.

60 APPLIED LIFE SCIENCES↗

Scaling and performance portability of the particle-in-cell scheme for plasma physics applications through mini-apps targeting exascale architectures

We perform a scaling and performance portability study of the particle-in-cell scheme for plasma physics applications through a set of mini-apps we name "Alpine", which can make use of exascale computing capabilities. The mini-apps are based on Independent Parallel Particle Layer, a framework that is designed around performance portable and dimension independent particles and fields. We benchmark the simulations with varying parameters such as grid resolutions (5123 to 20483) and number of simulation particles (109 to 1011) with the following mini-apps: weak and strong Landau damping, bump-on-tail and two-stream instabilities, and the dynamics of an electron bunch in a charge-neutral Penning trap. We show strong and weak scaling and analyze the performance of different components on several pre-exascale architectures such as Piz-Daint, Cori, Summit and Perlmutter. While the scaling and portability study helps identify the performance critical components of the particle-in-cell scheme in the current state-of-the-art computing architectures, the mini-apps by themselves can be used to develop new algorithms and optimize their high performance implementations targeting exascale architectures.

Muralikrishnan, Sriramkrishnan↗

ExTreeM: Scalable Augmented Merge Tree Computation via Extremum Graphs

Over the last decade merge trees have been proven to support a plethora of visualization and analysis tasks since they effectively abstract complex datasets. Here, this paper describes the ExTreeM-Algorithm: A scalable algorithm for the computation of merge trees via extremum graphs. The core idea of ExTreeM is to first derive the extremum graph G of an input scalar field f defined on a cell complex K, and subsequently compute the unaugmented merge tree of f on G instead of K; which are equivalent. Any merge tree algorithm can be carried out significantly faster on G, since K in general contains substantially more cells than G. To further speed up computation, ExTreeM includes a tailored procedure to derive merge trees of extremum graphs. The computation of the fully augmented merge tree, i.e., a merge tree domain segmentation of K, can then be performed in an optional post-processing step. All steps of ExTreeM consist of procedures with high parallel efficiency, and we provide a formal proof of its correctness. Our experiments, performed on publicly available datasets, report a speedup of up to one order of magnitude over the state-of-the-art algorithms included in the TTK and VTK-m software libraries, while also requiring significantly less memory and exhibiting excellent scaling behavior.

97 MATHEMATICS AND COMPUTING↗

Parallelizing autotuning for HPC applications: Unveiling the potential of the speculation strategy in Bayesian optimization

In the exascale computing era, tuning High-Performance Computing (HPC) applications has become a significant computational challenge. Although Bayesian optimization (BO) has emerged as a promising tool for HPC performance tuning, the BO workflow is inherently sequential (i.e., one function evaluation at a time) and cannot leverage the huge amount of parallel resources present in modern supercomputers, resulting in a considerable underutilization of their computational capabilities. This paper explores the trade-off between search quality and parallelism in BO, investigating a diverse set of methods. Building upon both previous approaches from the literature and novel methodologies introduced in this work, our study provides a deep analysis to accelerate BO performance tuning. By examining a set of synthetic functions and practical HPC applications, our exploration analyzes the interaction among various BO methods for parallelization, the quantity of parallel resources, the runtime distribution of target HPC applications, and the costs associated with different search orchestration mechanisms that have been overlooked in previous studies. Compared to sequential BO, our novel methodology achieves comparable quality while demonstrating robust scalability in search time as the amount of parallel resources increases; it also outperforms a state-of-the-art tuner, which supports parallelization, achieving up to 3.67x faster search time. We provide high-value insights for practitioners seeking to leverage the power of parallel computing for efficient HPC application tuning. Additionally, to further assist researchers in accelerating the performance tuning of their HPC applications, we provide an extension of an existing open-source tuning framework that incorporates our methods.

Bayesian optimization↗

Fluid dynamic and thermal performance of a slotted cylinder at low Reynolds number

The fluid dynamic and thermal performance of a circular cylinder with a slot parallel to the flow is numerically investigated. The study utilized the semi-implicit finite volume multi-material algorithm MPM-ICE, a component of the Uintah framework. The normalized slot width s/D ranges from 0.1 - 0.3, introducing an additional heat transfer surface area between ~ 10 and ~ 50%, and a mass reduction between ~ 13 and ~ 38% in the cylinder. We assumed two-dimensional incompressible flow and simulated a Reynolds number Re D between 100 and 1000. The slotted cylinders are found to have a total drag force reduction up to ~ 45%, compared to a solid cylinder despite the additional viscous drag force in the slot. Convection heat transfer is enhanced up to ~ 70%. Further, the slotted cylinder performance index, defined as the ratio of the heat rate to the drag force, increases up to maximum of ~ 3, indicating better overall thermal fluid performance. An entropy analysis showed the best performance index occurs at the highest Re D . Correlations for drag coefficient and Nusselt number are proposed along with an entropy optimization method.

42 ENGINEERING↗

Using OpenMP for HEP framework algorithm scheduling

The OpenMP standard is the primary mechanism used at high performance computing facilities to allow intra-process parallelization. In contrast, many HEP specific software packages (such as CMSSW, GaudiHive, and ROOT) make use of Intel’s Threading Building Blocks (TBB) library to accomplish the same goal. In these proceedings we will discuss our work to compare TBB and OpenMP when used for scheduling algorithms to be run by a HEP style data processing framework. This includes both scheduling of different interdependent algorithms to be run concurrently as well as scheduling concurrent work within one algorithm. As part of the discussion we present an overview of the OpenMP threading model. We also explain how we used OpenMP when creating a simplified HEP-like processing framework. Using that simplified framework, and a similar one written using TBB, we will present performance comparisons between TBB and different compiler versions of OpenMP.

97 MATHEMATICS AND COMPUTING↗

Coupling Surface Flow with High-performance Subsurface Reactive Flow and Transport Code PFLOTRAN

Water exchange between the surface and subsurface is important for both water resource management and environmental protection. In this paper, we develop coupled surface and subsurface flow simulation capability in a parallel subsurface flow and reactive transport code PFLOTRAN. We sequentially couple the diffusion wave-based surface flow with the subsurface flow governedby the Richards equation in PFLOTRAN. These two flow domains are linked with a boundary condition switching method that ensures continuity of pressure and flux at the surface-subsurface interface. We verify the coupled code against other existing hydrologic models and observation data using a number of numerical experiments. The coupled hydrological model exhibits good performance in strong parallel scaling tests. The new coupled surface and subsurface simulator significantly advance community simulation capability towards improving integrated hydrologic and biogeochemical understanding of complex systems such as watersheds and river corridors. Keywords: Surface flow, Integrated hydrological modeling, Boundary condition switching, Parallel computing

Wu, Runjian↗

Did the GPU obfuscate the load imbalance in my MPI simulation?

The current proliferation of GPU-based HPC systems necessitates a method for assessing the performance of simulations on heterogeneous machines. The addition of GPUs to a system adds multiple hierarchical levels of parallelism to the node architecture. In this paper, we demonstrate that the traditional load imbalance metric is insufficient for capturing the load imbalance on GPU-based machines, since it treats the GPU as a monolithic entity and ignores the internal parallelism. We propose a new hierarchical metric that improves the correlation of measured performance and application workload by up to 20.61%. Using our metric for determining application load instead of the traditional metric as the input for the load balancing algorithm reduces the residual load imbalance by up to 4× in our application.

Eberius, David↗

Robust wind farm layout optimization

Wake interactions in wind farms cause losses in annual energy production (AEP) on the order of 10%. Wind farm designers optimize the layout of the farm to mitigate wake losses, especially in the dominant site-specific wind directions. As wind turbines and wind farms grow in scale, optimization becomes more complex. Offshore wind farms regularly comprise more than 100 wind turbines and are characterized by complex boundaries due to shipping lanes, neighboring wind farms, and other constraints. Layout optimization methods are broadly split between gradient-based and gradient-free approaches. Gradient-based approaches can converge quickly and perform well for smaller, academic problems but are often sensitive to initial conditions and tuning parameters and require expert knowledge to use. On the other hand, gradient-free approaches can be more robust to problem complexities. We present a robust layout optimization approach based on a random search algorithm. The algorithm is intended for those who are not optimization experts and has few tuning parameters that need specification to achieve satisfactory results. Unlike off-the-shelf methods, which use generally available, non-domain-specific optimization routines that accept as inputs an optimization function and constraint definitions, this approach takes advantage of the relative computational costs of the different evaluations by evaluating cheaper computations first (boundary and minimum distance constraints) and running expensive AEP evaluations only if all other checks pass. Moreover, an outer genetic algorithm allows multiple solutions to evolve in parallel, enabling rapid solution development on high-performance computers. We discuss the relative ease of selecting necessary tuning parameters and demonstrate the efficacy of the genetic random search on a complex layout problem consisting of placing 70 turbines in a nonconvex and unconnected boundary region.

17 WIND ENERGY↗

On the Efficient Evaluation of the Exchange Correlation Potential on Graphics Processing Unit Clusters

The predominance of Kohn–Sham density functional theory (KS-DFT) for the theoretical treatment of large experimentally relevant systems in molecular chemistry and materials science relies primarily on the existence of efficient software implementations which are capable of leveraging the latest advances in modern high-performance computing (HPC). With recent trends in HPC leading toward increasing reliance on heterogeneous accelerator-based architectures such as graphics processing units (GPU), existing code bases must embrace these architectural advances to maintain the high levels of performance that have come to be expected for these methods. In this work, we purpose a three-level parallelism scheme for the distributed numerical integration of the exchange-correlation (XC) potential in the Gaussian basis set discretization of the Kohn–Sham equations on large computing clusters consisting of multiple GPUs per compute node. In addition, we purpose and demonstrate the efficacy of the use of batched kernels, including batched level-3 BLAS operations, in achieving high levels of performance on the GPU. We demonstrate the performance and scalability of the implementation of the purposed method in the NWChemEx software package by comparing to the existing scalable CPU XC integration in NWChem.

97 MATHEMATICS AND COMPUTING↗

Exploring the Use of Novel Spatial Accelerators in Scientific Applications

Driven by the need to find alternative accelerators which can viably replace GPUs in next-generation Supercomputing systems, this paper proposes a methodology to enable agile application/hardware co-design. The application-first methodology provides the ability to come up with design of accelerators while working with real-world workloads, available accelerators, and system software. The iterative design process targets a set of kernels in a workload for performance estimates that can prune the design space for later phases of detailed architectural evaluations. To this effect, in this paper, a novel data-parallel device model is introduced that simulates the latency of performance-sensitive operations in an accelerator including data transfers and kernel computation using multi-core CPUs. The use of off-the-shelf simulators, such as pre-RTL simulator Aladdin or multiple tools available for exploring the design of deep neural network accelerators (e.g., Timeloop) is demonstrated for evaluation of various accelerator designs using applications with realistic inputs. Examples of multiple device configurations that are instantiable in a system are explored to evaluate the performance benefit of deploying novel accelerators. The proposed device is integrated with a programming model and system software to potentially explore the impacts of high-level programming languages/compilers and low-level effects such as task scheduling on multiple accelerators. We analyze our methodology for a set of applications that represent high-performance computing (HPC) and graph analytics. The applications include a computational chemistry kernel realized using tensor contractions, triangle counting, GraphSAGE and Breadth-first Search. These applications include kernels such as dense matrix-dense matrix multiplication, sparse matrix-spare matrix multiplication, and sparse matrix-dense vector multiplication. Our results indicate potential performance benefits and insights for system design by including accelerators that realize these kernels along-side general purpose accelerators.

AI, codesign, Accelerated Computing, Modeling and ↗

Controlled exposure of CuO thin films through corrosion-protecting, ALD-deposited TiO 2 overlayers

Ultra-thin film coatings are used to protect semiconductor photoelectrodes from the harsh chemical environments common to photoelectrochemical energy conversion. These layers add contact transfer resistance to the interface that can result in a reduction of photoelectrochemical energy conversion efficiency of the photoelectrode. Here, we describe the concept of a partial protection layer, which allows for direct chemical access to a small fraction of the semiconductor underlayer for further functionalization by an electrocatalyst. The rest of the interface remains protected by a stable, inert protection layer. CuO is used as a model system for this scheme. Atomic layer deposition (ALD)-prepared TiO 2 layers on CuO thin films prepared from electrodeposited Cu 2 O allow for the control of interfacial morphology to intentionally expose the CuO underlayer. The ALD-TiO 2 overlayer shrinks during crystallization, while Cu 2 O in the underlayer expands during oxidation. As a result, the TiO 2 protection layer cracks to expose the oxidized underlying CuO layer, which can be controlled by preceding thermal oxidation. Furthermore, this work demonstrates a potentially promising strategy for the parallel optimization of photoelectrochemical interfaces for chemical stability and high performance.

14 SOLAR ENERGY↗

Structured Adaptive Mesh Refinement Adaptations to Retain Performance Portability With Increasing Heterogeneity

Adaptive mesh refinement (AMR) is an important method that enables many mesh-based applications to run at effectively higher resolution within limited computing resources by allowing high resolution only where really needed. This advantage comes at a cost, however: greater complexity in the mesh management machinery and challenges with load distribution. With the current trend of increasing heterogeneity in hardware architecture, AMR presents an orthogonal axis of complexity. Additionally, the usual techniques, such as asynchronous communication and hierarchy management for parallelism and memory that are necessary to obtain reasonable performance are very challenging to reason about with AMR. Different groups working with AMR are bringing different approaches to this challenge. Here, we examine the design choices of several AMR codes and also the degree to which demands placed on them by their users influence these choices.

42 ENGINEERING↗

Bit-GraphBLAS: Bit-Level Optimizations of Matrix-Centric Graph Processing on GPU

In the graph data structure like adjacency matrix, the connectivity of two nodes can be sufficiently represented using only 1 bit, but they are generally treated as 32-bit full-precision in state-of-the-art graph frameworks to adopt common sparse format such as CSR. Meanwhile, bit-level parallelism has recently be explored to have high-performance potential and low storage requirement on GPUs with dense bit-tiles. To fill the gap, our solution is a hierarchical storage format that contains the bit-indexing base and dense bit-tile units. Inherently, the granularity of the bit-tile is an essential factor in achieving both storage compression and GPU parallelism. How to find a sweet spot that trades off between avoiding sparsity and exploiting is comprehensively researched in this work. In the experiment, we evaluate the proposed storage format and algorithms on modern generation GPUs, including Pascal and Volta, to figure out critical software co-designs in conjunction with existing hardware-specific optimization.

Chen, Jou-An↗

Computational Fluid Dynamics Using the Adaptive Wavelet-Collocation Method

Advancements to the adaptive wavelet-collocation method over the last decade have opened up a number of new possible areas for active research. Volume penalization techniques allow complex immersed boundary conditions to be used with high efficiency for both internal and external flows. Anisotropic methods make it possible to use body-fitted meshes while still taking advantage of the dynamic adaptability properties wavelet-based methods provide. The parallelization of the approach has made it possible to perform large high-resolution simulations of detonation initiation and fluid instabilities to uncover new physical insights that would otherwise be difficult to discover. Other developments include space-time adaptive methods and nonreflecting boundary conditions. This article summarizes the work performed using the adaptive wavelet-collocation method developed by Vasilyev and coworkers over the past decade.

42 ENGINEERING↗

Stochastic AC optimal power flow: A data-driven approach

There is an emerging need for efficient solutions to stochastic AC Optimal Power Flow (AC-OPF) to ensure optimal and reliable grid operations in the presence of increasing demand and generation uncertainty. Herein this paper presents a highly scalable data-driven algorithm for stochastic AC-OPF that has extremely low sample requirement. The novelty behind the algorithm’s performance involves an iterative scenario design approach that merges information regarding constraint violations in the system with data-driven sparse regression. Compared to conventional methods with random scenario sampling, our approach is able to provide feasible operating points for realistic systems with much lower sample requirements. Furthermore, multiple sub-tasks in our approach can be easily paralleled and based on historical data to enhance its performance and application. We demonstrate the computational improvements of our approach through simulations on different test cases in the IEEE PES PGLib-OPF benchmark library.

42 ENGINEERING↗

A Performance and Energy Study of GPU-Resident Preconditioners for Conjugate Gradient Solvers: In the Context of Existing and Novel Approaches

Optimizing a particular subprogram out of the set of Basic (sparse) Linear Algebra Subprograms (BLAS) for a given architecture is a common topic of research. In applications, however, these BLAS functions rarely appear in isolation; usually, many of them are used together, in various combinations and with varying inputs. As the need to solve a large, sparse linear system is ubiquitous throughout HPC applications, linear solvers constitute a realistic, sufficiently complex and well-defined representative use case for composite BLAS routines. To this end, based on a representative set of matrices drawn from a diverse set of fields, we present a framework to study, from the performance and energy perspective, the efficacy of GPU- resident parallel Conjugate Gradient (CG) linear solver with different preconditioner options, including Gauss-Seidel, Jacobi, and incomplete Cholesky. We also propose a novel GPU-based preconditioner, in which the triangular solves are approximated by an iterative process. The development of this preconditioner was motivated by solving large graph Laplacian linear systems, for which the existing preconditioners either perform slow on GPU-based platforms or are not applicable. We compare the performance of these preconditioners on different hardware accelerator architectures, i.e., AMD MI250X, MI100, Nvidia A100, V100, and Jetson. Our experiments reveal performance trade-offs and provide information on how to select the best strategy for the given linear system, dictated by its properties, and the platform of interest. We demonstrate the application of our novel preconditioner for solving CG and graph Laplacian systems. Overall, the framework can be utilized as a benchmark to guide informed decisions in choosing a specific preconditioner, i.e., whether it is better to rely on the performance of a triangular solver or on the performance of sparse matrix-vector product. Finally, by considering power consumption to solve the linear systems, we report the energy footprint for the solvers.

Preconditioned Conjugate Gradient, GPUs, iterative↗