Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Network topologies”

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 433 records · Page 24

Script for Monitoring Infiniband Switch Links

This script ingests a configuration file and parses it to determine an Infiniband network topology, specifically the port information for switches. It then loops over the fabric to determine which, if any, ports do not meet their desired configuration.

Hanley, Jesse Alonzo↗

Bus.py

GridLAB-D is an agent? based distribution system simulation environment that allows fine-grained end-user models, including geospatial and network topology detail. GridLAB-D addresses the lack of runtime interaction by designing a flexible communication interface, Bus.py (pronounced bus-dot-pie), that uses Python to pass messages between one or more GridLAB-D instances and a Smart Grid simulator.

Hansen, Timothy↗

167-PFlops deep learning for electron microscopy: from learning physics to atomic manipulation

An artificial intelligence system called MENNDL, which used 25,200 NVIDIA Volta GPUs on Oak Ridge National Laboratory's Summit machine, automatically designed an optimal deep learning network in order to extract structural information from raw atomic-resolution microscopy data. In a few hours, MENNDL creates and evaluates millions of networks using a scalable, parallel, asynchronous genetic algorithm augmented with a support vector machine to automatically find a superior deep learning network topology and hyper-parameter set than a human expert can find in months. For the application of electron microscopy, the system furthers the goal of improving our understanding of the electron-beam-matter interactions and real-time image-based feedback, which enables a huge step beyond human capacity towards nanofabricating materials automatically. MENNDL has been scaled to the 4,200 available nodes of Summit achieving a measured 152.5 PFlops, with an estimated sustained performance of 167 PFlops when the entire machine is available.

Patton, Robert↗

An Asynchronous Task-based Fan-Both Sparse Cholesky Solver

Systems of linear equations arise at the heart of many scientific and engineering applications. Many of these linear systems are sparse; i.e., most of the elements in the coefficient matrix are zero. Direct methods based on matrix factorizations are sometimes needed to ensure accurate solutions. For example, accurate solution of sparse linear systems is needed in shift-invert Lanczos to compute interior eigenvalues. The performance and resource usage of sparse matrix factorizations are critical to time-to-solution and maximum problem size solvable on a given platform. In many applications, the coefficient matrices are symmetric, and exploiting symmetry will reduce both the amount of work and storage cost required for factorization. When the factorization is performed on large-scale distributed memory platforms, communication cost is critical to the performance of the algorithm. At the same time, network topologies have become increasingly complex, so that modern platforms exhibit a high level of performance variability. This makes scheduling of computations an intricate and performance-critical task. In this paper, we investigate the use of an asynchronous task paradigm, one-sided communication and dynamic scheduling in implementing sparse Cholesky factorization (symPACK) on large-scale distributed memory platforms. Our solver symPACK relies on efficient and flexible communication primitives provided by the UPC++ library. Performance evaluation shows good scalability and that symPACK outperforms state-of-the-art parallel distributed memory factorization packages, validating our approach on practical cases.

Jacquelin, Mathias↗

OpenCGRA: An Open-Source Unified Framework for Modeling,Testing, and Evaluating CGRAs

Coarse-grained reconfigurable arrays (CGRAs),loosely defined as arrays of functional units (e.g, adder, sub-tractor, multiplier, divider, or larger multi-operation units, butsmaller than a general-purpose core) interconnected through aNetwork-on-Chip, provide higher flexibility than domain-specificASIC accelerators while offering increased hardware efficiencywith respect to fine-grained reconfigurable devices, such as FieldProgrammable Gate Arrays (FPGAs). The fast evolving fieldsof machine learning and edge computing, which are seeing acontinuous flow of novel algorithms and larger models, makeCGRAs ideal target architectures to allow domain specializationwithout loosing too much generality. They also generally offerquicker and more effective reconfigurability than FPGAs, po-tentially allowing adaptation during actual algorithm execution,and implement a dataflow programming paradigm that adaptswell to these emerging workloads. Designing and generating aCGRA, however, still requires to define the type and number ofthe specific functional units, implement their interconnect andthe network topology, and perform its simulation and validation,given a variety of workloads of interest.In this paper, we propose OpenCGRA, a Python-based unifiedframework that integrates generation, modeling, testing and eval-uation for CGRAs. OpenCGRA is the first open-source integratedframework able to support the full top-to-bottom design flow forspecializing and implementing CGRAs: modeling at different ab-straction levels (functional level, cycle level, register-transfer level),generation, simulation, testing at different granularities (unit test-ing, integration testing, property-based testing), and characteriza-tion (area, power, and timing). OpenCGRAs will be made availableon GitHub.

CGRA, synthesis↗

Data-Driven Network Reduction and Aggregation with DERs for Outage Management

A novel approach exploiting the growing number of Distributed Energy Resources (DERs) to enhance distribution system resiliency is presented. After a power outage, DERs and loads are aggregated into switch-level equivalent models, preserving, at the same time, controllability information to enable real-time outage management analysis. Pre-fault smart-meters measurements are used as inputs for Artificial Neural Networks and Cold Load Pick-Up (CLPU) modeling to obtain short-term load forecast, while an optimal restoration analysis is carried out to determine restored network topology and utility-controlled loads and DERs set-points

Menazzi, Matteo↗

AURORA: Automated Refinement of Coarse-Grained Reconfigurable Accelerators

Coarse-grained reconfigurable arrays (CGRAs), loosely defined as arrays of functional units interconnected through a network-on-chip (NoC), provide higher flexibility than domain-specific ASIC accelerators while offering increased hardware efficiency with respect to fine-grained reconfigurable devices, such as Field Programmable Gate Arrays (FPGAs). Un-fortunately, designing a CGRA for a specific application domain involves enormous software/hardware engineering effort (e.g., designing the CGRA, map operations onto the CGRA, etc) and requires the exploration on a large design space (e.g., applying appropriate loop transformation on each application, specializing the reconfigurable processing elements of the CGRA, refining the network topology, deciding the size of the data memory, etc). Int his paper, we propose AURORA – a software/hardware co-design framework to automatically synthesize optimal CGRA given a set of applications of interest

Tan, Cheng↗

Syntheses, structures and luminescent properties of a series of 3D lanthanide coordination polymers with tripodal semirigid ligand

Reactions of the tripodal bridging ligand 5-(4-carboxy-phenoxy)-isophthalic acid (abbreviated as H{sub 3}cpia) with lanthanide salts lead to the formation of a family of different coordination polymers, that is, [Ln(cpia)(H{sub 2}O){sub 2}]{sub n}.nH{sub 2}O (Ln=Ce (1), Pr (2), Nd (3), Sm (4), Eu (5), Gd (6), Dy (7), Er (8), Tm (9) and Y (10)) in the presence of formic acid or diethylamine, which are characterized by elemental analysis, IR spectrum, thermogravimetric analysis (TGA), XRPD spectrum and single-crystal X-ray diffraction. Compounds 1-10 are isostructural and exhibit three-dimensional microporous frameworks. Furthermore, the photoluminescent properties of 4, 5 and 7 have been studied in detail. -- Graphical abstract: Reactions of the tripodal bridging ligand (H{sub 3}cpia) with lanthanide ions lead to the formation of a series of coordination polymers in the presence of formic acid or diethylamine. Display Omitted Research Highlights: {yields} Ten new lanthanides-based coordination polymers (1-10) have been synthesized. {yields} 1-10 exhibit 3D (4,8)-connected fluorite topology networks with 1D channel parallel to the b-axis. {yields} Compounds 4, 5 and 7 exhibit characteristic luminescence of Sm{sup 3+}, Eu{sup 3+} and Dy{sup 3+} ions, respectively.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Hydrothermal syntheses, structures and characterizations of two luminescent cadmium(II) complexes with p-xylenediphosphonic acid and N-donor ligands

Two novel cadmium diphosphonates [Cd(cis-H{sub 4}BDPP)(2,2 Prime -bipy){sub 2}]{center_dot}(trans-H{sub 2}BDPP)]{sub n} (1) and [Cd(trans-H{sub 2}BDPP)(phen)]{sub n} (2) (H{sub 4}BDPP=p-xylenediphosphonic acid, phen=1,10-phenanthroline, 2,2 Prime -bipy=2,2 Prime -bipyridine) were hydrothermally synthesized from p-xylenediphosphonic acid and CdSO{sub 4}{center_dot}3H{sub 2}O with phen or 2,2 Prime -bipy as second ligand components and characterized by means of elemental analyses, IR, TG analysis, luminescence spectroscopy and single crystal X-ray diffraction. Compound 1 consists of a novel one-dimensional (1D) sinusoidal [Cd(cis-H{sub 4}BDPP)(2,2 Prime -bipy){sub 2}] chains and trans-H{sub 2}BDPP anions. Compound 2 possesses a three-dimensional architecture built from double zigzag -Cd-O-P-O-Cd- chains pillared by trans-p-xylylenediphosphonate ligands from four different directions. There are hexagonal channels running along the c-axis and the coordinated phen ligands suspend in the hexagonal channels. The results indicate that p-xylenediphosphonic acid can adopt varied coordination modes and conformations in the formation of the complexes and the influence of the N-donor ligands on the structure of the complexes is discussed. - Graphical abstract: Two new cadmium diphosphonates were obtained by using two different auxiliary ligands. The influence of the N-donor ligands on the structure of the complexes is discussed. Highlights: Black-Right-Pointing-Pointer The first example of cadmium(II)-p-xylenediphosphonates templated by second ligand. Black-Right-Pointing-Pointer The role of size of the auxiliary ligand on the structure of cadmium p-xylenediphosphonates. Black-Right-Pointing-Pointer The cis and trans configurations of p-xylenediphosphonates exist in the same crystal structure. Black-Right-Pointing-Pointer Three-dimensional 4-connected framework with PtS network topology.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An Open Infrastructure for Scalable, Reconfigurable Analysis

Petascale systems will have hundreds of thousands of processor cores so their applications must be massively parallel. Effective use of petascale systems will require efficient interprocess communication through memory hierarchies and complex network topologies. Tools to collect and analyze detailed data about this communication would facilitate its optimization. However, several factors complicate tool design. First, large-scale runs on petascale systems will be a precious commodity, so scalable tools must have almost no overhead. Second, the volume of performance data from petascale runs could easily overwhelm hand analysis and, thus, tools must collect only data that is relevant to diagnosing performance problems. Analysis must be done in-situ, when available processing power is proportional to the data. We describe a tool framework that overcomes these complications. Our approach allows application developers to combine existing techniques for measurement, analysis, and data aggregation to develop application-specific tools quickly. Dynamic configuration enables application developers to select exactly the measurements needed and generic components support scalable aggregation and analysis of this data with little additional effort.

99 GENERAL AND MISCELLANEOUS↗

Advance Network Reservation and Provisioning for Science

We are witnessing a new era that offers new opportunities to conduct scientific research with the help of recent advancements in computational and storage technologies. Computational intensive science spans multiple scientific domains, such as particle physics, climate modeling, and bio-informatics simulations. These large-scale applications necessitate collaborators to access very large data sets resulting from simulations performed in geographically distributed institutions. Furthermore, often scientific experimental facilities generate massive data sets that need to be transferred to validate the simulation data in remote collaborating sites. A major component needed to support these needs is the communication infrastructure which enables high performance visualization, large volume data analysis, and also provides access to computational resources. In order to provide high-speed on-demand data access between collaborating institutions, national governments support next generation research networks such as Internet 2 and ESnet (Energy Sciences Network). Delivering network-as-a-service that provides predictable performance, efficient resource utilization and better coordination between compute and storage resources is highly desirable. In this paper, we study network provisioning and advanced bandwidth reservation in ESnet for on-demand high performance data transfers. We present a novel approach for path finding in time-dependent transport networks with bandwidth guarantees. We plan to improve the current ESnet advance network reservation system, OSCARS [3], by presenting to the clients, the possible reservation options and alternatives for earliest completion time and shortest transfer duration. The Energy Sciences Network (ESnet) provides high bandwidth connections between research laboratories and academic institutions for data sharing and video/voice communication. The ESnet On-Demand Secure Circuits and Advance Reservation System (OSCARS) establishes guaranteed bandwidth of secure virtual circuits at a certain time, for a certain bandwidth and length of time. Though OSCARS operates within the ESnet, it also supplies end-to-end provisioning between multiple autonomous network domains. OSCARS gets reservation requests through a standard web service interface, and conducts a Quality-of-service (QoS) path for bandwidth guarantees. Multi-protocol Label Switching (MPLS) and the Resource Reservation Protocol (RSVP) enable to create a virtual circuit using Label Switched Paths (LSP's). It contains three main components: a reservation manager, a bandwidth scheduler, and a path setup subsystem. The bandwidth scheduler needs to have information about the current and future states of the network topology in order to accomplish end-to-end bandwidth guaranteed paths.

97 MATHEMATICS AND COMPUTING↗

A Toolbox Model of Evolution of Metabolic Pathways on Networks of Arbitrary Topology

In prokaryotic genomes the number of transcriptional regulators is known to be proportional to the square of the total number of protein-coding genes. A toolbox model of evolution was recently proposed to explain this empirical scaling for metabolic enzymes and their regulators. According to its rules, the metabolic network of an organism evolves by horizontal transfer of pathways from other species. These pathways are part of a larger ‘‘universal’’ network formed by the union of all species-specific networks. It remained to be understood, however, how the topological properties of this universal network influence the scaling law of functional content of genomes in the toolbox model. Here we answer this question by first analyzing the scaling properties of the toolbox model on arbitrary tree-like universal networks. We prove that critical branching topology, in which the average number of upstream neighbors of a node is equal to one, is both necessary and sufficient for quadratic scaling. We further generalize the rules of the model to incorporate reactions with multiple substrates/products as well as branched and cyclic metabolic pathways. To achieve its metabolic tasks, the new model employs evolutionary optimized pathways with minimal number of reactions. Numerical simulations of this realistic model on the universal network of all reactions in the KEGG database produced approximately quadratic scaling between the number of regulated pathways and the size of the metabolic network. To quantify the geometrical structure of individual pathways, we investigated the relationship between their number of reactions, byproducts, intermediate, and feedback metabolites. Our results validate and explain the ubiquitous appearance of the quadratic scaling for a broad spectrum of topologies of underlying universal metabolic networks. They also demonstrate why, in spite of ‘‘small-world’’ topology, reallife metabolic networks are characterized by a broad distribution of pathway lengths and sizes of metabolic regulons in regulatory networks.

59 BASIC BIOLOGICAL SCIENCES↗

Engineering interactions for quasiperfect transfer of polariton states through nonideal bosonic networks of distinct topologies

We present a scheme for quasiperfect transfer of polariton states from a sender to a spatially separated receiver, both composed of high-quality cavities filled by atomic samples. The sender and the receiver are connected by a nonideal transmission channel --the data bus-- modelled by a network of lossy empty cavities. In particular, we analyze the influence of a large class of data-bus topologies on the fidelity and transfer time of the polariton state. Moreover, we also assume dispersive couplings between the polariton fields and the data-bus normal modes in order to achieve a tunneling-like state transfer. Such a tunneling-transfer mechanism, by which the excitation energy of the polariton effectively does not populate the data-bus cavities, is capable of attenuating appreciably the dissipative effects of the data-bus cavities. After deriving a Hamiltonian for the effective coupling between the sender and the receiver, we show that the decay rate of the fidelity is proportional to a cooperativity parameter that weighs the cost of the dissipation rate against the benefit of the effective coupling strength. The increase of the fidelity of the transfer process can be achieved at the expense of longer transfer times. We also show that the dependence of both the fidelity and the transfer time on the network topology is analyzed in detail for distinct regimes of parameters. It follows that the data-bus topology can be explored to control the time of the state-transfer process.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Toolbox Model of Evolution of Metabolic Pathways on Networks of Arbitrary Topology

In prokaryotic genomes the number of transcriptional regulators is known to be proportional to the square of the total number of protein-coding genes. A toolbox model of evolution was recently proposed to explain this empirical scaling for metabolic enzymes and their regulators. According to its rules, the metabolic network of an organism evolves by horizontal transfer of pathways from other species. These pathways are part of a larger 'universal' network formed by the union of all species-specific networks. It remained to be understood, however, how the topological properties of this universal network influence the scaling law of functional content of genomes in the toolbox model. Here we answer this question by first analyzing the scaling properties of the toolbox model on arbitrary tree-like universal networks. We prove that critical branching topology, in which the average number of upstream neighbors of a node is equal to one, is both necessary and sufficient for quadratic scaling. We further generalize the rules of the model to incorporate reactions with multiple substrates/products as well as branched and cyclic metabolic pathways. To achieve its metabolic tasks, the new model employs evolutionary optimized pathways with minimal number of reactions. Numerical simulations of this realistic model on the universal network of all reactions in the KEGG database produced approximately quadratic scaling between the number of regulated pathways and the size of the metabolic network. To quantify the geometrical structure of individual pathways, we investigated the relationship between their number of reactions, byproducts, intermediate, and feedback metabolites. Our results validate and explain the ubiquitous appearance of the quadratic scaling for a broad spectrum of topologies of underlying universal metabolic networks. They also demonstrate why, in spite of 'small-world' topology, real-life metabolic networks are characterized by a broad distribution of pathway lengths and sizes of metabolic regulons in regulatory networks.

59 BASIC BIOLOGICAL SCIENCES↗

Characterizing the Influence of Fracture Density on Network Scale Transport

The topology of natural fracture networks is inherently linked to the structure of the fluid velocity field and transport therein. Here we study the impact of network density on flow and transport behaviors. We stochastically generate fracture networks of varying density and simulate flow and transport with a discrete fracture network model, which fully resolves network topology at the fracture scale. We study conservative solute trajectories with Lagrangian particle tracking and find that as fracture density decreases, solute channelization to large local fractures increases, thereby reducing plume spreading. Furthermore, in sparse networks mean particle travel distance increases and local network features, such as velocity zones where flow is counter to the primary pressure gradient, become increasingly important for transport. As the network density increases, network statistics homogenize and such local features have a reduced impact. We quantify local topological influence on transport behavior with an effective tortuosity parameter, which measures the ratio of total advective distance to linear distance at the fracture scale; large tortuosity values are correlated to slow-velocity regions. Additionally, these large tortuosity, slow-velocity regions delay downstream transport and enhance tailing on particle breakthrough curves. Finally, we predict transport with an upscaled, Bernoulli spatial Markov random walk model and parameterize local topological influences with a novel tortuosity parameter. Furthermore, Bernoulli model predictions improve when sampling from a tortuosity distribution, as opposed to a fixed value as has previously been done, suggesting that local network topological features must be carefully considered in upscaled modeling efforts of fracture network systems.

58 GEOSCIENCES↗