Search NASA⌕ Search

SEARCH · Search NASA

Results for “structured data”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,441 records · Page 80

A Work-Efficient Parallel Sparse Matrix-Sparse Vector Multiplication Algorithm

We design and develop a work-efficient multithreaded algorithm for sparse matrix-sparse vector multiplication (SpMSpV) where the matrix, the input vector, and the output vector are all sparse. SpMSpV is an important primitive in the emerging GraphBLAS standard and is the workhorse of many graph algorithms including breadth-first search, bipartite graph matching, and maximal independent set. As thread counts increase, existing multithreaded SpMSpV algorithms can spend more time accessing the sparse matrix data structure than doing arithmetic. Our shared-memory parallel SpMSpV algorithm is work efficient in the sense that its total work is proportional to the number of arithmetic operations required. The key insight is to avoid each thread individually scan the list of matrix columns. Our algorithm is simple to implement and operates on existing column-based sparse matrix formats. It performs well on diverse matrices and vectors with heterogeneous sparsity patterns. A high-performance implementation of the algorithm attains up to 15x speedup on a 24-core Intel Ivy Bridge processor and up to 49x speedup on a 64-core Intel KNL manycore processor. In contrast to implementations of existing algorithms, the performance of our algorithm is sustained on a variety of different input types include matrices representing scale-free and high-diameter graphs.

97 MATHEMATICS AND COMPUTING↗

The Reverse Cuthill-McKee Algorithm in Distributed-Memory

Ordering vertices of a graph is key to minimize fill-in and data structure size in sparse direct solvers, maximize locality in iterative solvers, and improve performance in graph algorithms. Except for naturally parallelizable ordering methods such as nested dissection, many important ordering methods have not been efficiently mapped to distributed-memory architectures. In this paper, we present the first-ever distributed-memory implementation of the reverse Cuthill-McKee (RCM) algorithm for reducing the profile of a sparse matrix. Our parallelization uses a two-dimensional sparse matrix decomposition. We achieve high performance by decomposing the problem into a small number of primitives and utilizing optimized implementations of these primitives. Our implementation shows strong scaling up to 1024 cores for smaller matrices and up to 4096 cores for larger matrices.

97 MATHEMATICS AND COMPUTING↗

A Communication-Avoiding 3D LU Factorization Algorithm for Sparse Matrices

We propose a new algorithm to improve the strong scalability of right-looking sparse LU factorization on distributed memory systems. Our 3D sparse LU algorithm uses a three-dimensional MPI process grid, aggressively exploits elimination tree parallelism and trades off increased memory for reduced per-process communication. We also analyze the asymptotic improvements for planar graphs (e.g., from 2D grid or mesh domains) and certain non-planar graphs (specifically for 3D grids and meshes). For planar graphs with n vertices, our algorithm reduces communication volume asymptotically in n by a factor of O{log n} and latency by a factor of O{log n}. For non-planar cases, our algorithm can reduce the per-process communication volume by 3× and latency by O{n^1/3} times. In all cases, the memory needed to achieve these gains is a constant factor. We implemented our algorithm by extending the 2D data structure used in superLU. Our new 3D code achieves speedups up to 27× for planar graphs and up to 3.3× for non-planar graphs over the baseline 2D superLU when run on 24,000 cores of a Cray XC30.

Sao, Piyush↗

Bit-GraphBLAS: Bit-Level Optimizations of Matrix-Centric Graph Processing on GPU

In the graph data structure like adjacency matrix, the connectivity of two nodes can be sufficiently represented using only 1 bit, but they are generally treated as 32-bit full-precision in state-of-the-art graph frameworks to adopt common sparse format such as CSR. Meanwhile, bit-level parallelism has recently be explored to have high-performance potential and low storage requirement on GPUs with dense bit-tiles. To fill the gap, our solution is a hierarchical storage format that contains the bit-indexing base and dense bit-tile units. Inherently, the granularity of the bit-tile is an essential factor in achieving both storage compression and GPU parallelism. How to find a sweet spot that trades off between avoiding sparsity and exploiting is comprehensively researched in this work. In the experiment, we evaluate the proposed storage format and algorithms on modern generation GPUs, including Pascal and Volta, to figure out critical software co-designs in conjunction with existing hardware-specific optimization.

Chen, Jou-An↗

Radiative Heat Transfer Calculation on 16384 GPUs Using a Reverse Monte Carlo Ray Tracing Approach with Adaptive Mesh Refinement

Modeling thermal radiation is computationally challenging in parallel due to its all-to-all physical and resulting computational connectivity, and is also the dominant mode of heat transfer in practical applications such as next-generation clean coal boilers, being modeled by the Uintah framework. However, a direct all-to-all treatment of radiation is prohibitively expensive on large computers systems whether homogeneous or heterogeneous. DOE Titan and the planned DOE Summit and Sierra machines are examples of current and emerging GPU-based heterogeneous systems where the increased processing capability of GPUs over CPUs exacerbates this problem. These systems require that computational frameworks like Uintah leverage an arbitrary number of on-node GPUs, while simultaneously utilizing thousands of GPUs within a single simulation. We show that radiative heat transfer problems can be made to scale within Uintah on heterogeneous systems through a combination of reverse Monte Carlo ray tracing (RMCRT) techniques combined with AMR, to reduce the amount of global communication. In particular, significant Uintah infrastructure changes, including a novel lock and contention-free, thread-scalable data structure for managing MPI communication requests and improved memory allocation strategies were necessary to achieve excellent strong scaling results to 16384 GPUs on Titan.

Computer Science↗

Implementing the OpenACC Data Model

Programming accelerators today usually requires managing separate virtual and physical memories, such as allocating space in and copying data between host and device memories. The OpenACC API provides data directives and clauses to control this behavior where it is required. This paper describes how the data model is supported in current OpenACC implementations, ranging from research compilers (OpenUH and OpenARC) to a commercial compiler (the PGI OpenACC compiler). This includes implementation of the data directives and clauses, testing whether the data is already present on the device, OpenCL support, managing asynchronous data transfers and memory allocations, handling aliased data, reusing device memory, managing partially present data, and support for shared memory between host and device. Lastly, it also discusses on-going work to manage large, complex dynamic data structures.

Wolfe, Michael↗

Hardware-Accelerated Ray Tracing of CAD-Based Geometry for Monte Carlo Radiation Transport

Monte Carlo radiation transport (MCRT) methods have been used to simulate radiation environments for many decades by tracking individual particles through a model to accumulate statistical information. MCRT geometry is historically formed using the constructive solid geometry (CSG). Recently, significant work has been performed to support simulations using computer-aided design (CAD)-based tessellated surfaces to support highly complex geometries. Ray tracing acceleration data structures from the rendering and visualization community are applied to accelerate particle tracking in CAD-based models. Despite these efforts, CSG representations provide the superior performance in surface intersection operations during particle flight. Concurrently, pseudo Monte Carlo methods have become prevalent in rendering applications to support more realistic models for scattering media, motivating innovations that are advantageous for MCRT simulations. Finally, the authors’ work extends these innovations by employing Intel’s Embree ray tracing kernel within a geometry toolkit for Monte Carlo to improve the simulation performance using CAD-based models by factors of 1.5 to 2.

42 ENGINEERING↗

Scalable Triadic Analysis of Large-Scale Graphs: Multi-Core vs. Multi-Processor vs. Multi-Threaded Shared Memory Architectures

Triadic analysis encompasses a useful set of graph mining methods that is centered on the concept of a triad, which is a subgraph of three nodes and the configuration of directed edges across the nodes. Such methods are often applied in the social sciences as well as many other diverse fields. Triadic methods commonly operate on a triad census that counts the number of triads of every possible edge configuration in a graph. Like other graph algorithms, triadic census algorithms do not scale well when graphs reach tens of millions to billions of nodes. To enable the triadic analysis of large-scale graphs, we developed and optimized a triad census algorithm to efficiently execute on shared memory architectures. We will retrace the development and evolution of a parallel triad census algorithm. Over the course of several versions, we continually adapted the code’s data structures and program logic to expose more opportunities to exploit parallelism on shared memory that would translate into improved computational performance. We will recall the critical steps and modifications that occurred during code development and optimization. Furthermore, we will compare the performances of triad census algorithm versions on three specific systems: Cray XMT, HP Superdome, and AMD multi-core NUMA machine. These three systems have shared memory architectures but with markedly different hardware capabilities to manage parallelism.

Triadic analysis, triads, triad census, large-scal↗

Scalable Algorithms for Distributed-Memory Adaptive Mesh Refinement

This paper presents scalable algorithms and data structures for adaptive mesh refinement computations. We describe a novel mesh restructuring algorithm for adaptive mesh refinement computations that uses a constant number of collectives regardless of the refinement depth. To further increase scalability, we describe a localized hierarchical coordinate-based block indexing scheme in contrast to traditional linear numbering schemes, which incur unnecessary synchronization. In contrast to the existing approaches which take O(P) time and storage per process, our approach takes only constant time and has very small memory footprint. With these optimizations as well as an efficient mapping scheme, our algorithm is scalable and suitable for large, highly-refined meshes. We present strong-scaling experiments up to 2k ranks on Cray XK6, and 32k ranks on IBM Blue Gene/Q.

Langer, Akhil↗

BCSR on GPU: A Way Forward Extreme-scale Graph Processing on Accelerator-enabled Frontier Supercomputer

Handling large graphs in a distributed environment requires effective partitioning across processors and efficient management of local partitions. In 2D partitioning, local graphs often become too sparse, making memory-efficient data structures crucial. Using the Compressed Sparse Row (CSR) format wastes space, especially for > 83% of vertices with empty edges for the sparse graphs. This study explores bit-CSR (BCSR), a modified CSR representation, on GPUs to reduce memory usage in graph computations. We achieved 16.67% memory savings on a sparse rmat dataset with 268 million vertices and 357 million edges, without performance degradation, supported by both theoretical and experimental storage savings of 33%. However, we observed a 1.7× slowdown in degree lookup times due to bitwise operations on AMD CPUs. This analysis highlights the potential of BCSR on GPUs for improving Graph500 benchmark performance on GPU-accelerated systems, such as the Frontier supercomputer.

Sattar, Naw Safrin↗

A Survey on Privacy in Graph Neural Networks: Attacks, Preservation, and Applications

Graph Neural Networks (GNNs) have gained significant attention owing to their ability to handle graph-structured data and the improvement in practical applications. However, many of these models prioritize high utility performance, such as accuracy, with a lack of privacy consideration, which is a major concern in modern society where privacy attacks are rampant. To address this issue, researchers have started to develop privacy-preserving GNNs. Despite this progress, there is a lack of a comprehensive overview of the attacks and the techniques for preserving privacy in the graph domain. In this survey, we aim to address this gap by summarizing the attacks on graph data according to the targeted information, categorizing the privacy preservation techniques in GNNs, and reviewing the datasets and applications that could be used for analyzing/solving privacy issues in GNNs. We also outline potential directions for future research in order to build better privacy-preserving GNNs.

97 MATHEMATICS AND COMPUTING↗

Design and Evaluation of MPI File Domain Partitioning Methods under Extent-Based File Locking Protocol

MPI collective I/O has been an effective method for parallel shared-file access and maintaining the canonical orders of structured data in files. Its implementation commonly uses a two-phase I/O strategy that partitions a file into disjoint file domains, assigns each domain to a unique process, redistributes the I/O data based on their locations in the domains, and has each process perform I/O for the assigned domain. The partitioning quality determines the maximal performance achievable by the underlying file system, as the shared-file I/O has long been impeded by the cost of file system's data consistency control, particularly due to the conflicted locks. This paper proposes a few file domain partitioning methods designed to reduce lock conflicts under the extent-based file locking protocol. Experiments from four I/O benchmarks on the IBM GPFS and Lustre parallel file systems show that the partitioning method producing minimum lock conflicts wins the highest performance. The benefit of removing conflicted locks can be so significant that more than thirty times of write bandwidth differences are observed between the best and worst methods.

Computer Science↗

An Efficient Wait-Free Vector

The vector is a fundamental data structure, which provides constant-time access to a dynamically-resizable range of elements. Currently, there exist no wait-free vectors. The only non-blocking version supports only a subset of the sequential vector API and exhibits significant synchronization overhead caused by supporting opposing operations. Since many applications operate in phases of execution, wherein each phase only a subset of operations are used, this overhead is unnecessary for the majority of the application. To address the limitations of the non-blocking version, we present a new design that is wait-free, supports more of the operations provided by the sequential vector, and provides alternative implementations of key operations. These alternatives allow the developer to balance the performance and functionality of the vector as requirements change throughout execution. Compared to the known non-blocking version and the concurrent vector found in Intel’s TBB library, our design outperforms or provides comparable performance in the majority of tested scenarios. Over all tested scenarios, the presented design performs an average of 4.97 times more operations per second than the non-blocking vector and 1.54 more than the TBB vector. In a scenario designed to simulate the filling of a vector, performance improvement increases to 13.38 and 1.16 times. This work presents the first ABA-free non-blocking vector. Finally, unlike the other non-blocking approach, all operations are wait-free and bounds-checked and elements are stored contiguously in memory.

97 MATHEMATICS AND COMPUTING↗

Structural analysis and unique molecular recognition properties of a Bauhinia forficata lectin that inhibits cancer cell growth

Lectins have been used at length for basic research and clinical applications. New insights into the molecular recognition properties enhance our basic understanding of carbohydrate–protein interactions and aid in the design/development of new lectins. In this study, we used a combination of cell‐based assays, glycan microarrays, and X‐ray crystallography to evaluate the structure and function of the recombinant Bauhinia forficata lectin (BfL). The lectin was shown to be cytostatic for several cancer cell lines included in the NCI ‐60 panel; in particular, it inhibited growth of melanoma cancer cells ( LOX IMVI ) by over 95%. BfL is dimeric in solution and highly specific for binding of oligosaccharides and glycopeptides with terminal N ‐acetylgalactosamine (Gal NA c). BfL was found to have especially strong binding (apparent K d = 0.5–1.0 n m ) to the tumor‐associated Tn antigen. High‐resolution crystal structures were determined for the ligand‐free lectin, as well as for its complexes with three Tn glycopeptides, globotetraose, and the blood group A antigen. Extensive analysis of the eight crystal structures and comparison to structures of related lectins revealed several unique features of Gal NA c recognition. Of special note, the carboxylate group of Glu126, lining the glycan‐binding pocket, forms H‐bonds with both the N ‐acetyl of Gal NA c and the peptide amido group of Tn antigens. Stabilization provided by Glu126 is described here for the first time for any Gal NA c‐specific lectin. Taken together, the results provide new insights into the molecular recognition of carbohydrates and provide a structural understanding that will enable rational engineering of BfL for a variety of applications. Database Structural data are available in the PDB under the accession numbers 5T50 , 5T52 , 5T55 , 5T54 , 5T5L , 5T5J , 5T5P , and 5T5O .

Lubkowski, Jacek↗

THE EFFECTS OF CHANGING FUELS ON HOT GAS PATH CONDITIONS IN SYNGAS TURBINES

Gas turbines in integrated gasification combined cycle power plants burn a fuel gas (syngas) in which the proportions of hydrocarbons, H2, CO, water vapor, and minor impurity levels may differ significantly from those in natural gas. Such differences can yield changes in the temperature, pressure, and corrosive species that are experienced by critical components in the hot gas path, with important implications in the design, operation, and reliability of the turbine. A new data structure and computational methodology is presented for the numerical simulation of a turbine thermodynamic cycle for various fuel types. The approach used allows efficient handling of turbine components and different variable constraints due to fuel changes. Examples are presented for a turbine with four stages. The vanes and blades were considered to be cooled in an open circuit, with air provided from the appropriate compressor stages. A constraint was placed on the maximum metal temperature and values were calculated for the fuel flow rates, airflow ratios, and coolant flow rates for cases where the turbine was fired with natural gas, NG, or syngas, SG. One NG case was conducted to assess the effect of coolant pressure matching between the compressor extraction points and corresponding turbine injection points. It was found that pressure matching is a feature that must be considered for high combustion temperatures. The first series of SG simulations was conducted using the same inlet mass flow and pressure ratios as those for the NG case. The results showed that higher coolant flow rates and a larger number of cooled turbine rows were needed for the SG case to comply with imposed temperature constraint. Thus, for this first case, the turbine size would be different for SG than for NG. In order to maintain the original turbine configuration (i.e., geometry, diameters, blade heights, angles, and cooling circuit characteristics) for the SG simulations, a second series of simulations was carried out in which the inlet mass flow was varied while keeping constant the pressure ratios and the amount of hot gas passing the first vane of the turbine. The effects of turbine matching between the NG and SG cases were increases for the SG case of approximately 7 and 13 % for total cooling flows and cooling flows for the first vane, respectively. In particular, for the SG case, the vane in the last stage of the turbine experienced inner wall temperatures that approached the maximum allowable limit.

03 NATURAL GAS↗

Study of electron-induced chemical transformations in polymers

In extreme ultraviolet (EUV) photoresist exposure, the primary and secondary electrons drive chemistry rather than the EUV photons themselves. These electrons have a wide range of energies below approximately 80 eV, which are capable of complex network of reactions during exposure. To better understand the ability of electrons of different energies within the EUV primary and secondary electron range, we want to characterize and compare the chemistry induced in pure polymer films by direct exposure to electrons. Thin films of poly(tert-butyl methacrylate), poly(methyl methacrylate), and poly(4-hydroxystyrene) were exposed to a 20 to 80 eV electron beam. Outgassing during exposure was characterized in-situ using a quadrupole residual gas analyzer. The thickness changes were measured using ellipsometry and chemical bond structure data were collected using Fourier-transform infrared spectroscopy (FTIR) after exposure to compare different exposure conditions. Poly(4-hydroxystyrene) demonstrated stability during electron exposures. Exposures of the other two materials led to outgassing of protecting groups, the intensity of which decayed in time. Outgassing, FTIR, and thickness loss data exhibited approximately linear relationships to each other.

Mueller, Maximillian↗

Development of large area transparent conducting oxides from a combinatorial lead for organic solid state lighting

Organic light emitting device (OLEDs) may provide a low-cost, long-lived, and efficient wide area lighting solution if a number of challenges in reliability, cost and efficiency can be overcome. There is a need to develop new TCOs for use as the anode in a bottom-emitting device that do not contain In, have optimal work function, conductivity and visible light transmission properties, possess acceptable stability and possess a high work function to match the deep HOMO of blue OLED HTLs. We report here results from our efforts to scale up sputter deposition on large area substrates (up to 12”x12”) of TCO candidates (including Ga:ZnO and Zn:SnO) identified using combinatorial methods. We present transmission, electrical properties, work function, compositional and structural data for these films. Finally, we have evaluated the use of these materials in OLEDs, and show device performance comparisons between devices fabricated on combinatorial substrates, single composition substrates, and substrates grown at larger scale (up to 12”x12”). Post-operation analysis of the materials using a combination of surface analysis and electron microscopy techniques was performed. The device results demonstrate that we are able to generate substrates with the appropriate work function to reduce the operating voltage of blue phosphorescent OLEDs compared to commercial ITO, which we ascribe to improved work function-HOMO energy matching leading to more efficient charge injection into the device HTL.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗