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 307 records · Page 17

Advanced Performance Modeling with Combined Passive and Active Monitoring

To improve the efficiency of resource utilization and scheduling of scientific data transfers on high-speed networks, the "Advanced Performance Modeling with combined passive and active monitoring" (APM) project investigates and models a general-purpose, reusable and expandable network performance estimation framework. The predictive estimation model and the framework will be helpful in optimizing the performance and utilization of networks as well as sharing resources with predictable performance for scientific collaborations, especially in data intensive applications. Our prediction model utilizes historical network performance information from various network activity logs as well as live streaming measurements from network peering devices. Historical network performance information is used without putting extra load on the resources by active measurement collection. Performance measurements collected by active probing is used judiciously for improving the accuracy of predictions.

97 MATHEMATICS AND COMPUTING↗

Early science with the Korean VLBI network: evaluation of system performance

We report the very long baseline interferometry (VLBI) observing performance of the Korean VLBI Network (KVN). The KVN is the first millimeter-dedicated VLBI network in East Asia. The KVN consists of three 21 m radio telescopes with baseline lengths in a range of 305-476 km. The quasi-optical system equipped on the antennas allows simultaneous observations at 22, 43, 86, and 129 GHz. The first fringes of the KVN were obtained at 22 GHz on 2010 June 8. Test observations at 22 and 43 GHz on 2010 September 30 and 2011 April 4 confirmed that the full cycle of VLBI observations works according to specification: scheduling, antenna control system, data recording, correlation, post-correlation data processing, astrometry, geodesy, and imaging analysis. We found that decorrelation due to instability in the hardware at times up to 600 s is negligible. The atmosphere fluctuations at KVN baseline are partly coherent, which allows us to extend integration time under good winter weather conditions up to 600 s without significant loss of coherence. The post-fit residuals at KVN baselines do not exhibit systematic patterns, and the weighted rms of the residuals is 14.8 ps. The KVN is ready to image compact radio sources both in snapshot and full-track modes with residual noise in calibrated phases of less than 2 deg at 22 and 43 GHz and with dynamic ranges of ∼300 for snapshot mode and ∼1000 for full-track mode. With simultaneous multi-frequency observations, the KVN can be used to make parsec-scale spectral index maps of compact radio sources.

79 ASTRONOMY AND ASTROPHYSICS↗

Investigation of the role of hydrophilic chain length in amphiphilic perfluoropolyether/poly(ethylene glycol) networks: towards high-performance antifouling coatings

The facile preparation of amphiphilic network coatings having a hydrophobic dimethacryloxy-functionalized perfluoropolyether (PFPE-DMA; M{sub w} = 1500 g mol{sup -1}) crosslinked with hydrophilic monomethacryloxy functionalized poly(ethylene glycol) macromonomers (PEG-MA; M{sub w} = 300, 475, 1100 g mol{sup -1}), intended as non-toxic high-performance marine coatings exhibiting antifouling characteristics is demonstrated. The PFPE-DMA was found to be miscible with the PEG-MA. Photo-cured blends of these materials containing 10 wt% of PEG-MA oligomers did not swell significantly in water. PFPE-DMA crosslinked with the highest molecular weight PEG oligomer (ie PEG1100) deterred settlement (attachment) of algal cells and cypris larvae of barnacles compared to a PFPE control coating. Dynamic mechanical analysis of these networks revealed a flexible material. Preferential segregation of the PEG segments at the polymer/air interface resulted in enhanced antifouling performance. The cured amphiphilic PFPE/PEG films showed decreased advancing and receding contact angles with increasing PEG chain length. In particular, the PFPE/PEG1100 network had a much lower advancing contact angle than static contact angle, suggesting that the PEG1100 segments diffuse to the polymer/water interface quickly. The preferential interfacial aggregation of the larger PEG segments enables the coating surface to have a substantially enhanced resistance to settlement of spores of the green seaweed Ulva, cells of the diatom Navicula and cypris larvae of the barnacle Balanus amphitrite as well as low adhesion of sporelings (young plants) of Ulva, adhesion being lower than to a polydimethyl elastomer, Silastic T2.

36 MATERIALS SCIENCE↗

Performance of DSRC V2V Communication Networks in an Autonomous Semi-Truck Platoon Application

Autonomy for multiple trucks to drive in a fixedheadway platoon formation is achieved by adding precision GPS and V2V communications to a conventional adaptive cruise control (ACC) system. The performance of the Cooperative ACC (CACC) system depends heavily on the reliability of the underlying V2V communications network. Using data recorded on precision-instrumented trucks at both ACM and NCAT test tracks, we provide an understanding of various effects on V2V network performance: Occlusions - non-line-of-sight (NLOS) between the Tx and Rx antenna may cause network signal loss. Rain - water droplets in the air may cause network signal degradation. Antenna position - antennas at higher elevation may have less ground clutter to deal with. RF interference - interference may cause network packet loss. GPS outage - outages caused by tree cover, tunnels, etc. may result in degraded performance. Road curvature - curves may affect antenna diversity. Road grade - antenna may have limited vertical coverage. Our results, which include multiple plots and graphs and their analysis, build on those reported by others and could be of interest to researchers, practitioners, and end-users in the broader autonomous-connected vehicle community.

V2V communications, GPS, truck platoon, semi-auton↗

Optimal artificial neural network architecture selection for performance prediction of compact heat exchanger with the EBaLM-OTR technique

Artificial Neural Networks (ANN) have been used in the past to predict the performance of printed circuit heat exchangers (PCHE) with satisfactory accuracy. Typically published literature has focused on optimizing ANN using a training dataset to train the network and a testing dataset to evaluate it. Although this may produce outputs that agree with experimental results, there is a risk of over-training or overlearning the network rather than generalizing it, which should be the ultimate goal. An over-trained network is able to produce good results with the training dataset but fails when new datasets with subtle changes are introduced. In this paper we present EBaLM-OTR (error back propagation and Levenberg-Marquardt algorithms for over training resilience) technique, which is based on a previously discussed method of selecting neural network architecture that uses a separate validation set to evaluate different network architectures based on mean square error (MSE), and standard deviation of MSE. The method uses k-fold cross validation. Therefore in order to select the optimal architecture for the problem, the dataset is divided into three parts which are used to train, validate and test each network architecture. Then each architecture is evaluated according to their generalization capability and capability to conform to original data. The method proved to be a comprehensive tool in identifying the weaknesses and advantages of different network architectures. The method also highlighted the fact that the architecture with the lowest training error is not always the most generalized and therefore not the optimal. Using the method the testing error achieved was in the order of magnitude of within 10{sup -5} - 10{sup -3}. It was also show that the absolute error achieved by EBaLM-OTR was an order of magnitude better than the lowest error achieved by EBaLM-THP.

99 GENERAL AND MISCELLANEOUS↗

Advanced bandwidth scheduling algorithms in dedicated networks

An increasing number of high performance research network testbeds and production networks have the capability of provisioning dedicated channels for high speed data transfer in support of large scale scientific applications. Each dedicated channel in these networks typically consists of one or more physical links that are shared by multiple applications in both time and bandwidth through in advance reservation. The design of efficient bandwidth scheduling algorithms is critical to maximizing the utilization of dedicated network resources and meeting diverse end-to-end transport performance requirements. The topology of a dedicated network is represented by a graph, where each link maintains a list of residual bandwidths specified as segmented constant functions of time. Given a graph with an aggregated time-bandwidth table combining the reservation information on all links, designated source, and destination vertices, and a specified data size, we formulate and investigate five bandwidth scheduling problems to minimize the data transfer end time under different path and bandwidth constraints. (1) variable path with variable bandwidth (VPVB), which computes the widest (highest bandwidth) path in each time slot; (2) fixed path with variable bandwidth (FPVB), which computes a fixed path with varying bandwidths across different time slots; (3) variable path with fixed bandwidth (VPFB), which computes one path in each time slot with the same bandwidth; (4) fixed path with fixed bandwidth (FPFB), which computes a fixed path with a constant bandwidth; and (5) multiple fixed paths with fixed bandwidths (MFPFB), which computes multiple concurrent fixed paths with constant bandwidths. Among these problems, VPVB represents the most flexible scenario where the network resources are fully utilized and the minimal transfer end time is achieved, while FPFB imposes the most stringent transport conditions by fixing both path and bandwidth. We design an optimal algorithm for each of these scheduling problems. VPVB is solved using an extension of the classical Dijkstra's algorithm, and FPVB is solved using Maximum Permutation Algorithm, which tries all possible permutations of throughputs at different time slots to obtain the minimal transfer end time. The algorithm for VPFB, FPFB, and MFPFB are based on Adjacent Time Slots Search, which finds the minimum transfer end time by examining the possibility of data transfer in any number of contiguous time slots. All these algorithms are of polynomial or pseudo polynomial time complexity with respect to the network size and the total number of time slots in a bandwidth reservation table.

99 GENERAL AND MISCELLANEOUS↗

A Study of Complex Deep Learning Networks on High-Performance, Neuromorphic, and Quantum Computers

Current deep learning approaches have been very successful using convolutional neural networks trained on large graphical-processing-unit-based computers. Three limitations of this approach are that (1) they are based on a simple layered network topology, i.e., highly connected layers, without intra-layer connections; (2) the networks are manually configured to achieve optimal results, and (3) the implementation of the network model is expensive in both cost and power. In this paper, we evaluate deep learning models using three different computing architectures to address these problems: quantum computing to train complex topologies, high performance computing to automatically determine network topology, and neuromorphic computing for a low-power hardware implementation. We use the MNIST dataset for our experiment, due to input size limitations of current quantum computers. Our results show the feasibility of using the three architectures in tandem to address the above deep learning limitations. Finally, we show that a quantum computer can find high quality values of intra-layer connection weights in a tractable time as the complexity of the network increases, a high performance computer can find optimal layer-based topologies, and a neuromorphic computer can represent the complex topology and weights derived from the other architectures in low power memristive hardware.

97 MATHEMATICS AND COMPUTING↗

Quartz Dissolution Effects on Flow Channelization and Transport Behavior in Three‐Dimensional Fracture Networks

We perform a set of reactive transport simulations in three-dimensional fracture networks to characterize the impact of geochemical reactions on flow channelization. Flow channelization, a frequently observed phenomenon in porous and fractured subsurface rock formations, results from the spatially variable hydraulic resistance offered by a geological structure. In addition to geo-structural features such as network connectivity, geometry, and hydraulic resistance, geochemical reactions, for example, dissolution and precipitation, can dynamically inhibit or enhance flow channelization. These geochemical processes can change the fracture permeability leading to increased flow channelization, which are localized connected regions of high volumetric flow rates that are seemingly ubiquitous in the subsurface. In our simulations, fractures partially filled with quartz are gradually dissolved until quasi-steady state conditions are obtained. We compare the flow field's initial unreacted and final dissolved states in terms of flow and transport observations. We observe that the dissolved fracture networks provide less resistance to flow and exhibit increased flow channelization when compared to their unreacted counterparts. However, there is substantial variability in the magnitude of these changes which implies that the channelization strongly depends on the network structure. In turn, we identify the interplay between the particular network structure and the impact of geochemical dissolution on flow channelization. The presented results indicate that geological systems that have been weathering or reactive for longer times in older landscapes are likely to have increased flow channelization compared to their equivalent but younger counterparts, which implies a time dependence on flow channelization in fractured media.

Hyman, Jeffrey D.↗

Enhanced memory performance thanks to neural network assortativity

The behaviour of many complex dynamical systems has been found to depend crucially on the structure of the underlying networks of interactions. An intriguing feature of empirical networks is their assortativity--i.e., the extent to which the degrees of neighbouring nodes are correlated. However, until very recently it was difficult to take this property into account analytically, most work being exclusively numerical. We get round this problem by considering ensembles of equally correlated graphs and apply this novel technique to the case of attractor neural networks. Assortativity turns out to be a key feature for memory performance in these systems - so much so that for sufficiently correlated topologies the critical temperature diverges. We predict that artificial and biological neural systems could significantly enhance their robustness to noise by developing positive correlations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Predicting the performance of local seismic networks using Matlab and Google Earth.

We have used Matlab and Google Earth to construct a prototype application for modeling the performance of local seismic networks for monitoring small, contained explosions. Published equations based on refraction experiments provide estimates of peak ground velocities as a function of event distance and charge weight. Matlab routines implement these relations to calculate the amplitudes across a network of stations from sources distributed over a geographic grid. The amplitudes are then compared to ambient noise levels at the stations, and scaled to determine the smallest yield that could be detected at each source location by a specified minimum number of stations. We use Google Earth as the primary user interface, both for positioning the stations of a hypothetical local network, and for displaying the resulting detection threshold contours.

99 GENERAL AND MISCELLANEOUS↗

Updated Application of Frequency of Detection Methods for the INL Site Ambient Air Monitoring Network

This report presents a quantitative assessment of the current INL Site air monitoring network using frequency of detection (FD) methods. The first assessment of the INL network was performed in 2015 and made recommendations for improving the network. As a result of changes made in response to the recommendations and the addition of new source locations, the network was modified and reassessed in 2017. Since 2017, administration of the air sampling program has been consolidated under one contractor, which resulted in additional changes to the network (sampler numbers and locations) and changes in radionuclide detection levels. As a result of these changes and others, an updated assessment of the INL Site ambient air monitoring network was performed. The same two exposure scenarios used in previous assessments were used for this assessment: a resident scenario and a shepherd/rancher scenario. The resident was assumed to be continuously present at their residence/business/farm operation outside the INL Site boundary while the shepherd/rancher was assumed to be present 24-hours at the nearest INL grazing allotment boundary in each of the 22.5-degree sectors along the sector centerline from each source. Updates to both the resident and shepherd/rancher receptor locations were included. Other changes include updates to flow rates for stack sources, expansion of the list of important radionuclides based on the most recent National Emission Standards for Hazardous Pollutants (NESHAPs) analysis, and updated dose coefficients. The assessment was conducted to determine whether the current INL monitoring network is capable of detecting releases of important radionuclides from INL Site sources that have the potential to exceed a conservative dose threshold for the two exposure scenarios. The assessment revealed that for the resident scenario, the current network meets the desired performance objective (FD = 95%) for all radionuclides and sources except for Cl-36 from the TRA-770 stack (94.4%). For the shepherd/rancher scenario, the FD performance objective is met for all radionuclides and sources except tritium from MFC-774 and TAN 679 (91% for both). An investigation of reported emissions for the past three years revealed that Cl 36 is not emitted from TRA-770, and routine tritium emissions from MFC-774 and TAN-679 are very small and the sources are likely incapable of emitting enough tritium to cause a release that should be detectable by the monitoring network. This assessment is based on a conservative dose threshold. This coupled with fact that the FD for Cl 36 is only slightly less than the performance objective and Cl-36 is not emitted from TRA-770, modifying the network (i.e. adding another sampler, increasing sampler flow rate, moving samplers) to meet the 95% performance objective for this radionuclide/source/receptor scenario is not warranted. Similarly, because tritium emissions from MFC-774 and TAN-679 are very small and these two sources are likely incapable of causing a dose due to tritium release that should be detectable by the network, modifications to increase tritium detection for these sources is also unwarranted at this time. However, if it is required to meet the performance objective for tritium for all sources and receptor scenarios, additional analysis determined the FD could be raised from 91% to > 99% for both sources by adding two tritium samplers to the network.

61 RADIATION PROTECTION AND DOSIMETRY↗

Path-synchronous performance monitoring of interconnection networks based on source code attribution

Examples disclosed herein relate to path-synchronous performance monitoring of an interconnection network based on source code attribution. A processing node in the interconnection network has a profiler module to select a network transaction to be monitored, determine a source code attribution associated with the network transaction to be monitored, and issue a network command to execute the network transaction to be monitored. A logger module creates, in a buffer, a node temporal log associated with the network transaction and the network command. A drainer module periodically captures the node temporal log. The processing node has a network interface controller to receive the network command and mark a packet generated for the network command to be temporally tracked and attributed back to the source code attribution at each hop of the interconnection network traversed by the marked packet.

Chabbi, Milind M.↗

Inference-Engine v0.1.0

Given a pre-trained neural network, Inference-Engine performs maps network inputs to outputs by executing the forward pass through the provided network. Although the predominant programming language for machine-learning is Python, most high-performance computing (HPC) applications are written in Fortran, C, or C++. Inference-Engine aims to support HPC programs and is written in Fortran, a language with a large feature set supporting interoperability with C. This software exposes concurrency in a portable way by using standard language features that some modern Fortran compilers can exploit with various optimizations, including offloading computation to a Graphics Processing Unit (GPU). In particular, this software makes extensive use of Fortran's "do concurrent" parallel loop construct, implicitly parallel array statements, and pure procedures that can be invoked inside "do concurrent" blocks. Inference-Engine also supports dynamic choice of inference methods at runtime. Two current options include one method that uses Fortran's "dot_product" intrinsic function inside "do concurrent" blocks and another method that instead uses Fortran' "matmul" array intrinsic function. We plan to investigate automatic compiler offloading of "do concurrent" calculations to GPUs and compile-time substitution of optimized libraries such as the Basic Linear Algebra Library (BLAS) for "matmul" invocations. We also envision the potential for the choice of which method to use could happen at program launch based on in situ performance measurements on any given platform.

Rouson, Damian↗

Ergodicity, lack thereof, and the performance of reservoir computing with memristive networks and nanowire

Networks composed of nanoscale memristive components, such as nanowire and nanoparticle networks, have recently received considerable attention because of their potential use as neuromorphic devices. In this study, we explore ergodicity in memristive networks, showing that the performance on machine leaning tasks improves when these networks are tuned to operate at the edge between two global stability points. We find this lack of ergodicity is associated with the emergence of memory in the system. We measure the level of ergodicity using the Thirumalai-Mountain metric, and we show that in the absence of ergodicity, two different memristive network systems show improved performance when utilized as reservoir computers (RC). We highlight that it is also important to let the system synchronize to the input signal in order for the performance of the RC to exhibit improvements over the baseline.

97 MATHEMATICS AND COMPUTING↗

Ergodicity, lack thereof, and the performance of reservoir computing with memristive networks

Abstract Networks composed of nanoscale memristive components, such as nanowire and nanoparticle networks, have recently received considerable attention because of their potential use as neuromorphic devices. In this study, we explore ergodicity in memristive networks, showing that the performance on machine leaning tasks improves when these networks are tuned to operate at the edge between two global stability points. We find this lack of ergodicity is associated with the emergence of memory in the system. We measure the level of ergodicity using the Thirumalai-Mountain metric, and we show that in the absence of ergodicity, two different memristive network systems show improved performance when utilized as reservoir computers (RC). We highlight that it is also important to let the system synchronize to the input signal in order for the performance of the RC to exhibit improvements over the baseline.

97 MATHEMATICS AND COMPUTING↗

On the Traffic Impacts of Optimally Controlled Connected and Automated Vehicles

The implementation of connected and automated vehicle (CAV) technologies enables a novel computational framework for real-time control actions aimed at optimizing energy consumption and associated benefits. Several research efforts reported in the literature to date have proposed decentralized control algorithms to coordinate CAVs in various traffic scenarios, e.g., highway on-ramps, intersections, and roundabouts. However, the impact of optimally coordinating CAVs on the performance of a transportation network has not been thoroughly analyzed yet. In this paper, we apply a decentralized optimal control framework in a transportation network and compare its performance to a baseline scenario consisting of human-driven vehicles. We show that introducing of CAVs yields radically improved roadway capacity and network performance.

Zhao, Liuhui↗