Search NASA⌕ Search

SEARCH · Search NASA

Results for “Network Performance”

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 541 records · Page 30

Micro/Nanosatellite Mars Network for Global Lower Atmosphere Characterization

To address multiple key challenge areas for robotic exploration of Mars, to achieve scientific goals and reduce risk for future human missions, a micro/nanosatellite constellation for lower atmosphere characterization is proposed. A microsatellite design is discussed that can operate (1) in tandem with another microsat or (2) as a "mother-ship" to deploy a network of nanosatellites (CubeSats). Either configuration of the network would perform radio occultation-based atmospheric measurements. Advantages of the proposed network are low development cost based on an existing microsatellite bus, and proven performance of the bus to date. Continued efforts in miniaturization of instruments are needed to fully enable the mother-ship/nanosat version of the proposed network.

Tinker, Mike L.↗

Distributed Macroscopic Traffic Simulation with Open Traffic Models

This paper presents OTM-MPI, an extension of the Open Traffic Models platform (OTM) for running macroscopic traffic simulations in high-performance computing environments. OTM-MPI represents the first open-source, distributed-memory, macroscopic simulation model developed for modern high performance parallel machines and large networks. Macroscopic simulations are appropriate for studying regional traffic scenarios when aggregate trends are of interest, rather than individual vehicle traces. They are also appropriate for studying the routing behavior of classes of vehicles, such as app-informed vehicles. The network partitioning was performed with METIS. Inter-process communication was done with MPI (message-passing interface). Results are provided for two networks: one realistic network which was obtained from Open Street Maps for Chattanooga, TN, and another larger synthetic grid network. The software recorded a speedups of 198x using 256 cores for Chattanooga, and 475x with 1,024 cores for the synthetic network.

macro-scopic traffic simulation↗

Improving Trust in Deep Neural Networks with Nearest Neighbors

Deep neural networks are used increasingly for perception and decision-making in UAVs. For example, they can be used to recognize objects from images and decide what actions the vehicle should take. While deep neural networks can perform very well at complex tasks, their decisions may be unintuitive to a human operator. When a human disagrees with a neural network prediction, due to the black box nature of deep neural networks, it can be unclear whether the system knows something the human does not or whether the system is malfunctioning. This uncertainty is problematic when it comes to ensuring safety. As a result, it is important to develop technologies for explaining neural network decisions for trust and safety. This paper explores a modification to the deep neural network classification layer to produce both a predicted label and an explanation to support its prediction. Specifically, at test time, we replace the final output layer of the neural network classifier by a k-nearest neighbor classifier. The nearest neighbor classifier produces 1) a predicted label through voting and 2) the nearest neighbors involved in the prediction, which represent the most similar examples from the training dataset. Because prediction and explanation are derived from the same underlying process, this approach guarantees that the explanations are always relevant to the predictions. We demonstrate the approach on a convolutional neural network for a UAV image classification task. We perform experiments using a forest trail image dataset and show empirically that the hybrid classifier can produce intuitive explanations without loss of predictive performance compared to the original neural network. We also show how the approach can be used to help identify potential issues in the network and training process.

Lee, Ritchie↗

Vertex finding in neutrino-nucleus interaction: a model architecture comparison

We compare different neural network architectures for machine learning algorithms designed to identify the neutrino interaction vertex position in the MINERvA detector. The architectures developed and optimized by hand are compared with the architectures developed in an automated way using the package “Multi-node Evolutionary Neural Networks for Deep Learning” (MENNDL), developed at Oak Ridge National Laboratory. While the domain-expert hand-tuned network was the best performer, the differences were negligible and the auto-generated networks performed as well. There is always a trade-off between human, and computer resources for network optimization and this work suggests that automated optimization, assuming resources are available, provides a compelling way to save significant expert time.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

An effect of the networks of the subgrain boundaries on spectral responses of thick CdZnTe detectors

CdZnTe (CZT) crystals used for nuclear-radiation detectors often contain high concentrations of subgrain boundaries and networks of poligonized dislocations that can significantly degrade the performance of semiconductor devices. These defects exist in all commercial CZT materials, regardless of their growth techniques and their vendor. We describe our new results from examining such detectors using IR transmission microscopy and white X-ray beam diffraction topography. We emphasize the roles on the devices performances of networks of subgrain boundaries with low dislocation densities, such as poligonized dislocations and mosaic structures. Specifically, we evaluated their effects on the gamma-ray responses of thick, >10 mm, CZT detectors. Our findings set the lower limit on the energy resolution of CZT detectors containing dense networks of subgrain boundaries, and walls of dislocations.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

ExaTN: Scalable GPU-Accelerated High-Performance Processing of General Tensor Networks at Exascale

We present ExaTN (Exascale Tensor Networks), a scalable GPU-accelerated C++ library which can express and process tensor networks on shared- as well as distributed-memory high-performance computing platforms, including those equipped with GPU accelerators. Specifically, ExaTN provides the ability to build, transform, and numerically evaluate tensor networks with arbitrary graph structures and complexity. It also provides algorithmic primitives for the optimization of tensor factors inside a given tensor network in order to find an extremum of a chosen tensor network functional, which is one of the key numerical procedures in quantum many-body theory and quantum-inspired machine learning. Numerical primitives exposed by ExaTN provide the foundation for composing rather complex tensor network algorithms. We enumerate multiple application domains which can benefit from the capabilities of our library, including condensed matter physics, quantum chemistry, quantum circuit simulations, as well as quantum and classical machine learning, for some of which we provide preliminary demonstrations and performance benchmarks just to emphasize a broad utility of our library.

97 MATHEMATICS AND COMPUTING↗

Machine learning based unfolding of x-ray spectra from filter stack spectrometer data

We demonstrate the application of neural networks to perform x-ray spectra unfolding from data collected by filter stack spectrometers. A filter stack spectrometer consists of a series of filter-detector pairs, where the detectors behind each filter measure the energy deposition through each layer as photo-stimulated luminescence (PSL). The network is trained on synthetic data, assuming x-rays of energies < 1 MeV and of two different distribution functions (Maxwellian and Gaussian) and the corresponding measured PSL values obtained from five different filter stack spectrometer designs. Predicted unfolds of single distributions are near identical reproductions of the ground truth spectra, with differences in the values lower than 20% at the higher energy end in some cases. The neural network has also demonstrated robustness to experimental measurement errors of < 5% and some capability of performing unfolds for linear combinations of the two distributions without previous training. The network can perform unfolds at rates > 1 Hz, ideal for application to some high-repetition-rate systems.

47 OTHER INSTRUMENTATION↗

Blockchain based Communication Architectures with Applications to Private Security Networks

Existing communication protocols in high consequence security networks are highly centralized. While this naively makes the controls easier to physically secure, external actors require fewer resources to disrupt the system because there are fewer points in the system can be destroyed or interrupted without the entire system failing. We present a solution to this problem using a proof-of-work-based blockchain implementation built on MultiChain. We construct a test-bed network containing two types of data input: visual imagers and microwave sensor information. These data types are ubiquitous in perimeter intrusion detection security systems and allow a realistic representation of a real-world network architecture. The cameras in this system use an object detection algorithm to nd important targets in the scene. The raw data from the camera and the outputs from the detection algorithm are then placed in a transaction on the distributed ledger. Similarly, microwave data is used to detect relevant events and are placed in a transaction. These transactions are then bundled into blocks and broadcast to the rest of the network using the Bitcoin-based MultiChain protocol. We develop five tests to examine the security metrics of our network. We performed the five security metric test using different sized networks from 7 to 39 nodes to determine how the metrics scale with respect to size. We nd that when compared to a centralized architecture our implementation provides a resiliency increase that is expected from a blockchain-based protocol without slowing the system so much that a human operator would notice. Furthermore, our approach is able to detect tampering in real time. Based on these results, we theorize that security networks in general could use a blockchain-based approach in a meaningful way.

97 MATHEMATICS AND COMPUTING↗

GERT simulation program for GERT network analysis

GERT Simulation Program simulates GERT networks to obtain statistics on specified nodes of the network. It performs sampling experiments to determine which branches of the network are taken and how long it takes to traverse a branch of the network.

Alan, A.↗

A case for Virtual Machine based Fault Injection in a High-Performance Computing Environment

Large-scale computing platforms provide tremendous capabilities for scientific discovery. These systems have hundreds of thousands of computing cores, hundreds of terabytes of memory, and enormous high-performance interconnection networks. These systems are facing enormous challenges to achieve performance at such scale. Failures are an Achilles heel of these enormous systems. As applications and system software scale up to multi-petaflop and beyond to exascale platforms, the occurrence of failure will be much more common. This has given rise to a push in fault-tolerance and resilience research for HPC systems. This includes work on log analysis to identify types of failures, enhancements to the Message Passing Interface (MPI) to incorporate fault awareness, and a variety of fault tolerance mechanisms that span redundant computation, algorithm based fault tolerance, and advanced checkpoint/restart techniques. While there is much work to be done on the FT/Resilience mechanisms for such large-scale systems, there is also a profound gap in the tools for experimentation. This gap is compounded by the fact that HPC environments have stringent performance requirements and are often highly customized. The tool chain for these systems are often tailored for the platform and while the majority of systems on the Top500 Supercomputer list run Linux, these operating environments typically contain many site/machine specific enhancements. Therefore, it is desirable to maintain a consistent execution environment to minimize end-user (scientist) interruption. The work on system-level virtualization for HPC system offers a unique opportunity to maintain a consistent execution environment via a virtual machine (VM). Recent work on virtualization for HPC has shown that low-overhead, high performance systems can be realized. Virtualization also provides a clean abstraction for building experimental tools for investigation into the effects of failures in HPC and the related research on FT/Resilience mechanisms and policies. In this paper we discuss the motivation for tools to perform fault injection in an HPC context, and outline an approach that can leverage virtualization.

99 GENERAL AND MISCELLANEOUS↗

Genetic algorithm based task reordering to improve the performance of batch scheduled massively parallel scientific applications

The growth in size of networked high performance computers along with novel accelerator-based node architectures has further emphasized the importance of communication efficiency in high performance computing. The world's largest high performance computers are usually operated as shared user facilities due to the costs of acquisition and operation. Applications are scheduled for execution in a shared environment and are placed on nodes that are not necessarily contiguous on the interconnect. Furthermore, the placement of tasks on the nodes allocated by the scheduler is sub-optimal, leading to performance loss and variability. Here, we investigate the impact of task placement on the performance of two massively parallel application codes on the Titan supercomputer, a turbulent combustion flow solver (S3D) and a molecular dynamics code (LAMMPS). Benchmark studies show a significant deviation from ideal weak scaling and variability in performance. The inter-task communication distance was determined to be one of the significant contributors to the performance degradation and variability. A genetic algorithm-based parallel optimization technique was used to optimize the task ordering. This technique provides an improved placement of the tasks on the nodes, taking into account the application's communication topology and the system interconnect topology. As a result, application benchmarks after task reordering through genetic algorithm show a significant improvement in performance and reduction in variability, therefore enabling the applications to achieve better time to solution and scalability on Titan during production.

97 MATHEMATICS AND COMPUTING↗

Randomized methods to characterize large-scale vortical flow networks

We demonstrate the effective use of randomized methods for linear algebra to perform network-based analysis of complex vortical flows. Network theoretic approaches can reveal the connectivity structures among a set of vortical elements and analyze their collective dynamics. These approaches have recently been generalized to analyze high-dimensional turbulent flows, for which network computations can become prohibitively expensive. In this work, we propose efficient methods to approximate network quantities, such as the leading eigendecomposition of the adjacency matrix, using randomized methods. Specifically, we use the Nyström method to approximate the leading eigenvalues and eigenvectors, achieving significant computational savings and reduced memory requirements. The effectiveness of the proposed technique is demonstrated on two high-dimensional flow fields: two-dimensional flow past an airfoil and two-dimensional turbulence. We find that quasi-uniform column sampling outperforms uniform column sampling, while both feature the same computational complexity.

97 MATHEMATICS AND COMPUTING↗

Modeling and Performance Simulation of the Mass Storage Network Environment

This paper describes the application of modeling and simulation in evaluating and predicting the performance of the mass storage network environment. Network traffic is generated to mimic the realistic pattern of file transfer, electronic mail, and web browsing. The behavior and performance of the mass storage network and a typical client-server Local Area Network (LAN) are investigated by modeling and simulation. Performance characteristics in throughput and delay demonstrate the important role of modeling and simulation in network engineering and capacity planning.

Kim, Chan M.↗

Performance Evaluation of Distributed Energy Resource Management Algorithm in Large Distribution Networks

This paper presents performance evaluation of hierarchical optimization and control for distributed energy resource management system (DERMS) in large distribution networks via an advanced hardware-in-the-loop (HIL) platform. The HIL platform provides realistic testing in a laboratory environment, including the accurate modeling of a full-scale distribution system of 11,000 nodes, the DERMS software controller, and 90 power hardware photovoltaics (PVs) and battery inverters. The applied DERMS algorithm is designed based on a realtime optimal power flow algorithm and implemented with acceleration design that performs fast dispatch of simulated PVs and real physical hardware DER devices every 4 seconds.

DERMS↗

Performance Evaluation of Distributed Energy Resource Management Algorithm in Large Distribution Networks

This paper presents performance evaluation of hierarchical optimization and control for distributed energy resource management system (DERMS) in large distribution networks via an advanced hardware-in-the-loop (HIL) platform. The HIL platform provides realistic testing in a laboratory envi-ronment, including the accurate modeling of a full-scale dis-tribution system of 11,000 nodes, the DERMS software con-troller, and 90 power hardware photovoltaics (PVs) and bat-tery inverters. The applied DERMS algorithm is designed based on a real-time optimal power flow algorithm and im-plemented with acceleration design that performs fast dis-patch of simulated PVs and real physical hardware DER devices every 4 seconds.

distributed energy management system (DERMS)↗

Implementation and Investigation of a Weather- and Jam Density-tuned Network Perimeter Controller

This paper implements and evaluates the performance of a network fundamental diagram (NFD) proportional-integral perimeter controller (PC) using base tuned parameters (clear weather conditions and a base jam density of 160 veh/km/lane). The parameters were then re-tuned separately for different weather conditions and jam density values (reflecting different percentage of trucks), resulting in two new control methods: a weather-tuned perimeter controller (WTPC) and a jam density-tuned perimeter controller (JTPC). The WTPC was shown to outperform the no control strategy and the PC for different weather conditions. Specifically, the WTPC decreased the congestion inside the protected network (PN) and improved the overall performance of the full network (FN) by decreasing the average vehicle travel time, decreasing the vehicle total delay, increasing the average vehicle speed and decreasing the average vehicle fuel consumption. Alternatively, the JTPC was shown to perform similar to the PC for jam densities higher than the base-case jam density used in the PC (in our case 160 veh/km/lane). However, the JTPC outperformed the PC for smaller jam densities given that these smaller jam densities result in queues spilling back faster to upstream traffic signals. The results demonstrate the need to tune the controller to the actual jam density especially when the jam density decreases (e.g. trucks are introduced to the network). http://pubsindex.trb.org/

42 ENGINEERING↗

Effect of Networking Density on the Patterning Performance of Molecular Layer Deposited Alucone Electron Beam/EUV Resists

One of the main barriers to continued device scaling in the era of extreme ultraviolet (EUV) lithography is the need for improved photoresist chemistries to address challenges such as poor EUV sensitivity, inadequate etch resistance, and pattern collapse. Metal-organic photoresists are a promising class of materials that can address many of these challenges, and among them, resists deposited via hybrid molecular layer deposition (MLD) have attracted interest for their unique advantages in thickness control, chemical homogeneity, and compatibility with vacuum processing. However, despite many successful demonstrations of patterning, little is known about how the molecular design of hybrid MLD resists affects their lithographic performance. In this work, we study the effect of the network structure, a common feature among all hybrid MLD resists, via a series of aluminum alkoxide ("alucone") negative tone resists with varying networking density. Their patterning mechanism is investigated via electron beam lithography (EBL)─a common proxy for EUV─and compared to their EUV-induced reactions studied via flood exposure and in situ characterization. In conclusion, we show that the resist with the least networking density demonstrates the best sensitivity and resolution, with the ability to resolve dense line/space gratings as small as 14 nm half pitch via EBL.

electron beam lithography↗