SEARCH · Search NASA

Results for “High Performance Networking”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 901 records · Page 50

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Explicitly antisymmetrized neural network layers for variational Monte Carlo simulation

The combination of neural networks and quantum Monte Carlo methods has arisen as a promising path forward for highly accurate electronic structure calculations. Previous proposals have combined equivariant neural network layers with a final antisymmetric layer in order to satisfy the antisymmetry requirements of the electronic wavefunction. However, to date it is unclear if one can represent antisymmetric functions of physical interest, and it is difficult to precisely measure the expressiveness of the antisymmetric layer. Here, this work attempts to address this problem by introducing explicitly antisymmetrized universal neural network layers. This approach has a computational cost which increases factorially with respect to the system size, but we are nonetheless able to apply it to small systems to better understand how the structure of the antisymmetric layer affects its performance. We first introduce a generic antisymmetric (GA) neural network layer, which we use to replace the entire antisymmetric layer of the highly accurate ansatz known as the FermiNet. We demonstrate that the resulting FermiNet-GA architecture can yield effectively the exact ground state energy for small atoms and molecules. We then consider a factorized antisymmetric (FA) layer which more directly generalizes the FermiNet by replacing the products of determinants with products of antisymmetrized neural networks. We find, interestingly, that the resulting FermiNet-FA architecture does not significantly outperform the FermiNet. This strongly suggests that the sum of products of antisymmetries is a key limiting aspect of the FermiNet architecture. To explore this further, we investigate a slight modification of the FermiNet, called the full determinant mode, which replaces each product of determinants with a single combined determinant. We find that the full single-determinant FermiNet closes a large part of the gap between the standard single-determinant FermiNet and FermiNet-GA on small atomic and molecular problems. Surprisingly, on the nitrogen molecule at a dissociating bond length of 4.0 Bohr, the full single-determinant FermiNet can outperform the largest standard FermiNet calculation with 64 determinants.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Application of Machine Learning Techniques to an Agent-Based Model of Pantoea

Agent-based modeling (ABM) is a powerful simulation technique which describes a complex dynamic system based on its interacting constituent entities. While the flexibility of ABM enables broad application, the complexity of real-world models demands intensive computing resources and computational time; however, a metamodel may be constructed to gain insight at less computational expense. Here, we developed a model in NetLogo to describe the growth of a microbial population consisting of Pantoea . We applied 13 parameters that defined the model and actively changed seven of the parameters to modulate the evolution of the population curve in response to these changes. We efficiently performed more than 3,000 simulations using a Python wrapper, NL4Py . Upon evaluation of the correlation between the active parameters and outputs by random forest regression, we found that the parameters which define the depth of medium and glucose concentration affect the population curves significantly. Subsequently, we constructed a metamodel, a dense neural network, to predict the simulation outputs from the active parameters and found that it achieves high prediction accuracy, reaching an R 2 coefficient of determination value up to 0.92. Our approach of using a combination of ABM with random forest regression and neural network reduces the number of required ABM simulations. The simplified and refined metamodels may provide insights into the complex dynamic system before their transition to more sophisticated models that run on high-performance computing systems. The ultimate goal is to build a bridge between simulation and experiment, allowing model validation by comparing the simulated data to experimental data in microbiology.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2022

A neural network‐enhanced reproducing kernel particle method for modeling strain localization

Abstract Modeling the localized intensive deformation in a damaged solid requires highly refined discretization for accurate prediction, which significantly increases the computational cost. Although adaptive model refinement can be employed for enhanced effectiveness, it is cumbersome for the traditional mesh‐based methods to perform while modeling the evolving localizations. In this work, neural network‐enhanced reproducing kernel particle method (NN‐RKPM) is proposed, where the location, orientation, and shape of the solution transition near a localization is automatically captured by the NN approximation via a block‐level neural network (NN) optimization. The weights and biases in the blocked parameterization network control the location and orientation of the localization. The designed basic four‐kernel NN block is capable of capturing a triple junction or a quadruple junction topological pattern, while more complicated localization topological patters are captured by the superposition of multiple four‐kernel NN blocks. The standard RK approximation is then utilized to approximate the smooth part of the solution, which permits a much coarser discretization than the high‐resolution discretization needed to capture sharp solution transitions with the conventional methods. A regularization of the NN approximation is additionally introduced for discretization‐independent material responses. The effectiveness of the proposed NN‐RKPM is verified by a series of numerical verifications.

Baek, Jonghyuk↗

DOE OSTI2024

Stabilized Oxygen Vacancy Chemistry toward High-Performance Layered Oxide Cathodes for Sodium-Ion Batteries

Anionic redox has emerged as a transformative paradigm for high-energy layered transition-metal (TM) oxide cathodes, but it is usually accompanied by the formation of anionic redox-mediated oxygen vacancies (OVs) due to irreversible oxygen release. Additionally, external factor-induced OVs (defined as intrinsic OVs) also play a pivotal role in the physicochemical properties of layered TM oxides. However, an in-depth understanding of the interplay between intrinsic and anionic redox-mediated OVs and the corresponding regulation mechanism of the dynamic evolution of OVs is still missing. Herein, we disclose the strong interrelationship between these OVs and demonstrate that the presence of intrinsic OVs in the TMO2 layers could induce weak integrity of the TM-O frameworks and unlock additional diffusion paths to trigger the generation and migration of anionic redox-mediated OVs. Accordingly, an OV stabilization strategy is proposed by deliberately introducing high-valence Nb5+, which could serve as an important building block in anchoring the oxygen sublattice and preventing the formation of a percolating OV migration network, thereby suppressing the formation/diffusion of anionic redox-mediated OVs. Consequently, superb structural integrity and improved electrochemical performance with reversible anionic redox chemistry are achieved. This work advances our understanding of the role of OVs for developing high-performance energy storage systems utilizing anionic redox.

anionic redox↗

DOE OSTI2024

Regulating the Third Metal to Design and Engineer Multilayered NiFeM (M: Co, Mn, and Cu) Nanofoam Anode Catalysts for Anion-Exchange Membrane Water Electrolyzers

In this study, alkaline anion-exchange membrane water electrolyzers (AEMWEs) for green hydrogen production have received intensive attention due to their feasibility of using earth-abundant platinum group metal (PGM)-free catalysts. Herein, the third metal is incorporated into NiFe-based catalysts to regulate their electronic structures and morphologies, aiming to achieve sufficient oxygen evolution reaction (OER) activity and performance in AEMWEs. The ternary NiFeM (M: Cu, Co, or Mn) catalysts are featured with multiple layered structures and nanofoam network morphologies, consisting of highly OER-active amorphous Ni-rich oxide shells and electrically conductive metallic alloy cores. The physical and electronic perturbations to the NiFe induced by a third element lead to a fine-tuning of the redox ability of the metal sites at the reaction centers, which breaks the scaling relationship between OH* and O* intermediates at the reaction centers. Thus, the unique structural configuration and electronic regulation simultaneously benefit catalytic activity and performance improvements. These NiFeM nanofoam catalysts demonstrated promising anode performance in actual AEMWEs, comparable to the IrO 2 reference, especially at high current densities. Notably, using various electrolytes (e.g., KOH solution or pure water) for AEMWEs exhibited a different performance trend among studied NiFeM catalysts, likely due to dynamic changes of catalysts under various OER environments.

25 ENERGY STORAGE↗

DOE OSTI2020

Solution Blowing Synthesis of Li-Conductive Ceramic Nanofibers

Solid state electrolytes (SSEs) offer great potential to enable high-performance and safe lithium (Li) batteries. However, the scale-up synthesis and processing of SSEs is a major challenge. In this work, three-dimensional networks of lithium lanthanum titanite (LLTO) nanofibers are produced through a scale-up technique based on solution blowing. Compared with the conventional electrospinning method, the solution blowing technique enables high-speed fabrication of SSEs (e.g., 15 times faster) with superior productivity and quality. Additionally, the room-temperature ionic conductivity of composite polymer electrolytes (CPEs) formed from solution-blown LLTO fibers is 70% higher than the ones formed from electrospun fibers (1.9 x 10 -4 vs 1.1 x 10 -4 S cm -1 for 10 wt % LLTO fibers). Furthermore, the cyclability of the CPEs made from solution-blown fibers in the symmetric Li cell is more than 2.5 times that of the CPEs made from electrospun fibers. These comparisons here show that solution-blown ion-conductive fibers hold great promise for applications in Li metal batteries.

36 MATERIALS SCIENCE↗

DOE OSTI2019

Message-passing neural networks for high-throughput polymer screening

Machine learning methods have shown promise in predicting molecular properties, and given sufficient training data, machine learning approaches can enable rapid high-throughput virtual screening of large libraries of compounds. Graph-based neural network architectures have emerged in recent years as the most successful approach for predictions based on molecular structure and have consistently achieved the best performance on benchmark quantum chemical datasets. However, these models have typically required optimized 3D structural information for the molecule to achieve the highest accuracy. These 3D geometries are costly to compute for high levels of theory, limiting the applicability and practicality of machine learning methods in high-throughput screening applications. In this study, we present a new database of candidate molecules for organic photovoltaic applications, comprising approximately 91,000 unique chemical structures. Compared to existing datasets, this dataset contains substantially larger molecules (up to 200 atoms) as well as extrapolated properties for long polymer chains. We show that message-passing neural networks trained with and without 3D structural information for these molecules achieve similar accuracy, comparable to state-of-the-art methods on existing benchmark datasets. Furthermore, these results therefore emphasize that for larger molecules with practical applications, near-optimal prediction results can be obtained without using optimized 3D geometry as an input. We further show that learned molecular representations can be leveraged to reduce the training data required to transfer predictions to a new density functional theory functional.

14 SOLAR ENERGY↗

DOE OSTI2020

Enabling Highly Efficient Capsule Networks Processing Through A PIM-Based Architecture Design

In recent years, the CNNs have achieved great successes in the image processing tasks, e.g., image recognition and object detection. Unfortunately, traditional CNN's classication is found to be easily misled by increasingly complex image features due to the usage of pooling operations, hence unable to preserve accurate position and pose information of the objects. To address this challenge, a novel neural network structure called Capsule Network has been proposed, which introduces equivariance through capsules to signicantly enhance the learning ability for image segmentation and object detection. Due to its requirement of performing a high volume of matrix operations, CapsNets have been generally accelerated on modern GPU platforms that provide highly optimized software library for common deep learning tasks. However, based on our performance characterization on modern GPUs, CapsNets exhibit low effciency due to the special program and execution features of their routing procedure, including massive unshareable intermediate variables and intensive syn- chronizations, which are very dicult to optimize at software level. To address these challenges, we propose a hybrid computing architecture design named PIM-CapsNet. It preserves GPU's on-chip computing capability for accelerating CNN types of layers in CapsNet, while pipelining with an off-chip in-memory acceleration solution that effectively tackles routing procedure's ineffciency by leveraging the processing-in-memory capability of today's 3D stacked memory. Using routing procedure's inherent parallellization feature, our design enables hierarchical improvements on CapsNet inference effciency through minimizing data movement and maximizing parallel processing in memory. Evaluation results demonstrate that our proposed design can achieve substantial improvement on both performance and energy savings for CapsNet inference, with almost zero accuracy loss. The results also suggest good performance scalability in optimizing the routing procedure with increasing network size.

Zhang, Xingyao↗

DOE OSTI2026

Distributed Resilience in High-Energy Physics Data Acquisition

Historical experience in the High-Performance Computing community teaches us that as computing systems grow, the instance of failures goes from rare to a regular occurrence. A survey of the growth in the size and complexity of Data AcQuisition (DAQ) networks in High-Energy Physics (HEP) experiments reveals that these networks are scaling exponentially, trending to a point where automated fault handling should be considered over the current manual practice, especially given the rarity of data such as in DUNE's mission to observe core-collapse supernovae. We propose a general system, DiDAQt, which is designed to provide fault detection and handling in HEP DAQs specifically, through MPI-like primitives that allow it to be added easily to existing systems. We evaluate the scalability and response time of a prototype on the FABRIC national testbed, with results indicating sufficient scalability for current and near-future DAQs as well as practical response times (under 1 microsecond decision time).

Wolosewicz, A. [IIT, Chicago]↗

DOE OSTI2026

Oak Ridge Computing Academy: An HPC cluster deployment and management pilot

The High Performance Computing Technologies (HPCT) course is a hands-on High Performance Computing (HPC) cluster deployment and management training program offered as part of the International School for Advanced Studies (SISSA) and the International Center for Theoretical Physics (ICTP) Master in High Performance Computing (MHPC) specialization. Here, this training program introduces students to key concepts in cluster configuration. which include networking, software stack provisioning, job scheduling, and monitoring. The publicly available course materials feature several examples and underlying methods that are broadly applicable to cluster deployment and management. This paper discusses the design of a new workforce development program at the Oak Ridge National Laboratory that is based on HPCT, the Oak Ridge Computing Academy (ORCA). The ORCA pilot program was hosted by the Oak Ridge Leadership Computing Facility (OLCF) in Summer 2025. As a part of this discussion, HPCT and ORCA course contents and infrastructure are outlined, ORCA participant experiences are detailed, and potential opportunities for improvement are discussed.

Education↗

DOE OSTI2018

Controlled Synthesis of Sulfur-Rich Polymeric Selenium Sulfides as Promising Electrode Materials for Long-Life, High-Rate Lithium Metal Batteries

High-energy lithium/sulfur (Li/S) batteries still suffer from unsatisfactory cycle life and poor rate capability caused by the polysulfides shuttle and insulating nature of S cathodes. Here, we report our findings in the controlled synthesis of selenium (Se)-containing S-rich co-polymers of various compositions as novel cathode materials through a facile inverse vulcanization of S with selenium disulfide (SeS2) and 1,3- diisopropenylbenzene (DIB) as co-monomers. Nuclear magnetic resonance and X-ray photoelectron spectroscopy results show that divinyl functional groups of DIB were chemically cross-linked with S/SeS2 chain radicals through a ring-opening polymerization. The newly formed bonds of C-S, C-Se, and S-Se in novel S-SeS2-DIB copolymers effectively alleviate the shuttle effects of polysulfides/polyselenides. Furthermore, various electrochemical techniques confirm the positive roles of Secontaining co-polymers in enhancing the electrode reaction kinetics and the formation of stable solid electrolyte interphase layer with low charge-transfer resistance, leading to improved high-rate performances. The as-synthesized co-polymer was then infiltrated into well-interconnected, porous nanocarbon networks (Ketjenblack EC600JD, KB600) to provide effective paths for the fast electron transport. Due to the synergistic combination of chemical and physical confinement of the reaction intermediates during cycling, good reversibility for 500 cycles with a low decay rate of 0.0549% per cycle was achieved at 1000 mA g-1. These encouraging results suggest that the combination of chemical incorporation of SeS2 into S-rich co-polymer and the physical confinement of carbon networks is a promising strategy for advancing Li/S batteries and their viability for practical applications.

Dong, Panpan↗

DOE OSTI2020

MONACO: accurate biological network alignment through optimal neighborhood matching between focal nodes

Motivation: Alignment of protein–protein interaction networks can be used for the unsupervised prediction of functional modules, such as protein complexes and signaling pathways, that are conserved across different species. To date, various algorithms have been proposed for biological network alignment, many of which attempt to incorporate topological similarity between the networks into the alignment process with the goal of constructing accurate and biologically meaningful alignments. Especially, random walk models have been shown to be effective for quantifying the global topological relatedness between nodes that belong to different networks by diffusing node-level similarity along the interaction edges. However, these schemes are not ideal for capturing the local topological similarity between nodes. Results: Here, we propose MONACO, a novel and versatile network alignment algorithm that finds highly accurate pairwise and multiple network alignments through the iterative optimal matching of ‘local’ neighborhoods around focal nodes. Extensive performance assessment based on real networks as well as synthetic networks, for which the ground truth is known, demonstrates that MONACO clearly and consistently outperforms all other state-of-the-art network alignment algorithms that we have tested, in terms of accuracy, coherence and topological quality of the aligned network regions. Furthermore, despite the sharply enhanced alignment accuracy, MONACO remains computationally efficient and it scales well with increasing size and number of networks.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Thermal Analysis of a Polypropylene Capacitor for Resonant Tuning Networks in WPT Applications

This study presents the thermal analysis of polypropylene capacitors operating at high frequencies and high currents used in the resonant tuning networks for electric vehicle (EV) wireless charging systems. The thermal analysis and performance results of the CELEM polypropylene capacitors are presented at different currents for a polyphase wireless power transfer (WPT) system while the study can be expanded to other capacitors by different manufacturers. Thermal equivalent circuit of the capacitor is derived and required cold plate size and design calculations are conducted by modeling the polypropene capacitor in MATLAB. The polypropene capacitor's finite element analysis (FEA) model is developed using COMSOL Multiphysics simulation software, and the thermal characteristics and analysis of the capacitor are presented in this paper.

Aktas, Ahmet↗

DOE OSTI2022

An MLIR-based Compiler Flow for System-Level Design and Hardware Acceleration

The generation of custom hardware accelerators for applications implemented within high-level productive programming frameworks requires considerable manual effort. To automate this process, we introduce \sodaopt, a compiler tool that extends the MLIR infrastructure. \sodaopt automatically searches, outlines, tiles, and pre-optimizes relevant code regions to generate high-quality accelerators through high-level synthesis. \sodaopt can support any high-level programming framework and domain-specific language that interface with the MLIR infrastructure. By leveraging MLIR, \sodaopt solves compiler optimization problems with specialized abstractions. Backend synthesis tools connect to \sodaopt through progressive intermediate representation lowerings. \sodaopt interfaces to a design space exploration engine to identify the combination of compiler optimization passes and options that provides high-performance generated designs for different backends and targets. We demonstrate the practical applicability of the compilation flow by exploring the automatic generation of accelerators for deep neural networks operators outlined at arbitrary granularity and by combining outlining with tiling on large convolution layers. Experimental results with kernels from the PolyBench benchmark show that \sodaopt high-level optimizations improve execution delays of synthesized accelerators up to 60x. We also show that for the selected kernels, our solution outperforms the current of state-of-the art in more than 70% of the benchmarks and provides better average speedup in 55% of them.

Bohm Agostini, Nicolas↗

DOE OSTI2023

Spy in the GPU-box: Covert and Side Channel Attacks on Multi-GPU System

The deep learning revolution has been enabled in large part by GPUs, and more recently accelerators, which make it possible to carry out computationally demanding training and inference in acceptable times. As the size of machine learning networks and workloads continues to increase, multi-GPU machines have emerged as an important platform offered on High Performance Computing and cloud data centers. Since these machines are shared among multiple users, it becomes increasingly important to protect applications against potential attacks. In this paper, we explore the vulnerability of Nvidia's DGX multi-GPU machines to covert and side channel attacks. These machines consist of a number of discrete GPUs that are interconnected through a combination of custom interconnect (NVLink) and PCIe connections. We reverse engineer the interconnected cache hierarchy and show that it is possible for an attacker on one GPU to cause contention on the L2 cache of another GPU. We use this observation to first develop a covert channel attack across two GPUs, achieving the best bandwidth of around 4 MB/s. We also develop a prime and probe attack on a remote GPU allowing an attacker to recover the cache access pattern of another workload. This access pattern can be used in any number of side channel attacks: we demonstrate a proof of concept attack that fingerprints the application running on the remote GPU, with high accuracy. We also develop a proof of concept attack to extract hyperparameters of a machine learning workload. Our work establishes for the first time the vulnerability of these machines to microarchitectural attacks and can guide future research to improve their security.

Dutta, Sankha↗

DOE OSTI2024

Effect of realistic routing on the social burden metric

The distance people travel to reach critical services is a key input to the Social Burden metric used by Sandia’s Resilient Node Cluster Analysis Tool (ReNCAT) in the optimization’s objective function. By default, ReNCAT utilizes Euclidian distances between population blocks and critical facilities when calculating Social Burden. However, these straight-line distances do not reflect how most residents or goods would travel throughout the area. As distance is a vital input to the burden calculation, a more realistic distance calculation will yield more realistic burden values. This work uses real road networks and calculates the shortest distance path between population centers and critical facilities using a standard graph theory approach. These realistic route distances are then used to compute Social Burden for four areas of study. It was found that distances using real road routes are generally, but not always, longer than the Euclidean distance. The increased length increases the final Social Burden metric, however, the overall burden percent change ranged between 17% and 52%, which means the impact of realistic routes relies heavily upon the area’s road topology. It was found that rural locations within an area may have larger burden increases than urban areas as more dense road networks allow routes to more closely follow a straight-line path. Additionally, using the most straight forward routing algorithms requires high computational effort for areas with large road networks. While it is believed this process can be made more performant, that task is beyond this scope of work.

99 GENERAL AND MISCELLANEOUS↗

NASA NTRS1984

On the impact of communication complexity in the design of parallel numerical algorithms

This paper describes two models of the cost of data movement in parallel numerical algorithms. One model is a generalization of an approach due to Hockney, and is suitable for shared memory multiprocessors where each processor has vector capabilities. The other model is applicable to highly parallel nonshared memory MIMD systems. In the second model, algorithm performance is characterized in terms of the communication network design. Techniques used in VLSI complexity theory are also brought in, and algorithm independent upper bounds on system performance are derived for several problems that are important to scientific computation.

Gannon, D.↗

NASA NTRS1984

On the impact of communication complexity on the design of parallel numerical algorithms

This paper describes two models of the cost of data movement in parallel numerical alorithms. One model is a generalization of an approach due to Hockney, and is suitable for shared memory multiprocessors where each processor has vector capabilities. The other model is applicable to highly parallel nonshared memory MIMD systems. In this second model, algorithm performance is characterized in terms of the communication network design. Techniques used in VLSI complexity theory are also brought in, and algorithm-independent upper bounds on system performance are derived for several problems that are important to scientific computation.

Gannon, D. B.↗