Search NASA⌕ Search

SEARCH · Search NASA

Results for “OSCAR”

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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Hund's coupling governed orbital-selective superconductivity in Ba 1−𝑥 ⁢K 𝑥⁢ Fe 2 ⁢As 2

Understanding how strong electronic correlations shape superconductivity remains a central challenge in quantum materials. In multiorbital systems, correlations driven by Hund's coupling can differentiate the behavior of individual orbitals, producing the so-called Hund's metal state. How such orbital-selectivity also governs superconducting pairing, however, has remained largely unexplored experimentally. Here, in this study, we use high-resolution angle-resolved photoemission spectroscopy to systematically map the superconducting gap structure across the phase diagram of the representative iron-based superconductor Ba 1−x K x Fe 2 As 2 . We find that superconductivity evolves in a strongly orbital-dependent manner: the gap associated with the d xy orbital collapses beyond optimal doping while pairing on the d xz /d yz orbitals persists. This behavior mirrors the orbital-selective correlations observed in the normal state and reveals a direct connection between Hund's metal physics and the superconducting pairing landscape. Our results demonstrate that superconducting gaps themselves can serve as a sensitive probe of orbital-dependent correlations and suggest that Hund's coupling plays a central role in shaping pairing in multiorbital superconductors.

Corbae, Elena [SLAC National Accelerator Laborator↗
DOE OSTI2025

Kerr effective black hole geometries in supergravity

We derive the explicit embedding of the effective Kerr spacetimes, which are pertinent to the vanishing of static Love numbers, soft hair descriptions of Kerr black holes, and low-frequency scalar-Kerr scattering amplitudes, as solutions within 𝑁 = 2 supergravity. These spacetimes exhibit a hidden 𝑆⁢𝐿⁡(2,𝑅) × 𝑈⁡(1) or 𝑆⁢𝑂⁡(4,2) symmetry resembling the so called subtracted geometries with 𝑆⁢𝐿⁡(2,𝑅) × 𝑆⁢𝐿⁡(2,𝑅) symmetry, which accurately represent the near-horizon geometry of Kerr black holes and, as we will argue most accurately represents the internal structure of the Kerr black hole. To quantify the differences among the effective Kerr spacetimes, we compare their physical quantities, internal structures, and geodesic equations. Although their thermodynamic properties, including entropy, match those of Kerr, our study uncovers significant differences in the interiors of these effective Kerr solutions. A careful examination of the internal structure of the spacetimes highlights the distinctions between various effective Kerr geometries and their quasinormal spectra.

quantum aspects of black holes↗
DOE OSTI2021

Millisecond timescale reactions observed via X-ray spectroscopy in a 3D microfabricated fused silica mixer

Determination of electronic structures during chemical reactions remains challenging in studies which involve reactions in the millisecond timescale, toxic chemicals, and/or anaerobic conditions. Here, a three-dimensionally (3D) microfabricated microfluidic mixer platform that is compatible with time-resolved X-ray absorption and emission spectroscopy (XAS and XES, respectively) is presented. This platform, to initiate reactions and study their progression, mixes a high flow rate (0.50–1.5 ml min –1 ) sheath stream with a low-flow-rate (5–90 µl min –1 ) sample stream within a monolithic fused silica chip. The chip geometry enables hydro­dynamic focusing of the sample stream in 3D and sample widths as small as 5 µm. The chip is also connected to a polyimide capillary downstream to enable sample stream deceleration, expansion, and X-ray detection. In this capillary, sample widths of 50 µm are demonstrated. Further, convection–diffusion-reaction models of the mixer are presented. The models are experimentally validated using confocal epifluorescence microscopy and XAS/XES measurements of a ferricyanide and ascorbic acid reaction. The models additionally enable prediction of the residence time and residence time uncertainty of reactive species as well as mixing times. Residence times (from initiation of mixing to the point of X-ray detection) during sample stream expansion as small as 2.1 ± 0.3 ms are also demonstrated. Importantly, an exploration of the mixer operational space reveals a theoretical minimum mixing time of 0.91 ms. The proposed platform is applicable to the determination of the electronic structure of conventionally inaccessible reaction intermediates.

3D microfabrication↗
DOE OSTI2024

Community recommendations on cryoEM data archiving and validation

In January 2020, a workshop was held at EMBL-EBI (Hinxton, UK) to discuss data requirements for the deposition and validation of cryoEM structures, with a focus on single-particle analysis. The meeting was attended by 47 experts in data processing, model building and refinement, validation, and archiving of such structures. This report describes the workshop's motivation and history, the topics discussed, and the resulting consensus recommendations. Some challenges for future methods-development efforts in this area are also highlighted, as is the implementation to date of some of the recommendations.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2023

Medium Voltage Solid State Transformer for Extreme Fast Charging Applications

A modular and scalable solid state transformer (SST) with direct medium voltage (MV) AC connectivity is proposed to enable DC extreme fast charging (XFC) of electric vehicles. Single-phase-modules (SPMs), each consisting of an active-front-end (AFE) stage and an isolated DC-DC stage, are connected in input-series-output-parallel (ISOP) configuration. The modular hardware is co-designed with decentralized control of the DC-DC stages where voltage and power balancing are achieved by each SPM using only its local sensor feedback; a centralized controller (CC) regulates the low voltage (LV) DC bus through the AFE stages without any sensor feedback form the SPMs. The controller architecture contrasts sharply with the prior art for MV AC to LV DC SSTs where high-speed bidirectional communication among SPMs and a CC are required for module-level voltage and power balancing, which severely limits the scalability and practical realization of higher voltage and higher power units. Detailed small-signal analysis and controller design guidelines are developed. Furthermore, a soft start-up strategy is presented. The proposed converter and control structure are validated through simulation and experimental results.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2022

Decentralized Interleaving of Cascaded H-Bridge Multi-Level Converters

This document proposes a simple method to decentralize the interleaving for cascaded H bridge (CHB) converters. In the proposed approach, a single signal sent from the Central controller (CC) to Local Controllers (LC) contains information about the desired pulse width and is synchronized with respect to other LC. While centralized controllers need individual signals for each of the CHB modules, the proposed method requires a single signal per phase which decreases the number of PWM channels needed. A detailed explanation of the proposed method is presented. Experimental results are presented that show the interleaving of two CHB modules for an example DC to AC application.

Montes, Oscar Andres↗
DOE OSTI2021

Addressing Load Imbalance in Bioinformatics and Biomedical Applications: Efficient Scheduling across Multiple GPUs

Computational bioinformatics and biomedical applications frequently contain heterogeneously sized units of work or tasks, for instance due to variability in the sizes of biological sequences and molecules. Variable-sized workloads lead to load imbalances in parallel implementations which detract from efficiency and performance. Many modern computing resources now have multiple graphics processing units(GPUs) per computer for acceleration. These multiple GPU resources need to be used efficiently through balancing of workloads across the GPUs. OpenMP is a portable directive-based parallel programming API used ubiquitously in bioscience applications to program CPUs; recently, the use of OpenMP directives for GPU acceleration has become possible. Here, motivated by experiences with imbalanced loads in GPU-accelerated bioinformatics applications, we address the load balancing problem using OpenMP task-to-GPU scheduling combined with OpenMP GPU offloading for multiply heterogeneous workloads – loads with both variable input sizes, and simultaneously, variable convergence rates for algorithms with a stochastic component – scheduled across multiple GPUs. We aim to develop strategies which are both easy to use and have lower overheads, and may be incorporated incrementally in existing programs which already make use of OpenMP for CPU-based threading in order to make use of multi-GPU computers. We test different combinations of input size variability and convergence rate variability, and characterize the effects of these different scenarios on the performance of scheduling strategies across multiple GPUs with OpenMP. We present several dynamic scheduling solutions for different parallel patterns, explore optimizations, and provide publicly available example computational kernels to make these strategies easy to use in programs. This work will enable application developers to efficiently and easily use multiple GPUs for imbalanced workloads found in bioinformatics and biomedical applications.

Thavappiragasam, Mathialakan↗
DOE OSTI2026

Toward Energy-Efficient HPC: Insights from Power Profiling a Cloud-Resolving Earth System Model

Power is a fundamental constraint as supercomputing advances to exascale. Efficient operation within strict power budgets requires application-aware power management based on a detailed understanding of application-level power behavior. This work analyzes the Energy Exascale Earth System Model (E3SM) atmosphere component, SCREAM, on Perlmutter (NERSC) and Frontier (OLCF). We characterize power variation across inputs, concurrency levels, and power caps, evaluate the energy impact of code optimizations, and attribute energy within the code using a newly developed GPU energy model. Results show that SCREAM’s peak power remains stable during its core execution phase and decreases gradually as concurrency increases. Power capping experiments reveal a performance–energy "sweet spot". On Perlmutter, limiting GPU power to 50% of thermal design power (TDP) achieves up to 15% energy savings with a 7% performance penalty. On Frontier, a 40% TDP cap yields up to 10% energy savings with less than 10% performance loss. Code optimizations reduce SCREAM energy by shortening run time without increasing power. Modeling reveals a critical insight: data movement accounts for approximately 70% of SCREAM’s GPU energy. This fundamentally shifts the optimization focus from FLOPS to data transfer reduction for this class of applications, offering the most impactful strategy for improving energy efficiency. This work establishes a foundation for practical, application-aware power management at exascale.

Zhao, Zhengji [Lawrence Berkeley National Laborato↗
DOE OSTI2025

Implementing Directive-Based Deferred Execution for Effective Network Aggregation

Remote direct memory access technology provides an efficient mechanism for one-sided communication that can be leveraged to implement a distributed shared memory programming model. However, when applications generate large numbers of small, irregular messages, network congestion often arises. Existing solutions address this small message problem by facilitating message aggregation but typically require disruptive code transformations that detract from the algorithmic intent of applications, or can be limited by dependent operations on aggregated data between synchronisation points. A solution is to use a directive-assisted approach that enables compilers to transform code dependent on aggregated communication for deferred execution. This paper presents an algorithm that a compiler can use to implement and optimise deferred execution for code dependent on aggregated data, based on an "aggregation context" extension for the OpenSHMEM partitioned global address space library. This new capability addresses a key challenge of message aggregation, allowing its full potential to reduce network congestion and enhance programmability to be realised.

Welch, Aaron [ORNL]↗
DOE OSTI2026

Energy–Performance Trade-offs in Privacy-Preserving Federated Learning on SmartNIC-Enabled HPC Systems

Federated learning (FL) is increasingly deployed on accelerator-rich high-performance computing (HPC) systems, yet the system-level energy cost of privacy-aware FL remains poorly understood, particularly across heterogeneous networking and server-placement options. We present a measurement-driven study of energy–performance trade-offs for FL on GH200-class nodes across three deployment configurations: CPU-Ethernet, CPU-InfiniBand (RDMA-capable), and a DPU-hosted FL server over InfiniBand using a BlueField-3 SmartNIC/DPU. Using NVIDIA FLARE (NVFLARE), we align node-level power telemetry with per-round timing extracted from NVFLARE logs to quantify time-to-solution (TTS), energy-to-solution (ETS), energy-delay product (EDP), and synchronization behavior for three transformer models (ALBERT, DistilBERT, BERT), trained with and without differential privacy (DP). We find that interconnect choice is the dominant driver of runtime and energy: host-managed InfiniBand consistently reduces communication overhead versus Ethernet, yielding lower TTS/ETS/EDP. In contrast, in our NVFLARE deployment, placing the FL server on the DPU does not consistently match CPU-InfiniBand performance and can be slower—especially for larger models—highlighting that server placement alone is not sufficient to guarantee end-to-end gains. Finally, under our fixed-round protocol, DP increases per-round cost and runtime variance; ETS increases largely in proportion to TTS because average node power remains relatively stable across configurations.

Kotevska, Olivera [ORNL] (ORCID:0000000316772243)↗
DOE OSTI2026

SO(3)-invariant PCA with application to molecular data

Principal component analysis (PCA) is a fundamental technique for dimensionality reduction and denoising; however, its application to three-dimensional data with arbitrary orientations -- common in structural biology -- presents significant challenges. A naive approach requires augmenting the dataset with many rotated copies of each sample, incurring prohibitive computational costs. In this paper, we extend PCA to 3D volumetric datasets with unknown orientations by developing an efficient and principled framework for SO(3)-invariant PCA that implicitly accounts for all rotations without explicit data augmentation. By exploiting underlying algebraic structure, we demonstrate that the computation involves only the square root of the total number of covariance entries, resulting in a substantial reduction in complexity. We validate the method on real-world molecular datasets, demonstrating its effectiveness and opening up new possibilities for large-scale, high-dimensional reconstruction problems.

Fraiman, Michael [Tel Aviv Univ., Tel Aviv (Israel↗
DOE OSTI2020

Supercomputing Pipelines Search for Therapeutics Against COVID-19

The urgent search for drugs to combat SARS-CoV-2 has included the use of supercomputers. The use of general-purpose graphical processing units (GPUs), massive parallelism, and new software for high-performance computing (HPC) has allowed researchers to search the vast chemical space of potential drugs faster than ever before. We developed a new drug discovery pipeline using the Summit supercomputer at Oak Ridge National Laboratory to help pioneer this effort, with new platforms that incorporate GPU-accelerated simulation and allow for the virtual screening of billions of potential drug compounds in days compared to weeks or months for their ability to inhibit SARS-COV-2 proteins. Here, this effort will accelerate the process of developing drugs to combat the current COVID-19 pandemic and other diseases.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2021

Performance Portability of Molecular Docking Miniapp On Leadership Computing Platforms

Rapidly changing computer architectures, such as those found at high-performance computing (HPC) facilities, present the need for mini-applications (miniapps) that capture essential algorithms used in large applications to test program performance and portability, aiding transitions to new systems. The COVID-19 pandemic has fueled a flurry of activity in computational drug discovery, including the use of supercomputers and GPU acceleration for massive virtual screens for therapeutics. Recent work targeting COVID-19 at the Oak Ridge Leadership Computing Facility (OLCF) used the GPU-accelerated program AutoDock-GPU to screen billions of compounds on the Summit supercomputer. In this paper we present the development of a new miniapp, miniAutoDock-GPU, that can be used to evaluate the performance and portability of GPU-accelerated protein-ligand docking programs on different computer architectures. These tests are especially relevant as facilities transition from petascale systems and prepare for upcoming exascale systems that will use a variety of GPU vendors. The key calculations, namely, the Lamarckian genetic algorithm combined with a local search using a Solis-Wets based random optimization algorithm, are implemented. We developed versions of the miniapp using several different programming models for GPU acceleration, including a version using the CUDA runtime API for NVIDIA GPUs, and the Kokkos middle-ware API which is facilitated by C++ template libraries. A third version, currently in progress, uses the HIP programming model. These efforts will help facilitate the transition to exascale systems for this important emerging HPC application, as well as its use on a wide range of heterogeneous platforms.

Thavappiragasam, Mathialakan↗
DOE OSTI2024

Impacts of floating-point non-associativity on reproducibility for HPC and deep learning applications

Run to run variability in parallel programs caused by floating-point non-associativity has been known to significantly affect reproducibility in iterative algorithms, due to accumulating errors. Non-reproducibility can critically affect the efficiency and effectiveness of correctness testing for stochastic programs. Recently, the sensitivity of deep learning training and inference pipelines to floating-point non-associativity has been found to sometimes be extreme. It can prevent certification for commercial applications, accurate assessment of robustness and sensitivity, and bug detection. New approaches in scientific computing applications have coupled deep learning models with high-performance computing, leading to an aggravation of debugging and testing challenges. Here we perform an investigation of the statistical properties of floating-point non-associativity within modern parallel programming models, and analyze performance and productivity impacts of replacing atomic operations with deterministic alternatives on GPUs. We examine the recently-added deterministic options in PyTorch within the context of GPU deployment for deep learning, uncovering and quantifying the impacts of input parameters triggering run to run variability and reporting on the reliability and completeness of the documentation. Finally, we evaluate the strategy of exploiting automatic determinism that could be provided by deterministic hardware, using the Groq LPUTM accelerator for inference portions of the deep learning pipeline. We demonstrate the benefits that a hardware-based strategy can provide within reproducibility and correctness efforts.

Shanmugavelu, Sanjif↗