FleCSPH: The next generation FleCSIble parallel computational infrastructure for smoothed particle hydrodynamics
Not Available
97 MATHEMATICS AND COMPUTING↗
SEARCH · Search NASA
Results for “Tree Topology”
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.
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↗
Guaranteed Phase & Topology Identification in Three Phase Distribution Grids
We present a method for joint phase identification and topology recovery in unbalanced three phase radial networks using only voltage measurements. By recovering phases and topology jointly, we utilize all three phase voltage measurements and can handle networks where some buses have a subset of three phases. Our method is theoretically justified by a novel linearized formulation of unbalanced three phase power flow and makes precisely defined and reasonable assumptions on line impedances and load statistics. We validate our method on three IEEE test networks simulated under realistic conditions in OpenDSS, comparing our performance to the state of the art. In addition to providing a new method for phase and topology recovery, our intuitively structured linearized model will provide a foundation for future work in this and other applications.
42 ENGINEERING↗
Implementing Falut Tolerance in the COTS-Based X2000 Architecture: A Case Study on IEEE 1394
Among other challenges from NASA's X2000 Technology Development Program, affordability and miniaturizaton are prominent criteria, which 1) preclude the traditional solutions for mission reliability that rely on customer-built hardware and extensive component/subsystem replication, and 2) call for commercial-of-the-shelf (COTS) based approaches incorporating novel, practical fault tolerance techniques.
IEEE 1394 bus interface commercial-off-th-shelf sp↗
COTS-Based Fault Tolerance in Deep Space: Qualitative and Quantitative Analyses of A Bus Network Architecture
Using COTS products, standards and intellectual properties (IPs) for all the system and component interfaces is a crucial step toward significant reduction of both system cost and development cost, as the COTS interfaces enable other COTS products and IPs to be readily accommodated by the target system architecture.
commercial↗
DENDRAL-64 - A system for computer construction, enumeration and notation of organic molecules as tree structures and cyclic graphs. Part II - Topology of cyclic graphs Interim report
System for computer construction, enumeration and notation of organic molecules as tree structures and cyclic graphs
TREE↗
Scale-invariant topology and bursty branching of evolutionary trees emerge from niche construction
Explore the source record for details and available documents.
Chi Xue↗
Using minimal spanning trees to compare the reliability of network topologies
Graph theoretic methods are applied to compute the reliability for several types of networks of moderate size. The graph theory methods used are minimal spanning trees for networks with bi-directional links and the related concept of strongly connected directed graphs for networks with uni-directional links. A comparison is conducted of ring networks and braided networks. The case is covered where just the links fail and the case where both links and nodes fail. Two different failure modes for the links are considered. For one failure mode, the link no longer carries messages. For the other failure mode, the link delivers incorrect messages. There is a description and comparison of link-redundancy versus path-redundancy as methods to achieve reliability. All the computations are carried out by means of a fault tree program.
Leister, Karen J.↗
FORESTR: Finding, Organizing, Representing, Explaining, Summarizing, and Thinning Random forests
Random forests have become popular models used for data driven predictions. As a result, random forests are currently used or being considered for high-consequence mission applications in national security, such as the prediction of yield from optical signals and malware detection. While random forests may provide accurate predictions, the complexity of the algorithm causes a lack of interpretability. Random forests are an ensemble of regression or decision trees. Individual regression and decision trees are interpretable, but ensembles are inherently difficult to interpret due to the compilation of many models. We aim to increase the interpretability of random forests by finding patterns in the ensemble of trees that can be used to “thin” (or remove) trees. As a starting point, in this report, we develop a new distance metric for quantifying the similarity between trees based on their topologies (i.e., shapes). We base the metric on a novel distance metric for graphs that is a proper mathematical distance, is invariant to transformations, has registration between graphs, and computes topological evolutions between graphs. We use the tree distance metric to compute tree statistics such as a “mean tree” and to identify clusters of trees. We apply the developed methodology to a toy dataset and a mission relevant product inspection dataset to demonstrate how the metric can provide insight into random forests. Furthermore, we discuss the limitations of the approach and ideas for future research into how the metric could be used as a thinning tool to develop less complex models.
97 MATHEMATICS AND COMPUTING↗
Editorial: Viruses, Genetic Exchange, and the Tree of Life
We live in exciting times for microbiology research. The significant technological and scientific advancements in the past decades have now enabled scientists to pursue discovery and description of novel microbial and viral linages from previously uncharted Earth habitats. Two such discoveries are particularly exciting and noteworthy in this regard. First, the discovery of the first ‘giant virus’, Acanthamoeba polyphaga mimivirus, in 2003, and several others thereafter, posed intriguing questions regarding virus origins, evolution, classification, and their place in the ‘tree of life’. Second, the discoveries of ‘Lokiarchaeota’ and several other closelyrelated archaeal members that encode several eukaryote-specific proteins challenged the threedomain canonical structure of the tree of life. These discoveries have reopened debates on central questions in evolutionary biology research such as the origin of viruses, the origin of eukaryotes, evolutionary relationship between Archaea and Eukarya, and the structure and topology of the tree of life. In this Research Topic, we received a broad range of contributions addressing these and other related questions.
59 BASIC BIOLOGICAL SCIENCES↗
Optimization and Augmentation for Data Parallel Contour Trees
Contour trees are used for topological data analysis in scientific visualization. While originally computed with serial algorithms, recent work has introduced a vector-parallel algorithm. Furthermore, this algorithm is relatively slow for fully augmented contour trees which are needed for many practical data analysis tasks. We therefore introduce a representation called the hyperstructure that enables efficient searches through the contour tree and use it to construct a fully augmented contour tree in data parallel, with performance on average 6 times faster than the state-of-the-art parallel algorithm in the TTK topological toolkit.
97 MATHEMATICS AND COMPUTING↗
Graph Theory Roots of Spatial Operators for Kinematics and Dynamics
Spatial operators have been used to analyze the dynamics of robotic multibody systems and to develop novel computational dynamics algorithms. Mass matrix factorization, inversion, diagonalization, and linearization are among several new insights obtained using such operators. While initially developed for serial rigid body manipulators, the spatial operators and the related mathematical analysis have been shown to extend very broadly including to tree and closed topology systems, to systems with flexible joints, links, etc. This work uses concepts from graph theory to explore the mathematical foundations of spatial operators. The goal is to study and characterize the properties of the spatial operators at an abstract level so that they can be applied to a broader range of dynamics problems. The rich mathematical properties of the kinematics and dynamics of robotic multibody systems has been an area of strong research interest for several decades. These properties are important to understand the inherent physical behavior of systems, for stability and control analysis, for the development of computational algorithms, and for model development of faithful models. Recurring patterns in spatial operators leads one to ask the more abstract question about the properties and characteristics of spatial operators that make them so broadly applicable. The idea is to step back from the specific application systems, and understand more deeply the generic requirements and properties of spatial operators, so that the insights and techniques are readily available across different kinematics and dynamics problems. In this work, techniques from graph theory were used to explore the abstract basis for the spatial operators. The close relationship between the mathematical properties of adjacency matrices for graphs and those of spatial operators and their kernels were established. The connections hold across very basic requirements on the system topology, the nature of the component bodies, the indexing schemes, etc. The relationship of the underlying structure is intimately connected with efficient, recursive computational algorithms. The results provide the foundational groundwork for a much broader look at the key problems in kinematics and dynamics. The properties of general graphs and trees of nodes and edge were examined, as well as the properties of adjacency matrices that are used to describe graph connectivity. The nilpotency property of such matrices for directed trees was reviewed, and the adjacency matrices were generalized to the notion of block weighted adjacency matrices that support block matrix elements. This leads us to the development of the notion of Spatial Kernel Operator SKO kernels. These kernels provide the basis for the development of SKO resolvent operators.
Jain, Abhinandan↗
Development and Evaluation of an Order-N Formulation for Multi-Flexible Body Space Systems
This paper presents development of a generic recursive Order-N algorithm for systems with rigid and flexible bodies, in tree or closed-loop topology, with N being the number of bodies of the system. Simulation results are presented for several test cases to verify and evaluate the performance of the code compared to an existing efficient dense mass matrix-based code. The comparison brought out situations where Order-N or mass matrix-based algorithms could be useful.
Multibody dynamics↗
Sneak circuit analysis of instrumentation and control systems
The evolvement and implementation is presented of a systematic means for detecting the sneak prone designs of an electrical system which could result in such unplanned modes so that they can be prevented prior to occurrence. Sneak circuit analysis is shown to be a formalized approach based upon topological techniques. The trees employed are produced from manufacturing detail data processed by a computer to orderly completion. The analysis techniques applied on a variety of NASA programs are shown to be particularly applicable to industrial instrumentation and control systems.
Rankin, J. P.↗
Thermocapillary motion of deformable drops
The thermocapillary motion of initially spherical drops/bubbles driven by a constant temperature gradient in an unbounded liquid medium is simulated numerically. Effects of convection of momentum and energy, as well as shape deformations, are addressed. The method used is based on interface tracking on a base cartesian grid, and uses a smeared color or indicator function for the determination of the surface topology. Quad-tree adaptive refinement of the cartesian grid is implemented to enhance the fidelity of the surface tracking. It is shown that convection of energy results in a slowing of the drop, as the isotherms get wrapped around the front of the drop. Shape deformation resulting from inertial effects affect the migration velocity. The physical results obtained are in agreement with the existing literature. Furthermore, remarks are made on the sensitivity of the calculated solutions to the smearing of the fluid properties. Analysis and simulations show that the migration velocity depends very strongly on the smearing of the interfacial force whereas it is rather insensitive to the smearing of other properties, hence the adaptive grid.
Haj-Hariri, Hossein↗
Computer evaluation of topological formulas for network analysis
Single tree-finding program for digital computer evaluation of topological formulas for network analysis
Chan, S. P.↗
Topological numbering of features on a mesh
Assume a nxn binary image is given containing horizontally convex features; i.e., for each feature, each of its row's pixels form an interval on that row. The problem of assigning topological numbers to such features is considered; i.e., assign a number to every feature f so that all features to the left of f have a smaller number assigned to them. This problem arises in solutions to the stereo matching problem. A parallel algorithm to solve the topological numbering problem in O(n) time on an nxn mesh of processors is presented. The key idea of the solution is to create a tree from which the topological numbers can be obtained even though the tree does not uniquely represent the to the left of relationship of the features.
Atallah, Mikhail J.↗
An Evaluation of the Effect of Network Cost Optimization for Leadership Class Supercomputers
Dragonfly-based networks are an extensively deployed network topology in large-scale high-performance computing due to their cost-effectiveness and efficiency. The US will soon have three Exascale supercomputers for leadership class workloads deployed using dragonfly networks. Compared to indirect networks of similar scale, the dragonfly network has considerably reduced cable lengths, cable counts, and switch counts, resulting in significant network cost savings for a given system size, however, these cost reductions result in reduced global minimal paths and more challenging routing. Additionally, large scale dragonfly networks often require a taper at the global link level, resulting in less bisection bandwidth than is achievable in other traditional non-blocking topologies of equivalent scale. While dragonfly networks have been extensively studied, they have yet to be fully evaluated in an extreme scale (i.e., exascale) system that targets capability workloads. In this paper, we present the results of the first large scale evaluation of a dragonfly network on an exascale system (Frontier) and compare its behavior to a similar scale fat-tree network on a previous generation TOP500 system (Summit). This evaluation aims to determine the effect of network cost optimizations by measuring a tapered topology’s impact on capability workloads. Our evaluation is based on a collection of synthetic microbenchmarks, mini-apps, and full scale applications. It compares the scaling efficiencies of each benchmark between the dragonfly-based Frontier and the fat-tree-based Summit systems. Our results show that a dragonfly network is $\sim \mathbf{3 0 \%}$ more cost efficient than a fat-tree topology, which amortizes to $\sim 3 \%$ of an exascale system cost. Furthermore, while tapered dragonfly networks impose significant tradeoffs, the impacts are not as broad as initially thought and are mostly seen in applications with global communication patterns, particularly all-to-all (e.g., FFT-based algorithms), but also local communication patterns (e.g., nearest-neighbor algorithms) that are sensitive to network performance variability.
Khan, Awais↗