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 415 records · Page 23

Role of interaction between hydraulic and natural fractures on production

One of the main purposes of hydraulic fracturing in unconventional resources such as shale is to improve the connectivity between existing natural fractures and the production well. Since the inherent permeability of shale is extremely low, this newly formed fracture connectivity provides faster paths for the hydrocarbon stored in preexisting natural fractures. In this study, we performed numerical simulations of the free gas production at large scale fractured reservoir with different pre-existing natural fracture network intensities and with variable hydraulic fracture sizes and staging. We explored production characteristics as a function of the properties of both, natural fractures (intensity) and hydraulic fractures (size and staging). Our hypothesis is that once maximum fracture connectivity is achieved, additional stimulation does not increase production significantly. In this numerical study we use an advanced modeling tool to study fractures connectivity, Discrete Fracture Network (DFN) approach, which can represent fracture networks similar to those observed on individual reservoir sites. In our model the horizontal production well and vertical hydraulic fractures were deterministically defined and surrounded by stochastically generated natural fracture networks. The performed numerical experiments show how fracture connectivity depends on hydraulic fracture settings in fractured reservoir with different preexisting fracture densities. We numerically showed that cumulative free gas production is not affected significantly by hydraulic fractures size (25 m–150 m) or spacing (15 m–45 m) for dense natural fracture networks. However, the hydraulic fracture size is important in reservoirs with sparse natural fractures, although spacing (number of stages) does not play a significant role.

58 GEOSCIENCES↗

Auto-HPCnet: An Automatic Framework to Build Neural Network-based Surrogate for High-Performance Computing Applications

High-performance computing communities are increasingly adopt- ing Neural Networks (NN) as surrogate models in their applications to generate scientific insights. Replacing an execution phase in the application with NN models can bring significant performance im- provement. However, there is a lack of tools that can help domain scientists automatically apply NN-based surrogate models to HPC applications. We introduce a framework, named Auto-HPCnet, to democratize the usage of NN-based surrogates. Auto-HPCnet is the first end-to-end framework that makes past proposals for the NN-based surrogate model practical and disciplined. Auto-HPCnet introduces a workflow to address unique challenges when apply- ing the approximation, such as feature acquisition and meeting the application-specific constraint on the quality of final computation outcome. We show that Auto-HPCnet can leverage NN for a set of HPC applications and achieve 5.50× speedup on average (up to 16.8× speedup and with data preparation cost included) while meeting the application-specific constraint on the final computation quality.

Dong, Wenqian↗

Putting the Pieces Together: High-performance LC-MS/MS Provides Network-, Pathway-, and Protein-level Perspectives in Populus

High-performance mass spectrometry (MS)-based proteomics enabled the construction of a detailed proteome atlas for Populus, a woody perennial plant model organism. Optimization of experimental procedures and implementation of current state-of-the-art instrumentation afforded the most detailed look into the predicted proteome space of Populus, offering varying proteome perspectives: 1) network-wide, 2) pathway-specific, and 3) protein-level viewpoints. Together, enhanced protein retrieval through a detergent-based lysis approach and maximized peptide sampling via the dual-pressure linear ion trap mass spectrometer (LTQ Velos), have resulted in the identification of 63,056 tryptic peptides. The technological advancements, specifically spectral- acquisition and sequencing speed, afforded the deepest look into the Populus proteome, with peptide abundances spanning 6 orders of magnitude and mapping to~25% of the predicted proteome space. In total, tryptic peptides mapped to 13,574 protein assignments across four organ-types: mature (fully expanded, leaf plastichronic index (LPI) 10-12) leaf, young (juvenile, LPI 4-6) leaf, root, and stem. To resolve protein ambiguity, identified proteins were grouped by sequence similarity ( 90%), thereby reducing the protein assignments into 7,538 protein groups. In addition, this large-scale data set features the first systems-wide survey of protein expression across different Populus organs. As a demonstration of the precision and comprehensiveness of the semi-quantitative analysis, we were able to contrast two stages of leaf development, mature versus young leaf. Statistical comparison through ANOVA analysis revealed 1,432 protein groups that exhibited statistically significant (p 0.01) differences in protein abundance. Experimental validation of the metabolic circuitry expected in mature leaf (characterized by photosynthesis and carbon fixation) compared to young leaf (characterized by rapid growth and moderate photosynthetic activities) strongly testifies to the credibility of the approach. Instead of quantitatively comparing a few proteins, a systems view of all the changes associated with a given cellular perturbation could be made.

Abraham, Paul E↗

So ware-Defined Network Solutions for Science Scenarios: Performance Testing Framework and Measurements

High-performance scientific work flows utilize supercomputers, scientific instruments, and large storage systems. Their executions require fast setup of a small number of dedicated network connections across the geographically distributed facility sites. We present Software-Defined Network (SDN) solutions consisting of site daemons that use dpctl, Floodlight, ONOS, or OpenDaylight controllers to set up these connections. The development of these SDN solutions could be quite disruptive to the infrastructure, while requiring a close coordination among multiple sites; in addition, the large number of possible controller and device combinations to investigate could make the infrastructure unavailable to regular users for extended periods of time. In response, we develop a Virtual Science Network Environment (VSNE) using virtual machines, Mininet, and custom scripts that support the development, testing, and evaluation of SDN solutions, without the constraints and expenses of multi-site physical infrastructures; furthermore, the chosen solutions can be directly transferred to production deployments. By complementing VSNE with a physical testbed, we conduct targeted performance tests of various SDN solutions to help choose the best candidates. In addition, we propose a switching response method to assess the setup times and throughput performances of different SDN solutions, and present experimental results that show their advantages and limitations.

Settlemyer, Bradley↗

Limited-path-length entanglement percolation in quantum complex networks

We study entanglement distribution in quantum complex networks where nodes are connected by bipartite entangled states. These networks are characterized by a complex structure, which dramatically affects how information is transmitted through them. For pure quantum state links, quantum networks exhibit a remarkable feature absent in classical networks: it is possible to effectively rewire the network by performing local operations on the nodes. We propose a family of such quantum operations that decrease the entanglement percolation threshold of the network and increase the size of the giant connected component. We provide analytic results for complex networks with an arbitrary (uncorrelated) degree distribution. These results are in good agreement with numerical simulations, which also show enhancement in correlated and real-world networks. The proposed quantum preprocessing strategies are not robust in the presence of noise. However, even when the links consist of (noisy) mixed-state links, one can send quantum information through a connecting path with a fidelity that decreases with the path length. In this noisy scenario, complex networks offer a clear advantage over regular lattices, namely, the fact that two arbitrary nodes can be connected through a relatively small number of steps, known as the small-world effect. We calculate the probability that two arbitrary nodes in the network can successfully communicate with a fidelity above a given threshold. This amounts to working out the classical problem of percolation with a limited path length. We find that this probability can be significant even for paths limited to few connections and that the results for standard (unlimited) percolation are soon recovered if the path length exceeds by a finite amount the average path length, which in complex networks generally scales logarithmically with the size of the network.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Assessment of Existing Synchrophasor Networks (Final, Version 0.5)

In 2007-09, DOE worked with NASPI to fund the development of an architecture framework for synchrophasor data networks. That “NASPInet” framework has been the prevailing guidance since that time, and various NASPInet elements were incorporated and tested in several of the SGIG synchrophasor projects. But the NASPInet framework is now outdated; synchrophasor technology has evolved; data volumes are increasing exponentially, and networking technology changes markedly every year. Many of the NASPInet design concepts remain useful, but implementations have fallen short; the NASPInet architecture must be sharpened and projected forward in terms of technology capability to enable the design and deployment of the next generation of synchrophasor data networks. The NASPInet 2.0 project is intended to update the NASPInet framework to address the new technology opportunities and needs for synchrophasor data networks. The main objectives of this project are to assess existing synchrophasor data networks, evaluate current and future networking technologies and synchrophasor network needs, perform a gap analysis, and recommend a path forward and specific technology and design recommendations for the next generation of synchrophasor data networks (henceforth to be called NASPInet 2.0).

97 MATHEMATICS AND COMPUTING↗

One network metric datastore to track them all: the OSG network metric service

The Open Science Grid (OSG) relies upon the network as a critical part of the distributed infrastructures it enables. In 2012, OSG added a new focus area in networking with a goal of becoming the primary source of network information for its members and collaborators. This includes gathering, organizing, and providing network metrics to guarantee effective network usage and prompt detection and resolution of any network issues, including connection failures, congestion, and traffic routing. In September of 2015, this service was deployed into the OSG production environment. We will report on the creation, implementation, testing, and deployment of the OSG Networking Service. Starting from organizing the deployment of perfSONAR toolkits within OSG and its partners, to the challenges of orchestrating regular testing between sites, to reliably gathering the resulting network metrics and making them available for users, virtual organizations, and higher level services, all aspects of implementation will be reviewed. In particular, several higher-level services were developed to bring the OSG network service to its full potential. These include a web-based mesh configuration system, which allows central scheduling and management of all the network tests performed by the instances; a set of probes to continually gather metrics from the remote instances and publish it to different sources; a central network datastore (esmond), which provides interfaces to access the network monitoring information in close to real time and historically (up to a year) giving the state of the tests; and a perfSONAR infrastructure monitor system, ensuring the current perfSONAR instances are correctly configured and operating as intended. We will also describe the challenges we encountered in ongoing operations of the network service and how we have evolved our procedures to address those challenges. Finally we will describe our plans for future extensions and improvements to the service.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Parallel Evolutionary Optimization for Neuromorphic Network Training

One of the key impediments to the success of current neuromorphic computing architectures is the issue of how best to program them. Evolutionary optimization (EO) is one promising programming technique; in particular, its wide applicability makes it especially attractive for neuromorphic architectures, which can have many different characteristics. In this paper, we explore different facets of EO on a spiking neuromorphic computing model called DANNA. We focus on the performance of EO in the design of our DANNA simulator, and on how to structure EO on both multicore and massively parallel computing systems. We evaluate how our parallel methods impact the performance of EO on Titan, the U.S.'s largest open science supercomputer, and BOB, a Beowulf-style cluster of Raspberry Pi's. We also focus on how to improve the EO by evaluating commonality in higher performing neural networks, and present the result of a study that evaluates the EO performed by Titan.

97 MATHEMATICS AND COMPUTING↗

Parallel Evolutionary Optimization for Neuromorphic Network Training

One of the key impediments to the success of current neuromorphic computing architectures is the issue of how best to program them. Evolutionary optimization (EO) is one promising programming technique; in particular, its wide applicability makes it especially attractive for neuromorphic architectures, which can have many different characteristics. In this paper, we explore different facets of EO on a spiking neuromorphic computing model called DANNA. We focus on the performance of EO in the design of our DANNA simulator, and on how to structure EO on both multicore and massively parallel computing systems. We evaluate how our parallel methods impact the performance of EO on Titan, the U.S.'s largest open science supercomputer, and BOB, a Beowulf-style cluster of Raspberry Pi's. We also focus on how to improve the EO by evaluating commonality in higher performing neural networks, and present the result of a study that evaluates the EO performed by Titan.

Schuman, Catherine D↗

Stochasticity and robustness in spiking neural networks

Despite drawing inspiration from biological systems which are inherently noisy and variable, artificial neural networks have been shown to require precise weights to carry out the task which they are trained to accomplish. This creates a challenge when adapting these artificial networks to specialized execution platforms which may encode weights in a manner which restricts their accuracy and/or precision.Reflecting back on the non-idealities which are observed in biological systems, we investigated the effect these properties have on the robustness of spiking neural networks under perturbations to weights. First, we examined techniques extant in conventional neural networks which resemble noisy processes, and postulated they may produce similar beneficial effects in spiking neural networks. Second, we evolved a set of spiking neural networks utilizing biological non-idealities to solve a pole-balancing task, and estimated their robustness. We showed it is higher in networks using noisy neurons, and demonstrated that one of these networks can perform well under the variance expected when a hafnium-oxide based resistive memory is used to encode synaptic weights. Lastly, we trained a series of networks using a surrogate gradient method on the MNIST classification task. We confirmed that these networks demonstrate similar trends in robustness to the evolved networks. We discuss these results and argue that they display empirical evidence supporting the role of noise as a regularizer which can increase network robustness.

97 MATHEMATICS AND COMPUTING↗

An Online Prototype Toolset for Predicting and Optimizing P&T Performance (FY23 Status Report)

A new web-based toolset is being developed to support ongoing remediation optimization efforts and implementation of an adaptive site management strategy for the 200 West Area Pump-and-Treat (P&T) system at the Hanford Site. This toolset, comprising the well performance index tool and the well optimization pre-screening tool, will offer a user-friendly interface to predict and optimize the P&T well network’s performance at a preliminary level. Efforts in fiscal year (FY) 2023 focused on three main components: updating the existing deep learning model for predicting P&T performance, designing and developing a prototype of a web-based performance index tool, and initiating the conceptual design of the well optimization pre-screening tool. The well performance index tool is based on a pre-trained deep learning model that allows users to select a target contaminant and well screen length, then visualize the predicted performance of potential new wells across the site. The well optimization pre-screening tool includes two separate modules: the pre-computed scenario viewer, which organizes and visualizes offline optimization simulation results, and the quick analysis module, which provides real-time model prediction using user-specified well locations. In FY24, the plan is to add web-based applications to SOCRATES for both the well performance prediction tool and the optimization prescreening tool, with accompanying user and theory guides. These tools are intended to enable an accessible, easily applied, and transparent approach to remedy planning and decision-making.

97 MATHEMATICS AND COMPUTING↗

Developing a Hybrid Electric Vehicle Eco-Cooperative Adaptive Cruise Control System at Signalized Intersections.

This study develops an eco-driving strategy for hybrid electric vehicles (HEVs) in the vicinity of signalized intersections, entitled HEV Eco-Cooperative Adaptive Cruise Control at Intersections (Eco-CACC-I). The proposed system computes real-time, energy-optimized vehicle trajectories using HEV vehicle dynamics and energy consumption models. In the proposed system, a simple HEV energy model is used to compute the instantaneous fuel consumption. This HEV energy model is selected since it is general, transferable, and can be easily used to compute instantaneous energy consumption levels for HEVs without the additional input of vehicle engine data or complicated power control strategies. In addition, a vehicle dynamics model is used to capture the relationship between speed, acceleration level, and tractive/resistance forces on vehicles. The energy-optimum problem is formulated as an optimization problem with constraints, which is solved using a moving-horizon dynamic programming approach. The proposed HEV Eco-CACC-I system was tested to evaluate its performance for various speed limits, roadway grades, and signal timings. Lastly, the proposed HEV controller was implemented in a microscopic traffic simulation software to test its network-wide performance. The test results from an arterial corridor with three signalized intersections demonstrate that the proposed system can effectively reduce stop-and-go traffic in the vicinity of signalized intersections producing savings of 7.4% in energy consumption, 5.8% in traffic delay and 23% vehicle stops, respectively.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Integrated network design and scheduling problems :

We consider the class of integrated network design and scheduling problems. These problems focus on selecting and scheduling operations that will change the characteristics of a network, while being speci cally concerned with the performance of the network over time. Motivating applications of INDS problems include infrastructure restoration after extreme events and building humanitarian distribution supply chains. While similar models have been proposed, no one has performed an extensive review of INDS problems from their complexity, network and scheduling characteristics, information, and solution methods. We examine INDS problems under a parallel identical machine scheduling environment where the performance of the network is evaluated by solving classic network optimization problems. We classify that all considered INDS problems as NP-Hard and propose a novel heuristic dispatching rule algorithm that selects and schedules sets of arcs based on their interactions in the network. We present computational analysis based on realistic data sets representing the infrastructures of coastal New Hanover County, North Carolina, lower Manhattan, New York, and a realistic arti cial community CLARC County. These tests demonstrate the importance of a dispatching rule to arrive at near-optimal solutions during real-time decision making activities. We extend INDS problems to incorporate release dates which represent the earliest an operation can be performed and exible release dates through the introduction of specialized machine(s) that can perform work to move the release date earlier in time. An online optimization setting is explored where the release date of a component is not known.

Nurre, Sarah G.↗

Longitudinal Trajectories of Memory Performance in Patients with Early-Stage Breast Cancer

Background. While breast cancer and its treatments may affect cognition, the longitudinal trajectories of cognition among those receiving differing cancer treatment types remain poorly understood. Prior research suggests hippocampal-prefrontal cortex network integrity may influence cognition, although how this network predicts performance over time remains unclear. Methods. We conducted a prospective trial including 69 patients with early-stage breast cancer receiving adjuvant therapy and 12 controls. Longitudinal cognitive testing was conducted at four visits: pretreatment-baseline, 6-7 months, 14-15 months, and 23-24 months. Cognitive composite scores of episodic memory, executive functioning, and processing speed were assessed at each timepoint. Baseline structural MRI was obtained in a subset of these participants, and hippocampal and prefrontal cortex regional volumes were extracted. Results. Longitudinal linear mixed modeling revealed significant group by time interactions on memory performance, controlling for age and education. Post hoc analyses revealed this effect was driven by patients treated with chemotherapy or chemotherapy plus hormone therapy, who demonstrated the least improvement in memory scores over time. Treatment group did not significantly influence the relationship between time and processing speed or executive functioning. Neither pretreatment hippocampal nor prefrontal volume differed between groups, and there were no significant group by time by baseline regional volume effects on cognition. Conclusion. Patients with early-stage breast cancer treated with chemotherapy or chemotherapy plus hormone therapy benefit less from practice effects seen in healthy controls on memory tests. Loss of longitudinal practice effect may be a new and clinically relevant measure for capturing patients’ experience of cognitive difficulties after treatment.

60 APPLIED LIFE SCIENCES↗

Automated species-level identification of planktic foraminifera using convolutional neural networks, with comparison to human performance

Picking foraminifera from sediment samples is an essential, but repetitive and low-reward task that is well-suited for automation. The first step toward building a picking robot is the development of an automated identification system. We use machine learning techniques to train convolutional neural networks (CNNs) to identify six species of extant planktic foraminifera that are widely used by paleoceanographers, and to distinguish the six species from other taxa. We employ CNNs that were previously built and trained for image classification. Foraminiferal training and identification use reflected light microscope digital images taken at 16 different illumination angles using a light-emitting diode (LED) ring. Overall machine accuracy, as a combination of precision and recall, is better than 80% even with limited training. We compare machine performance to that of human pickers (six experts and five novices) by tasking each with the identification of 540 specimens based on images. Experts achieved comparable precision but poorer recall relative to the machine, with an average accuracy of 63%. Novices scored lower than experts on both precision and recall, for an overall accuracy of 53%. The machine achieved fairly uniform performance across the six species, while participants' scores were strongly species-dependent, commensurate with their past experience and expertise. The machine was also less sensitive to specimen orientation (umbilical versus spiral views) than the humans. Finally, these results demonstrate that our approach can provide a versatile ‘brain’ for an eventual automated robotic picking system.

58 GEOSCIENCES↗

Multiagent-Based Dynamic Voltage Support of Power Converters During Fault Ride-Through

Reference point of applicability (RPA) is a predefined point in a distribution network that performance requirements shall apply. As RPA is not directly controlled by a dedicated distributed energy resource (DER), it requires an aggregate response of multiple DERs over a complex meshed network. Here, this article presents a multiagent-based distributed dynamic voltage support (DDVS) method for coordinated aggregate response of multiple DER units to support RPA voltage profile during and after fault ride-through. DDVS implements a multiagent-based leader target tracking scheme with velocity matching and flock centering features to avoid uncoordinated current injections of cooperative DERs. The DDVS is an event-based approach based on RPA requirements. Two-dimensional voltage support objective is handled: 1) coordinated positive sequence current injection for voltage magnitude boosting and 2) coordinated negative sequence current injection for unbalance voltage mitigation. The results demonstrate that the proposed DDVS algorithm addresses emerging coordinated DVS requirement of DERs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

SeaStar Unchained: Multiplying the Performance of the Cray SeaStar Network

The Oak Ridge Leadership Computing Facility (OLCF) supports many different systems and many differ- ent interconnects. The only common programming interfaces across these systems are BSD Sockets and MPI. Due to the design assumptions such as implicit buffering leading to extra copies, Sockets performance is almost universally lower than the native interface. Even in the cases that Sockets provides similar bandwidth as the native interface, it suffers from excessive CPU usage. MPI is the de-facto interface for intra- job communication, but is difficult to use between jobs and provides no ability to communicate with service nodes or off- system nodes (e.g. for I/O forwarding). We have developed the Common Communication Interface (CCI), a programming interface that exposes the advances in interconnect hardware, notably Remote Direct Memory Access (RDMA) and operating system (OS) bypass, while imposing as little overhead as possible. This API directly supports inter-job as well as off- system communication. CCI is a lightweight abstraction layer that provides point-to-point messaging and remote memory access. The Cray SeaStar ASIC, with its programmable embedded processor, provides an excellent platform to investigate the properties of various network protocols and programming interfaces. This paper describes our native implementation CCI on the SeaStar platform, and details how we implemented full OS bypass for common operations. We demonstrate a 30% to 50% reduction in latency, more than a six-fold increase in message injection rate, and an almost 7x improvement in bandwidth for small message sizes when compared to the generic Cray Portals implementation.

Dillow, David A↗