Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Parallel optimization”

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 595 records · Page 33
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Enhancing quantum annealing accuracy through replication-based error mitigation *

Abstract Quantum annealers like those manufactured by D-Wave Systems are designed to find high quality solutions to optimization problems that are typically hard for classical computers. They utilize quantum effects like tunneling to evolve toward low-energy states representing solutions to optimization problems. However, their analog nature and limited control functionalities present challenges to correcting or mitigating hardware errors. As quantum computing advances towards applications, effective error suppression is an important research goal. We propose a new approach called replication based mitigation (RBM) based on parallel quantum annealing (QA). In RBM, physical qubits representing the same logical qubit are dispersed across different copies of the problem embedded in the hardware. This mitigates hardware biases, is compatible with limited qubit connectivity in current annealers, and is well-suited for currently available noisy intermediate-scale quantum annealers. Our experimental analysis shows that RBM provides solution quality on par with previous methods while being more flexible and compatible with a wider range of hardware connectivity patterns. In comparisons against standard QA without error mitigation on larger problem instances that could not be handled by previous methods, RBM consistently gets better energies and ground state probabilities across parameterized problem sets.

Djidjev, Hristo N. (ORCID:0000000192868824)↗
DOE OSTI2023

Performance Evaluation of Heterogeneous GPU Programming Frameworks for Hemodynamic Simulations

Preparing for the deployment of large scientific and engineering codes on upcoming exascale systems with GPU-dense nodes is made challenging by the unprecedented diversity of device architectures and heterogeneous programming models. In this work, we evaluate the process of porting a massively parallel, fluid dynamics code written in CUDA to SYCL, HIP, and Kokkos with a range of backends, using a combination of automated tools and manual tuning. We use a proxy application along with a custom performance model to inform the results and identify additional optimization strategies. At scale performance of the programming model implementations are evaluated on pre-production GPU node architectures for Frontier and Aurora, as well as on current NVIDIA device-based systems Summit and Polaris. Real-world workloads representing 3D blood flow calculations in complex vasculature are assessed. Our analysis highlights critical trade-offs between code performance, portability, and development time.

Martin, Aristotle↗
DOE OSTI2024

IDAES-PSE 2.7.0 Release

The Institute for the Design of Advanced Energy Systems (IDAES) Integrated Platform is a versatile computational environment offering extensive process systems engineering (PSE) capabilities for optimizing the design and operation of complex, interacting technologies and systems. IDAES enables users to efficiently search vast, complex design spaces to discover the lowest cost solutions while supporting the full process modeling lifecycle, from conceptual design to dynamic optimization and control. The extensible, open platform empowers users to create models of novel processes and rapidly develop custom analyses, workflows, and end-user applications. IDAES-PSE 2.7.0 Release Highlights New features: AutoScaler and CustomScalerBase classes: Such tools are the core of the new scaling framework being implemented in IDAES. Wider adoption of scaling tools among users will result in quicker and more robust model solutions. Scaler for equilibrium reactor and saponification properties: These scaler models are examples to follow for how to use the new scaling tools. ONNX Surrogate support from Optimization & Machine Learning Toolkit (OMLT): ONNX is an open standard format to save and load ML/AI models that is widely supported by all major frameworks. This capability makes it easier for IDAES users to create surrogate models and use them without having to support each framework individually. 1D Membrane Model for CO2 Capture and Utilization: Supports ongoing efforts for modeling and optimizing polymer membrane processes for CO2 capture and conversion into formic acid. StreamScaler unit model: Unrelated to the CustomScalerBase, this unit model allows a stream’s extensive variables to be scaled by a fixed factor. This allows streams being processed by multiple units in parallel to be scaled down to unit scale and scaled back up to process scale. Bug fixes or improvements: Scaling, EoS, Diagnostics tool, Modular Properties, tests & documentation Deprecations: Old Cubic EoS

AS↗
DOE OSTI2025

Robustness of Deep Learning Classification to Adversarial Input on GPUs: Asynchronous Parallel Accumulation Is a Source of Vulnerability

The ability of machine learning (ML) classification models to resist small, targeted input perturbations—known as adversarial attacks—is a key measure of their safety and reliability. We show that floating-point non associativity (FPNA) coupled with asynchronous parallel programming on GPUs is sufficient to result in misclassification, without any perturbation to the input. Additionally, we show that this misclassification is particularly significant for inputs close to the decision boundary and that standard adversarial robustness results may be overestimated up to 4.6 when not considering machine-level details. We first study a linear classifier, before focusing on standard Graph Neural Network (GNN) architectures and datasets used in robustness assessments. We develop a novel black-box attack using Bayesian optimization to discover external workloads that can change the instruction scheduling which bias the output of reductions on GPUs and reliably lead to misclassification. Motivated by these results, we present a new learnable permutation (LP) gradient-based approach to learning floating-point operation orderings that lead to misclassifications. The LP approach provides a worst-case estimate in a computationally efficient manner, avoiding the need to run identical experiments tens of thousands of times over a potentially large set of possible GPU states or architectures. Finally, using instrumentation-based testing, we investigate parallel reduction ordering across different GPU architectures under external background workloads, when utilizing multi-GPU virtualization, and when applying power capping. Our results demonstrate that parallel reduction ordering varies significantly across architectures under the first two conditions, substantially increasing the search space required to fully test the effects of this parallel scheduler-based vulnerability. These results and the methods developed here can help to include machine-level considerations into adversarial robustness assessments, which can make a difference in safety and mission critical applications.

Shanmugavelu, Sanjif [Maxeler Technologies, a Groq↗
DOE OSTI2022

Transience of the Retinal Output Is Determined by a Great Variety of Circuit Elements

Retinal ganglion cells (RGCs) encrypt stimulus features of the visual scene in action potentials and convey them toward higher visual centers in the brain. Although there are many visual features to encode, our recent understanding is that the ~46 different functional subtypes of RGCs in the retina share this task. In this scheme, each RGC subtype establishes a separate, parallel signaling route for a specific visual feature (e.g., contrast, the direction of motion, luminosity), through which information is conveyed. The efficiency of encoding depends on several factors, including signal strength, adaptational levels, and the actual efficacy of the underlying retinal microcircuits. Upon collecting inputs across their respective receptive field, RGCs perform further analysis (e.g., summation, subtraction, weighting) before they generate the final output spike train, which itself is characterized by multiple different features, such as the number of spikes, the inter-spike intervals, response delay, and the rundown time (transience) of the response. These specific kinetic features are essential for target postsynaptic neurons in the brain in order to effectively decode and interpret signals, thereby forming visual perception. We review recent knowledge regarding circuit elements of the mammalian retina that participate in shaping RGC response transience for optimal visual signaling.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

A GPU-Accelerated Population Generation, Sorting, and Mutation Kernel for an Optimization-Based Causal Inference Model

We develop a GPU-accelerated machine learning generative adversarial network model that can be used with observational data for the purpose of constructing causal inferences. The theoretical basis of our machine learning model is novel and is conceptualized to be operable and scalable for high performance computing platforms. Our GPU-accelerated code enables large-scale parallelization of the computation within a common and accessible computing environment. This will expand the reach of our model and empower research in new substantive domains while maintaining the underlying theoretical properties.

Cho, Wendy K. Tam↗
DOE OSTI2020

A Two-Stage Decomposition Approach for AC Optimal Power Flow

The alternating current optimal power flow (AC-OPF) problem is critical to power system operations and planning, but it is generally hard to solve due to its nonconvex and large-scale nature. Furthermore, this paper proposes a scalable decomposition approach in which the power network is decomposed into a master network and a number of subnetworks, where each network has its own AC-OPF subproblem. This formulates a two-stage optimization problem and requires only a small amount of communication between the master and subnetworks. The key contribution is a smoothing technique that renders the response of a subnetwork differentiable with respect to the input from the master problem, utilizing properties of the barrier problem formulation that naturally arises when subproblems are solved by a primal-dual interior-point algorithm. Consequently, existing efficient nonlinear programming solvers can be used for both the master problem and the subproblems. The advantage of this framework is that speedup can be obtained by processing the subnetworks in parallel, and it has convergence guarantees under reasonable assumptions. The formulation is readily extended to instances with stochastic subnetwork loads. Numerical results show favorable performance and illustrate the scalability of the algorithm which is able to solve instances with more than 11 million buses.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

A high efficiency rooftop air conditioning system using multi-speed compressors

This study delineates a meticulous exploration of technologies to enhance the energy efficiency of rooftop air conditioning units, employing the DOE/ORNL heat pump design model for comprehensive engineering design and optimization. A baseline rooftop air conditioning unit, featuring a 13 ton (45.7 kW) cooling capacity and a 17.9 integrated energy efficiency ratio, served as the point of departure for substantive efficiency enhancements. Key modifications included the consolidation of two refrigerant circuits into one, integrating three parallel 2-stage (dual-speed) compressors, fan replacements with high-efficiency substitutes. Notably, a lower global warming potential refrigerant, R452B, was evaluated as a substitute for R-410A, demonstrating better performance in the lab prototype. Further, the achieved measured integrated energy efficiency ratio of 21.4 in the lab prototype surpassed the baseline integrated energy efficiency ratio. Comparative evaluations between R410A and R452B indicated heightened efficiency with the latter, showcasing a lab-demonstrated integrated energy efficiency ratio of 22.4 at the rated capacity of 13.8 ton (48.5 kW) and 23.9 integrated energy efficiency ratio at the rated capacity of 10 ton (35.2 kW). This research underscores the successful development of a rigorous, energy efficient rooftop air conditioning unit prototype with noteworthy environmental and economic implications.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2022

Crystal structure of diclazuril, C 17 H 9 Cl 3 N 4 O 2

The crystal structure of diclazuril has been solved and refined using synchrotron X-ray powder diffraction data, and optimized using density functional theory techniques. Diclazuril crystallizes in space group P2 1 /a (#14) with a = 27.02080(18), b = 11.42308(8), c = 5.36978(5) Å, β = 91.7912(7)°, V = 1656.629(15) Å 3 , and Z = 4. The crystal structure consists of layers of molecules parallel to the ac-plane. A strong N–H∙∙∙O hydrogen bond links the molecules into dimers along the a-axis with a graph set R2,2(8). The powder pattern has been submitted to ICDD for inclusion in the Powder Diffraction File™ (PDF®).

36 MATERIALS SCIENCE↗
DOE OSTI2021

Evaluating CUDA Portability with HIPCL and DPCT

HIPCL is expanding the scope of the CUDA portability route from an AMD platform to an OpenCL platform. In the meantime, the Intel DPC++ Compatibility Tool (DPCT) is migrating a CUDA program to a data parallel C++ (DPC++) program. Towards the goal of portability enhancement, we evaluate the performance of the CUDA applications from Rodinia, SHOC, and proxy applications ported using HIPCL and DPCT on Intel GPUs. After profiling the ported programs, we aim to understand their performance gaps, and optimize codes converted by DPCT to improve their performance. The open-source repository for the CUDA, HIP, and DPCT programs will be useful for the development of a translator.

Jin, Zheming↗
DOE OSTI2021

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↗
DOE OSTI2022

Crystal structure of vismodegib, C 19 H 14 Cl 2 N 2 O 3 S

The crystal structure of vismodegib has been solved and refined using synchrotron X-ray powder diffraction data, and optimized using density functional theory techniques. Vismodegib crystallizes in space group P2 1 /a (#14) with a = 16.92070(20), b = 10.20235(4), c = 12.16161(10) Å, β = 108.6802(3)°, V = 1988.873(9) Å 3 , and Z = 4. The crystal structure consists of corrugated layers of molecules parallel to the bc-plane. There is only one classical hydrogen bond in the structure, between the amide nitrogen atom and the N atom of the pyridine ring. Pairs of these hydrogen bonds link the molecules into dimers, with a graph set R2,2(14) > a > a. The powder pattern has been submitted to ICDD for inclusion in the Powder Diffraction File™ (PDF®).

36 MATERIALS SCIENCE↗
DOE OSTI2023

Crystal structure of oxibendazole, C 12 H 15 N 3 O 3

The crystal structure of oxibendazole has been solved and refined using synchrotron X-ray powder diffraction data, and optimized using density functional theory techniques. Oxibendazole crystallizes in space group C2/c (#15) with a = 23.18673(22), b = 5.35136(5), c = 19.88932(13) Å, β = 97.0876(9)°, V = 2449.018(17) Å 3 , and Z = 8. The structure consists of hydrogen-bonded layers of planar molecules parallel to the bc-plane. Strong N–H∙∙∙N hydrogen bonds link the molecules into dimers, with a graph set R2,2(8). N–H∙∙∙O hydrogen bonds further link these dimers into layers parallel to the bc-plane. The powder pattern has been submitted to ICDD for inclusion in the Powder Diffraction File™ (PDF®).

36 MATERIALS SCIENCE↗
DOE OSTI2023

Crystal structure of elvitegravir Form II, C 23 H 23 ClFNO 5

The crystal structure of elvitegravir Form II has been solved and refined using synchrotron X-ray powder diffraction data, and optimized using density functional theory techniques. Elvitegravir Form II crystallizes in space group P2 1 (#4) with a = 11.54842(7), b = 14.04367(5), c = 13.33333(8) Å, β = 90.0330(6)°, V = 2162.427(14) Å 3 , and Z = 4. The crystal structure consists of alternating layers of parallel molecules perpendicular to the b-axis. The mean planes of the oxoquinoline ring systems in molecules 1 and 2 are 1(22)-1 and -1(22)1. Between the stacks are layers of the halogenated phenyl rings. These exhibit herringbone stacking. In each molecule, the carboxylic acid group forms a strong intramolecular O–H∙∙∙O hydrogen bond to the nearby carbonyl group. The hydroxyl group of each molecule forms a strong hydrogen bond to the carbonyl group of the carboxylic acid of the other molecule. These O–H∙∙∙O hydrogen bonds link the molecules into dimers, with a graph set R2,2(18) > a > c. The powder pattern has been submitted to ICDD for inclusion in the Powder Diffraction File™ (PDF®).

36 MATERIALS SCIENCE↗
DOE OSTI2025

On-lattice kinetic Monte Carlo approaches for modeling molecular anisotropy in resveratrol crystallization

Stilbenes are a class of organic compounds with broad-ranging pharmaceutical and agricultural applications, which are typically isolated and purified through recrystallization. We are motivated by reducing experimental waste and optimizing yield via developing predictive simulations for processing-dependent crystal morphologies. Using resveratrol as a model stilbene system, we have developed an approach for simulating crystallization with molecular resolution using on-lattice kinetic Monte Carlo. In this work, we highlight modifications to the Stochastic Parallel PARticle Kinetic Simulator (SPPARKS) software package, which were essential to this application. Key enhancements include the incorporation of non-orthogonal cell shapes and monomer anisotropy approximations using bound hard spheres. This new SPPARKS application has been applied to resveratrol with attachment energy libraries obtained from density functional theory, resulting in excellent agreement with experimental morphology prediction.

crystallization↗
DOE OSTI2025

Investigation into Scalable and Detection-Enhanced Satellite Conjunction Assessment

Imaging opportunities (viewable conjunctions) of Resident Space Objects (RSOs) by satellites are not continuously discovered. We propose to continuously produce and report viewable conjunctions among objects in orbit. Viewable conjunctions are events in space and time when a satellite may favorably view a Resident Space Object (RSO). Favorability is defined by a set of constraints, e.g., solar illumination, distance between observer and target, orbital location for viewable event. Computing viewable conjunctions requires calculation of orbital propagation while considering constraints based on the state vectors of position, velocity, with covariance for both satellite and RSO. We propose two parallel lanes of effort: acceleration and research. The objective of acceleration is to avoid missed opportunities and reduce latency for satellite maneuver requests through continuous prediction and reporting of viewable conjunctions. The effort will begin by deploying currently available software on dedicated systems and continue with optimizing the code for high performance computing hardware. The research lane aims to expand RSO inspection and modeling capabilities. Among our current research ideas are spectral characterization of RSO materials and planning multiple observations to recover RSO 3D form. Computing resources at Oak Ridge National Laboratory (ORNL) are available for the acceleration work. Laika, Maxar conjunction prediction dashboard software, and Bluesim, Maxar orbital propagation software, are expected to be the first software in the acceleration lane. Laike and Bluesim are to be provided by the sponsor, and output will be made accessible through its dashboard. Deliverables will follow a gated schedule to the sponsor. ORNL will provide progressively more robust viewable conjunction assessments from both modelled and actual ephemerides.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Comparison of Some RANS Solvers

We will take a look at solving the Reynolds-averaged Navier-Stokes (RANS) equations that are encountered in the context of wind farm performance simulations and optimizations. We will compare some of the more popular ways to solve these equations with a focus on using iterative solvers for the linear solve. We will compare their performance and reliability to a direct solve as we scale the problem both by adding more and parallel resources and by increasing the size of the domain, both in two and three dimensions. There are many strategies that can be applied to solving the RANS equations, some are very efficient, while others are very insensitive to, for example, the Reynolds number. The first contender we will consider is the Pressure-Convection-Diffusion (PCD) preconditioner. Early results suggest that PCD is indeed a very efficient solver, in particular in two dimensions, as long as the Reynold's number remains small. Next we will try to reorder our degrees of freedom such that we can use GMRES with ILU for our linear solve. Another popular choice we will consider for solving the RANS equations is SIMPLE (and its derivatives). For all of our implementations we make use of either FEniCS or Firedrake, basing our work on both existing implementations of some of these solvers while also writing new extensions for others.

CFD↗
DOE OSTI2024

Distributed-Memory Sparse Deep Neural Network Inference Using Global Arrays

Partitioned Global Address Space (PGAS) models exhibit tremendous promise in developing efficient and productive distributed-memory parallel applications. They have been used extensively in scientific computations due to conveniently offering a ``shared-memory''-like model and convenient interfaces that separate communication with synchronization. Traditionally, PGAS communication models have been applied to dense/contiguously distributed data, but most modern applications depict varied levels of sparsity. Existing PGAS models require certain adaptations to support distributed sparse computations, since associated computations often require matrix arithmetic, in addition to data movement. The Global Arrays toolkit from Pacific Northwest National Laboratory (PNNL) is one of the earliest PGAS models to combine one-sided data communication and distributed matrix operations and is still used in the popular NWChem quantum chemistry suite. Recently, we have expanded the Global Arrays toolkit to support common sparse operations, like sparse matrix-dense matrix multiplies (SpMM), sparse matrix-sparse matrix multiplication (SpGEMM) and Sampled Dense-Dense Matrix Multiplication (SDDMM). As it turns out, these operations are the bedrock of sparse Deep Learning (DL); sparse deep neural networks and Graph Neural Networks (GNNs) have gained increasing attention recently in achieving speedups on training and inference with reduced memory footprints. Unlike scientific applications in High Performance Computing (HPC), modern (distributed-memory capable) DL toolkits often rely on non-standardized and closed-source vendor software optimizations, creating challenges in software-hardware co-design at scale. Our goal is to support a variety of distributed-memory sparse matrix operations and helper functions in the newly created Sparse Global Arrays (SGA), such that it is possible to build portable and productive Machine Learning scenarios for algorithm/software and hardware codesign purposes. Contemporary data-parallel schemes for training/inference are undergoing a major overhaul since model replication limits scalability and causes resource inefficiencies. As such, we have adopted tensor parallelism in decomposing the model and inputs, to mitigate memory issues. Current implementation is built on top of MPI and uses CPUs to maximize the portability across the platforms.

Distributed computing, machine learning↗