Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Network partitioning”

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 181 records · Page 10

Virtual-Voltage Partition-Based Approach to Optimal Transmission Switching

This article deals with optimal transmission switching (OTS) problems involving binary decisions about network topology and nonconvex power flow constraints. We adopt a semidefinite programming formulation for the optimal power flow (OPF) problem that, however, remains nonconvex due to the presence of discrete variables and bilinear products between the decision variables. To tackle the latter, we introduce a physically inspired, virtual-voltage approximation that leads to provable lower and upper bounds on the solution of the original problem. To deal with the exponential complexity caused by the discrete variables, we introduce a graph partition-based algorithm that breaks the problem into several parallel mixed-integer subproblems of smaller size. Simulations on the IEEE bus test cases demonstrate the high degree of accuracy and affordable computational requirements of our approach.

42 ENGINEERING↗

Entanglement spectrum of a random partition: Connection with the localization transition

We study the entanglement spectrum of a translationally invariant lattice system under a random partition, implemented by choosing each site to be in one subsystem with probability p ϵ[0,1]. We apply this random partitioning to a translationally invariant (i.e., clean) topological state, and argue on general grounds that the corresponding entanglement spectrum captures the universal behavior about its disorder-driven transition to a trivial localized phase. Specifically, as a function of the partitioning probability p , the entanglement Hamiltonian H A must go through a topological phase transition driven by the percolation of a random network of edge states. For example, we analytically derive the entanglement Hamiltonian for a one-dimensional topological superconductor under a random partition, and demonstrate that its phase diagram includes transitions between Griffiths phases. We discuss potential advantages of studying disorder-driven topological phase transitions via the entanglement spectra of random partitions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Evapotranspiration partitioning estimates from 8 methods from 47 NEON sites, 2019-2021

This dataset provides daily estimates of evapotranspiration (ET) and the transpiration-to-evapotranspiration ratio (T/ET) across 47 terrestrial National Ecological Observatory Network (NEON) sites spanning diverse environmental and biome conditions in the United States across three years of data (2019-2021). Daily ET is reported in both energy units (MJ m⁻² day⁻¹) and equivalent water depth (mm day⁻¹), assuming a constant latent heat of vaporization of 2.45 MJ/kg. The primary method uses a hybrid recurrent neural network–Penman–Monteith framework (RNN-PM), which integrates physically based surface energy balance constraints with data-driven learning to partition ET into transpiration and evaporation components. Model inputs include in situ meteorological observations (air temperature, vapor pressure deficit, wind speed, and radiation) combined with satellite-derived land surface temperature, leaf area index, and soil moisture. For benchmarking and uncertainty assessment, T/ET estimates from seven additional models are included: Priestley-Taylor Jet Propulsion Laboratory (PT-JPL), Penman-Monteith (P-M), Two-Source Energy Balance (TSEB), Support Vector Regression (SVR), and Categorical Boosting (CatBoost), among others—spanning empirical, machine-learning, and process-based approaches (see methods section or linked publication for detailed descriptions). Data Package Contents: The dataset a csv files containing daily ET and T/ET estimates for each site and model, along with associated metadata files these variables. Data can be accessed using common spreadsheet software (e.g., Microsoft Excel, LibreOffice) or programming environments such as R or Python. Together, these data support cross-site comparisons of ecosystem water use, evaluation of ET partitioning methods, and development of improved land–atmosphere exchange models.

EARTH SCIENCE > ATMOSPHERE↗

A Very Large Area Network (VLAN) knowledge-base applied to space communication problems

This paper first describes a hierarchical model for very large area networks (VLAN). Space communication problems whose solution could profit by the model are discussed and then an enhanced version of this model incorporating the knowledge needed for the missile detection-destruction problem is presented. A satellite network or VLAN is a network which includes at least one satellite. Due to the complexity, a compromise between fully centralized and fully distributed network management has been adopted. Network nodes are assigned to a physically localized group, called a partition. Partitions consist of groups of cell nodes with one cell node acting as the organizer or master, called the Group Master (GM). Coordinating the group masters is a Partition Master (PM). Knowledge is also distributed hierarchically existing in at least two nodes. Each satellite node has a back-up earth node. Knowledge must be distributed in such a way so as to minimize information loss when a node fails. Thus the model is hierarchical both physically and informationally.

Zander, Carol S.↗

Avionics System Architecture for NASA Orion Vehicle

This viewgraph presentation reviews the Orion Crew Exploration Vehicle avionics architecture. The contents include: 1) What is Orion?; 2) Orion Concept of Operations; 3) Orion Subsystems; 4) Orion Avionics Architecture; 5) Orion Avionics-Network; 6) Orion Network Unification; 7) Orion Avionics-Integrity; 8) Orion Avionics-Partitioning; and 9) Orion Avionics-Redundancy.

Baggerman, Clint↗

Multivariate and Multiscale Dependence in the Global Climate System Revealed Through Complex Networks

A systematic characterization of multivariate dependence at multiple spatio-temporal scales is critical to understanding climate system dynamics and improving predictive ability from models and data. However, dependence structures in climate are complex due to nonlinear dynamical generating processes, long-range spatial and long-memory temporal relationships, as well as low-frequency variability. Here we utilize complex networks to explore dependence in climate data. Specifically, networks constructed from reanalysis-based atmospheric variables over oceans and partitioned with community detection methods demonstrate the potential to capture regional and global dependence structures within and among climate variables. Proximity-based dependence as well as long-range spatial relationships are examined along with their evolution over time, yielding new insights on ocean meteorology. The tools are implicitly validated by confirming conceptual understanding about aggregate correlations and teleconnections. Our results also suggest a close similarity of observed dependence patterns in relative humidity and horizontal wind speed over oceans. In addition, updraft velocity, which relates to convective activity over the oceans, exhibits short spatiotemporal decorrelation scales but long-range dependence over time. The multivariate and multi-scale dependence patterns broadly persist over multiple time windows. Our findings motivate further investigations of dependence structures among observations, reanalysis and model-simulated data to enhance process understanding, assess model reliability and improve regional climate predictions.

54 ENVIRONMENTAL SCIENCES↗

Efficient partitioning and assignment on programs for multiprocessor execution

The general problem studied is that of segmenting or partitioning programs for distribution across a multiprocessor system. Efficient partitioning and the assignment of program elements are of great importance since the time consumed in this overhead activity may easily dominate the computation, effectively eliminating any gains made by the use of the parallelism. In this study, the partitioning of sequentially structured programs (written in FORTRAN) is evaluated. Heuristics, developed for similar applications are examined. Finally, a model for queueing networks with finite queues is developed which may be used to analyze multiprocessor system architectures with a shared memory approach to the problem of partitioning. The properties of sequentially written programs form obstacles to large scale (at the procedure or subroutine level) parallelization. Data dependencies of even the minutest nature, reflecting the sequential development of the program, severely limit parallelism. The design of heuristic algorithms is tied to the experience gained in the parallel splitting. Parallelism obtained through the physical separation of data has seen some success, especially at the data element level. Data parallelism on a grander scale requires models that accurately reflect the effects of blocking caused by finite queues. A model for the approximation of the performance of finite queueing networks is developed. This model makes use of the decomposition approach combined with the efficiency of product form solutions.

Standley, Hilda M.↗

Geometric Mapping of Tasks to Processors on Parallel Computers with Mesh or Torus Networks

We present a new method for reducing parallel applications' communication time by mapping their MPI tasks to processors in a way that lowers the distance messages travel and the amount of congestion in the network. Assuming geometric proximity among the tasks is a good approximation of their communication interdependence, we use a geometric partitioning algorithm to order both the tasks and the processors, assigning task parts to the corresponding processor parts. In this way, interdependent tasks are assigned to “nearby” cores in the network. We also present a number of algorithmic optimizations that exploit specific features of the network or application to further improve the quality of the mapping. We specifically address the case of sparse node allocation, where the nodes assigned to a job are not necessarily located in a contiguous block nor within close proximity to each other in the network. Furthermore, our methods generalize to contiguous allocations as well, and results are shown for both contiguous and non-contiguous allocations. We show that, for the structured finite difference mini-application MiniGhost, our mapping methods reduced communication time up to 75% relative to MiniGhost's default mapping on 128K cores of a Cray XK7 with sparse allocation. For the atmospheric modeling code E3SM/HOMME, our methods reduced communication time up to 31% on 16K cores of an IBM BlueGene/Q with contiguous allocation.

97 MATHEMATICS AND COMPUTING↗

WHAT IS THE SOURCE OF QUIET SUN TRANSITION REGION EMISSION?

Dating back to the first observations of the on-disk corona, there has been a qualitative link between the photosphere’s magnetic network and enhanced transition-temperature plasma emission. These observations led to the development of a general model that describes emission structures through the partitioning of the atmospheric volume with different magnetic loop geometries that exhibit different energetic equilibria. Does the internetwork produce transition-temperature emission? What fraction of network flux connects to the corona? How does quiet Sun emission compare with low-activity Sun-like stars? In this work, we revisit the canonical model of the quiet Sun, with high-resolution observations from the Interface Region Imaging Spectrograph ( IRIS ) and HMI in hand, to address those questions. We use over 900 deep exposures of Si iv 1393 Å from IRIS along with nearly simultaneous HMI magnetograms to quantify the correlation between transition-temperature emission structures and magnetic field concentrations through a number of novel statistics. Our observational results are coupled with analysis of the Bifrost MHD model and a large-scale potential field model. Our results paint a complex portrait of the quiet Sun. We measure an emission signature in the distant internetwork that cannot be attributed to network contribution. We find that the dimmest regions of emission are not linked to the local vertical magnetic field. Using the MHD simulation, we categorize the emission contribution from cool mid-altitude loops and high-altitude coronal loops and discuss the potential emission contribution of spicules. Our results provide new constraints on the coupled solar atmosphere so that we can build on our understanding of how dynamic thermal and magnetic structures generate the observed phenomena in the transition region.

79 ASTRONOMY AND ASTROPHYSICS↗

UltraSciencenet: High- Performance Network Research Test-Bed

The high-performance networking requirements for next generation large-scale applications belong to two broad classes: (a) high bandwidths, typically multiples of 10Gbps, to support bulk data transfers, and (b) stable bandwidths, typically at much lower bandwidths, to support computational steering, remote visualization, and remote control of instrumentation. Current Internet technologies, however, are severely limited in meeting these demands because such bulk bandwidths are available only in the backbone, and stable control channels are hard to realize over shared connections. The UltraScience Net (USN) facilitates the development of such technologies by providing dynamic, cross-country dedicated 10Gbps channels for large data transfers, and 150 Mbps channels for interactive and control operations. Contributions of the USN project are two-fold: (a) Infrastructure Technologies for Network Experimental Facility: USN developed and/or demonstrated a number of infrastructure technologies needed for a national-scale network experimental facility. Compared to Internet, USN's data-plane is different in that it can be partitioned into isolated layer-1 or layer-2 connections, and its control-plane is different in the ability of users and applications to setup and tear down channels as needed. Its design required several new components including a Virtual Private Network infrastructure, a bandwidth and channel scheduler, and a dynamic signaling daemon. The control-plane employs a centralized scheduler to compute the channel allocations and a signaling daemon to generate configuration signals to switches. In a nutshell, USN demonstrated the ability to build and operate a stable national-scale switched network. (b) Structured Network Research Experiments: A number of network research experiments have been conducted on USN that cannot be easily supported over existing network facilities, including test-beds and production networks. It settled an open matter by demonstrating that the performance of switched connections and Multiple Protocol Label Switching tunnels over routed networks are comparable. Furthermore, such connections can be easily peered, and the performance of the resultant hybrid connections is still comparable to the constituent pure connections. USN experiments demonstrated that Infiniband transport can be effectively extended to wide-area connections of thousands of miles, which opens up new opportunities for efficient bulk data transport. USN provided dedicated connections to Cray X1 supercomputer and helped diagnose TCP performance problems which might have been otherwise incorrectly attributed to traffic on shared connections. USN contributed to the development of transport methods for dedicated connections to other traffic. Recently, experiments were conducted to assess the performance of application acceleration devices that employ flow optimization and data compression methods to improve TCP performance.

99 GENERAL AND MISCELLANEOUS↗

Revolutionizing observations and predictability of Arctic system dynamics through next-generation dense, heterogeneous and intelligent wireless sensor networks with embedded AI

The Arctic region is a complex and dynamic system, where changes in temperature and partitioning between water in solid, liquid and vapor phase are fundamentally reshaping hydro-biogeochemical fluxes from the bedrock to the atmosphere. The increasing temperature and frequency of extreme heat, precipitation and fire events (Wang et al., 2017; Meredith et al., 2019) have critical consequences for the Arctic ecosystems and people, as well as for the global climate system. Although many observational and remote sensing activities have been on-going, detailed ecosystem processes – particularly related to controls on and impacts of permafrost thaw – are difficult to detect or measure. To improve the understanding and prediction of these extreme events and their consequences, we need a revolution in the way we collect ground-based observations from hillslope to pan-Arctic scales and couple them with satellite imagery and models to deliver rich, actionable, and scale-appropriate data.

54 ENVIRONMENTAL SCIENCES↗

Inducing polarity in [VO{sub 3}]{sub n}{sup n-} chain compounds using asymmetric hydrogen-bonding networks

1,4-Bis(3-aminopropyl)piperazine, (R)-3-aminopiperidine and (S)-3-aminopiperidine were used in the syntheses of [C{sub 10}H{sub 26}N{sub 4}][VO{sub 3}]{sub 2}{center_dot}2H{sub 2}O, [(R)-C{sub 5}H{sub 14}N{sub 2}][VO{sub 3}]{sub 2} and [(S)-C{sub 5}H{sub 14}N{sub 2}][VO{sub 3}]{sub 2}, which all contain similar [VO{sub 3}]{sub n}{sup n-} chains. Inversion symmetry within the 1,4-bis(3-aminopropyl)piperazine allows for crystallization of [C{sub 10}H{sub 26}N{sub 4}][VO{sub 3}]{sub 2}{center_dot}2H{sub 2}O in a centrosymmetric space group, while the use of enantiomerically pure sources of either (R)-3-aminopiperidine or (S)-3-aminopiperidine forces crystallographic noncentrosymmetry. Moreover, asymmetry in the hydrogen-bonding networks between the metavanadate chains and either [(R)-3-aminopiperidineH{sub 2}]{sup 2+} or [(S)-3-aminopiperidineH{sub 2}]{sup 2+} cations directs alignment of the chains and crystallization in a polar space group (C2, no. 5). Component and net dipole moments were calculated using iterative-Hirshfeld partial atomic charges. [(R)-C{sub 5}H{sub 14}N{sub 2}][VO{sub 3}]{sub 2} and [(S)-C{sub 5}H{sub 14}N{sub 2}][VO{sub 3}]{sub 2} both display type 1 phase-matching capabilities and exhibit second harmonic generation activities of {approx}140 Multiplication-Sign {alpha}-SiO{sub 2}. - Graphical abstract: One centrosymmetric and a pair of polar noncentrosymmetric templated metavanadates were synthesized under mild hydrothermal conditions. Asymmetry in the hydrogen-bonding between either [(R)-C{sub 5}H{sub 14}N{sub 2}]{sup 2+} or [(S)-C{sub 5}H{sub 14}N{sub 2}]{sup 2+} and [VO{sub 3}]{sub n}{sup n-} chains results in polar structures that exhibit type 1 phase-matching capabilities. Hirshfeld surfaces were used to probe the hydrogen-bonding networks and component and net dipole moments were calculated from atomic positions and iterative-Hirshfeld partial charges. Highlights: Black-Right-Pointing-Pointer One centrosymmetric and a pair of polar templated metavanadate chain compounds are reported. Black-Right-Pointing-Pointer Asymmetry in the hydrogen-bonding networks drives the compound polarities. Black-Right-Pointing-Pointer Iterative-Hirshfeld partitioning was used to calculate partial atomic charges. Black-Right-Pointing-Pointer Net and component dipole moments are calculated for each compound. Black-Right-Pointing-Pointer Type 1 phase-matching behavior and SHG activities of {approx}140 Multiplication-Sign {alpha}-SiO{sub 2} are found.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Mapping to Irregular Torus Topologies and Other Techniques for Petascale Biomolecular Simulation, In: SC '14: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis

Currently deployed petascale supercomputers typically use toroidal network topologies in three or more dimensions. While these networks perform well for topology-agnostic codes on a few thousand nodes, leadership machines with 20,000 nodes require topology awareness to avoid network contention for communication-intensive codes. Topology adaptation is complicated by irregular node allocation shapes and holes due to dedicated input/output nodes or hardware failure. In the context of the popular molecular dynamics program NAMD, we present methods for mapping a periodic 3-D grid of fixed-size spatial decomposition domains to 3-D Cray Gemini and 5-D IBM Blue Gene/Q toroidal networks to enable hundred-million atom full machine simulations, and to similarly partition node allocations into compact domains for smaller simulations using multiple copy algorithms. Additional enabling techniques are discussed and performance is reported for NCSA Blue Waters, ORNL Titan, ANL Mira, TACC Stampede, and NERSC Edison.

Computer Science↗

Wiring Viterbi decoders (splitting deBruijn graphs)

A new Viterbi decoder, capable of decoding convolutional codes with constraint lengths up to 15, is under development for the Deep Space Network (DSN). A key feature of this decoder is a two-level partitioning of the Viterbi state diagram into identical subgraphs. The larger subgraphs correspond to circuit boards, while the smaller subgraphs correspond to Very Large Scale Integration (VLSI) chips. The full decoder is built from identical boards, which in turn are built from identical chips. The resulting system is modular and hierarchical. The decoder is easy to implement, test, and repair because it uses a single VLSI chip design and a single board design. The partitioning is completely general in the sense that an appropriate number of boards or chips may be wired together to implement a Viterbi decoder of any size greater than or equal to the size of the module.

Collins, O.↗

FD/DAMA Scheme For Mobile/Satellite Communications

Integrated-Adaptive Mobile Access Protocol (I-AMAP) proposed to allocate communication channels to subscribers in first-generation MSAT-X mobile/satellite communication network. Based on concept of frequency-division/demand-assigned multiple access (FD/DAMA) where partition of available spectrum adapted to subscribers' demands for service. Requests processed, and competing requests resolved according to channel-access protocol, or free-access tree algorithm described in "Connection Protocol for Mobile/Satellite Communications" (NPO-17735). Assigned spectrum utilized efficiently.

Yan, Tsun-Yee↗

Network design consideration of a satellite-based mobile communications system

Technical considerations for the Mobile Satellite Experiment (MSAT-X), the ground segment testbed for the low-cost spectral efficient satellite-based mobile communications technologies being developed for the 1990's, are discussed. The Network Management Center contains a flexible resource sharing algorithm, the Demand Assigned Multiple Access scheme, which partitions the satellite transponder bandwidth among voice, data, and request channels. Satellite use of multiple UHF beams permits frequency reuse. The backhaul communications and the Telemetry, Tracking and Control traffic are provided through a single full-coverage SHF beam. Mobile Terminals communicate with the satellite using UHF. All communications including SHF-SHF between Base Stations and/or Gateways, are routed through the satellite. Because MSAT-X is an experimental network, higher level network protocols (which are service-specific) will be developed only to test the operation of the lowest three levels, the physical, data link, and network layers.

Yan, T.-Y.↗

Thermodynamic analysis of hydrogel swelling in aqueous sodium chloride solutions

Here, a comprehensive thermodynamic model is presented for swelling and salt partitioning of poly (n-isopropyl acrylamide) hydrogels in aqueous sodium chloride (NaCl) solutions at 298 K. Together with a Helmholtz energy expression for network elastic energy, a modified electrolyte Nonradom Two-Liquid activity coefficient model is used to represent both the long-range electrostatic interactions and the short-range van der Waals interactions present in the gel phase. The model parameters include one network parameter per hydrogel system plus two binary parameters per interaction pair in the polymer–solvent-salt systems. With semiquantitave agreement with experimental data for both hydrogel swelling and salt partitioning up to salt saturation, the analysis suggests the ion hydration between NaCl and water is the root cause for hydrogel deswelling in aqueous NaCl solution at high NaCl concentrations, i.e., NaCl weight fraction >0.03. On the other hand, the strong repulsive interaction between NaCl and hydrogel polymer is the dominant factor for salt partitioning.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Automated Instrumentation, Monitoring and Visualization of PVM Programs Using AIMS

We present views and analysis of the execution of several PVM (Parallel Virtual Machine) codes for Computational Fluid Dynamics on a networks of Sparcstations, including: (1) NAS Parallel Benchmarks CG and MG; (2) a multi-partitioning algorithm for NAS Parallel Benchmark SP; and (3) an overset grid flowsolver. These views and analysis were obtained using our Automated Instrumentation and Monitoring System (AIMS) version 3.0, a toolkit for debugging the performance of PVM programs. We will describe the architecture, operation and application of AIMS. The AIMS toolkit contains: (1) Xinstrument, which can automatically instrument various computational and communication constructs in message-passing parallel programs; (2) Monitor, a library of runtime trace-collection routines; (3) VK (Visual Kernel), an execution-animation tool with source-code clickback; and (4) Tally, a tool for statistical analysis of execution profiles. Currently, Xinstrument can handle C and Fortran 77 programs using PVM 3.2.x; Monitor has been implemented and tested on Sun 4 systems running SunOS 4.1.2; and VK uses XIIR5 and Motif 1.2. Data and views obtained using AIMS clearly illustrate several characteristic features of executing parallel programs on networked workstations: (1) the impact of long message latencies; (2) the impact of multiprogramming overheads and associated load imbalance; (3) cache and virtual-memory effects; and (4) significant skews between workstation clocks. Interestingly, AIMS can compensate for constant skew (zero drift) by calibrating the skew between a parent and its spawned children. In addition, AIMS' skew-compensation algorithm can adjust timestamps in a way that eliminates physically impossible communications (e.g., messages going backwards in time). Our current efforts are directed toward creating new views to explain the observed performance of PVM programs. Some of the features planned for the near future include: (1) ConfigView, showing the physical topology of the virtual machine, inferred using specially formatted IP (Internet Protocol) packets: and (2) LoadView, synchronous animation of PVM-program execution and resource-utilization patterns.

Mehra, Pankaj↗