Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Parallel algorithms”

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 649 records · Page 36

TAO Users Manual (Rev. 3.15)

The Toolkit for Advanced Optimization (TAO) focuses on the development of algorithms and software for the solution of large-scale optimization problems on high-performance architectures. Areas of interest include unconstrained and bound-constrained optimization, nonlinear least squares problems, optimization problems with partial differential equation constraints, and variational inequalities and complementarity constraints. The development of TAO was motivated by the scattered support for parallel computations and the lack of reuse of external toolkits in current optimization software. Our aim is to produce high-quality optimization software for computing environments ranging from workstations and laptops to massively parallel high-performance architectures. Our design decisions are strongly motivated by the challenges inherent in the use of large-scale distributed memory architectures and the reality of working with large, often poorly structured legacy codes for specific applications.

97 MATHEMATICS AND COMPUTING↗

Performance Enhancement of APW+lo Calculations by Simplest Separation of Concerns

Full-potential linearized augmented plane wave (LAPW) and APW plus local orbital (APW+lo) codes differ widely in both their user interfaces and in capabilities for calculations and analysis beyond their common central task of all-electron solution of the Kohn–Sham equations. However, that common central task opens a possible route to performance enhancement, namely to offload the basic LAPW/APW+lo algorithms to a library optimized purely for that purpose. To explore that opportunity, we have interfaced the Exciting-Plus (“EP”) LAPW/APW+lo DFT code with the highly optimized SIRIUS multi-functional DFT package. This simplest realization of the separation of concerns approach yields substantial performance over the base EP code via additional task parallelism without significant change in the EP source code or user interface. We provide benchmarks of the interfaced code against the original EP using small bulk systems, and demonstrate performance on a spin-crossover molecule and magnetic molecule that are of size and complexity at the margins of the capability of the EP code itself.

Zhang, Long↗

Computable and Operationally Meaningful Multipartite Entanglement Measures

Multipartite entanglement is an essential resource for quantum communication, quantum computing, quantum sensing, and quantum networks. The utility of a quantum state |ψ$\rangle$ for these applications is often directly related to the degree or type of entanglement present in |ψ$\rangle$. Therefore, efficiently quantifying and characterizing multipartite entanglement is of paramount importance. Here, in this work, we introduce a family of multipartite entanglement measures, called concentratable entanglements. Several well-known entanglement measures are recovered as special cases of our family of measures, and hence we provide a general framework for quantifying multipartite entanglement. We prove that the entire family does not increase, on average, under local operations and classical communications. We also provide an operational meaning for these measures in terms of probabilistic concentration of entanglement into Bell pairs. Finally, we show that these quantities can be efficiently estimated on a quantum computer by implementing a parallelized SWAP test, opening up a research direction for measuring multipartite entanglement on quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum annealing algorithms for Boolean tensor networks

Abstract Quantum annealers manufactured by D-Wave Systems, Inc., are computational devices capable of finding high-quality heuristic solutions of NP-hard problems. In this contribution, we explore the potential and effectiveness of such quantum annealers for computing Boolean tensor networks. Tensors offer a natural way to model high-dimensional data commonplace in many scientific fields, and representing a binary tensor as a Boolean tensor network is the task of expressing a tensor containing categorical (i.e., $$\{0, 1\}$$ { 0 , 1 } ) values as a product of low dimensional binary tensors. A Boolean tensor network is computed by Boolean tensor decomposition, and it is usually not exact. The aim of such decomposition is to minimize the given distance measure between the high-dimensional input tensor and the product of lower-dimensional (usually three-dimensional) tensors and matrices representing the tensor network. In this paper, we introduce and analyze three general algorithms for Boolean tensor networks: Tucker, Tensor Train, and Hierarchical Tucker networks. The computation of a Boolean tensor network is reduced to a sequence of Boolean matrix factorizations, which we show can be expressed as a quadratic unconstrained binary optimization problem suitable for solving on a quantum annealer. By using a novel method we introduce called parallel quantum annealing, we demonstrate that Boolean tensor’s with up to millions of elements can be decomposed efficiently using a DWave 2000Q quantum annealer.

97 MATHEMATICS AND COMPUTING↗

Artificial Intelligence for Multiphysics Nuclear Design Optimization with Additive Manufacturing

The geometric flexibility of additively manufactured metals and ceramics generates a very large and open design space that requires advanced modeling and simulation tools for physics simulations and the rigorous definition of design problems. This effort deploys artificial intelligence (AI) and machine learning (ML) algorithms to understand the design space, evaluate potential designs, and more efficiently generate optimized results. The Transformational Challenge Reactor (TCR) program is leveraging advances in several scientific areas—including materials, manufacturing, sensors and control systems, data analytics, and high-fidelity modeling and simulation—to accelerate the design, manufacturing, qualification, and deployment of advanced nuclear energy systems. Through a manufacturing-informed design approach, the TCR program seeks to integrate digital data for rapid nuclear innovation; accelerate the adoption of advances in manufacturing, materials, and computational sciences for nuclear applications; and dramatically reduce deployment costs and timelines for new nuclear reactor technologies. This report documents efforts under the TCR program to leverage advanced modeling and simulation techniques driven by AI/ML algorithms on high-performance computing (HPC) systems to yield more optimized TCR core designs. A multiphysics ML surrogate model was developed to run on the HPC architectures. The surrogate model is trained on high-fidelity simulation data of coupled neutronics and thermofluidics and is used to quickly evaluate thousands of candidate core designs in parallel, which drives the evolution of the cooling channel shapes to minimize temperature peaking and material stress. Outcomes from these activities provide design information and feedback into the core design efforts.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Discorpy : algorithms and software for camera calibration and correction

Camera or lens-based detector calibration is essential for spatial accuracy in applications like dimensional tomography, optical metrology, and computer vision. Many methods and software exist yet there is still a lack of approaches that achieve both high accuracy and robustness while being easy to use and capable of handling a wide range of distortions. Radial lens distortion is common in high-resolution X-ray detector optics used in parallel-beam tomography at synchrotrons. Achieving sub-pixel accuracy requires calibrating with an optical target image. Although methods for characterizing radial distortion are well established, acquired images often also include perspective distortion and optical center offset. Here, we present our approaches to individually characterize and correct both types of distortion using a single calibration image, implemented in the Discorpy software.

36 MATERIALS SCIENCE↗

OptZConfig: Efficient Parallel Optimization of Lossy Compression Configuration

Lossless compressors have very low compression ratios that do not meet the needs of today's large-scale scientific applications that produce vast volumes of data. Error-bounded lossy compression (EBLC) is considered a critical technique for the success of scientific research. Although EBLC allows users to set an error bound for the compression, users have been unable to specify the requirements on the compression quality, limiting practical use. Our contributions are: (1) We formulate the problem of configuring EBLC to preserve a user-defined metric as an optimization problem. This allows many classes of new metrics to be preserved, which improves over current practices. (2) We present a framework, OptZConfig, that can adapt to improvements in the search algorithm, compressor, and metrics with minimal changes, enabling future advancements in this area. (3) We demonstrate the advantages of our approach against the leading methods to configure compressors to preserve specific metrics. Here, our approach improves compression ratios against a specialized compressor by up to 3 x, has a 56x speedup over FRaZ, 1000x speedup over MGARD-QOI post tuning, and 110x speedup over systematic approaches which had not been bounded by compressors before.

97 MATHEMATICS AND COMPUTING↗

Big Data Seismology

The discipline of seismology is based on observations of ground motion that are inherently undersampled in space and time. Our basic understanding of earthquake processes and our ability to resolve 4D Earth structure are fundamentally limited by data volume. Currently, Big Data Seismology is an emergent revolution involving the use of large, data-dense inquiries that is providing new opportunities to make fundamental advances in these areas. This article reviews recent scientific advances enabled by Big Data Seismology through the context of three major drivers: the development of new data-dense sensor systems, improvements in computing, and the development of new types of techniques and algorithms. Each driver is explored in the context of both global and exploration seismology, alongside collaborative opportunities that combine the features of long-duration data collections (common to global seismology) with dense networks of sensors (common to exploration seismology). The review explores some of the unique challenges and opportunities that Big Data Seismology presents, drawing on parallels from other fields facing similar issues. Finally, recent scientific findings enabled by dense seismic data sets are discussed, and we assess the opportunities for significant advances made possible with Big Data Seismology. This review is designed to be a primer for seismologists who are interested in getting up-to-speed with how the Big Data revolution is advancing the field of seismology.

58 GEOSCIENCES↗

Evaluating asynchronous Schwarz solvers on GPUs

With the commencement of the exascale computing era, we realize that the majority of the leadership supercomputers are heterogeneous and massively parallel. Even a single node can contain multiple co-processors such as GPUs and multiple CPU cores. For example, ORNL’s Summit accumulates six NVIDIA Tesla V100 GPUs and 42 IBM Power9 cores on each node. Synchronizing across compute resources of multiple nodes can be prohibitively expensive. Hence, it is necessary to develop and study asynchronous algorithms that circumvent this issue of bulk-synchronous computing. In this study, we examine the asynchronous version of the abstract Restricted Additive Schwarz method as a solver. We do not explicitly synchronize, but allow the communication between the sub-domains to be completely asynchronous, thereby removing the bulk synchronous nature of the algorithm. We accomplish this by using the one-sided Remote Memory Access (RMA) functions of the MPI standard. We study the benefits of using such an asynchronous solver over its synchronous counterpart. We also study the communication patterns governed by the partitioning and the overlap between the sub-domains on the global solver. Finally, we show that this concept can render attractive performance benefits over the synchronous counterparts even for a well-balanced problem.

Nayak, Pratik↗

Efficient compressive and Bayesian characterization of biphoton frequency spectra

Frequency-bin qudits constitute a promising tool for quantum information processing, but their high dimensionality can make for tedious characterization measurements. Here we introduce and compare compressive sensing and Bayesian mean estimation for recovering the spectral correlations of entangled photon pairs. Using a conventional compressive sensing algorithm, we reconstruct joint spectra with up to a 26-fold reduction in measurement time compared to the equivalent raster scan. Applying a custom Bayesian model to the same data, we then additionally realize reliable and consistent quantification of uncertainty. Finally, these efficient methods of biphoton characterization should advance our ability to use the high degree of parallelism and complexity afforded by frequency-bin encoding.

42 ENGINEERING↗

Current possibilities and future opportunities for erasure coded computations

The key capability established through the research funded by this award are erasure coded computations for linear systems, in serial and in parallel. This capability enables powerful efficient and scalable alternatives to existing linear system solvers in fault-prone computational systems.

97 MATHEMATICS AND COMPUTING↗

Improving ICARUS Track Reconstruction Algorithms

The ICARUS experiment is part of the Short-Baseline Neutrino (SBN) program at Fermilab. The main goal of the experiment is to investigate the possibility of sterile neutrinos in the O(1 eV) mass region and provide clarification of the anomaly detected from the Liquid Scintillator Neutrino Detector (LSND) and MiniBooNE experiments. The ICARUS-T600 detector is a Liquid Argon Time Projection Chamber (LAr-TPC), that can provide excellent 3D imaging and calorimetric reconstruction of any ionizing particles. This detection technique allows a detailed study of neutrino interactions, spanning a wide energy spectrum (from a few keV to several hundreds of GeV). The detector consists of two identical adjacent modules, filled with a total of 760 tons of ultra-pure liquid argon. Each module houses two LAr-TPCs separated by a common cathode with a maximum drift distance of 1.5 m, equivalent to about 1 ms drift time for the nominal $500$ V/m electric drift field. The anode is made of three parallel wire planes positioned 3 mm apart, where the stainless-steel wires are oriented on each plane at a different angle with respect to the horizontal direction ($+60^\degree$,$-60^\degree$,$0^\degree$). The first two planes (Induction 1 and Induction 2) provide a non-destructive charge measurement, whereas the ionization charge is fully collected by the last collection plane. In total, 53248 wires with a 3 mm pitch and length up to 9 m are installed in the detector. In the first stage of the reconstruction, segments of waveforms corresponding to physical signals (hits) are searched for in the deconvolved wire waveform with a threshold-based hit-finding algorithm. Each hit is then fitted with a Gaussian, whose area is proportional to the number of drift electrons generating the signal. In the second stage of the reconstruction, hits are passed as input to Pandora, a framework software composed of different pattern recognition algorithms, that performs a 3D reconstruction of the full image recorded in the collected event, including the identification of interaction vertices and tracks and showers inside the TPC. These are organized into a hierarchical structure (called slice) of particles generated starting from a primary interaction vertex. In some cases, related to the inefficiencies in the hit detection or excessive deflection of the particle trajectory, Pandora breaks the particle's track into two or more smaller pieces and considers each piece as an independent track. We studied this phenomenon focusing on primary muons from ν_μ CC interactions contained in a single module with a track at least 20 cm long, to exclude delta rays. The study determined that about $7-8\%$ of the muon tracks are broken. Approximately $80\%$ of the times, Pandora assigns all segments of the track to the same slice (intra-slice track split), while in the remaining $20\%$ of the cases, one of the segments is associated with another slice (extra-slice track split). To mitigate this phenomenon, we designed an algorithm that detects and stitches the tracks broken by Pandora for the intra-slice split. In Monte Carlo simulations, the algorithm showed an efficiency exceeding $80\%$ and a purity exceeding $93\%$.

Ricci, Alessandro Maria [Pisa U.; INFN, Pisa] (ORC↗

Record acceleration of the two-dimensional Ising model using a high-performance wafer-scale engine

The versatility and wide-ranging applicability of the Ising model, originally introduced to study phase transitions in magnetic materials, have made it a cornerstone in statistical physics and a valuable tool for evaluating the performance of emerging computer hardware. Here, we present a novel implementation of the two-dimensional Ising model on Cerebras Wafer-Scale Engine (WSE) – a revolutionary processor that is opening new frontiers in computing. In our deployment of the checkerboard algorithm, we optimized the Ising model to take advantage of the unique WSE architecture. Specifically, we employed a compressed bit representation storing 16 spins on each int16 word, and efficiently distributed the spins over the processing units enabling seamless weak scaling and limiting communications to only immediate neighboring units. Our implementation can handle up to 754 simulations in parallel, achieving an aggregate of over 61.8 trillion flip attempts per second for Ising models with up to 200 million spins. This represents a gain of up to 148 times over previously reported single-devices with a highly optimized implementation on NVIDIA V100 and up to 88 times in productivity compared to NVIDIA H100. Our findings highlight the significant potential of the WSE in scientific computing, particularly in the field of materials modeling.

Ising model↗

Multi-beam X-ray ptychography using coded probes for rapid non-destructive high resolution imaging of extended samples

Imaging large areas of a sample non-destructively and with high resolution is of great interest for both science and industry. For scanning coherent X-ray diffraction microscopy, i. e., ptychography, the achievable scan area at a given spatial resolution is limited by the coherent photon flux of modern X-ray sources. Multibeam X-ray ptychography can improve the scanning speed by scanning the sample with several parallel mutually incoherent beams, e. g., generated by illuminating multiple focusing optics in parallel by a partially coherent beam. The main difficulty with this scheme is the robust separation of the superimposed signals from the different beams, especially when the beams and the illuminated sample areas are quite similar. We overcome this difficulty by encoding each of the probing beams with its own X-ray phase plate. This helps the algorithm to robustly reconstruct the multibeam data. We compare the coded multibeam scans to uncoded multibeam and single beam scans, demonstrating the enhanced performance on a microchip sample with regular and repeating structures.

47 OTHER INSTRUMENTATION↗

Multi-physics Topology OPtimization and Additive Manufacturing for High-temperature Heat Exchangers

This research significantly advances the understanding of high-temperature heat exchanger design through an integrated approach that combines topology optimization (TO), triply periodic minimal surface (TPMS) structures, additive manufacturing (AM) and thermohydraulic testing. Each of these components contributes uniquely to a unified, high-performance design, fabrication and testing workflow. Topology optimization serves as the foundation of the design methodology by providing a systematic way to determine the most effective material layout for separating hot and cold fluids while maximizing thermal performance. The researchers introduced a novel three-material optimization framework using two density fields to represent hot fluid, cold fluid, and solid domains. This approach enables automated discovery of optimal shapes and flow paths that cannot be intuitively designed, especially under constraints imposed by manufacturing technologies. Furthermore, constraints such as minimal wall thickness and overhang angles were embedded into the optimization process, ensuring that resulting designs are not only thermally efficient but also manufacturable using modern additive techniques. In parallel, the study delves into the use of Gyroid-based TPMS geometries for constructing the core of the heat exchanger. TPMS structures are known for their high surface area, excellent fluid mixing capabilities, and minimal pressure drop characteristics. The researchers applied a data-driven modeling framework using Heteroscedastic Sparse Gaussian Process Regression (HSGPR) combined with genetic algorithms. This allowed for the rapid evaluation and optimization of key geometric parameters such as frequency, iso-value, and phase shift. The result was a set of Gyroid structures tailored for high heat transfer and low flow resistance, demonstrating clear improvements over conventional straight-channel designs. After the designing process, additive manufacturing played a critical role by turning these highly complex, optimized geometries into physical components. Utilizing Laser Powder Bed Fusion (LPBF) with Haynes 282, the study demonstrated the feasibility of fabricating these heat exchangers at high precision. Post-processing methods, including dilation-erosion operations, were applied to ensure local features adhered to self-supporting constraints. The fabricated structures were then subjected to thermohydraulic testing under conditions representative of supercritical CO 2 Brayton cycles, validating the predicted performance and confirming the viability of the full design-to-fabrication pipeline. Finally, thermohydraulic testing across the above studies served as a crucial experimental validation of advanced heat exchanger. Under consistent high-temperature and high-pressure conditions using supercritical CO 2 , the testing demonstrated that both TO and Gyroid-based TPMS designs significantly outperformed conventional straight-channel HXs. The TO design achieved a 115% increase in UA and NTU and a 27.6% boost in gravimetric power density, while the data-driven optimized Gyroid design delivered a 166% increase in UA and NTU and improved effectiveness from 68.7% to 86.1%. These results validate the simulation models, confirm the manufacturability of complex geometries under AM constraints, and provide key insights into design-performance trade-offs, thereby advancing the development of high-efficiency, compact heat exchangers for extreme environments.

36 MATERIALS SCIENCE↗

Communication-Avoiding and Memory-Constrained Sparse Matrix-Matrix Multiplication at Extreme Scale

Sparse matrix-matrix multiplication (SpGEMM) is a widely used kernel in various graph, scientific computing and machine learning algorithms. In this paper, we consider SpGEMMs performed on hundreds of thousands of processors generating trillions of nonzeros in the output matrix. Distributed SpGEMM at this extreme scale faces two key challenges: (1) high communication cost and (2) inadequate memory to generate the output. Furthermore, we address these challenges with an integrated communication-avoiding and memory-constrained SpGEMM algorithm that scales to 262,144 cores (more than 1 million hardware threads) and can multiply sparse matrices of any size as long as inputs and a fraction of output fit in the aggregated memory. As we go from 16,384 cores to 262,144 cores on a Cray XC40 supercomputer, the new SpGEMM algorithm runs 10x faster when multiplying large-scale protein-similarity matrices.

97 MATHEMATICS AND COMPUTING↗

Development of Real-Time System Identification to Detect Abnormal Operations in a Gas Turbine Cycle

Here, we present a novel online system identification methodology for monitoring the performance of power systems. This methodology was demonstrated in a gas turbine recuperated power plant designed for a hybrid configuration. A 120-kW Garrett microturbine modified to test dynamic control strategies for hybrid power systems designed at the National Energy Technology Laboratory (NETL) was used to implement and validate this online system identification methodology. The main component of this methodology consists of an empirical transfer function model implemented in parallel to the turbine speed operation and the fuel control valve, which can monitor the process response of the gas turbine system while it is operating. During fully closed-loop operations or automated control, the output of the controller, fuel valve position, and the turbine speed measurements were fed for a given period of time to a recursive algorithm that determined the transfer function parameters during the nominal condition. After the new parameters were calculated, they were fed into the transfer function model for online prediction. The turbine speed measurement was compared against the transfer function prediction, and a control logic was implemented to capture when the system operated at nominal or abnormal conditions. To validate the ability to detect abnormal conditions during dynamic operations, drifting in the performance of the gas turbine system was evaluated. A leak in the turbomachinery working fluid was emulated by bleeding 10% of the airflow from the compressor discharge to the atmosphere, and electrical load steps were performed before and after the leak. This tool could detect the leak 7 s after it had occurred, which accounted for a fuel flow increase of approximately 15.8% to maintain the same load and constant turbine speed operations.

algorithms↗

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↗