Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “NVIDIA”

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 361 records · Page 20

Porting OVERFLOW CFD Code to GPUs: To Hackathons and Beyond!

OVERFLOW is an overset, structured computational fluid dynamics (CFD) code written in Fortran which is widely used in the government, industry, and academia. Over the last several years the OVERFLOW developers have been working to port miniapps based on computationally expensive parts of OVERFLOW to run on GPUs, primarily using OpenACC. This effort started at our first hackathon in 2019 and since then the OVERFLOW team has attended two additional hackathons (virtually). These hackathon environments have provided a great place to collaborate with others and learn from experts. These learning experiences enabled porting two miniapps to run effectively on NVIDIA GPUs using OpenACC. The first miniapp focused on motifs found in the solver itself and the final ported version runs three times fast ona single V100 compared to a 40 core, dual-socket Intel Skylake node. The speed up in this solverminiapp required multiple design changes including increasing the amount of parallelism available and the amount of work performed in each kernel. The second miniapp focused on overset MPI communication, also saw significant speedups over the CPU implementation using a CUDA-aware MPI implementation through OpenACC. This presentation will discuss our experience at the hackathons, our process of porting the miniapps to run on the GPUs, and several lessons learned throughout.

OpenACC↗

Earth System Digital Twins (ESDT)

"First Webinar for a digital twin webinar series titled ""Digital Twin Webinar Series 1: Concept, Practices, and Vision"". This kick-off webinar will focus on concepts, architecture and high level discussion on digital twins for Earth science and other domain sciences. The agenda will be the following: - Dr. Jacqueline Le Moigne is NASA AIST program manager, and the first federal program manager to programmatically fund 14 digital twin research projects. - Mr. Stan Posey is the HPC Program Manager, ESM and CFD Domains at NVIDIA. - Dr. Goodchild is a emeritus professor at UCSB, member of the national academy, and a founder of digital earth international society."

Information Systems↗

NASA Earth Science Technology Office (ESTO) Advanced Information Systems Technology (AIST) Program: Earth Systems Digital Twins (ESDT) Standards for Interoperable Digital Twins Workshop Presentations

On September 18, 2023, NASA Earth Science Technology Office (ESTO) Advanced Information Systems Technology (AIST) Program conducted a mini-workshop that brought together seven experts to survey and discuss "Standards for Interoperable Digital Twins". Since three years, the AIST Program has been developing technologies and prototypes for Earth System Digital Twins (ESDT). During those developments and after the ESDT Workshop held in October 2022, it became clear that standard for ESDT interoperability were needed and should be defined as soon as possible. To address this challenge, the AIST program will survey ongoing development for Digital Twins standards in various domains and the September 18, 2023 Workshop represented the first step towards this understanding. Speakers during this event included: Michael Grieves (Digital Twin Institute), Siri Jodha Singh Khalsa (IEEE GRSS Standards), Trent Tinker (OGC), Ryan Berkheimer (NOAA), John Stone (NVIDIA), Thomas Geenen (ECMWF-DestinE) and Arne Berre (SINTEF-Iliad DTO and EDITO). This presentation regroups all the speakers' presentations.

Earth Science Remote Sensing; Information Systems↗

Standards for Interoperable Digital Twins

On September 18, 2023, NASA Earth Science Technology Office (ESTO) Advanced Information Systems Technology (AIST) Program conducted a mini-workshop that brought together seven experts to survey and discuss "Standards for Interoperable Digital Twins". Since three years, the AIST Program has been developing technologies and prototypes for Earth System Digital Twins (ESDT). During those developments and after the ESDT Workshop held in October 2022, it became clear that standard for ESDT interoperability were needed and should be defined as soon as possible. To address this challenge, the AIST program will survey ongoing development for Digital Twins standards in various domains and the September 18, 2023 Workshop represented the first step towards this understanding. Speakers during this event included: Michael Grieves (Digital Twin Institute), Siri Jodha Singh Khalsa (IEEE GRSS Standards), Trent Tinker (OGC), Ryan Berkheimer (NOAA), John Stone (NVIDIA), Thomas Geenen (ECMWF-DestinE) and Arne Berre (SINTEF-Iliad DTO and EDITO). This movie represents the recording of this event.

Earth Science Remote Sensing↗

Strategies for the GPU Implementation of the OVERFLOW CFD Code

Wondering how to port a large, computational fluid dynamics (CFD) solver, written in Fortran, to run effectively on GPUs? Join this talk to learn about the strategies NASA’s OVERFLOW CFD code has used to effectively utilize GPUs to greatly improve the time to solution compared to CPUs. OVERFLOW is an overset, structured grid, computational fluid dynamics (CFD) flow solver developed by NASA and widely used by government, US industry, and academia. It is known for its effective use of CPU hardware, but this talk will discuss recent efforts to modify the code to run efficiently on GPUs. We will describe our use of OpenACC, CUDA Fortran, and CUDA C++, discussing why and how we use each to map our problem onto NVIDIA GPUs. We will also describe structural changes we made in the code to expose enough parallelism to effectively use the GPU hardware. Finally, we will present the performance benefits from running OVERFLOW on GPUs compared to the well optimized CPU version of the code.

GPU Programming↗

Optimizing Air Traffic - Integrating Artificial Intelligence and Machine Learning in Flight Path Planning and 3D Airspace Visualization for Air Traffic Control

Air Traffic Control (ATC) systems are vital components of the National Airspace System (NAS). ATC, Airport Traffic Control Towers (ATCT), and Terminal Radar Approach Control (TRACON) are responsible for directing all flights departing from and arriving at airports, managing our nation’s airspace, preventing potential accidents, and ensuring that every flight is accounted for. However, these systems often face challenges in effectively monitoring the skies. Issues such as poor communication between operators, difficulty in performing operations, and the constant need for vigilance frequently burden ATC operators. Additionally, the projected increase in air traffic in the coming years will only exacerbate the stress associated with this role. To address these issues, we propose a system that assists ATC operators in situations such as handovers, emergencies, and routing aircraft to avoid weather hazards. Our solution includes an Artificial Intelligence (AI) and Machine Learning (ML)-based Flight Pathways Planning System (FPPS) designed to find the fastest and most optimal routes for aircraft, taking into account weather conditions, restricted terrain, and Extended-Range Twin-Engine Operational Performance Standards (ETOPS) ratings. The proposed Predictive Weather Planning Model, included in FPPS, adjusts routes based on real-time and forecasted weather conditions. Additionally, our NVIDIA Omniverse 3D Visualization System offers a highly interactive environment for better visualization and a clear view of the airspace. By incorporating these systems, the roles of ATC, ATCT, and TRACON operators will become more manageable and less stressful, equipping them to efficiently handle the growing density of airspace.

Regina Ayoubi↗

X-Hab 2026: LiDAR-Powered Autonomous Charging Service Capability for Surface Rovers and Systems

This document details the timeline of the LiDAR-Powered Autonomous Charging Service Capability for Surface Rovers and Systems project, initiated by the Fall 2025 semester class and completed by the Spring 2026 semester class. This project focuses on developing a fully autonomous system composed of a mobile surface rover and an induction charging station with a robotic arm, both controlled by their own NVIDIA Jetson Orin Nano. Structural improvements to the rover suspension system and body eliminated excessive camber, reduced stress and strain on the plexiglass body, and improved maneuverability and durability of the rover. The charging station robotic arm was fully redesigned to increase reach while minimizing weight and increasing misalignment tolerance during docking on uneven terrain. Electrical system improvements addressed previous torque and power limitations of both the rover and charging station arm. High-torque servo motors were selected based on updated calculations which incorporated terrain slope and Factor of Safety, enabling zero-point turning for the rover and increased payload capacity of the charging station arm. Significant progress was made in autonomy and perception. The rover now employs 3D LiDAR and SLAM mapping for localization, mapping, and path planning. The Battery Monitoring System (BMS) was created to coordinate battery management between the rover and charging station. The BMS provides continuous monitoring of battery state of charge, temperature, current, and will enable the autonomous initiation, execution, and termination of the charging cycle via Bluetooth communication. Testing of the WIBOTIC induction charging system demonstrated reliable power transfer under both aligned and misaligned conditions. This project demonstrated the ability of an autonomously navigating surface rover to independently plan a path to the charging station, dock, and the charging station to autonomously deploy a robotic charging arm and initiate charging of the rover. This work details the progress made to demonstrate the feasibility of autonomous surface rover navigation and recharging systems.

Megan Steele↗

Highly-scalable, physics-informed GANs for learning solutions of stochastic PDEs

Uncertainty quantification for forward and inverse problems is a central challenge across physical and biomedical disciplines. We address this challenge for the problem of modeling subsurface flow at the Hanford Site by combining stochastic computational models with observational data using physics-informed GAN models. The geographic extent, spatial heterogeneity, and multiple correlation length scales of the Hanford Site require training a computationally intensive GAN model to thousands of dimensions. We develop a highly optimized implementation that scales to {\herogpucount} NVIDIA Volta GPUs. We develop a hierarchical scheme based on a multi-player game-theoretic approach for exploiting domain parallelism, map discriminators and generators to multiple GPUs, and employ efficient communication schemes to ensure training stability and convergence. Our implementation scales to {\heronodecount} nodes on the Summit supercomputer with a \weakscalingeff\% scaling efficiency, achieving peak and sustained half-precision rates of {\heropeakperf} PF/s and {\herosustainedperf} PF/s.

physics informed ML, machine learning, generative ↗

Reconstruction of Charged Particle Tracks in Realistic Detector Geometry Using a Vectorized and Parallelized Kalman Filter Algorithm

One of the most computationally challenging problems expected for the High-Luminosity Large Hadron Collider (HL-LHC) is finding and fitting particle tracks during event reconstruction. Algorithms used at the LHC today rely on Kalman filtering, which builds physical trajectories incrementally while incorporating material e ects and error estimation. Recognizing the need for faster computational throughput, we have adapted Kalman-filterbased methods for highly parallel, many-core SIMD and SIMT architectures that are now prevalent in high-performance hardware. Previously we observed significant parallel speedups, with physics performance comparable to CMS standard tracking, on Intel Xeon, Intel Xeon Phi, and (to a limited extent) NVIDIA GPUs. While early tests were based on artificial events occurring inside an idealized barrel detector, we showed subsequently that our mkFit software builds tracks successfully from complex simulated events (including detector pileup) occurring inside a geometrically accurate representation of the CMS-2017 tracker. Here, we report on advances in both the computational and physics performance of mkFit, as well as progress toward integration with CMS production software. Recently we have improved the overall eciency of the algorithm by preserving short track candidates at a relatively early stage rather than attempting to extend them over many layers. Moreover, mkFit formerly produced an excess of duplicate tracks; these are now explicitly removed in an additional processing step. We demonstrate that with these enhancements, mkFit becomes a suitable choice for the first iteration of CMS tracking, and eventually for later iterations as well. We plan to test this capability in the CMS High Level Trigger during Run 3 of the LHC, with an ultimate goal of using it in both the CMS HLT and oine reconstruction for the HL-LHC CMS tracker.

Cerati, Giuseppe↗

Performance Evaluation of Python Based Data Analytics Frameworks in Summit: Early Experiences

The explosion in the volumes of data generated from ever-larger simulation campaigns and experiments or observations necessitates competent tools for data wrangling and analysis). While the Oak Ridge Leadership Computing Facility (OLCF) provides a variety of tools to perform data wrangling and data analysis tasks, Python based tools often lack scalability, or the ability to fully exploit the computational capability of OLCF’s Summit supercomputer. NVIDIA RAPIDS and Dask offer a promising solution to accelerate and distribute data analytics workloads from personal computers to heterogeneous supercomputing systems. We discuss early performance evaluation results of RAPIDS and Dask on Summit to understand their capabilities, scalability, and limitations. Our evaluation includes a subset of RAPIDS libraries, i.e., cuDF, cuML, and cuGraph, and Chainer’s CuPy, and their multi-GPU variants when available.We also draw on the observed trends from the performance evaluation results to discuss best practices for maximizing performance.

Hernandez Arreguin, Benjamin↗

Generic, Sparse Tensor Core for Neural Networks

Sparse neural network attracts more attention for model compression, fast execution, and power reduction. The state-of-the-art designed sparse tensor core for structured and static sparsity, which did not support well for generic or dynamic sparsity. We design a sparse tensor core to support generic sparsity pruning with a novel hybrid and blocked sparse matrix storage format, HB-ELL, which saves computation and storage while keeping the most significant elements, as well as supporting dynamic sparsity for data flow in neural networks. We achieve better performance with preliminary results than the state-of- the-art on an NVIDIA GPU simulator.

Wu, Xiaolong↗

Revisiting Huffman Coding: Toward Extreme Performance on Modern GPU Architectures

Today's high-performance computing (HPC) applications are producing vast volumes of data, which are challenging to store and transfer efficiently during the execution, such that data compression is becoming a critical technique to mitigate the storage burden and data movement cost. Huffman coding is arguably the most efficient Entropy coding algorithm in information theory, such that it could be found as a fundamental step in many modern compression algorithms such as DEFLATE. On the other hand, today's HPC applications are more and more relying on the accelerators such as GPU on supercomputers, while Huffman encoding suffers from low throughput on GPUs, resulting in a significant bottleneck in the entire data processing. In this paper, we propose and implement an efficient Huffman encoding approach based on modern GPU architectures, which addresses two key challenges: (1) how to parallelize the entire Huffman encoding algorithm, including codebook construction, and (2) how to fully utilize the high memory-bandwidth feature of modern GPU architectures. The detailed contribution is fourfold. (1) We develop an efficient parallel codebook construction on GPUs that scales effectively with the number of input symbols. (2) We propose a novel reduction based encoding scheme that can efficiently merge the codewords on GPUs. (3) We optimize the overall GPU performance by leveraging the state-of-the-art CUDA APIs such as Cooperative Groups. (4) We evaluate our Huffman encoder thoroughly using six real-world application datasets on two advanced GPUs and compare with our implemented multithreaded Huffman encoder. Experiments show that our solution can improve the encoding throughput by up to 5.0× and 6.8× on NVIDIA RTX 5000 and V100, respectively, over the state-of-the-art GPU Huffman encoder, and by up to 3.3× over the multithread encoder on two 28-core Xeon Platinum 8280 CPUs.

Tian, Jiannan↗

Parallelizing the Unpacking and Clustering of Detector Data for Reconstruction of Charged Particle Tracks on Multi-core CPUs and Many-core GPUs

We present results from parallelizing the unpacking and clustering steps of the raw data from the silicon strip modules for reconstruction of charged particle tracks. Throughput is further improved by concurrently processing multiple events using nested OpenMP parallelism on CPU or CUDA streams on GPU. The new implementation along with earlier work in developing a parallelized and vectorized implementation of the combinatoric Kalman filter algorithm has enabled efficient global reconstruction of the entire event on modern computer architectures. We demonstrate the performance of the new implementation on Intel Xeon and NVIDIA GPU architectures.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Enabling Combustion Science Simulations for Future Exascale Machines

Reacting flow simulations for combustion applications require extensive computing capabilities. Leveraging the AMReX library, the Pele suite of combustion simulation tools targets the largest supercomputers available and future exascale machines. We introduce PeleC, the compressible solver in the Pele suite, and detail its capabilities, including complex geometry representation, chemistry integration, and discretization. We present a comparison of development efforts using both OpenACC and AMReX's C++ performance portability framework for execution on multiple GPU architectures. We discuss relevant details that have allowed PeleC to achieve high performance and scalability. PeleC's performance characteristics are measured through relevant simulations on multiple supercomputers. The success of PeleC's design for exascale is exhibited through demonstration of a 160 billion cell simulation and weak scaling onto 100\% of Summit, an NVIDIA-based GPU supercomputer at Oak Ridge National Laboratory. Our results provide confidence that PeleC will enable future combustion science simulations with unprecedented fidelity.

combustion↗

Anderson Acceleration for Distributed Training of Deep Learning Models

Anderson acceleration (AA) is an extrapolation technique that has recently gained interest in the deep learning (DL) community to speed-up the sequential training of DL models. However, when performed at large scale, the DL training is exposed to a higher risk of getting trapped into steep local minima of the training loss function, and standard AA does not provide sufficient acceleration to escape from these steep local minima. This results in poor generalizability and makes AA ineffective. To restore AA’s advantage to speed-up the training of DL models on large scale computing platforms, we combine AA with an adaptive moving average procedure that boosts the training to escape from steep local minima. By monitoring the relative standard deviation between consecutive iterations, we also introduce a criterion to automatically assess whether the moving average is needed. We applied the method to the following DL instantiations for image classification: (i) ResNet50 trained on the open-source CIFAR100 dataset and (ii) ResNet50 trained on the open-source ImageNet1k dataset. Numerical results obtained using up to 1,536 NVIDIA V100 GPUs on the OLCF supercomputer Summit showed the stabilizing effect of the moving average on AA for all the problems above.

Lupo Pasini, Massimiliano↗

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

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

Lupo Pasini, Massimiliano↗