Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “high performance and distributed computing”

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,729 records · Page 96
All sourcesNASA NTRSDOE OSTI
DOE OSTI2013

Inferring ultraviolet anatomical exposure patterns while distinguishing the relative contribution of radiation components

Exposure to solar ultraviolet (UV) radiation is the main causative factor for skin cancer. UV exposure depends on environmental and individual factors, but individual exposure data remain scarce. While ground UV irradiance is monitored via different techniques, it is difficult to translate such observations into human UV exposure or dose because of confounding factors. A multi-disciplinary collaboration developed a model predicting the dose and distribution of UV exposure on the basis of ground irradiation and morphological data. Standard 3D computer graphics techniques were adapted to develop a simulation tool that estimates solar exposure of a virtual manikin depicted as a triangle mesh surface. The amount of solar energy received by various body locations is computed for direct, diffuse and reflected radiation separately. Dosimetric measurements obtained in field conditions were used to assess the model performance. The model predicted exposure to solar UV adequately with a symmetric mean absolute percentage error of 13% and half of the predictions within 17% range of the measurements. Using this tool, solar UV exposure patterns were investigated with respect to the relative contribution of the direct, diffuse and reflected radiation. Exposure doses for various body parts and exposure scenarios of a standing individual were assessed using erythemally-weighted UV ground irradiance data measured in 2009 at Payerne, Switzerland as input. For most anatomical sites, mean daily doses were high (typically 6.2-14.6 Standard Erythemal Dose, SED) and exceeded recommended exposure values. Direct exposure was important during specific periods (e.g. midday during summer), but contributed moderately to the annual dose, ranging from 15 to 24% for vertical and horizontal body parts, respectively. Diffuse irradiation explained about 80% of the cumulative annual exposure dose.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2017

Fluidized-Bed Heat Transfer Modeling for the Development of Particle/Supercritical-CO2 Heat Exchanger

Concentrating solar power (CSP) technology is moving toward high-temperature and high-performance design. One technology approach is to explore high-temperature heat-transfer fluids and storage, integrated with a high-efficiency power cycle such as the supercritical carbon dioxide (s-CO2) Brayton power cycle. The s-CO2 Brayton power system has great potential to enable the future CSP system to achieve high solar-to-electricity conversion efficiency and to reduce the cost of power generation. Solid particles have been proposed as a possible high-temperature heat-transfer medium that is inexpensive and stable at high temperatures above 1,000 degrees C. The particle/heat exchanger provides a connection between the particles and s-CO2 fluid in the emerging s-CO2 power cycles in order to meet CSP power-cycle performance targets of 50% thermal-to-electric efficiency, and dry cooling at an ambient temperature of 40 degrees C. The development goals for a particle/s-CO2 heat exchanger are to heat s-CO2 to =720 degrees C and to use direct thermal storage with low-cost, stable solid particles. This paper presents heat-transfer modeling to inform the particle/s-CO2 heat-exchanger design and assess design tradeoffs. The heat-transfer process was modeled based on a particle/s-CO2 counterflow configuration. Empirical heat-transfer correlations for the fluidized bed and s-CO2 were used in calculating the heat-transfer area and optimizing the tube layout. A 2-D computational fluid-dynamics simulation was applied for particle distribution and fluidization characterization. The operating conditions were studied from the heat-transfer analysis, and cost was estimated from the sizing of the heat exchanger. The paper shows the path in achieving the cost and performance objectives for a heat-exchanger design.

14 SOLAR ENERGY↗
DOE OSTI2014

Enhanced Mixed Electronic-Ionic Conductors through Cation Ordering

The performance of many energy conversion and storage devices depend on the properties of mixed ionic-electronic conducting (miec) materials. Mixed or ambipolar conductors simultaneously transport ions and electrons and provide the critical interface between chemical and electrical energy in devices such as fuel cells, ion transport membranes, and batteries. Enhancements in storage capacity, reversibility, power density and device lifetime all require new materials and a better understanding of the fundamentals of ambipolar conductivity and surface reactivity.The high temperature properties of the ordered perovksites AA’B 2 O 5+x , where A = rare earth ion, Y and B = Ba, Sr were studied. The work was motivated by the high oxygen transport and surface exchange rates observed for members of this class of mixed ionic and electronic conductors. A combined experimental and computational approach, including structural, electrochemical, and transport characterization and modeling was used. The approach attacks the problem simultaneously at global (e.g., neutron diffraction and impedance spectroscopy), local (e.g., pair distribution function, nuclear magnetic resonance) and molecular (ab initio thermokinetic modeling) length scales. The objectives of the work were to understand how the cation and associated anion order lead to exceptional ionic and electronic transport properties and surface reactivity in AA’B2O5+x perovskites. A variety of compounds were studied by X-ray and neutron diffraction, measurements of thermodynamics and transport and theoretically. These included PrBaCo 2 O 5+x and NdBaCo 2 O 5+x , PrBaCo 2-x FexO 6- δ (x = 0, 0.5, 1.0, 1.5 and 2) and LnBaCoFeO 6- δ (Ln = La, Pr, Nd, Sm, Eu and Gd), Sr 3 YCo 4 O 10.5 , YBaMn 2 O 5+x . A 0.5 A’ 0.5 BO 3 (where A=Y, Sc, La, Ce, Pr, Nd, Pm, Sm; A’= Sr, Ba; and B= Fe, Co, Mn, Ni), Ba 2 In 2 O 5 , and La 1 x Sr x CoO 3-δ /(La 1-y Sry) 2 CoO 4±δ interfaces.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Neural Network-Enhanced Reproducing Kernel Particle Method for Image-Based Multiphysics Damage Modeling of Energy Storage Materials

Energy storage materials undergo significant stresses during charge/discharge cycling, which makes understanding their reliability and durability fundamental in predicting performance and service life. Strong electrochemical-mechanical coupling and highly anisotropic material properties contribute to the formation and propagation of micro-cracking, largely along material interfaces and grain boundaries. With microstructural images supplied by the National Renewable Energy Laboratory (NREL), image-based modeling techniques are used to represent the complex material microstructures that dictate the coupled physics of these systems. Traditional electrochemical-mechanical models rely on mesh-based finite element methods, which can lead to difficulties in capturing crack propagation due to mesh dependency. Additionally, commonly used damage models, such as the continuous damage model and the cohesive zone model, often have steep tradeoffs between discontinuous field accuracy and computational expense. In this work, a neural network-enhanced reproducing kernel particle method (NN-RKPM) [1] is leveraged to accurately capture damage and crack propagation throughout the material by learning the location, orientation, and sharpness of discontinuity while allowing for a coarser nodal distribution than that necessary for capturing sharp solution transitions using traditional mesh-based methods. NN-RKPM is used to inform how crack opening and closure in turn affect the coupled chemical equations and material microstructure. Reference: [1] Baek, J., Chen, J. S., Susuki, K., "Neural Network enhanced Reproducing Kernel Particle Method for Modeling Localizations," International Journal for Numerical Methods in Engineering, Vol. 123, pp 4422-4454, https://doi.org/10.1002/nme.7040, 2022.

damage modeling↗
DOE OSTI2027

Nodal capacity expansion planning with flexible large-scale load siting

We propose explicitly incorporating large-scale load siting into a stochastic nodal power system capacity expansion planning model that concurrently co-optimizes generation, transmission, and storage expansion. The potential operational flexibility of some of these large loads is also taken into account by considering them as consisting of a set of tranches with different reliability requirements, which are modeled as a constraint on expected served energy across operational scenarios. We implement our model as a two-stage stochastic mixed-integer optimization problem with cross-scenario expectation constraints. To overcome the challenge of scalability, we build upon existing work to implement this model on a high performance computing platform and exploit scenario parallelization using an augmented Progressive Hedging Algorithm. The algorithm is implemented using the bounding features of mpisppy, which have shown to provide satisfactory provable optimality gaps despite the absence of theoretical guarantees of convergence. We test our approach and assess the value of this proactive planning framework on total system cost and reliability metrics using realistic testcases geographically assigned to San Diego and South Carolina, with datacenter and direct air capture facilities as large loads.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2014

s-Step Krylov Subspace Methods as Bottom Solvers for Geometric Multigrid

Geometric multigrid solvers within adaptive mesh refinement (AMR) applications often reach a point where further coarsening of the grid becomes impractical as individual sub domain sizes approach unity. At this point the most common solution is to use a bottom solver, such as BiCGStab, to reduce the residual by a fixed factor at the coarsest level. Each iteration of BiCGStab requires multiple global reductions (MPI collectives). As the number of BiCGStab iterations required for convergence grows with problem size, and the time for each collective operation increases with machine scale, bottom solves in large-scale applications can constitute a significant fraction of the overall multigrid solve time. In this paper, we implement, evaluate, and optimize a communication-avoiding s-step formulation of BiCGStab (CABiCGStab for short) as a high-performance, distributed-memory bottom solver for geometric multigrid solvers. This is the first time s-step Krylov subspace methods have been leveraged to improve multigrid bottom solver performance. We use a synthetic benchmark for detailed analysis and integrate the best implementation into BoxLib in order to evaluate the benefit of a s-step Krylov subspace method on the multigrid solves found in the applications LMC and Nyx on up to 32,768 cores on the Cray XE6 at NERSC. Overall, we see bottom solver improvements of up to 4.2x on synthetic problems and up to 2.7x in real applications. This results in as much as a 1.5x improvement in solver performance in real applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

The Design of a Distributed Key-Value Store for Petascale Hot Storage in Data Acquisition Systems

Data acquisition systems for high energy physics experiments readout terabytes of data per second from a large number of electronic components. They are thus inherently distributed systems and require fast online data selection, otherwise requirements for permanent storage would be enormous. Still, incoming data need to be buffered while waiting for this selection to happen. Each minute of an experiment can produce hundreds of terabytes that cannot be lost before a selection decision is made. In this context, we present the design of DAQDB (Data Acquisition Database) - a distributed key-value store for high-bandwidth, generic data storage in event-driven systems. DAQDB offers not only high-capacity and low-latency buffer for fast data selection, but also opens a new approach in high-bandwidth data acquisition by decoupling the lifetime of the data analysis processes from the changing event rate due to the duty cycle of the data source. This is achievable by the option to extend its capacity even up to hundreds of petabytes to store hours of an experiment’s data. Our initial performance evaluation shows that DAQDB is a promising alternative to generic database solutions for the high luminosity upgrades of the LHC at CERN.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Integrating Asynchronous Task Parallelism with OpenSHMEM, In: OpenSHMEM 2016: OpenSHMEM and Related Technologies. Enhancing OpenSHMEM for Hybrid Environments

Partitioned Global Address Space (PGAS) programming models combine shared and distributed memory features, and provide a foundation for high-productivity parallel programming using lightweight one-sided communications. The OpenSHMEM programming interface has recently begun gaining popularity as a lightweight library-based approach for developing PGAS applications, in part through its use of a symmetric heap to realize more efficient implementations of global pointers than in other PGAS systems. However, current approaches to hybrid inter-node and intra-node parallel programming in OpenSHMEM rely on the use of multithreaded programming models (e.g., pthreads, OpenMP) that harness intra-node parallelism but are opaque to the OpenSHMEM runtime. This OpenSHMEM+X approach can encounter performance challenges such as bottlenecks on shared resources, long pause times due to load imbalances, and poor data locality. Furthermore, OpenSHMEM+X requires the expertise of hero-level programmers, compared to the use of just OpenSHMEM. All of these are hard challenges to mitigate with incremental changes. This situation will worsen as computing nodes increase their use of accelerators and heterogeneous memories.

Computer Science↗
DOE OSTI2014

A domain decomposition method of stochastic PDEs: An iterative solution techniques using a two-level scalable preconditioner

Recent advances in high performance computing systems and sensing technologies motivate computational simulations with extremely high resolution models with capabilities to quantify uncertainties for credible numerical predictions. A two-level domain decomposition method is reported in this investigation to devise a linear solver for the large-scale system in the Galerkin spectral stochastic finite element method (SSFEM). In particular, a two-level scalable preconditioner is introduced in order to iteratively solve the large-scale linear system in the intrusive SSFEM using an iterative substructuring based domain decomposition solver. The implementation of the algorithm involves solving a local problem on each subdomain that constructs the local part of the preconditioner and a coarse problem that propagates information globally among the subdomains. The numerical and parallel scalabilities of the two-level preconditioner are contrasted with the previously developed one-level preconditioner for two-dimensional flow through porous media and elasticity problems with spatially varying non-Gaussian material properties. A distributed implementation of the parallel algorithm is carried out using MPI and PETSc parallel libraries. The scalabilities of the algorithm are investigated in a Linux cluster.

42 ENGINEERING↗
DOE OSTI2020

Prediction of Performance Variation Caused by Manufacturing Tolerances and Defects in Gas Diffusion Electrodes of Phosphoric Acid (PA)–Doped Polybenzimidazole (PBI)-Based High-Temperature Proton Exchange Membrane Fuel Cells

The automated process of coating catalyst layers on gas diffusion electrodes (GDEs) for high-temperature proton exchange membrane fuel cells results inherently into a number of defects. These defects consist of agglomerates in which the platinum sites cannot be accessed by phosphoric acid and which are the consequence of an inconsistent coating, uncoated regions, scratches, knots, blemishes, folds, or attached fine particles—all ranging from μm to mm size. These electrochemically inactive spots cause a reduction of the effective catalyst area per unit volume (cm2/cm3) and determine a drop in fuel cell performance. A computational fluid dynamics (CFD) model is presented that predicts performance variation caused by manufacturing tolerances and defects of the GDE and which enables the creation of a six-sigma product specification for Advent phosphoric acid (PA)-doped polybenzimidazole (PBI)-based membrane electrode assemblies (MEAs). The model was used to predict the total volume of defects that would cause a 10% drop in performance. It was found that a 10% performance drop at the nominal operating regime would be caused by uniformly distributed defects totaling 39% of the catalyst layer volume (~0.5 defects/μm2). The study provides an upper bound for the estimation of the impact of the defect location on performance drop. It was found that the impact on the local current density is higher when the defect is located closer to the interface with the membrane. The local current density decays less than 2% in the presence of an isolated defect, regardless of its location along the active area of the catalyst layer.

Gurau, Vladimir (ORCID:0000000327429061)↗
NASA NTRSDate not supplied

LA-8 Computational Analysis and Validation Studies Using FlightStream

With the emerging market of Urban Air Mobility and the associated unique new flight vehicles with the capability of vertical takeoff and landing, design tools need to be calibrated to assist in the development of these new flight vehicle concepts. Distributed electric propulsion (DEP) covers these vehicles with high-energy flow from the array of motors, which leads to extensive propulsion/airframe interaction effects. With limited experimental data of vehicles using DEP and vehicle operation across a large range of angles of attack, including post-stall conditions, there is a lack of validated design tools to advance new vehicle concepts that have blown wings and operate in multiple flight modes. Although some CFD tools can handle the integration of multiple propulsors and unique geometries, the computational time with a full vehicle is extraordinary. FlightStream, a surface vorticity flow solver that can run in a fraction of the time of other CFD methods, has been evaluated using the Langley Aerodrome No. 8 (LA-8) vehicle as a test case. The LA-8 vehicle is a DEP tandem tilt-wing research vehicle that was designed, built, and tested at NASA Langley Research Center. The LA-8 design features both high-performance and high-technical risks aspects. The vehicle has gone through extensive design of experiments wind tunnel testing in the NASA Langley 12-Foot Low-Speed Wind Tunnel in order to capture all modes of operation. In addition, the LA-8 vehicle has undergone wind tunnel testing with and without propellers, which contributes to the validation of FlightStream for aerodynamic performance in blown and unblown wing cases. This study shows that FlightStream can produce trends and magnitudes of the lift and drag coefficients similar to the data collected from the wind tunnel testing of LA-8. The test cases were both blown and unblown wing cases and with and without high lift control surface deflections.

Steven Curtis Geuther↗
DOE OSTI2019

BCL: A Cross-Platform Distributed Data Structures Library

One-sided communication is a useful paradigm for irregular parallel applications, but most one-sided programming environments, including MPI's one-sided interface and PGAS programming languages, lack application-level libraries to support these applications. We present the Berkeley Container Library, a set of generic, cross-platform, high-performance data structures for irregular applications, including queues, hash tables, Bloom filters and more. BCL is written in C++ using an internal DSL called the BCL Core that provides one-sided communication primitives such as remote get and remote put operations. The BCL Core has backends for MPI, OpenSHMEM, GASNet-EX, and UPC++, allowing BCL data structures to be used natively in programs written using any of these programming environments. Along with our internal DSL, we present the BCL ObjectContainer abstraction, which allows BCL data structures to transparently serialize complex data types while maintaining efficiency for primitive types. We also introduce the set of BCL data structures and evaluate their performance across a number of high-performance computing systems, demonstrating that BCL programs are competitive with hand-optimized code, even while hiding many of the underlying details of message aggregation, serialization, and synchronization.

Brock, Benjamin↗
DOE OSTI2024

Parallel computing for power system climate resiliency: Solving a large-scale stochastic capacity expansion problem with mpi-sppy

Here we propose a nodal stochastic generation and transmission expansion planning model that incorporates the output from high-resolution global climate models through load and generation availability scenarios. We implement our model in Pyomo and perform computational studies on a realistically-sized test case of the California electric grid in a high performance computing environment. We propose model reformulations and algorithm tuning to efficiently solve this large problem using a variant of the Progressive Hedging Algorithm. We utilize the parallelization capabilities and overall versatility of mpi-sppy, exploiting its hub-and-spoke architecture to concurrently obtain inner and outer bounds on an optimal expansion plan. Initial results show that instances with 360 representative days on a system with over 8,000 buses can be solved to within 5% of optimality in under 4 h of wall clock time, a first step towards solving a large-scale power system expansion planning problem across a wide range of climate-informed operational scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2019

Additive Manufacturing: Assessing Metal Powder Quality Through Characterizing Feedstock and Contaminants

The quality of powder feedstock for additive manufacturing (AM) metal powder bed fusion methods can significantly affect the quality of parts built from it. Particle size distribution (PSD) and shape factors influence flowability as well as the thickness and uniformity of each powder layer in the build box. For high-performance applications such as aerospace, medical, power generation and military, it becomes important to identify critical additional factors: the types, numbers and sizes of particulate contaminants that may be present in the powder. This is true for virgin, used and blended powders. Contaminants may be introduced during powder manufacture (e.g., ceramic insulation fragments from gas atomization equipment), handling (building insulation, talc) or possibly during the build process itself. Contaminants contained within a batch of powder can be physically built into an additive part when they are incorporated into the melt pool, and they can remain as discrete particulates or non-fused interfaces that act as stress concentrators. Their presence may decrease fatigue life by increasing the likelihood of fatigue crack initiation. This article describes three methods to rapidly and quantifiably characterize powder feedstock. (1) Computer-controlled scanning electron microscopy (CCSEM) provides quantitative size and shape parameters, as well as fine surface details from individual images on a particle-by-particle basis in large populations of powder. (2) Energy-dispersive spectroscopy (EDS) can be included, providing insights into variations within a batch of powder, as well as contaminant compositions. (3) For critical applications, the heavy liquid separation (HLS) method physically extracts low-density contaminants from a sample of powder metal down to part-per-billion detection limits to allow direct examination of contaminants and enhance identification and prevention of their sources. Altogether, these methods permit direct comparisons among powder metal samples. Better quantification of powder characteristics aids determination of suitability for end uses.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Constant Overhead Entanglement Distillation via Scrambling

High-fidelity quantum entanglement enables key quantum networking capabilities such as secure communication and distributed quantum computing, but long-distance entanglement distribution is limited by noise and loss. Entanglement distillation protocols address this problem by extracting high-fidelity Bell pairs from multiple noisy ones. The primary objective is minimizing the resource overhead: the number of noisy input pairs needed to distill each high-fidelity output pair. While protocols achieving optimal overhead are known in theory, they often require complex decoding operations that make practical implementation challenging. We circumvent this challenge by introducing protocols that use quantum scrambling—the spreading of quantum information under chaotic dynamics—through random Clifford operations. Based on this scrambling mechanism, our protocol maintains asymptotically constant overhead, independent of the desired output error rate $\bar{𝜖}$ , and can be implemented with shallow quantum circuits of depth 𝑂⁡(poly log log⁡ $\bar{𝜖}$ −1 ) and memory 𝑂⁡(poly log⁡ $\bar{𝜖}$ −1 ). Our protocol remains effective even with noisy quantum gates. By incorporating error correction, our protocol achieves state-of-the-art performance: starting with pairs of 10% initial infidelity, we require only seven noisy inputs per output pair to distill a single Bell pair with infidelity $\bar{𝜖}$ =10 −12 , substantially outperforming existing schemes. We demonstrate the utility of our protocols for quantum repeater networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

High-Temperature Gas-Cooled Reactors Multiphysics Simulation Demonstration and Code Validation

This study presents a comprehensive benchmarking and verification effort of several thermal-hydraulic and multiphysics capabilities for high-temperature gas-cooled reactor applications. The first part of this effort focuses on the running-in verification of Griffin’s multiphysics capabilities, specifically for simulating the evolution of pebble-bed reactor cores from startup to equilibrium. Since Fiscal Year 2024, improvements and enhancements have been implemented in Griffin, including simplifying the process to specify streamlines and developing the online cross-section generation capability. In the absence of validation data, code-to-code comparisons are conducted with kugelpy, showing good agreement for integral quantities like k-eff predictions and predictions for maximum power density. However, accuracy issues are noted for more detailed quantities like the spatial distribution of fission rate densities which will require further work to address. The second part of this report presents an improved System Analysis Module (SAM) core channel model where the effects of cross flow are considered during the pressurized loss of forced cooling transient, resulting in an improved agreement of the predicted pebble temperature with respect to the predictions from the SAM 2D porous media model. Additionally, the wall channeling effect due to variable porosity at the near wall region of the core is also investigated. Furthermore, to demonstrate Griffin’s online cross-section generation capability, a Multiphysics simulation is performed by coupling Griffin to the SAM core channel model. In the third part of the report, as a part of the Organisation for Economic Co-operation and Development/Nuclear Energy Agency (OECD/NEA) thermal-hydraulic code validation benchmark activity for a high-temperature gas-cooled reactor, the High Temperature Test Facility (HTTF) is investigated first using the NekRS computational fluid dynamics (CFD) code to study the flow mixing phenomenon in the lower plenum of the facility. Then, code-to-code and code-to-data comparisons are performed for Test PG27, which is a pressurized conduction cooldown (PCC) test, using five different codes by six organizations from five countries. The different simulations show good agreements in terms of the general trend but there are differences in some results such as the peak temperatures of different regions and heat removal rate.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

Scalable Pattern Matching in Metadata Graphs via Constraint Checking

Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: They do not scale to process large graphs and/or support only a restricted set of search templates or usage scenarios. Moreover, the algorithms at the core of the existing techniques are not suitable for today’s graph processing infrastructures relying on horizontal scalability and shared-nothing clusters, as most of these algorithms are inherently sequential and difficult to parallelize. In this article we present an algorithmic pipeline that bases pattern matching on constraint checking. The key intuition is that each vertex and edge participating in a match has to meet a set of constraints implicitly specified by the search template. These constraints can be verified independently and typically are less expensive to compute than searching the full template. The pipeline we propose generates these constraints and iterates over them to eliminate all the vertices and edges that do not participate in any match, thus reducing the background graph to a subgraph that is the union of all template matches—the complete set of all vertices and edges that participate in at least one match. Additional analysis can be performed on this annotated, reduced graph, such as full match enumeration, match counting, or computing vertex/edge centrality. Furthermore, a vertex-centric formulation for constraint checking algorithms exists, and this makes it possible to harness existing high-performance, vertex-centric graph processing frameworks. This technique (i) enables highly scalable pattern matching in metadata (labeled) graphs; (ii) supports arbitrary patterns with 100% precision; (iii) enables tradeoffs between precision and time-to-solution, while always selects all vertices and edges that participate in matches, thus offering 100% recall; and (iv) supports a set of popular data analytics scenarios. We implement our approach on top of HavoqGT, an open-source asynchronous graph processing framework, and demonstrate its advantages through strong and weak scaling experiments on massive scale real-world (up to 257 billion edges) and synthetic (up to 4.4 trillion edges) labeled graphs, respectively, and at scales (1,024 nodes / 36,864 cores), orders of magnitude larger than used in the past for similar problems. This article serves two purposes: First, it synthesises the knowledge accumulated during a long-term project. Second, it presents new system features, usage scenarios, optimizations, and comparisons with related work that strengthen the confidence that pattern matching based on iterative pruning via constraint checking is an effective and scalable approach in practice. The new contributions include the following: (i) We demonstrate the ability of the constraint checking approach to efficiently support two additional search scenarios that often emerge in practice, interactive incremental search and exploratory search. (ii) We empirically compare our solution with two additional state-of-the-art systems, Arabsque and TriAD. (iii) We show the ability of our solution to accommodate a more diverse range of datasets with varying properties, e.g., scale, skewness, label distribution, and match frequency. (iv) We introduce or extend a number of system features (e.g., work aggregation, load balancing, and the ability to cap the generated traffic) and design optimizations and demonstrate their advantages with respect to improving performance and scalability. (v) We present bottleneck analysis and insights into artifacts that influence performance. (vi) We present a theoretical complexity argument that motivates the performance gains we observe.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Multipoint Aerostructural Optimization of Wind Turbine Rotors Using a Coupled Blade‐Resolved Aerostructural Solver

Physics‐based design optimization workflows thread the needle between computational cost limitations and simulation complexity, often compromising between modeling detail and the range of operating design conditions. Multipoint aerostructural optimization of wind turbine rotors has so far been confined to low‐fidelity analyses or to high‐fidelity studies with simplified structural models, leaving the most complex design trade‐offs unexplored. We close this gap by performing the first tightly coupled gradient‐based multipoint aerostructural rotor optimization using 3D aerodynamic and structural solvers with discrete coupled adjoints. The optimizer simultaneously varies blade planform, airfoil shapes, and structural thickness through more than 270 design variables, minimizing a weighted combination of rotor mass and power across multiple wind speeds. Applied to a modified DTU 10‐MW benchmark under conservative structural and aerodynamic constraints, our multipoint optimization reduces rotor mass by up to 36% and increases power by 12%–15% across the main operating conditions; biasing the objective toward power yields power gains up to 18% and a 17% mass reduction. For a nominal wind distribution, 3‐point rotor designs accounting for low RPM and high thrust conditions capture dominant trade‐offs and outperform single‐point designs. Adding two off‐design points changes individual‐condition power by less than 3% but leaves the weighted average within 0.5%, and the mass‐power bias has a stronger effect on the final design than the operating‐point weighting itself. Our framework extends naturally to richer load cases and site‐specific wind distributions, providing a basis for high‐fidelity multipoint design earlier in industrial workflows.

17 WIND ENERGY↗