Search NASA⌕ Search

SEARCH · Search NASA

Results for “leaf nodes”

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 19 records

Global tree network for computing structures enabling global processing operations

A system and method for enabling high-speed, low-latency global tree network communications among processing nodes interconnected according to a tree network structure. The global tree network enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices are included that interconnect the nodes of the tree via links to facilitate performance of low-latency global processing operations at nodes of the virtual tree and sub-tree structures. The global operations performed include one or more of: broadcast operations downstream from a root node to leaf nodes of a virtual tree, reduction operations upstream from leaf nodes to the root node in the virtual tree, and point-to-point message passing from any node to the root node. The global tree network is configurable to provide global barrier and interrupt functionality in asynchronous or synchronized manner, and, is physically and logically partitionable.

Blumrich↗

EVIO - A lightweight object-oriented I/O package

The EVIO package implements I/O between disk and an in-memory hierarchical object tree. Tree nodes are either container nodes, holding other nodes, or leaf nodes, containing any amount of data of a single type (int64_t,..., int8_t, float, double, and string). Trees can easily be constructed using factory methods and stream operators; queried using STL-like algorithms, function object, etc; or modified using tree or node methods. The tree logically maps to XML, and utilities exist to transform between binary and ASCII XML formats. The binary representation is compact, I/O is simple and efficient, and endian conversions are handled automatically. EVIO will be used by the next generation of experiments at Jefferson Lab1.

97 MATHEMATICS AND COMPUTING↗

Broadcasting a message in a parallel computer

Methods, systems, and products are disclosed for broadcasting a message in a parallel computer that includes: transmitting, by the logical root to all of the nodes directly connected to the logical root, a message; and for each node except the logical root: receiving the message; if that node is the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received; if that node received the message from a parent node and if that node is not a leaf node, then transmitting the message to all of the child nodes; and if that node received the message from a child node and if that node is not the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received and transmitting the message to the parent node.

97 MATHEMATICS AND COMPUTING↗

Broadcasting a message in a parallel computer

Methods, systems, and products are disclosed for broadcasting a message in a parallel computer that includes: transmitting, by the logical root to all of the nodes directly connected to the logical root, a message; and for each node except the logical root: receiving the message; if that node is the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received; if that node received the message from a parent node and if that node is not a leaf node, then transmitting the message to all of the child nodes; and if that node received the message from a child node and if that node is not the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received and transmitting the message to the parent node.

97 MATHEMATICS AND COMPUTING↗

Execution of computation graphs

A computation graph is accessed. In the computation graph, operations to be performed are represented as interior nodes, inputs to the operations are represented as leaf nodes, and a result of the operations is represented as a root. Selected sets of the operations are combined to form respective kernels of operations. Code is generated execute the kernels of operations. The code is executed to determine the result.

Ravishankar, Mahesh↗

Workbench Analysis Sequence Processor

The Workbench Analysis Sequence Processor (WASP) was developed to streamline lexing, parsing, access, validation, and analysis of ascii text files. The foundation of WASP resides on the parse tree data structure, where each node in the tree represents the syntax of the input document. Nodes can parent nodes with children. Nodes that have no children are known as terminal or leaf nodes , and they represent tokens (string, number, delimiter, etc.) in the text file. The fast lexical analyzer generator (flex - https://www.gnu.org/software/flex/) and GNU Bison parser generator (https://www.gnu.org/software/bison/) are extensively used for lexing and parsing.

97 MATHEMATICS AND COMPUTING↗

Indigo: A Domain-Specific Language for Fast, Portable Image Reconstruction

© 2018 IEEE. Linear operators used in iterative methods like conjugate gradient have typically been implemented either as ''matrix-driven'' subroutines backed by explicit sparse or dense matrices, or as ''matrix-free'' subroutines that implement specific linear operations directly (e.g. FFTs). The matrix-driven approach is generally more portable because it can target widely-Available BLAS libraries, but it can be inefficient in terms of time and space complexity. In contrast, the matrix-free approach is more performant because it leverages structure in operations, but it requires each operator be re-implemented on each new platform. To increase performance and portability, we propose a hybrid approach that represents linear operators as expression trees. Leaf nodes in the tree are either matrix-free or matrix-driven operators, and interior nodes represent mathematical compositions (sums, products, transposes) or structural compositions (stacks, block diagonals, etc.) of the leaf operators. This representation enables expert-guided reordering and fusion transformations that can improve performance or reduce memory pressure. We implement our approach in a domain-specific language called Indigo. We assess Indigo on image reconstruction problems arising in four application areas: magnetic resonance imaging, ptychography, magnetic particle imaging, and fluorescent microscopy. We give performance results from vendor BLAS libraries, and we introduce specializations to Sparse BLAS routines that achieve near-Roofline performance on multi-core, many-core, and GPU systems.

Driscoll, Michael↗

A localized ensemble of approximate Gaussian processes for fast sequential emulation

More attention has been given to the computational cost associated with the fitting of an emulator. Substantially less attention is given to the computational cost of using that emulator for prediction. This is primarily because the cost of fitting an emulator is usually far greater than that of obtaining a single prediction, and predictions can often be obtained in parallel. In many settings, especially those requiring Markov Chain Monte Carlo, predictions may arrive sequentially and parallelization is not possible. In this case, using an emulator procedure which can produce accurate predictions efficiently can lead to substantial time savings in practice. In this paper, we propose a global model approximate Gaussian process framework via extension of a popular local approximate Gaussian process (laGP) framework. Our proposed emulator can be viewed as a treed Gaussian process where the leaf nodes are laGP models, and the tree structure is learned greedily as a function of the prediction stream. The suggested method (called leapGP) has interpretable tuning parameters which control the time‐memory trade‐off. One reasonable choice of settings leads to an emulator with a training cost and makes predictions rapidly with an asymptotic amortized cost of .

97 MATHEMATICS AND COMPUTING↗

Managing complexity in simulations of land surface and near-surface processes

Increasing computing power and the growing role of simulation in Earth systems science have led to an increase in the number and complexity of processes in modern simulators. We present a multiphysics framework that specifies interfaces for coupled processes and automates weak and strong coupling strategies to manage this complexity. Process management is enabled by viewing the system of equations as a tree, where individual equations are associated with leaf nodes and coupling strategies with internal nodes. A dynamically generated dependency graph connects a variable to its dependencies, streamlining and automating model evaluation, easing model development, and ensuring models are modular and flexible. Additionally, the dependency graph is used to ensure that data requirements are consistent between all processes in a given simulation. Here we discuss the design and implementation of these concepts within the Arcos framework, and demonstrate their use for verification testing and hypothesis evaluation in numerical experiments.

54 ENVIRONMENTAL SCIENCES↗

Automatic off-body overset adaptive Cartesian mesh method based on an octree approach

This paper describes a method for generating adaptive structured Cartesian grids within a near-body/off-body mesh partitioning framework for the flow simulation around complex geometries. The off-body Cartesian mesh generation derives from an octree structure, assuming each octree leaf node defines a structured Cartesian block. This enables one to take into account the large scale discrepancies in terms of resolution between the different bodies involved in the simulation, with minimum memory requirements. Two different conversions from the octree to Cartesian grids are proposed: the first one generates Adaptive Mesh Refinement (AMR) type grid systems, and the second one generates abutting or minimally overlapping Cartesian grid set. We also introduce an algorithm to control the number of points at each adaptation, that automatically determines relevant values of the refinement indicator driving the grid refinement and coarsening. An application to a wing tip vortex computation assesses the capability of the method to capture accurately the flow features.

97 MATHEMATICS AND COMPUTING↗

Arabidopsis thaliana NIP7;1: An Anther-Specific Boric Acid Transporter of the Aquaporin Superfamily Regulated by an Unusual Tyrosine in Helix 2 of the Transport Pore

Plant nodulin-26 intrinsic proteins (NIPs) are members of the aquaporin superfamily that serve as multifunctional transporters of uncharged metabolites. In Arabidopsis thaliana, a specific NIP pore subclass, known as the NIP II proteins, is represented by AtNIP5;1 and AtNIP6;1, which encode channel proteins expressed in roots and leaf nodes, respectively, that participate in the transport of the critical cell wall nutrient boric acid. Modeling of the protein encoded by the AtNIP7;1 gene shows that it is a third member of the NIP II pore subclass in Arabidopsis. However, unlike AtNIP5;1 and AtNIP6;1 proteins, which form constitutive boric acid channels, AtNIP7;1 forms a channel with an extremely low intrinsic boric acid transport activity. Molecular modeling and molecular dynamics simulations of AtNIP7;1 suggest that a conserved tyrosine residue (Tyr81) located in transmembrane helix 2 adjacent to the aromatic arginine (ar/R) pore selectivity region stabilizes a closed pore conformation through interaction with the canonical Arg220 in ar/R region. Substitution of Tyr81 with a Cys residue, characteristic of established NIP boric acid channels, results in opening of the AtNIP7;1 pore that acquires a robust, transport activity for boric acid as well as other NIP II test solutes (glycerol and urea). Substitution of a Phe for Tyr81 also opens the channel, supporting the prediction from MD simulations that hydrogen bond interaction between the Tyr81 phenol group and the ar/R Arg may contribute to the stabilization of a closed pore state. Expression analyses show that AtNIP7;1 is selectively expressed in developing anther tissues of young floral buds of A. thaliana, principally in developing pollen grains of stage 9 11 anthers. Because boric acid is both an essential nutrient as well as a toxic compound at high concentrations, it is proposed that Tyr81 modulates transport and may provide an additional level of regulation for this transporter in male gametophyte development.

Li, Tian↗

Dynamic Load Balancing Based on Constrained K-D Tree Decomposition for Parallel Particle Tracing

Particle tracing is a fundamental technique in flow field data visualization. In this work, we present a novel dynamic load balancing method for parallel particle tracing. Specifically, we employ a constrained k-d tree decomposition approach to dynamically redistribute tasks among processes. Each process is initially assigned a regularly partitioned block along with duplicated ghost layer under the memory limit. During particle tracing, the k-d tree decomposition is dynamically performed by constraining the cutting planes in the overlap range of duplicated data. This ensures that each process is reassigned particles as even as possible, and on the other hand the new assigned particles for a process always locate in its block. Result shows good load balance and high efficiency of our method.

Zhang, Jiang↗

A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs

Computing the Euclidean minimum spanning tree (Emst) is a computationally demanding step of many algorithms. While work-efficient serial and multithreaded algorithms for computing Emst are known, designing an efficient GPU algorithm is challenging due to a complex branching structure, data dependencies, and load imbalances. In this paper, we propose a single-tree $Bor\mathring{u}vka$-based algorithm for computing Emst on GPUs. We use an efficient nearest neighbor algorithm and reduce the number of the required distance calculations by avoiding traversing subtrees with leaf nodes in the same component. The developed algorithms are implemented in a performance portable way using ArborX, an open-source geometric search library based on the Kokkos framework. We evaluate the proposed algorithm on various 2D and 3D datasets, show and compare it with the current state-of-the-art open-source CPU implementations. We demonstrate 4-24 × speedup over the fastest multi-threaded implementation. We prove the portability of our implementation by providing results on a variety of hardware: AMD EPYC 7763, Nvidia A100 and AMD MI250X. We show scalability of the implementation, computing Emst for 37 million 3D cosmological dataset in under a 0.5 second on a single A100 Nvidia GPU.

Prokopenko, Andrey↗

DGTile

SAND2022-12898 O DGTile is a lightweight C++17 adaptive mesh library meant to support explicit discontinuous Galerkin applications on high performance computing machines. DGTile uses a block-based adaptive mesh refinement approach, where the underlying mesh data structure is an octree in three dimensions, where each leaf node of the tree represents a Cartesian grid. Over each grid, DGTile provides modal discontinuous Galerkin basis functions to facilitate simulations. 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.

Granzow, Brian↗

HIERARCHICAL STRUCTURE OF MAGNETOHYDRODYNAMIC TURBULENCE IN POSITION-POSITION-VELOCITY SPACE

Magnetohydrodynamic turbulence is able to create hierarchical structures in the interstellar medium (ISM) that are correlated on a wide range of scales via the energy cascade. We use hierarchical tree diagrams known as dendrograms to characterize structures in synthetic position-position-velocity (PPV) emission cubes of isothermal magnetohydrodynamic turbulence. We show that the structures and degree of hierarchy observed in PPV space are related to the presence of self-gravity and the global sonic and Alfvenic Mach numbers. Simulations with higher Alfvenic Mach number, self-gravity and supersonic flows display enhanced hierarchical structure. We observe a strong dependency on the sonic and Alfvenic Mach numbers and self-gravity when we apply the statistical moments (i.e., mean, variance, skewness, kurtosis) to the leaf and node distribution of the dendrogram. Simulations with self-gravity, larger magnetic field and higher sonic Mach number have dendrogram distributions with higher statistical moments. Application of the dendrogram to three-dimensional density cubes, also known as position-position-position (PPP) cubes, reveals that the dominant emission contours in PPP and PPV are related for supersonic gas but not for subsonic. We also explore the effects of smoothing, thermal broadening, and velocity resolution on the dendrograms in order to make our study more applicable to observational data. These results all point to hierarchical tree diagrams as being a promising additional tool for studying ISM turbulence and star forming regions for obtaining information on the degree of self-gravity, the Mach numbers and the complicated relationship between PPV and PPP data.

79 ASTRONOMY AND ASTROPHYSICS↗

Effect of MLC leaf width on treatment adaptation and accuracy for concurrent irradiation of prostate and pelvic lymph nodes

Purpose: The aim of the study was to evaluate the impact of multileaf collimator (MLC) leaf width on treatment adaptation and delivery accuracy for concurrent treatment of the prostate and pelvic lymph nodes with intensity modulated radiation therapy (IMRT). Methods: Seventy-five kilovoltage cone beam CTs (KV-CBCT) from six patients were included for this retrospective study. For each patient, three different IMRT plans were created based on a planning CT using three different MLC leaf widths of 2.5, 5, and 10 mm, respectively. For each CBCT, the prostate displacement was determined by a dual image registration. Adaptive plans were created by shifting selected MLC leaf pairs to compensate for daily prostate movements. To evaluate the impact of MLC leaf width on the adaptive plan for each daily CBCT, three MLC shifted plans were created using three different leaf widths of MLCs (a total of 225 adaptive treatment plans). Selective dosimetric endpoints for the tumor volumes and organs at risk (OARs) were evaluated for these adaptive plans. Using the planning CT from a selected patient, MLC shifted plans for three hypothetical longitudinal shifts of 2, 4, and 8 mm were delivered on the three linear accelerators to test the deliverability of the shifted plans and to compare the dose accuracy of the shifted plans with the original IMRT plans. Results: Adaptive plans from 2.5 and 5 mm MLCs had inadequate dose coverage to the prostate (D99 < 97%, or D{sub mean} < 99% of the planned dose) in 6%-8% of the fractions, while adaptive plans from 10 mm MLC led to inadequate dose coverage to the prostate in 25.3% of the fractions. The average V{sub 56Gy} of the prostate over the six patients was improved by 6.4% (1.6%-32.7%) and 5.8% (1.5%-35.7%) with adaptive plans from 2.5 and 5 mm MLCs, respectively, when compared with adaptive plans from 10 mm MLC. Pelvic lymph nodes were well covered for all MLC adaptive plans, as small differences were observed for D99, D{sub mean}, and V{sub 50.4Gy}. Similar OAR sparing could be achieved for the bladder and rectum with all three MLCs for treatment adaptation. The MLC shifted plans can be accurately delivered on all three linear accelerators with accuracy similar to their original IMRT plans, where gamma (3%/3 mm) passing rates were 99.6%, 93.0%, and 92.1% for 2.5, 5, and 10 mm MLCs, respectively. The percentages of pixels with dose differences between the measurement and calculation being less than 3% of the maximum dose were 85.9%, 82.5%, and 70.5% for the original IMRT plans from the three MLCs, respectively. Conclusions: Dosimetric advantages associated with smaller MLC leaves were observed in terms of the coverage to the prostate, when the treatment was adapted to account for daily prostate movement for concurrent irradiation of the prostate and pelvic lymph nodes. The benefit of switching the MLC from 10 to 5 mm was significant (p Much-Less-Than 0.01); however, switching the MLC from 5 to 2.5 mm would not gain significant (p= 0.15) improvement. IMRT plans with smaller MLC leaf widths achieved more accurate dose delivery.

61 RADIATION PROTECTION AND DOSIMETRY↗

Asynchronous broadcast for ordered delivery between compute nodes in a parallel computing system where packet header space is limited

Disclosed is a mechanism on receiving processors in a parallel computing system for providing order to data packets received from a broadcast call and to distinguish data packets received at nodes from several incoming asynchronous broadcast messages where header space is limited. In the present invention, processors at lower leafs of a tree do not need to obtain a broadcast message by directly accessing the data in a root processor's buffer. Instead, each subsequent intermediate node's rank id information is squeezed into the software header of packet headers. In turn, the entire broadcast message is not transferred from the root processor to each processor in a communicator but instead is replicated on several intermediate nodes which then replicated the message to nodes in lower leafs. Hence, the intermediate compute nodes become "virtual root compute nodes" for the purpose of replicating the broadcast message to lower levels of a tree.

97 MATHEMATICS AND COMPUTING↗

An algorithm for shifting MLC shapes to adjust for daily prostate movement during concurrent treatment with pelvic lymph nodes

Concurrent treatment of the prostate and the pelvic lymph nodes encounters the problem of the prostate gland moving independently from the pelvic lymph nodes on a daily basis. The purpose of this study is to develop a leaf-tracking algorithm for adjustment of IMRT portals without requirement of online dose calculation to account for daily prostate position during concurrent treatment with pelvic lymph nodes. A leaf-shifting algorithm was developed and programmed to adjust the positions of selected MLC leaf pairs according to prostate movement in the plane perpendicular to each beam angle. IMRT plans from five patients with concurrent treatment of the prostate and pelvic lymph nodes were selected to test the feasibility of this algorithm by comparison with isocenter-shifted plans, using defined dose endpoints. When the prostate moved 0.5, 1.0, and 1.5 cm along the anterior/posterior direction, the average doses to 95% of the prostate (D{sub 95%}) for the iso-shift plans were similar to the MLC-shift plans, (54.7, 54.4, and 54.1 Gy versus 54.5, 54.3, and 53.9 Gy, respectively). The corresponding D{sub 95%} averages to the pelvic lymph nodes were reduced from the prescription dose of 45 Gy to 42.7, 38.3, and 34.0 Gy for iso-shift plans (p=0.04 for each comparison), while the D{sub 95%} averages for the MLC-shift plans did not significantly differ from the prescription dose, at 45.0, 44.8, and 44.5 Gy. Compensation for prostate movement along the superior/inferior direction was more complicated due to a limiting MLC leaf width of 1.0 cm. In order to concurrently treat the prostate and pelvic lymph nodes with the prostate moving independently, shifting selected MLC leaf pairs may be a more practical adaptive solution than shifting the patient.

62 RADIOLOGY AND NUCLEAR MEDICINE↗