Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel, scaling”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 1,387 records · Page 77

TESS

Computing a Voronoi or Delaunay tessellation from a set of points is a core part of the analysis of many simulated and measured datasets. As the scale of simulations and observations surpasses billions of particles, a distributed-memory scalable parallel algorithm is the only feasible approach. The primary contribution of this software is a distributed-memory parallel Delaunay and Voronoi tessellation algorithm based on existing serial computational geometry libraries that automatically determines which neighbor points need to be exchanged among the subdomains of a spatial decomposition. Other contributions include the addition of periodic and wall boundary conditions.

Dmitriy Morozov, TomPeterka↗

Application of a medium-range global hydrologic probabilistic forecast scheme to the Ohio River Basin

A 10-day globally applicable flood prediction scheme was evaluated using the Ohio River basin as a test site for the period 2003-2007. The Variable Infiltration Capacity (VIC) hydrology model was initialized with the European Centre for Medium Range Weather Forecasts (ECMWF) analysis temperatures and wind, and Tropical Rainfall Monitoring Mission Multi Satellite Precipitation Analysis (TMPA) precipitation up to the day of forecast. In forecast mode, the VIC model was then forced with a calibrated and statistically downscaled ECMWF ensemble prediction system (EPS) 10-day ensemble forecast. A parallel set up was used where ECMWF EPS forecasts were interpolated to the spatial scale of the hydrology model. Each set of forecasts was extended by 5 days using monthly mean climatological variables and zero precipitation in order to account for the effect of initial conditions. The 15-day spatially distributed ensemble runoff forecasts were then routed to four locations in the basin, each with different drainage areas. Surrogates for observed daily runoff and flow were provided by the reference run, specifically VIC simulation forced with ECMWF analysis fields and TMPA precipitation fields. The flood prediction scheme using the calibrated and downscaled ECMWF EPS forecasts was shown to be more accurate and reliable than interpolated forecasts for both daily distributed runoff forecasts and daily flow forecasts. Initial and antecedent conditions dominated the flow forecasts for lead times shorter than the time of concentration depending on the flow forecast amounts and the drainage area sizes. The flood prediction scheme had useful skill for the 10 following days at all sites.

54 ENVIRONMENTAL SCIENCES↗

Institutional Computing Annual Report - W11_Friction

The IC W11_Friction program has as a goal the fundamental understanding of the physical mechanisms which determine the macroscopic frictional force between ductile metals for arbitrary compressions and relative velocities. The high performance computing platforms have allowed detailed understanding of physical mechanisms: elasticity, anharmonicity of phonons, plastic deformation, phase transitions and melting, and grain structure including grain growth and refinement. The method used has been Non Equilibrium Molecular Dynamics (NEMD) using the SPaSM parallel code developed at LANL. The results of these simulations have resulted in a scaling model for the metal-metal frictional force.

36 MATERIALS SCIENCE↗

Combinatorial Algorithms to Enable Computational Science and Engineering: Work from the CSCAPES Institute

This final progress report summarizes the work accomplished at the Combinatorial Scientific Computing and Petascale Simulations Institute. We developed Zoltan, a parallel mesh partitioning library that made use of accurate hypergraph models to provide load balancing in mesh-based computations. We developed several graph coloring algorithms for computing Jacobian and Hessian matrices and organized them into a software package called ColPack. We developed parallel algorithms for graph coloring and graph matching problems, and also designed multi-scale graph algorithms. Three PhD students graduated, six more are continuing their PhD studies, and four postdoctoral scholars were advised. Six of these students and Fellows have joined DOE Labs (Sandia, Berkeley), as staff scientists or as postdoctoral scientists. We also organized the SIAM Workshop on Combinatorial Scientific Computing (CSC) in 2007, 2009, and 2011 to continue to foster the CSC community.

97 MATHEMATICS AND COMPUTING↗

Upscaling of U(VI) Desorption and Transport Using Decimeter-Scale Tanks

Two decimeter-scale 2D experiments were conducted in the proposed research. To the extent possible, the first experiment (2.44 m x 0.61 m x 10 cm) was be packed to reproduce the observed distributions of sediment size fractions in the subsurface at the tracer test site. Four size fractions of sediment (<125m, 125-250m, 250m to 2 mm, >2mm) were packed in the tank and the size fractions were placed in a sediment structure imitating pattern rather than the block pattern used in the previous experiments conducted with Naturita sediment. The second tank used the same total amount of sediment and proportions of the three size fractions used in the first experiment but was packed at larger geostatistical correlation lengths to evaluate how the scale of heterogeneity affects the upscaling results. This experiment was conducted with the goal of trying to determine how the upscaling would be affected by the diffusion path length associated with low permeability zones. The initial conditions in the tanks were based on observed field conditions. The influent was a synthetic groundwater that mimicked uncontaminated groundwater observed at the Naturita site. Samples were collected from side and end ports of the tank and were analyzed for U(VI), alkalinity, pH and major ions as was done in previous experiments. Each decimeter scale experiment was run for approximately 6 months and the experiments were run in parallel. Extensive premodeling occurred for both tanks and lasted the first year of the project.

58 GEOSCIENCES↗

In Situ Indexing and Query Processing of AMR Data

We have developed the first, holistic, Adaptive Mesh Refinement (AMR) capable, in situ query framework to ensure the tractability of the current- and next-generation AMR simulation analysis on the path to extreme scale. We have addressed key issues pertaining to in situ analysis, memory hierarchy, generalized parallel indexing, index-compression, and real-time access pattern detection. We have published the following research papers in high profile peer reviewed computer science conferences: (a) Parallel In Situ Detection of Connected Components in Adaptive Mesh Refinement Data; (b) AMR-aware In Situ Indexing and Scalable Querying; (c) Pattern-driven dynamic data layout optimization; (d) In situ Storage Layout Optimization for AMR Spatio-temporal Read Accesses; (e) AMRZone: A Runtime AMR Data Sharing Framework for Scientific Applications; (f) Exploring Memory Hierarchy and Network Topology for Runtime AMR Data Sharing Across Scientific Applications.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

A Parallel Computing Infrastructure for Building Energy Simulation

In order to study grid-interactive efficient buildings, Pacific Northwest National Laboratories (PNNL) needs an infrastructure for urban-scale building energy modeling. Such an infrastructure should be fast, scalable, and easy-to-use. Given a set of data from the Energy Information Administration’s Commercial Building Energy Consumption Survey (CBECS) and tool to translate survey data into simulation inputs, this project aimed to conduct the simulation of the entire dataset in parallel. Before running the simulations, the necessary software was bundled into a container for use on the PNNL supercomputing network. Then, the parallel simulation workflow was designed using GNU Make, a file creation software, and submitted to a supercomputing partition which could run hundreds of simulations simultaneously. The EnergyPlus simulations output hourly electric meter data for each CBECS sample, which represents the electricity consumption of similar commercial buildings across the United States. Analyzing and visualizing the meter data is important to the future of the work, and this project wrote code to make common analysis methods simple, fast, and accessible. Moving forwards, the model will need to be expanded to include data from other sources and its accuracy will need to be improved and eventually validated.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

TESS

Computing a Voronoi or Delaunay tessellation from a set of points is a core part of the analysis of many simulated and measured datasets. As the scale of simulations and observations surpasses billions of particles, a distributed-memory scalable parallel algorithm is the only feasible approach. The primary contribution of this software is a distributed-memory parallel Delaunay and Voronoi tessellation algorithm based on existing serial computational geometry libraries that automatically determines which neighbor points need to be exchanged among the subdomains of a spatial decomposition. Other contributions include the addition of periodic and wall boundary conditions.

Dmitriy Morozov, Tom Peterka↗

Sirocco Storage Server v. pre-alpha 0.1

Sirocco is a parallel storage system under development, designed for write-intensive workloads on large-scale HPC platforms. It implements a keyvalue object store on top of a set of loosely federated storage servers that cooperate to ensure data integrity and performance. It includes support for a range of different types of storage transactions. This software release constitutes a conformant storage server, along with the client-side libraries to access the storage over a network.

Curry, Matthew L.↗

Extending the Binomial Checkpointing Technique for Resilience

In terms of computing time, adjoint methods offer a very attractive alternative to compute gradient information, re- quired, e.g., for optimization purposes. However, together with this very favorable temporal complexity result comes a memory requirement that is in essence proportional with the operation count of the underlying function, e.g., if algo- rithmic differentiation is used to provide the adjoints. For this reason, checkpointing approaches in many variants have become popular. This paper analyzes an extension of the so-called binomial approach to cover also possible failures of the computing systems. Such a measure of precaution is of special interest for massive parallel simulations and adjoint calculations where the mean time between failure of the large scale computing system is smaller than the time needed to complete the calculation of the adjoint information. We de- scribe the extensions of standard checkpointing approaches required for such resilience, provide a corresponding imple- mentation and discuss numerical results.

Walther, Andrea↗

Covering Resilience: A Recent Development for Binomial Checkpointing

In terms of computing time, adjoint methods offer a very attractive alternative to compute gradient information, required, e.g., for optimization purposes. However, together with this very favorable temporal complexity result comes a memory requirement that is in essence proportional with the operation count of the underlying function, e.g., if algorithmic differentiation is used to provide the adjoints. For this reason, checkpointing approaches in many variants have become popular. This paper analyzes an extension of the so-called binomial approach to cover also possible failures of the computing systems. Such a measure of precaution is of special interest for massive parallel simulations and adjoint calculations where the mean time between failure of the large scale computing system is smaller than the time needed to complete the calculation of the adjoint information. We describe the extensions of standard checkpointing approaches required for such resilience, provide a corresponding implementation and discuss first numerical results.

Walther, Andrea↗

Stable Parallel Training of Wasserstein Conditional Generative Adversarial Neural Networks : *Full/Regular Research Paper submission for the symposium CSCI-ISAI: Artificial Intelligence

We use a stable parallel approach to train Wasserstein Conditional Generative Adversarial Neural Networks (W-CGANs). The parallel training reduces the risk of mode collapse and enhances scalability by using multiple generators that are concurrently trained, each one of them focusing on a single data label. The use of the Wasserstein metric reduces the risk of cycling by stabilizing the training of each generator. We apply the approach on the CIFAR10 and the CIFAR100 datasets, two standard benchmark datasets with images of the same resolution, but different number of classes. Performance is assessed using the inception score, the Fréchet inception distance, and image quality. An improvement in inception score and Fréchet inception distance is shown in comparison to previous results obtained by performing the parallel approach on deep convolutional conditional generative adversarial neural networks (DC-CGANs). Weak scaling is attained on both datasets using up to 100 NVIDIA V100 GPUs on the OLCF supercomputer Summit.

Lupo Pasini, Massimiliano↗

A Transport-Friendly NIC for Multicore-Multiprocessor Systems

Receive side scaling (RSS) is a network interface card (NIC) technology. It provides the benefits of parallel receive processing in multiprocessing environments. However, existing RSS-enabled NICs lack a critical data steering mechanism that would automatically steer incoming network data to the same core on which its application process resides. This absence causes inefficient cache usage if an application is not running on the core on which RSS has scheduled the received traffic to be processed. In Linux systems, it cannot even ensure that packets in a TCP flow are processed by a single core, even if the interrupts for the flow are pinned to a specific core. This results in degraded performance. In this paper, we develop such a data steering mechanism in the NIC for multicore or multiprocessor systems. This data steering mechanism is mainly targeted at TCP, but it can be extended to other transport layer protocols. We term a NIC with such a data steering mechanism 'A Transport Friendly NIC' (A-TFN). Experimental results have proven the effectiveness of A-TFN in accelerating TCP/IP performance.

Wu, Wenji↗

Real-Time Bayesian Inference at Extreme Scale: A Digital Twin for Tsunami Early Warning Applied to the Cascadia Subduction Zone

We present a Bayesian inversion-based digital twin that employs acoustic pressure data from seafloor sensors, along with 3D coupled acoustic–gravity wave equations, to infer earthquake-induced spatiotemporal seafloor motion in real time and forecast tsunami propagation toward coastlines for early warning with quantified uncertainties. Our target is the Cascadia subduction zone, with one billion parameters. Computing the posterior mean alone would require 50 years on a 512 GPU machine. Instead, exploiting the shift invariance of the parameter-to-observable map and devising novel parallel algorithms, we induce a fast offline–online decomposition. The offline component requires just one adjoint wave propagation per sensor; using MFEM, we scale this part of the computation to the full El Capitan system (43,520 GPUs) with 92% weak parallel efficiency. Moreover, given real-time data, the online component exactly solves the Bayesian inverse and forecasting problems in 0.2 seconds on a modest GPU system, a ten-billion-fold speedup.

97 MATHEMATICS AND COMPUTING↗

Cyclotron breaking: a mechanism for parallel ion cyclotron waves to heat the fast solar wind

The Parker Solar Probe mission has observed near-continuous power in parallel ion cyclotron waves (PICWs) in the young, fast solar wind. These waves are unlikely to be directly produced by the turbulent cascade and are likely born of a local instability; yet, they are observed to both cool – and heat – the plasma. We propose that these observations can be self-consistently explained as the natural consequence of PICWs propagating in the inhomogeneous solar wind after they have been driven unstable. In this work, we argue that strong proton heating by a turbulent cascade of oblique ICWs will result in PICWs being driven unstable in a process known as quasi-linear focusing. Because the power in the turbulent cascade is concentrated at scales above the turbulent transition region, PICWs will be driven unstable within a range of wavenumbers parallel to the background magnetic field, 𝑘 ∥ , that is bounded from above by 𝑘$^{∗}_{∥P}$, corresponding to the start of the transition region. As unstable PICWs propagate away from the Sun to regions of lower proton density, their 𝑘 ∥ , multiplied by the proton inertial length 𝑑 p , increases. Eventually, 𝑘$^{∗}_{∥P}$ of the PICWs becomes larger than 𝑘$^{∗}_{∥P}$⁢𝑑 p and the waves damp, heating the solar wind. We call this effect ‘cyclotron breaking’, in analogy with ocean waves breaking on the shore. We then discuss the testable predictions of the theory, including a distinct heating signature in which PICWs cool fast protons and heat slow protons at any given heliocentric distance 𝑟. Finally, we conjecture that cyclotron breaking can lead to net heating by PICWs if the power emitted as PICWs decreases sufficiently rapidly with 𝑟 that local emission of PICWs is overwhelmed by the local damping of PICWs generated closer to the Sun.

plasma heating↗

Enhanced magnetic reconnection in the presence of pressure gradients

Magnetic reconnection in the presence of background pressure gradients is studied, with special attention to parallel (compressional) magnetic fluctuations. A process is reported that reconnects fields through coupling of drift-wave-type instabilities with current sheets. Its time scale is set not by the reconnecting field but by inhomogeneities of the background density or temperature. The observed features can be attributed to a pressure-gradient-driven linear instability which interacts with the reconnecting system but is fundamentally different from microtearing. In particular, this mode relies on parallel magnetic fluctuations and the associated drift. For turbulent reconnection, similar or even stronger enhancements are reported. In the solar corona, this yields a critical pressure gradient scale length of about 200 km below which this new process becomes dominant over the tearing instability.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Low-Energy Backgrounds in Solid-State Phonon and Charge Detectors

Solid-state phonon and charge detectors probe the scattering of weakly interacting particles, such as dark matter and neutrinos, through their low recoil thresholds. Recent advancements have pushed sensitivity to eV-scale energy depositions, uncovering previously unseen low-energy excess backgrounds. While some arise from known processes such as thermal radiation, luminescence, and stress, others remain unexplained. This review examines these backgrounds, their possible origins, and parallels to low-energy effects in solids, an understanding of which is essential for interpreting particle interactions at and below the eV scale.

coherent neutrino–nucleus scattering↗

Direct numerical simulations for hybrid rocket boundary layers: Performance modeling and scaling

This paper presents a comprehensive performance and scaling analysis of direct numerical simulations for reacting boundary layers, focusing on slab burner configurations. Using a PETSc-based finite volume CFD framework, the study evaluates the scalability and computational cost of flow, chemistry, and radiation evaluations across 2D and 3D simulations. Polymethyl methacrylate (PMMA) is the fuel with pure O 2 as the oxidizer, modeled using a detailed chemical kinetics mechanism with 113 species and 660 reactions. A ray-tracing-based radiation solver, designed for distributed memory applications, is implemented to model radiation heat transfer. Parallel scalability is analyzed for the coupled flow, chemistry, and radiation heat transfer processes. Weak and strong scaling studies are conducted on up to 15,000 computational ranks, revealing robust performance when flow cells exceed 200 per rank. Chemistry evaluations dominate the computational cost in large 3D simulations, accounting for approximately 40% of the total runtime, while flow processes contribute around 35%, and radiation solver contributions remain below 10% due to reduced evaluation frequencies. GPU accelerated chemistry evaluation, implemented with Zero-RK, demonstrates significant promise, achieving up to a 4x speedup for workloads exceeding 30,000 cells per GPU. However, diminishing returns are observed for smaller workloads due to CPU-GPU communication overhead. This study identifies key challenges, including memory bottlenecks and the effects of domain partitioning on flow scalability, while highlighting the potential of GPU-accelerated chemistry to reduce computational costs. In conclusion, these findings provide realizable run configurations for 2D, 3D, and GPU-accelerated cases, offering insights for optimizing reactive flow solvers.

CFD Scalability↗