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 631 records · Page 35

Analysis of space network loading

The NASA Space Network (SN) consists of several geosynchronous communications satellites, in addition to ground support facilities. Space Network management must predict years in advance what network resources are necessary to adequately satisfy all SN users. Similarly, users of the Space Network must know throughout all stages of mission planning and operations to what extent their communication support requirements can be met. NASA, at the Goddard Space Flight Center, performs Space Network and Mission Modeling using The Network Planning and Analysis System (NPAS), to determine the answers to these questions.

Simons, Mark↗

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↗

Implementing Journaling in a Linux Shared Disk File System

In computer systems today, speed and responsiveness is often determined by network and storage subsystem performance. Faster, more scalable networking interfaces like Fibre Channel and Gigabit Ethernet provide the scaffolding from which higher performance computer systems implementations may be constructed, but new thinking is required about how machines interact with network-enabled storage devices. In this paper we describe how we implemented journaling in the Global File System (GFS), a shared-disk, cluster file system for Linux. Our previous three papers on GFS at the Mass Storage Symposium discussed our first three GFS implementations, their performance, and the lessons learned. Our fourth paper describes, appropriately enough, the evolution of GFS version 3 to version 4, which supports journaling and recovery from client failures. In addition, GFS scalability tests extending to 8 machines accessing 8 4-disk enclosures were conducted: these tests showed good scaling. We describe the GFS cluster infrastructure, which is necessary for proper recovery from machine and disk failures in a collection of machines sharing disks using GFS. Finally, we discuss the suitability of Linux for handling the big data requirements of supercomputing centers.

Preslan, Kenneth W.↗

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↗

Characterizing 4-string contact interaction using machine learning

Abstract The geometry of 4-string contact interaction of closed string field theory is characterized using machine learning. We obtain Strebel quadratic differentials on 4-punctured spheres as a neural network by performing unsupervised learning with a custom-built loss function. This allows us to solve for local coordinates and compute their associated mapping radii numerically. We also train a neural network distinguishing vertex from Feynman region. As a check, 4-tachyon contact term in the tachyon potential is computed and a good agreement with the results in the literature is observed. We argue that our algorithm is manifestly independent of number of punctures and scaling it to characterize the geometry ofn-string contact interaction is feasible.

Physics↗

Macroscopic Traffic Modeling Using Probe Vehicle Data: A Machine Learning Approach

Abstract The macroscopic fundamental diagram (MFD) captures an orderly relationship among traffic flow, density, and speed at the network level. It is a simple yet powerful tool for modeling traffic dynamics in large urban networks with broad application in traffic control and management. However, empirically derived MFDs in urban regions require high-resolution traffic data from the network. Having the network flow and vehicular density estimated at the (granular) census tract level using vehicle probe data, we apply machine learning methods to predict the MFDs across U.S. urban areas and capture the impacts of location-specific input features on the network flow–density relationships at a large scale. The results show that, among the four tested machine learning approaches (Random Forest, XGBoost, Support Vector Machine, and Neural Network), XGBoost delivers the best performance in predicting network traffic flow based on vehicular density and location attributes. Using interaction Shapley Additive explanation (SHAP) values and partial correlation analysis, we examine the factors influencing MFD shapes across different locations. Our empirical findings reveal that across U.S. urban areas, network topology, transportation infrastructure, and land use are primary factors shaping MFD curves, while demand and trip-related factors play a lesser role. Specifically, higher ranking roads, centrality, and development levels correlate positively with network capacity and critical density, whereas negative associations are observed for network connectivity, mixed-use development, and road roughness levels.

Jin, Ling↗

BSTC: A Novel Binarized-Soft-Tensor-Core Design for Accelerating Bit-Based Approximated Neural Nets

Binarized neural network (or BNN) promises tremendous performance improvement over traditional DNNs through simplified bit-level computation and significantly reduced memory access/storage cost. In addition, it has other advantages of low-cost, low-energy and high-robustness, showing great utilization potential in resources-constrained, volatile and latency-critical applications, which are critical for future HPC execution. However, the promised significant performance gain of BNN inference has never been fully demonstrated on general-purpose processors, particularly on GPUs, due to: (i) the challenge to extract and leverage sufficient fine-grained bit-level-parallelism to saturate GPU cores when batch is small; (ii) the fundamental design conflict between bit-based BNN algorithm and underlying word-based architecture; (iii) architecture \& performance unfriendly BNN network design. To address (i) and (ii), we propose binarized-soft-tensor-core as a software-hardware codesign approach to construct bit-manipulation capability for modern GPUs to effectively harvest the emerging bit-level-parallelism. To tackle (iii), we propose intra- and inter-layer fusion techniques so that the entire BNN inference can be packed into a single GPU kernel, to avoid high-cost frequent launching. Experiments demonstrate that our design can achieve over 1000x speedup for raw inference latency and 10x for inference throughput over the state-of-the-art full-precision simulated BNN inference for AlexNet on ImageNet.

Li, Ang↗

Mass measurements of neutron rich isotopes in the Fe region and electron capture processes in neutron star crusts

Experimental knowledge of nuclear masses of exotic nuclei is important for understanding nu- clear structure far from the valley of -stability, and as a direct input into astrophysical models. Electron capture processes in the crust of accreting neutron stars have been proposed as a heat source that can affect the thermal structure of the star. Nuclear masses of very neutron-rich nu- clides are necessary inputs to model the electron capture process. The time-of-flight (TOF) mass measurement technique allows measurements on very short-lived nuclei. It has been effectively applied using the fast fragment beams produced at the National Superconducting Cyclotron Lab (NSCL) to reach masses very far from stability. Measurements were performed for neutron-rich isotopes in the region of the N=32 and N=40 subshells, which coincides with the mass range of carbon superburst ashes. We discuss reaction network calculations performed to investigate the impact of our new measurements and to compare the effect of using different global mass models in the calculations. It is observed that the process is sensitive to the differences in the odd-even mass staggering predicted by the mass models, and our new result for 66Mn has a significant impact on the distribution of heat sources in the crust.

43 PARTICLE ACCELERATORS↗

Design and Analysis of Convolutional Neural Network for RF Signal Modulation Classification for In-Orbit Deployment

To effectively transmit data to and from satellites requires a complex and robust RF communication system. Commonly, several different types of signal modulations may be required to maximize satellite efficiency depending on a variety of unexpected channel impairments. We propose a neural network algorithm capable of learning these RF signal modulations using a supervised learning technique designed for low power, high-efficiency in-orbit deployment. The work presented demonstrates a convolutional neural network (CNN) capable of learning and recognizing a set of modulation schemes commonly used to transmit RF information. We are capable of recognizing the modulation scheme from the I and Q data channels directly, with no preprocessing or data conversion required other than breaking the incoming signal into a set of uniform normalized samples. We perform a network design and size analysis, showing that reasonably high accuracy can be obtained using networks with a relatively low number of trainable parameters. Given that a user of a system such as this may wish to receive a signal using a modulation scheme that the network has not previously learned, we demonstrate that transfer learning can learn new modulation schemes by retraining only the fully connected layers in the CNN. Thus, this type of network would excel in outer space deployment using high-efficiency transfer learning hardware. Modulation recognition can be performed through rapid feedforward computation, and the CNN training process is significantly simplified when learning new modulations is required.

CNN↗

Performance of a distributed superscalar storage server

The RS/6000 performed well in our test environment. The potential exists for the RS/6000 to act as a departmental server for a small number of users, rather than as a high speed archival server. Multiple UniTree Disk Server's utilizing one UniTree Disk Server's utilizing one UniTree Name Server could be developed that would allow for a cost effective archival system. Our performance tests were clearly limited by the network bandwidth. The performance gathered by the LibUnix testing shows that UniTree is capable of exceeding ethernet speeds on an RS/6000 Model 550. The performance of FTP might be significantly faster if asked to perform across a higher bandwidth network. The UniTree Name Server also showed signs of being a potential bottleneck. UniTree sites that would require a high ratio of file creations and deletions to reads and writes would run into this bottleneck. It is possible to improve the UniTree Name Server performance by bypassing the UniTree LibUnix Library altogether and communicating directly with the UniTree Name Server and optimizing creations. Although testing was performed in a less than ideal environment, hopefully the performance statistics stated in this paper will give end-users a realistic idea as to what performance they can expect in this type of setup.

Finestead, Arlan↗

Laser Tracker Calibration - Testing the Angle Measurement System -

Physics experiments at the SLAC National Accelerator Laboratory (SLAC) usually require high accuracy positioning, e. g. 100 {micro}m over a distance of 150 m or 25 {micro}m in a 10 x 10 x 3 meter volume. Laser tracker measurement systems have become one of the most important tools for achieving these accuracies when mapping components. The accuracy of these measurements is related to the manufacturing tolerances of various individual components, the resolutions of measurement systems, the overall precision of the assembly, and how well imperfections can be modeled. As with theodolites and total stations, one can remove the effects of most assembly and calibration errors by measuring targets in both direct and reverse positions and computing the mean to obtain the result. However, this approach does not compensate for errors originating from the encoder system. In order to improve and gain a better understanding of laser tracker angle measurement tolerances we extended our laboratory's capabilities with the addition of a horizontal angle calibration test stand. This setup is based on the use of a high precision rotary table providing an angular accuracy of better than 0.2 arcsec. Presently, our setup permits only tests of the horizontal angle measurement system. A test stand for vertical angle calibration is under construction. Distance measurements (LECOCQ & FUSS, 2000) are compared to an interferometer bench for distances of up to 32 m. Together both tests provide a better understanding of the instrument and how it should be operated. The observations also provide a reasonable estimate of covariance information of the measurements according to their actual performance for network adjustments.

43 PARTICLE ACCELERATORS↗

Beam-waveguide antenna performance predictions with comparisons to experimental results

An overview of a NASA/JPL antenna project is presented, with specific focus on the methodology used to predict the microwave performance of a 34-m-diameter beam-waveguide (BWG) reflector antenna, designated DSS 13 (Deep Space Station 13). DSS 13 is the R&D facility serving the NASA/JPL Deep Space Network. Microwave performance predictions as well as a summary of test results for the antenna are given. The antenna has Cassegrain and centerline BWG operating modes at X-band (8.450-GHz) and Ka-band (32-GHz) frequencies. The performance predictions regarding antenna area efficiencies, corresponding beampeak gains, and for several (but not all) operating noise temperatures are found to agree reasonably well with the corresponding experimental results.

Bathker, Dan A.↗

Developing a Framework for Effective Network Capacity Planning

As Internet traffic continues to grow exponentially, developing a clearer understanding of, and appropriately measuring, network's performance is becoming ever more critical. An important challenge faced by the Information Resources Directorate (IRD) at the Johnson Space Center in this context remains not only monitoring and maintaining a secure network, but also better understanding the capacity and future growth potential boundaries of its network. This requires capacity planning which involves modeling and simulating different network alternatives, and incorporating changes in design as technologies, components, configurations, and applications change, to determine optimal solutions in light of IRD's goals, objectives and strategies. My primary task this summer was to address this need. I evaluated network-modeling tools from OPNET Technologies Inc. and Compuware Corporation. I generated a baseline model for Building 45 using both tools by importing "real" topology/traffic information using IRD's various network management tools. I compared each tool against the other in terms of the advantages and disadvantages of both tools to accomplish IRD's goals. I also prepared step-by-step "how to design a baseline model" tutorial for both OPNET and Compuware products.

Yaprak, Ece↗

Environment Adversarial Reinforcement Learning

This paper presents a training method for increasing performance of reinforcement learning agents. The method is named Environment Adversarial Reinforcement Learning. The method requires the reinforcement learning environment to be parameterizeable. Over the course of training, environment parameters are updated in a direction of increasing difficulty for the agent. The direction for these updates is found using a performance prediction network trained on data from tests of the agent under varying environment parameters. The method was tested on a CartPole environment. A 28-58\% improvement in mean return was found when comparing performance to a baseline reinforcement learning algorithm on both easy and hard versions of the task.

machine learning↗

Power, data latency, and radio frequnecy interference issues in Mars Realy Network scheduling

At different time periods in the future, missions to Mars will overlap. Previous studies indicate that during such periods, existing deep space communication infrastructure cannot handle all Mars communication needs. A plausible solution is to take into account the end-to-end communication performances of network along with operational constraints, and optimize the resource usage by scheduling communication at highest possible data throughputs. As a result, shorter communication time is required and more missions can be accommodated. This principle is demonstrated in this paper for a Mars relay communication network; a network consisting of multiple surface units and orbiters on Mars and the Deep Space Stations.

power latency RFI Mars Relay Network scheduling↗