Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “high performance 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,747 records · Page 97
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

Drekar v.2.0

Drekar is an application code that solves partial differential equations for fluids that can be optionally coupled to electromagnetics. Drekar solves low-mach compressible and incompressible computational fluid dynamics (CFD), compressible and incompressible resistive magnetohydrodynamics (MHD), and multiple species plasmas interacting with electromagnetic fields. Drekar discretization technology includes continuous and discontinuous finite element formulations, stabilized finite element formulations, mixed integration finite element bases (nodal, edge, face, volume) and an initial arbitrary Lagrangian Eulerian (ALE) capability. Drekar contains the implementation of the discretized physics and leverages the open source Trilinos project for both parallel solver capabilities and general finite element discretization tools. The code will be released open source under a BSD license. The code is used for fundamental research for simulation of fluids and plasmas on high performance computing environments.

Seefeldt, Ben↗
DOE OSTI2024

Scaling the SciDAC QuantOm Workflow

As part of the Scientific Discovery through Advanced Computing (SciDAC) program, the Quantum Chromodynamics Nuclear Tomography (QuantOM) project aims to analyze data from Deep Inelastic Scattering (DIS) experiments conducted at Jefferson Lab and the upcoming Electron Ion Collider. The DIS data analysis is performed on an event-level by combining the input from theoretical and experimental nuclear physics into a single, composable workflow. The optimization itself (I.e. fitting the experimental data with theoretical predictions) is carried out by a machine / deep learning algorithm. The size of the acquired DIS data as well as the complexity of the workflow itself require that the analysis is performed across multiple GPUs on high performance computing systems, such as Polaris at Argonne National Laboratory. This presentation discusses the novelties and challenges that came along with parallelizing this workflow. Recent results are compared to common distributed training techniques.

Lersch, Daniel↗
DOE OSTI2019

High-performance End-to-End Integrity Verification on Big Data Transfer

The scale of scientific data generated by experimental facilities and simulations in high-performance computing facilities has been proliferating with the emergence of IoT-based big data. In many cases, this data must be transmitted rapidly and reliably to remote facilities for storage, analysis, or sharing, for the Internet of Things (IoT) applications. Simultaneously, IoT data can be verified using a checksum after the data has been written to the disk at the destination to ensure its integrity. However, this end-to-end integrity verification inevitably creates overheads (extra disk I/O and more computation). Thus, the overall data transfer time increases. In this article, we evaluate strategies to maximize the overlap between data transfer and checksum computation for astronomical observation data. Specifically, we examine file-level and block-level (with various block sizes) pipelining to overlap data transfer and checksum computation. We analyze these pipelining approaches in the context of GridFTP, a widely used protocol for scientific data transfers. Theoretical analysis and experiments are conducted to evaluate our methods. The results show that block-level pipelining is effective in maximizing the overlap mentioned above, and can improve the overall data transfer time with end-to-end integrity verification by up to 70% compared to the sequential execution of transfer and checksum, and by up to 60% compared to file-level pipelining.

data integrity↗
DOE OSTI2018

FAODEL

FAODEL is a collection of libraries for implementing data management services on high-performance computing (HPC) platforms. It is composed of several components: (1) an RDMA portability library called NNTI for transporting data, (2) an in-application, restful API service, (3) a memory management library for network memory named Lunasa, (4) an asynchronous communication engine, and (5) a distributed key/blob service names Kelpie. Application developers may use these libraries to move data between the distributed nodes of one job to another, as well as to distributed storage resources. FAODEL is different than other communication libraries in that it supports both intra- and inter-job communication, features event-driven mechanisms, and provides high-level primitives for developers to reason about a platform’s distributed resources.

ECP↗
DOE OSTI2021

Non-Proprietary Companion to the Q1 CY2021 PathForward Final Assessment (WBS 2.4.1, Milestone PM-HI-1040)

The PathForward element of the Exascale Computing Project (ECP) Hardware and Integration (HI) focus area has met its goals of preparing the US industry for exascale system procurements and generally improving US competitiveness in the worldwide computing market. This report is a companion to the deliverable for the ECP milestone PM-HI-1040, Assess PathForward Impact Against Exascale Hardware Challenges, which gives a summary of the final status of each PathForward project, describes progress achieved against PathForward contract milestones, and includes a final assessment of each vendor’s progress on key exascale challenges. This companion document details the results of the PathForward research to the extent possible without disclosing proprietary information and the impact on products and US exascale systems. In addition, it captures lessons learned in order to inform future projects in general and in high-performance computing in particular.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Preliminary Development of a Drift-Flux Model Based Pin-Resolved Core Thermal-Hydraulic Code for Dedicated Use in Efficient High-Fidelity Neutronics Coupled Calculations

As the high-fidelity multiphysics coupled core calculation becomes more practical with the advent of high-performance computing technology, efficient coupling of a neutronics code with a thermal-hydraulic (T/H) code at the pin level poses a new challenge. The COBRA-TF (CTF) code which is one of the well-known subchannel analysis codes based on the two-fluid, three-field model was coupled with many neutron transport codes such as MPACT, TORTTD, and nTRACER due to the easiness of coupling by its well-established coupling interface. Nevertheless, the calculation efficiency of such coupled codes is not satisfactory because of the heavy computational burden of CTF. The MATRA subchannel analysis code of KAERI which is based on the homogeneous equilibrium model (HEM) was coupled with neutronics codes as well. The choice of the HEM and the marching scheme in MATRA reduces the computational burden significantly. However, the applicability of the HEM for the two-phase flow conditions is limited to normal operating conditions of pressurized water reactors (PWRs) and therefore a better model which would allow wider applicability than HEM is necessary in order to deal with the core states involving nontrivial voiding. The drift-flux model (DFM) which uses 5 equations for two-fluid analyses by adopting the mixture velocity instead of two phasic velocities can be a good compromise between the two-fluid model and the HEM. With the DFM, the computational cost can be reduced and moreover the modeling of the interfacial area constitutive relations can be avoided. The phase separation for the mixture velocity can be incorporated by using the drift-flux parameters, C0 and Vgj, which can be obtained by using empirical formulas. Several subchannel codes such as WOSUB and ASSERT were developed based on the DFM. It was also adopted in some system analysis codes such as RETRAN3D. In the work here, the development of a DFM based pin-resolved T/H analysis code, ESCOT (Efficient Simulator of Core Thermal-hydraulics), is introduced for the use in efficient coupled calculations with a high-fidelity neutronics code. The field equations and the numerical methods are briefly described. Then the efficiency tests of various linear system solvers including the Krylov subspace methods (KSMs) are presented. A test problem is solved by ESCOT, MATRA and CTF for performance comparison and validation. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

HPC Molecular Simulation Tries Out a New GPU: Experiences on Early AMD Test Systems for the Frontier Supercomputer

Molecular simulation is an important tool for nu- merous efforts in physics, chemistry, and the biological sciences. Simulating molecular dynamics requires extremely rapid cal- culations to enable sufficient sampling of simulated temporal molecular processes. The Hewlett Packard Enterprise (HPE) Cray EX Frontier supercomputer installed at the Oak Ridge Leadership Computing Facility (OLCF) will provide an exascale resource for open science, and will feature graphics processing units (GPUs) from Advanced Micro Devices (AMD). The future LUMI supercomputer in Finland will be based on an HPE Cray EX platform as well. Here we test the ports of several widely used molecular dynamics packages that have each made substantial use of acceleration with NVIDIA GPUs, on Spock, the early Cray pre-Frontier testbed system at the OLCF which employs AMD GPUs. These programs are used extensively in industry for pharmaceutical and materials research, as well as academia, and are also frequently deployed on high-performance computing (HPC) systems, including national leadership HPC resources. We find that in general, performance is competitive and installation is straightforward, even at these early stages in a new GPU ecosystem. Our experiences point to an expanding arena for GPU vendors in HPC for molecular simulation.

Sedova, Ada↗
DOE OSTI2021

Dilute Combustion Control Using Spiking Neural Networks

Dilute combustion with exhaust gas recirculation (EGR) in spark-ignition engines presents a cost-effective method for achieving higher levels of engine efficiency. At high levels of EGR, however, cycle-to-cycle variability (CCV) of the combustion process is exacerbated by sporadic occurrences of misfires and partial burns. Previous studies have shown that temporal deterministic patterns emerge at such conditions and certain combustion cycles have a significant influence over future events. Due to the complexity of the combustion process and the nature of CCV, harnessing all the deterministic information for control purposes has remained challenging even with physics based 0-D, 1-D, and high-fidelity computational fluid dynamics (CFD) models. In this study, we present a data-driven approach to optimize the combustion process by controlling CCV adjusting the cycle-to-cycle fuel injection quantity. Readily available data from in-cylinder pressure was used to train a spiking neural network (SNN) which learns the optimal way to manage fuel injection in order to reduce CCV while maintaining acceptable levels of fuel consumption. SNNs are particularly well suited for powertrain control applications due to their ability to be deployed on FPGA-based neuromorphic hardware which are small, inexpensive, and have a low power demand. The high-performance computing (HPC) resources of Oak Ridge National Laboratory were used to run an evolutionary-based training approach for choosing the best SNN configuration that minimizes the size of the network while achieving the desired goal. The neuromorphic hardware with the optimized SNN deployed was connected to the rapid prototyping engine control system for real-time control implementation and tested on a single cylinder version of a GM LNF 4-cylinder engine. The results show a significant reduction of CCV with a small percentage of additional fuel used to stabilize the charge.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2026

AutoBEM: A scalable framework for nationwide building energy simulation and retrofit evaluation in the United States

This paper presents AutoBEM, an integrated, automated framework for nationwide building energy modeling and retrofit evaluation in the United States. Unlike prior UBEM platforms that either rely primarily on representative stock sampling or operate at city scale, AutoBEM automates the generation of building-resolved, physics-based EnergyPlus/OpenStudio simulation models at national scale using GIS-derived geometry, prototype-based assumptions, and standardized scalable workflows. Leveraging the Model America dataset and high-performance computing, AutoBEM generates and simulates energy models for 122.9 million buildings, representing 97.8% of the U.S. building stock. These models are being made publicly and freely available as the Model America v1.0 (MAv1) dataset. AutoBEM supports detailed, building-level assessments of energy consumption, CO2 emissions, and post-processed anthropogenic heat emissions (AHE), and evaluates 151 energy conservation measures (ECMs) using localized utility pricing and building characteristics. In addition, AutoBEM incorporates both typical and future climate conditions through integration with Typical Meteorological Year (TMY) and Future TMY (fTMY) weather data derived from IPCC scenarios. In a case study of Phoenix, Arizona, AutoBEM identified several high-efficiency HVAC upgrades and selected envelope measures with short modeled payback periods (1.5 years) for certain building types and standards. Simulations under future climate scenarios (SSP5–RCP8.5) project an 11.3% increase in electricity use and a 32% reduction in natural gas demand by 2100, underscoring the need for climate-adaptive retrofit planning. By enabling reproducible, bottom-up, and location-specific analysis at scale, AutoBEM provides a step toward a national digital twin of the built environment and supports data-driven screening and planning for decarbonization, resilience, and energy equity.

Li, Hang [ORNL] (ORCID:0000000306001920)↗
DOE OSTI2024

Navigating Exascale Operational Data Analytics: From Inundation to Insight

In this paper, we address the challenges in achieving sustainable data-driven efficiency by providing a detailed exploration of the end-to-end operational data analytics (ODA) framework that evolved through two generations of supercomputer systems at the Oak Ridge Leadership Computing Facility (OLCF). This framework addresses large data streams ingested from heavily instrumented HPC environment that accumulates multi-terabytes per day. We outline the multifaceted data life cycle across HPC procurement, operations, and research & development, identifying key obstacles and design decisions that shape effective strategies in building and supporting data pipelines end-to-end. By sharing key insights and lessons learned from our experience, we offer recommendations for the HPC community on enabling sustainable operational data analytics and beyond. Our contributions aim to bridge the gap between potential and real benefits of operational data, guiding future efforts towards integrated and sustainable operational intelligence in high-performance computing environments.

Shin, Woong↗
DOE OSTI2023

The confluence of machine learning and multiscale simulations

Multiscale modeling has a long history of use in structural biology, as computational biologists strive to overcome the time- and length-scale limits of atomistic molecular dynamics. Contemporary machine learning techniques, such as deep learning, have promoted advances in virtually every field of science and engineering and are revitalizing the traditional notions of multiscale modeling. Deep learning has found success in various approaches for distilling information from fine-scale models, such as building surrogate models and guiding the development of coarse-grained potentials. However, perhaps its most powerful use in multiscale modeling is in defining latent spaces that enable efficient exploration of conformational space. In conclusion, this confluence of machine learning and multiscale simulation with modern high-performance computing promises a new era of discovery and innovation in structural biology.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2014

Detecting Silent Data Corruption for Extreme-Scale Applications through Data Mining

Supercomputers allow scientists to study natural phenomena by means of computer simulations. Next-generation machines are expected to have more components and, at the same time, consume several times less energy per operation. These trends are pushing supercomputer construction to the limits of miniaturization and energy-saving strategies. Consequently, the number of soft errors is expected to increase dramatically in the coming years. While mechanisms are in place to correct or at least detect some soft errors, a significant percentage of those errors pass unnoticed by the hardware. Such silent errors are extremely damaging because they can make applications silently produce wrong results. In this work we propose a technique that leverages certain properties of high-performance computing applications in order to detect silent errors at the application level. Our technique detects corruption solely based on the behavior of the application datasets and is completely application-agnostic. We propose multiple corruption detectors, and we couple them to work together in a fashion transparent to the user. We demonstrate that this strategy can detect the majority of the corruptions, while incurring negligible overhead. We show that with the help of these detectors, applications can have up to 80% of coverage against data corruption.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Quench process modeling & simulation in the heat-treatment of critical aerospace components

To manufacture light-weight, advanced metal alloy components for gas turbine engines, quench heat-treatment processes are typically used. By quenching the component from elevated tempera-tures, the alloy sometimes undergoes a solid-state phase transformation which produces special microstructures with the required, enhanced mechanical properties. However, the quenching can also lead to cracks forming in the component. Addressing the quench cracking problems adds a significant burden to the cost, schedule, and energy demand of manufacture. Currently, optimizing the quench process to mitigate or avoid the cracking is performed largely by trial-and-error, relying heavily on costly experimental (thermocouple) trials to understand the local thermal gradients which cause the cracks to form. In this first part (Phase 1) of the work, high-performance computing is employed to establish the ability of modern CFD (computational fluid dynamics) to alleviate or wholly replace the experimental quenching trials by virtual testing. A baseline CFD model is defined and its accuracy established to be comparable to (and which usually exceeds) the accuracy of existing HTC (heat-transfer correlation) based simulation methods of quenching. As a first-principles based approach, “calibration” of the Baseline CFD model is independent of the quench process itself, but instead relies on the accuracy of the underlying (modeled), generic two-phase fluid processes which cannot be currently resolved by CFD for large, industrial-scale cases. A novel, high-fidelity DNS capability has been developed and verified to examine and further improve upon the mean-field closure submodels on which the Baseline CFD approach is based.

36 MATERIALS SCIENCE↗
DOE OSTI2018

On Data Transfers Over Wide-Area Dedicated Connections

Dedicated wide-area network connections are employed in big data and high-performance computing scenarios, since the absence of cross-traffic promises to make it easier to analyze and optimize data transfers over them. However, nonlinear transport dynamics and end-system complexity due to multi-core hosts and distributed file systems make these tasks surprisingly challenging. We present an overview of methods to analyze memory and disk file transfers using extensive measurements over 10 Gbps physical and emulated connections with 0–366 ms round trip times (RTTs). For memory transfers, we derive performance profiles of TCP and UDT throughput as a function of RTT, which show concave regions in contrast to entirely convex regions predicted by previous models. These highly desirable concave regions can be expanded by utilizing large buffers and more parallel flows. We also present Poincar´e maps and Lyapunov exponents of TCP and UDT throughputtraces that indicate complex throughput dynamics. For disk file transfers, we show that throughput can be optimized using a combination of parallel I/O and network threads under direct I/O mode. Our initial throughput measurements of Lustre filesystems mounted over long-haul connections using LNet routers show convex profiles indicative of I/O limits.

Rao, Nageswara S.↗
DOE OSTI2025

Compactly‐Supported Nonstationary Kernels for Computing Exact Gaussian Processes on Big Data

The Gaussian process (GP) is a widely used method for analyzing large-scale data sets, including spatio-temporal measurements of nonlinear processes that are now commonplace in the environmental sciences. Traditional implementations of GPs involve stationary kernels (also termed covariance functions) that limit their flexibility, and exact methods for inference that prevent application to data sets with more than about 10,000 points. Modern approaches to address stationarity assumptions generally fail to accommodate large data sets, while all attempts to address scalability focus on approximating the Gaussian likelihood, which can involve subjectivity and lead to inaccuracies. In this work, we explicitly derive an alternative kernel that can discover and encode both sparsity and nonstationarity. We embed the kernel within a fully Bayesian GP model and leverage high-performance computing resources to enable the analysis of massive data sets. We demonstrate the favorable performance of our novel kernel relative to existing exact and approximate GP methods across a variety of synthetic data examples. Furthermore, we conduct space–time prediction based on more than 1 million measurements of daily maximum temperature and verify that our results outperform state-of-the-art methods in the Earth sciences. More broadly, having access to exact GPs that use ultra-scalable, sparsity-discovering, nonstationary kernels allows GP methods to truly compete with a wide variety of machine learning methods.

Gaussian processes↗
DOE OSTI2026

Graph Identification of Proteins in Tomograms (GRIP-Tomo) 2.0: Topologically aware classification for proteins

Cryo-electron tomography (cryo-ET) enables structural characterization of biomolecules under near-native conditions. Existing approaches for interpreting the resulting three-dimensional volumes are computationally expensive and have difficulty interpreting density associated with small proteins/complexes. To explore alternate approaches for identifying proteins in cryo-ET data we pursued a Graph Network and topologically invariant approach. Here, we report on a fast algorithm that classifies particles by searching for nuances of evolutionarily conversed motifs and the geometrical characteristics of protein structure. GRIP-Tomo 2.0 is a machine-learning pipeline that extracts interpretable topological features of protein structures within noisy experimental backgrounds. Compared to version 1.0, the new pipeline includes three upgrades that significantly improve performance including synthetic tomogram generation simulating realistic noise, graph-based persistent feature extraction as protein fingerprints, and high-performance computing acceleration. GRIP-Tomo 2.0 achieves over 90% accuracy in classifying between proteins and noise using both real and synthetic datasets which represents a foundational step toward advancing cryo-ET workflows and empowering automated visual proteomics.

Li, Chengxuan↗
DOE OSTI2025

Assessing VQLS for Fluid Dynamics on a Hybrid Quantum-HPC Stack

Recent advances in quantum linear solvers offer a promising direction for accelerating extreme scientific computations such as fluid dynamics. However, the deep and complex circuits required by many quantum algorithms limit their practical use on current quantum hardware. The Variational Quantum Linear Solver (VQLS) presents a viable alternative for near-term quantum devices (NISQ), and initial efforts have explored its application to select fluid dynamics problems. In this work, we evaluate the use of VQLS for canonical fluid dynamics problems, aiming to identify pathways for generalizing its implementation across a broader class of systems. We analyze the impact of various circuit ansatz and classical optimizers on solution quality and convergence behavior. Furthermore, we assess the algorithm's feasibility within a hybrid quantum–high-performance computing (HPC) framework by porting it to QFw, a state-of-the-art quantum-HPC software stack. 11This manuscript has been authored by UT-Battelle, LLC, under contract DE-AC05-00OR22725 with the US Department of Energy (DOE). The US government retains and the publisher, by accepting the article for publication, acknowledges that the US government retains a nonexclusive, paid-up, irrevocable, worldwide license to publish or reproduce the published form of this manuscript, or allow others to do so, for US government purposes. DOE will provide public access to these results of federally sponsored research in accordance with the DOE Public Access Plan. This research used resources of the Oak Ridge Leadership Computing Facility at the Oak Ridge National Laboratory, which is supported by the Office of Science of the US DOE under Contract No. DE-AC05-00OR22725.

Gopalakrishnan Meena, Murali [ORNL] (ORCID:0000000↗