Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMMUNICATIONS NETWORKS”

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 1,405 records · Page 78

A Data Gathering Scheme in Wireless Sensor Networks Based on Synchronization of Chaotic Spiking Oscillator Networks

This paper studies chaos-based data gathering scheme in multiple sink wireless sensor networks. In the proposed scheme, each wireless sensor node has a simple chaotic oscillator. The oscillators generate spike signals with chaotic interspike intervals, and are impulsively coupled by the signals via wireless communication. Each wireless sensor node transmits and receives sensor information only in the timing of the couplings. The proposed scheme can exhibit various chaos synchronous phenomena and their breakdown phenomena, and can effectively gather sensor information with the significantly small number of transmissions and receptions compared with the conventional scheme. Also, the proposed scheme can flexibly adapt various wireless sensor networks not only with a single sink node but also with multiple sink nodes. This paper introduces our previous works. Through simulation experiments, we show effectiveness of the proposed scheme and discuss its development potential.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

How to program 122,400 heterogeneous cores and retain your sanity

Current technology trends favor hybrid architectures, typically with each node in a cluster containing both general-purpose and specialized 'accelerator' processors. The typical model for programming such systems is host-centric: The general-purpose processor orchestrates the computation, offloading performance-critical work to the accelerator, and data is communicated only among general-purpose processors. In this talk we propose a radically different hybrid-programming approach, which we call the 'reverse-acceleration model'. In this model the accelerators orchestrate the computation, offloading unacceleratable work to the general-purpose processors. Data is communicated among accelerators, not among general-purpose processors. We present the Cell Messaging Layer (CML), an implementation of the reverse-acceleration model for Los Alamos National Laboratory's Roadrunner supercomputer, a complex conglomerate of 122,400 processor cores of various types, multiple memory domains, and multiple network types, all with radically different performance characteristics but which together make Roadrunner the world's second-fastest supercomputer. CML demonstrates a new messaging-layer implementation technique called 'receiver-initiated message passing', which reduces communication latency by up to a third. Our thesis is that the reverse-acceleration model simplifies porting codes to heterogeneous systems and facilitates performance optimization. We present a case study of a legacy neutron-transport code that we modified to use reverse acceleration. Performance results from running this code across the full Roadrunner system indicate a substantial performance improvement over the unaccelerated version of the code.

97 MATHEMATICS AND COMPUTING↗

Overlapping clusters for distributed computation.

Scalable, distributed algorithms must address communication problems. We investigate overlapping clusters, or vertex partitions that intersect, for graph computations. This setup stores more of the graph than required but then affords the ease of implementation of vertex partitioned algorithms. Our hope is that this technique allows us to reduce communication in a computation on a distributed graph. The motivation above draws on recent work in communication avoiding algorithms. Mohiyuddin et al. (SC09) design a matrix-powers kernel that gives rise to an overlapping partition. Fritzsche et al. (CSC2009) develop an overlapping clustering for a Schwarz method. Both techniques extend an initial partitioning with overlap. Our procedure generates overlap directly. Indeed, Schwarz methods are commonly used to capitalize on overlap. Elsewhere, overlapping communities (Ahn et al, Nature 2009; Mishra et al. WAW2007) are now a popular model of structure in social networks. These have long been studied in statistics (Cole and Wishart, CompJ 1970). We present two types of results: (i) an estimated swapping probability {rho}{infinity}; and (ii) the communication volume of a parallel PageRank solution (link-following {alpha} = 0.85) using an additive Schwarz method. The volume ratio is the amount of extra storage for the overlap (2 means we store the graph twice). Below, as the ratio increases, the swapping probability and PageRank communication volume decreases.

99 GENERAL AND MISCELLANEOUS↗

The role of social support on midwestern farmers’ willingness to grow perennial bioenergy crops

The lack of farmers' willingness to grow perennial bioenergy crops (PBCs) presents a critical barrier to the emergence of cellulosic biofuel production. The willingness relies on a complex network of economic, environmental, and social drivers, among which the influence of social factors (e.g., the influence of neighborhood, community, and communication) is less understood. This study addresses this knowledge gap via a survey analysis of midwestern farmers. The survey data are analyzed through ordinary least square regression and structural equation model, which together investigate the individual and interactive impacts of multiple factors on farmers' decisions to adopt PBCs. Based on a farm-scale analysis, six statistically significant predictors of farmer willingness to grow PBCs are identified: perception of PBCs' environment benefits, education level, willingness to take risks, familiarity with PBCs, portion of peers already growing PBCs, and support of biorefineries locating in the local community. Among these, the latter three predictors are social support variables. It is found that familiarity with the crops is the most significant predictor of willingness; familiarity is also an important intermediate variable that mediates the influence of many other predictors. In addition, peer adoption can both directly and indirectly affect willingness via its influence on familiarity. Furthermore, these findings suggest that it is a pressing need to improve farmers’ knowledge of PBCs to promote the adoption of such crops.

09 BIOMASS FUELS↗

Fast neural network training on a cluster of GPUs for action recognition with high accuracy

In this work, we propose algorithms and techniques to accelerate training of deep neural networks for action recognition on a cluster of GPUs. The convergence analysis of our algorithm shows it is possible to reduce communication cost and at the same time minimize the number of iterations needed for convergence. We customize the Adam optimizer for our distributed algorithm to improve efficiency. In addition, we employ transfer-learning to further reduce training time while improving validation accuracy. For the UCF101 and HMDB51 datasets, the validation accuracies achieved are 93.1% and 67.9% respectively. With an additional end-to-end trained temporal stream, the validation accuracies achieved for UCF101 and HMDB51 are 93.47% and 81.24% respectively. As far as we know, these are the highest accuracies achieved with the two-stream approach using ResNet that does not involve computationally expensive 3D convolutions or pretraining on much larger datasets.

97 MATHEMATICS AND COMPUTING↗

Computation-Efficient Algorithm for Distributed Feedback Optimization of Distribution Grids

Feedback-based optimization algorithms use real-time measurements to update the optimal control for the underlying system which may not be fully identified. Recently, we have developed a distributed feedback-based algorithm [1] that avoids the requirement of fast communication between central computing and local actuator/sensor agents. This paper extends the work by greatly reducing the number of copies of variables involved in the distributed feedback-based algorithm, which results in faster convergence and lower communication requirement. The main idea is to leverage the specific structural properties of the admittance matrix for distribution systems with tree network topology. We also show the effectiveness of the proposed algorithm in simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

MiniMOD

SAND2025-03854O MiniMod is a user-friendly software tool designed to assess the performance of high-performance computing (HPC) systems. Researchers can use the program to test communication methods and computational tasks to understand how different setups can affect application efficiency. This software is particularly useful for optimizing network performance in scientific research, simulations, and data analysis. MiniMod‘s flexible design allows users to make informed decisions about their computing environments, which can enhance productivity and results in real-world applications. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Dosanjh, Matthew [Sandia National Lab. (SNL-CA), L↗

Data for The Role of Social Support on Midwestern Farmers’ Willingness to Grow Perennial Bioenergy Crops

The lack of farmers’ willingness to grow perennial bioenergy crops (PBCs) presents a critical barrier to the emergence of cellulosic biofuel production. The willingness relies on a complex network of economic, environmental, and social drivers, among which the influence of social factors (e.g., the influence of neighborhood, community, and communication) is less understood. This study addresses this knowledge gap via a survey analysis of midwestern farmers. The survey data are analyzed through ordinary least square regression and structural equation model, which together investigate the individual and interactive impacts of multiple factors on farmers’ decisions to adopt PBCs. Based on a farm-scale analysis, six statistically significant predictors of farmer willingness to grow PBCs are identified: perception of PBCs’ environment benefits, education level, willingness to take risks, familiarity with PBCs, portion of peers already growing PBCs, and support of biorefineries locating in the local community. Among these, the latter three predictors are social support variables. It is found that familiarity with the crops is the most significant predictor of willingness; familiarity is also an important intermediate variable that mediates the influence of many other predictors. In addition, peer adoption can both directly and indirectly affect willingness via its influence on familiarity. These findings suggest that it is a pressing need to improve farmers’ knowledge of PBCs to promote the adoption of such crops.

Economics↗

Magnetization of Materials in Pulsed Magnetic Fields

Magnetism has proven pivotal in the development of many technologies. From navigation compasses, imaging devices in medicine and electric motors, exploitation of the magnetic field on both the macroscopic and atomic scale has played an important role in human development. There is particular interest in the magnetic properties of materials, especially due to the incomplete understanding of why some materials behave magnetically in a specific manner. This has been motivated in some cases by the desire to engineer compounds to fulfil specific roles. One group of compounds being investigated for this purpose are known as molecular magnets, so-called as they are formed of discrete molecule-based units with metal ions providing a magnetic moment while organic or inorganic molecules bridge these metal centres. They can be large, discrete molecular clusters (referred to as 0-D molecular magnets) or long coordination networks in 1-D, 2-D or 3-D. The dimensionality here refers to the number of directions in which spins communicate: all directions (3-D), only in planes (2-D), only in chains (1-D) or no long range communication (0-D). These organometallic compounds, they are sometimes referred to as metal organic frameworks (MOFs) though there is some discrepancy in conventions in regards to whether MOFs should be different from molecular magnets. Molecular magnets offer flexible synthesis routes towards magnetic materials. Being transition complexes, ligands can be substituted to refine the magnetic properties of the final product or the metallic centre can be changed. This can be accomplished through as simple a method as different reactant ratios Materials with novel properties are also being sought such as magnetoelectric multiferroic compounds which display simultaneous ferromagnetism and ferroelectricity.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Case Study of MPI Over Long Distance Connections

Scientific workflows are increasingly being distributed across wide-area networks, and their code executions are expected to span across geographically dispersed computing systems. MPI has been extensively used to support communications for distributed computations, typically, over compute clusters and high-performance systems within a single facility. We present a case study of performance of MPI basic operations over long distance connections, wherein TCP is used for the underlying transport. We present measurements of execution times of MPI codes that utilize MPI Sendrecv operations over emulated 10Gbps connections with 0-366ms round-trip times, including the longest one spanning the globe. They demonstrate that basic MPI codes can be sustained over long distance connections under external packet loss rates up to 10%. They also highlight the qualitative effects of losses which manifest as increased execution times as a consequence of TCP’s loss recovery process.

Rao, Nageswara S.↗

Disaster-survivable cloud-network mapping

Cloud-computing services are provided to consumers through a network of servers and network equipment. Cloud-network (CN) providers virtualize resources [e.g., virtual machine (VM) and virtual network (VN)] for efficient and secure resource allocation. Disasters are one of the worst threats for CNs as they can causemassive disruptions and CN disconnection. A disaster may also induce post-disaster correlated, cascading failures which can disconnect more CNs. Survivable virtual-network embedding (SVNE) approaches have been studied to protect VNs against single physical-link/- node and dual physical-link failures in communication infrastructure, but massive disruptions due to a disaster and their consequences can make SVNE approaches insufficient to guarantee cloud-computing survivability. In this work, we study the problem of survivable CN mapping from disaster. We consider risk assessment, VM backup location, and post-disaster survivability to reduce the risk of failure and probability of CN disconnection and the penalty paid by operators due to loss of capacity.We formulate the proposed approach as an integer linear program and study two scenarios: a natural disaster, e.g., earthquake and a human-made disaster, e.g., weapons-of-mass-destruction attack. Finally, our illustrative examples show that our approach reduces the risk of CN disconnection and penalty up to 90% compared with a baseline CN mapping approach and increases the CN survivability up to 100% in both scenarios.

97 MATHEMATICS AND COMPUTING↗

Stable parallel training of Wasserstein conditional generative adversarial neural networks

In this work, we propose a stable, parallel approach to train Wasserstein conditional generative adversarial neural networks (W-CGANs) under the constraint of a fixed computational budget. Differently from previous distributed GANs training techniques, our approach avoids inter-process communications, reduces the risk of mode collapse and enhances scalability by using multiple generators, each one of them concurrently trained on a single data label. The use of the Wasserstein metric also reduces the risk of cycling by stabilizing the training of each generator. We illustrate the approach on the CIFAR10, CIFAR100, and ImageNet1k datasets, three standard benchmark image datasets, maintaining the original resolution of the images for each dataset. Performance is assessed in terms of scalability and final accuracy within a limited fixed computational time and computational resources. To measure accuracy, we use the inception score, the Fréchet inception distance, and image quality. An improvement in inception score and Fréchet inception distance is shown in comparison to previous results obtained by performing the parallel approach on deep convolutional conditional generative adversarial neural networks as well as an improvement of image quality of the new images created by the GANs approach. Weak scaling is attained on both datasets using up to 2000 NVIDIA V100 GPUs on the OLCF supercomputer Summit.

97 MATHEMATICS AND COMPUTING↗

Detecting control system misbehavior by fingerprinting programmable logic controller functionality

In recent years, attacks such as the Stuxnet malware have demonstrated that cyberattacks against control systems cause extensive damage. These attacks can result in physical damage to the networked systems under their control. In this paper, we discuss our approach for detecting such attacks by distinguishing between programs running on a programmable logic controller (PLC) without having to monitor communications. Using power signatures generated by an attached, high-frequency power measurement device, we can identify what a PLC is doing and when an attack may have altered what the PLC should be doing. To accomplish this, we generated labeled data for testing our methods and applied feature engineering techniques and machine learning models. The results of this research demonstrate that Random Forests and Convolutional Neural Networks classify programs with up to 98% accuracy for major program differences and 84% accuracy for minor differences. Our results can be used for both online and offline applications.

97 MATHEMATICS AND COMPUTING↗

Runtime Performance and Virtual Network Control Alternatives in VM-Based High-Fidelity Network Simulations

In prior work (Yoginath and Perumalla, 2011; Yoginath, Perumalla and Henz, 2012), the motivation, challenges and issues were articulated in favor of virtual time ordering of Virtual Machines (VMs) in network simulations hosted on multi-core machines. Two major components in the overall virtualization challenge are (1) virtual timeline establishment and scheduling of VMs, and (2) virtualization of inter-VM communication. Here, we extend prior work by presenting scaling results for the first component, with experiment results on up to 128 VMs scheduled in virtual time order on a single 12-core host. We also explore the solution space of design alternatives for the second component, and present performance results from a multi-threaded, multi-queue implementation of inter-VM network control for synchronized execution with VM scheduling, incorporated in our NetWarp simulation system.

Yoginath, Srikanth B↗

Modelling the transmission of a 40-Gbit s{sup -1} NRZ-ADPSK signal in 50-GHz networks

We study numerically the effect of linear and nonlinear distortions on the transmission of a 40-Gbit s{sup -1} NRZ-ADPSK signal. The results of the numerical simulation coincide within the measurement accuracy with the experimental data, which indicates the adequacy of the mathematical model of the communication line, transmitter and receiver. We have found experimentally and numerically that in communication systems based on a standard telecommunication fibre negative dispersion (approximately -160 ps nm{sup -1}) introduced into the signal being transmitted provides an increase in the maximum admissible signal power coupled into a span and in the value of the admissible attenuation of the spans at 2 dB. It is established that nonlinear distortions caused by the presence of adjacent channels in a frequency network with a step of 50 and 100 GHz (crosstalks) are insignificant in comparison with the interchannel nonlinear distortions. (optical information transmission)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

LADS: Optimizing Data Transfers using Layout-Aware Data Scheduling

While future terabit networks hold the promise of signifi- cantly improving big-data motion among geographically distributed data centers, significant challenges must be overcome even on today s 100 gigabit networks to real- ize end-to-end performance. Multiple bottlenecks exist along the end-to-end path from source to sink. Data stor- age infrastructure at both the source and sink and its in- terplay with the wide-area network are increasingly the bottleneck to achieving high performance. In this paper, we identify the issues that lead to congestion on the path of an end-to-end data transfer in the terabit network en- vironment, and we present a new bulk data movement framework called LADS for terabit networks. LADS ex- ploits the underlying storage layout at each endpoint to maximize throughput without negatively impacting the performance of shared storage resources for other users. LADS also uses the Common Communication Interface (CCI) in lieu of the sockets interface to use zero-copy, OS-bypass hardware when available. It can further im- prove data transfer performance under congestion on the end systems using buffering at the source using flash storage. With our evaluations, we show that LADS can avoid congested storage elements within the shared stor- age resource, improving I/O bandwidth, and data transfer rates across the high speed networks.

Data Management↗

Robust Decentralized Secondary Control Scheme for Inverter-based Power Networks

Inverter-dominated microgrids are quickly becoming a key building block of future power systems. They rely on centralized controllers that can provide reliability and resiliency in extreme events. Nonetheless, communication failures due to cyber-physical attacks or natural disasters can make autonomous operation of islanded microgrids challenging. This paper examines a unified decentralized secondary control scheme that is robust to inverter clock synchronization errors and can be seamlessly applied to grid-following or grid-forming control architectures. The proposed scheme overcomes the well-known stability problem that arises from parallel operation of local integral controllers. Theoretical guarantees for stability are provided along with criteria to appropriately tune the secondary control gains to achieve good frequency regulation performance while ensuring fair power sharing. The efficacy of our approach is demonstrated through simulations on a 5-bus microgrid with four grid-forming inverters.

24 POWER TRANSMISSION AND DISTRIBUTION↗