Search NASA⌕ Search

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.

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

At least 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
NASA NTRS2006

Implementing Access to Data Distributed on Many Processors

A reference architecture is defined for an object-oriented implementation of domains, arrays, and distributions written in the programming language Chapel. This technology primarily addresses domains that contain arrays that have regular index sets with the low-level implementation details being beyond the scope of this discussion. What is defined is a complete set of object-oriented operators that allows one to perform data distributions for domain arrays involving regular arithmetic index sets. What is unique is that these operators allow for the arbitrary regions of the arrays to be fragmented and distributed across multiple processors with a single point of access giving the programmer the illusion that all the elements are collocated on a single processor. Today's massively parallel High Productivity Computing Systems (HPCS) are characterized by a modular structure, with a large number of processing and memory units connected by a high-speed network. Locality of access as well as load balancing are primary concerns in these systems that are typically used for high-performance scientific computation. Data distributions address these issues by providing a range of methods for spreading large data sets across the components of a system. Over the past two decades, many languages, systems, tools, and libraries have been developed for the support of distributions. Since the performance of data parallel applications is directly influenced by the distribution strategy, users often resort to low-level programming models that allow fine-tuning of the distribution aspects affecting performance, but, at the same time, are tedious and error-prone. This technology presents a reusable design of a data-distribution framework for data parallel high-performance applications. Distributions are a means to express locality in systems composed of large numbers of processor and memory components connected by a network. Since distributions have a great effect on the performance of applications, it is important that the distribution strategy is flexible, so its behavior can change depending on the needs of the application. At the same time, high productivity concerns require that the user be shielded from error-prone, tedious details such as communication and synchronization.

James, Mark↗
DOE OSTI2024

Tokamak divertor plasma emulation with machine learning

Abstract Future tokamak devices that aim to create conditions relevant to power plant operations must consider strategies for mitigating damage to plasma facing components in the divertor. One of the goals of MAST-U tokamak operations is to inform these considerations by researching advanced divertor configurations that aid stable plasma detachment. Machine design, scenario planning and detachment control would all greatly benefit from tools that enable rapid calculation of scenario-relevant quantities given some input parameters. This paper presents a method for generating large, simulated scrape-off layer data sets, which was applied to generate a data set of steady-state Hermes-3 simulations of the MAST-U tokamak. A machine learning model was constructed using a Bayesian approach to hyperparameter optimisation to predict diagnosable output quantities given control-relevant input features. The resulting best-performing model, which is based on a feedforward neural network, achieves high accuracy when predicting electron temperature at the divertor target and carbon impurity radiation front position and runs in around 1 ms in inference mode. Techniques for interpreting the predictions made by the model were applied, and a high-resolution parameter scan of upstream conditions was performed to demonstrate the utility of rapidly generating accurate predictions using the emulator. This work represents a step forward in the design of machine learning-driven emulators of tokamak exhaust simulation codes in operational modes relevant to divertor detachment control and plasma scenario design.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Role of Selenium in CdZnTeSe as a Defect Engineering Agent

Cadmium zinc telluride (CdZnTe) with 10 atomic % Zn has been the material of choice for room-temperature semiconductor compact X- and gamma-ray detector applications for over three decades. Despite its commercial success as the most desirable room-temperature semiconductor radiation detection material, CdZnTe (CZT) suffers from a lack of compositional homogeneity on both the micro- and macroscales and the presence of high concentrations of performance-limiting defects such as subgrain boundary networks (dislocation walls) and secondary phases (Te-rich inclusions). Random distributions of these defects in the CZT matrix result in the spatial inhomogeneity of the material’s charge-transport properties. The recently discovered quaternary Cd x Zn 1-x Te 1-y Se y (CZTS) has experienced remarkable advances in its material properties, with highly reduced defects and higher compositional homogeneity. This book chapter focuses on the presence of performance-limiting defects in CZT that have thus far hindered the yield and cost of high-quality detectors and restricted their widespread deployment for a variety of potential applications, particularly for their use as large-volume gamma detectors, where the demands on material perfection are significantly greater. This chapter also provides an overview of the recent developments in the quaternary material CZTS, particularly the effects of selenium (Se) in the CZTS matrix on the defect engineering of the quaternary alloy material and the advancement of CZTS as a potential next-generation detector operable at room temperature.

Roy, Utpal N.↗
DOE OSTI2026

Resources for Homeowners: Home Efficiency Upgrades

A fact sheet to support small business building contractors in communicating with homeowners about potential benefits of home efficiency strategies and suggestions for navigating home upgrades. This work was developed under the Building Business Network (B-Biz) program, which aims to improve adoption of high-performance building technology solutions by collaborating with organizations that support small business contractors that provide and service high-performance building technologies.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2024

MassiveGNN: Efficient Training via Prefetching for Massively Connected Distributed Graphs

Graph Neural Networks (GNN) are indispensable in learning from graph-structured data, yet their rising computational costs, especially on massively connected graphs, pose significant challenges in terms of execution performance. To tackle this, distributed-memory solutions such as partitioning the graph to concurrently train multiple replicas of GNNs are in practice. However, approaches requiring a partitioned graph usually suffer from communication overhead and load imbalance, even under optimal partitioning and communication strategies due to irregularities in the neighborhood minibatch sampling. This paper proposes practical trade-offs for improving the sampling and communication overheads for representation learn- ing on distributed graphs (using popular GraphSAGE architecture) by developing a parameterized prefetch and eviction scheme on top of the state-of-the-art Amazon DistDGL distributed GNN framework, demonstrating about 15–40% improvement in end-to-end training performance on the NERSC Perlmutter supercomputer for various OGB datasets.

Machine Leanring, high performance comptuing, grap↗
DOE OSTI2017

Deformation Behavior in Neutron Irradiated Generation II FeCrAl Alloys for Accident Tolerant Fuel Cladding

Preliminary work has been completed to evaluate the deformation behavior of the Generation II FeCrAl alloy class. The Generation II alloy, C35M, was neutron irradiated within the High Flux Isotop e Reactor followed by post-irradiation examination to evaluate the mechanical properties, irradiated microstructure, deformation modes, and deformation microstructure. Complementary characterization techniques were used in this evaluation. It was found tha t aft er irradiation to1.8 dpa at 364 °C that the C35M specimen failed in a ductile manner. The observed deformation microstructure showed a high density of line dislocations, dislocation networks, and dislocation pile-ups. The observed performance and stru cture s are consistent with literature studies on high-Cr FeCr alloys that were thermally aged at 500°C. The observed results suggest that Generation II FeCrAl alloys retain ductility under low-dose, prototypical LWR irradiation conditions.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Detection of Anomalies in Environmental Gamma Radiation Background with Hopfield Artificial Neural Network - Consortium on Nuclear Security Technologies (CONNECT) Q3 Report

Environmental screening of gamma radiation consists of detecting weak nuisance and anomaly signal in the presence of strong and highly varying background. In a typical scenario, a mobile detector-spectrometer continuously measures gamma radiation spectra in short, e.g., one-second, signal acquisition intervals. The measurement data is a 2D matrix, where one dimension is gamma ray energy, and the other dimension is the number of measurements or total time. In principle, gamma radiation sources can be detected and identified from the measured data by their unique spectral lines. Detecting sources from data measured in a search scenario is difficult due to the highly varying background because of naturally occurring radioactive material (NORM), and low signal-to-noise ratio (S/N) of spectral signal measured during one-second acquisition intervals. The objective of this work is to investigate performance of a Hopfield Neural Network (HNN) in in detection and identification of weak nuisances and anomalies events in the presence of a highly fluctuating background. Performance of HNN algorithm is benchmarked using search data from an environmental screening campaign. One data set contained a 137 Cs source, and another dataset contained a 131 I source.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2021

Advances in CdZnTeSe for Radiation Detector Applications

Detection of X- and gamma-rays is essential to a wide range of applications from medical imaging to high energy physics, astronomy, and homeland security. Cadmium zinc telluride (CZT) is the most widely used material for room-temperature detector applications and has been fulfilling the requirements for growing detection demands over the last three decades. However, CZT still suffers from the presence of a high density of performance-limiting defects, such as sub-grain boundary networks and Te inclusions. Cadmium zinc telluride selenide (CZTS) is an emerging material with compelling properties that mitigate some of the long-standing issues seen in CZT. This new quaternary is free from sub-grain boundary networks and possesses very few Te inclusions. In addition, the material offers a high degree of compositional homogeneity. The advancement of CZTS has accelerated through investigations of the material properties and virtual Frisch-grid (VFG) detector performance. The excellent material quality with highly reduced performance-limiting defects elevates the importance of CZTS as a potential replacement to CZT at a substantially lower cost.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2021

Multilevel Graph Partitioning for Three-Dimensional Discrete Fracture Network Flow Simulations

We present a topology-based method for mesh-partitioning in three-dimensional discrete fracture network (DFN) simulations that takes advantage of the intrinsic multi-level nature of a DFN. DFN models are used to simulate flow and transport through low-permeability fractured media in the subsurface by explicitly representing fractures as discrete entities. The governing equations for flow and transport are numerically integrated on computational meshes generated on the interconnected fracture networks. Modern high-fidelity DFN simulations require high-performance computing on multiple processors where performance and scalability depends partially on obtaining a high-quality partition of the mesh to balance work-loads and minimize communication across all processors. The discrete structure of a DFN naturally lends itself to various graph representations, which can be thought of as coarse-scale representations of the computational mesh. Using this concept, we develop two applications of the multilevel graph partitioning algorithm to partition the mesh of a DFN. In the first, we project a partition of the graph based on the DFN topology onto the mesh of the DFN and in the second, this DFN-based projection is used as the initial condition for further partitioning refinement of the mesh. We compare the performance of these methods with standard multi-level graph partitioning using graph-based metrics (cut, imbalance, partitioning time), computational-based metrics (FLOPS, iterations, solver time), and total run time. The DFN-based and the mesh-based partitioning methods are comparable in terms of the graph-based metrics, but the time required to obtain the partition is several orders of magnitude faster using the DFN-based partitions. The computation-based metrics show comparable performance between both methods so, in combination, the DFN-based partitions are several orders of magnitude faster than the mesh-based partition. Furthermore, the method which uses the DFN-partition solution as the initial condition of the mesh partition provided cut and imbalance values that were close to the mesh-based partition but in a fraction of the time. In turn, this hybrid method outperformed both of the other methods in terms of the total run time.

58 GEOSCIENCES↗
DOE OSTI2024

Scaling neural simulations in STACS

Abstract As modern neuroscience tools acquire more details about the brain, the need to move towards biological-scale neural simulations continues to grow. However, effective simulations at scale remain a challenge. Beyond just the tooling required to enable parallel execution, there is also the unique structure of the synaptic interconnectivity, which is globally sparse but has relatively high connection density and non-local interactions per neuron. There are also various practicalities to consider in high performance computing applications, such as the need for serializing neural networks to support potentially long-running simulations that require checkpoint-restart. Although acceleration on neuromorphic hardware is also a possibility, development in this space can be difficult as hardware support tends to vary between platforms and software support for larger scale models also tends to be limited. In this paper, we focus our attention on Simulation Tool for Asynchronous Cortical Streams (STACS), a spiking neural network simulator that leverages the Charm++ parallel programming framework, with the goal of supporting biological-scale simulations as well as interoperability between platforms. Central to these goals is the implementation of scalable data structures suitable for efficiently distributing a network across parallel partitions. Here, we discuss a straightforward extension of a parallel data format with a history of use in graph partitioners, which also serves as a portable intermediate representation for different neuromorphic backends. We perform scaling studies on the Summit supercomputer, examining the capabilities of STACS in terms of network build and storage, partitioning, and execution. We highlight how a suitably partitioned, spatially dependent synaptic structure introduces a communication workload well-suited to the multicast communication supported by Charm++. We evaluate the strong and weak scaling behavior for networks on the order of millions of neurons and billions of synapses, and show that STACS achieves competitive levels of parallel efficiency.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1992

High speed network issues in a distributed visualization application

The author examines the issues in creating an UltraNet TCP/IP socket-based distributed application. The visualization computation is performed on a Connection Machine, and the results are rendered using a Silicon Graphics 4D/320 VGX workstation. The UltraNet network facilitates high-bandwidth communication between the computers. Ideally, taking advantage of the UltraNet is no more complex than developing TCP/IP and UNIX BSD socket-type applications on a single machine. In practice, there are several problems in developing an application using the UltraNet. The author identifies potential problems and discusses techniques for overcoming them. The performance of UltraNet communication is measured and found to be 10 MB/s for SGI 4D/320 workstations.

Krystynak, John↗
DOE OSTI2019

Tail queues: A multi-threaded matching architecture

As we approach exascale, computational parallelism will have to drastically increase in order to meet throughput targets. Many–core architectures have exacerbated this problem by trading reduced clock speeds, core complexity, and computation throughput for increasing parallelism. This presents two major challenges for communication libraries such as MPI: the library must leverage the performance advantages of thread level parallelism and avoid the scalability problems associated with increasing the number of processes to that scale. Hybrid programming models, such as MPI+X, have been proposed to address these challenges. MPI THREAD MULTIPLE is MPI's thread safe mode. While there has been work to optimize it, it largely remains non–performant in most implementations. While current applications avoid MPI multithreading due to performance concerns, it is expected to be utilized in future applications. One of the major synchronous data structures required by MPI is the matching engine. In this paper, we present a parallel matching algorithm that can improve MPI matching for multithreaded applications. We then perform a feasibility study to demonstrate the performance benefit of the technique.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Building an Integrated Ecosystem of Computational and Observational Facilities to Accelerate Scientific Discovery

Future scientific discoveries will rely on flexible ecosystems that incorporate modern scientific instruments, high performance computing resources, parallel distributed data storage, and performant networks across multiple, independent facilities. In addition to connecting physical resources, such an ecosystem presents many challenges in logistics and accessibility, especially in orchestrating computations and experiments that span across leadership computing systems and experimental instruments. Past efforts have typically been application-specific or limited to interfaces for computing resources. This paper proposes a general framework for integrating computation resources and instrument operations, addressing challenges in code development/execution, data staging and collection, software stack, control mechanisms, resource authorization and governance, and hardware integration. We also describe a demonstration use case wherein a Bayesian optimization algorithm running on an edge computing resource guides a scanning probe microscope to autonomously and intelligently characterize a material sample. This science edge ecosystem framework will provide a blueprint for federating multi-institutional, disparate resources and orchestrating scientific workflows across them to enable next-generation discoveries.

Somnath, Suhas↗
DOE OSTI2017

EvoGraph: On-The-Fly Efficient Mining of Evolving Graphs on GPU

With the prevalence of the World Wide Web and social networks, there has been a growing interest in high performance analytics for constantly-evolving dynamic graphs. Modern GPUs provide massive AQ1 amount of parallelism for efficient graph processing, but the challenges remain due to their lack of support for the near real-time streaming nature of dynamic graphs. Specifically, due to the current high volume and velocity of graph data combined with the complexity of user queries, traditional processing methods by first storing the updates and then repeatedly running static graph analytics on a sequence of versions or snapshots are deemed undesirable and computational infeasible on GPU. We present EvoGraph, a highly efficient and scalable GPU- based dynamic graph analytics framework.

dynamic graphs↗
DOE OSTI2019

SimCCS: An open-source tool for optimizing CO 2 capture, transport, and storage infrastructure

Commercial-scale carbon capture and storage (CCS) technology will involve deploying infrastructure on a massive and costly scale. This effort will require careful and comprehensive planning to ensure that capture locations, storage sites, and the dedicated CO 2 distribution pipelines are selected in a robust and cost-effective manner. Presented in 2009, SimCCS is an optimization model for integrated system design that enables researchers, stakeholders, and policy makers to design CCS infrastructure networks. SimCCS 2.0 is a complete, ground-up redesign that is now a portable software package, useable and shareable by the CCS research, industrial, policy, and public communities. SimCCS 2.0 integrates multiple new capabilities including a refined optimization model, novel candidate network generation techniques, and optional integration with high-performance computing platforms. Accessing user-provided CO 2 source, sink, and transportation data, SimCCS 2.0 creates candidate transportation routes and formalizes an optimization problem that determines the most cost-effective CCS system design. This optimization problem is further solved either through a high-performance computing interface, or through third-party software on a local desktop computing platform. Finally, SimCCS 2.0 employs an open-access geographic information system framework to enable analysis and visualization capabilities. SimCCS 2.0 is written in Java and is publicly available via GitHub to encourage collaboration, modification, and community development.

42 ENGINEERING↗
DOE OSTI2017

Self-supported Zn/Si core-shell arrays as advanced electrodes for lithium ion batteries

Graphical abstract: Zn/Si core-shell arrays prepared by combined hydrothermal plus sputtering method show good performance with high specific capacity and excellent cycling stability. - Highlights: • Construct Zn/Si core-shell arrays via sputtering. • The Zn/Si core-shell arrays show high capacity and good cycles. • Core-shell arrays is favorable for fast ion/electron transfer. - Abstract: Silicon is considered as the most promising substitute for the commercial graphite anode of lithium ion batteries (LIBs) due to its high capacity and low working voltage. In this work, we realize the rational combination between Zn nanorods and Si forming self-supported Zn/Si core-shell arrays with the aid of hydrothermal and sputtering methods. Amorphous Si layer is well coated on the backbone of Zn nanorods with diameters of 70–80 nm. As a preliminary test, the Zn/Si core-shell arrays are used as the anode of LIBs and demonstrated with a high initial reversible capacity of 2795 mAh g{sup −1} at 0.1C, good high-rate capability with 1985 mAh g{sup −1} at 1C and stable cycling life. The good performance is due to the highly conductive Zn nanorod network and porous core-shell structure providing good mechanical support and fast transport of ions/electrons.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Improving Progressive Retrieval for HPC Scientific Data using Deep Neural Network

As the disparity between compute and I/O on high-performance computing systems has continued to widen, it has become increasingly difficult to perform post-hoc data analytics on full-resolution scientific simulation data due to the high I/O cost. Error-bounded data decomposition and progressive data retrieval framework has recently been developed to address such a challenge by performing data decomposition before storage and reading only part of the decomposed data when necessary. However, the performance of the progressive retrieval framework has been suffering from the over-pessimistic error control theory, such that the achieved maximum error of recomposed data is significantly lower than the required error. Therefore, more data than required is fetched for recomposition, incurring additional I/O overhead. In order to tackle this issue, we propose a DNN-based progressive retrieval framework that can better identify the minimum amount of data to be retrieved. Our contributions are as follows: 1) We provide an in-depth investigation of the recently developed progressive retrieval framework; 2) We propose two designs of prediction models (named D-MGARD and E-MGARD) to estimate the amount of retrieved data size based on error bounds. 3) We evaluate our proposed solutions using scientific datasets generated by real-world simulations from two domains. Evaluation results demonstrate the effectiveness of our solution in accurately predicting the amount of retrieval data size, as well as the advantages of our solution over the traditional approach to reducing the I/O overhead. Based on our evaluation, our solution is shown to read significantly less data (5% - 40% with D-MGARD, 20% - 80% with E-MGARD).

Wang, Jinzhen↗
DOE OSTI2024

Fault-Tolerant Decentralized Control for Large-Scale Inverter-Based Resources for Active Power Tracking

Integration of inverter-based resources (IBRs) which lack the intrinsic characteristics such as the inertial response of the traditional synchronous-generator (SG)-based sources presents a new challenge in the form of analyzing the grid stability under their presence. While the dynamic composition of IBRs differs from that of the SGs, the control objective remains similar in terms of tracking the desired active power. This letter presents a decentralized primal-dual-based fault-tolerant control framework for the power allocation in IBRs. Overall, a hierarchical control algorithm is developed with a lower level addressing the current control and the parameter estimation for the IBRs and the higher level acting as the reference power generator to the low level based on the desired active power profile. The decentralized network-based algorithm adaptively splits the desired power between the IBRs taking into consideration the health of the IBRs transmission lines. The proposed framework is tested through a simulation on the network of IBRs and the high-level controller performance is compared against the existing framework in the literature. The proposed algorithm shows significant performance improvement in the magnitude of power deviation and settling time to the nominal value under faulty conditions as compared to the algorithm in the literature.

24 POWER TRANSMISSION AND DISTRIBUTION↗