Search NASA⌕ Search

SEARCH · Search NASA

Results for “data structures”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

pnnl/SHAD

Scalable High-performance Algorithms and Data-structures. Scalable High-performance Algorithms and Data-structures (SHAD) is an application programming interface based on a generic software library. It has a modular design that enables reuse of modules. The core of this software tool set is built on an Abstract Runtime interface and it's library includes the common data structures such as array, vector, map and set. It is designed to accommodate significant amount of data which can be accessed in massively parallel environments, and used as building blocks for SHAD extensions, i.e. higher level software libraries.

Castellana, Vito↗
DOE OSTI2018

Multithreaded sparse matrix-matrix multiplication for many-core and GPU architectures

Sparse matrix-matrix multiplication is a key kernel that has applications in several domains such as scientific computing and graph analysis. Several algorithms have been studied in the past for this foundational kernel. In this work, we develop parallel algorithms for sparse matrix-matrix multiplication with a focus on performance portability across different high performance computing architectures. The performance of these algorithms depend on the data structures used in them. We compare different types of accumulators in these algorithms and demonstrate the performance difference between these data structures. Furthermore, we develop a meta-algorithm, kkSpGEMM, to choose the right algorithm and data structure based on the characteristics of the problem. We show performance comparisons on three architectures and demonstrate the need for the community to develop two phase sparse matrix-matrix multiplication implementations for efficient reuse of the data structures involved.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Multi-threaded Sparse Matrix Sparse Matrix Multiplication for Many-Core and GPU Architectures.

Sparse Matrix-Matrix multiplication is a key kernel that has applications in several domains such as scientific computing and graph analysis. Several algorithms have been studied in the past for this foundational kernel. In this paper, we develop parallel algorithms for sparse matrix- matrix multiplication with a focus on performance portability across different high performance computing architectures. The performance of these algorithms depend on the data structures used in them. We compare different types of accumulators in these algorithms and demonstrate the performance difference between these data structures. Furthermore, we develop a meta-algorithm, kkSpGEMM, to choose the right algorithm and data structure based on the characteristics of the problem. We show performance comparisons on three architectures and demonstrate the need for the community to develop two phase sparse matrix-matrix multiplication implementations for efficient reuse of the data structures involved.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1991

Analysis of structural response data using discrete modal filters

The application of reciprocal modal vectors to the analysis of structural response data is described. Reciprocal modal vectors are constructed using an existing experimental modal model and an existing frequency response matrix of a structure, and can be assembled into a matrix that effectively transforms the data from the physical space to a modal space within a particular frequency range. In other words, the weighting matrix necessary for modal vector orthogonality (typically the mass matrix) is contained within the reciprocal model matrix. The underlying goal of this work is mostly directed toward observing the modal state responses in the presence of unknown, possibly closed loop forcing functions, thus having an impact on both operating data analysis techniques and independent modal space control techniques. This study investigates the behavior of reciprocol modal vectors as modal filters with respect to certain calculation parameters and their performance with perturbed system frequency response data.

Freudinger, Lawrence C.↗
DOE OSTI2018

Nuclear Data Sheets for A=170☆

Nuclear structure data pertaining to all nuclei with mass number A=170 have been evaluated, and incorporated into the ENSDF data file. This evaluation supersedes the previous evaluation (Coral M. Baglin), Nuclear Data Sheets 96, 611 (2002), (cutoff date 15 August 2002) and subsequent updates of the ENSDF file for Yb to Dy (cutoff 15 April 2010), Lu (cutoff 8 October 1998), Pt (cutoff 17 February 1999) and Ta, Os (cutoff 7 April 1998). Since the previous evaluation, {sup 170}Gd has been observed and the ground state T{sub 1/2} measured. New excited states have also been observed in the neutron rich {sup 170}Dy. The ground state T{sub 1/2} of {sup 170}Tb has been determined, however, there are currently still no excited states observed in this nucleus. There remains some uncertainty in the ground state and longer-lived isomer in {sup 170}Ir which could warrent further experimental investigation.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1990

Sources of the solar wind - What are the smallest-scale structures?

Data obtained by a variety of observing techniques are summarized to show that the solar wind is structured over a wide range of scale sizes (from one to one millionth solar radius). The possible contribution of reconnection sites as sources of momentum for the solar wind is examined. It is pointed out that, as plasmoids ejected from the reconnection sites traverse the stratified corona, they may expand sufficiently to occupy all of the available volume. It is suggested that the solar wind, at its origin, is composed essentially of these plasmoids.

Mullan, D. J.↗
DOE OSTI2017

The introspective may achieve more: Enhancing existing Geoscientific models with native-language emulated structural reflection

Geoscientific models manage myriad and increasingly complex data structures as trans -disciplinary models are integrated. They often incur significant redundancy with cross-cutting tasks. Reflection, the ability of a program to inspect and modify its structure and behavior at runtime, is known as a powerful tool to improve code reusability, abstraction, and separation of concerns. Reflection is rarely adopted in high-performance Geoscientific models, especially with Fortran, where it was previously deemed implausible. Practical constraints of language and legacy often limit us to feather-weight, native-language solutions. We demonstrate the usefulness of a structural-reflection-emulating, dynamically-linked metaObjects, gd . We show real-world examples including data structure self-assembly, effortless save/restart and upgrade to parallel I/O, recursive actions and batch operations. We share gd and a derived module that reproduces MATLAB-like structure in Fortran and C++. We suggest that both a gd representation and a Fortran-native representation are maintained to access the data, each for separate purposes. In conclusion, embracing emulated reflection allows generically-written codes that are highly re-usable across projects.

58 GEOSCIENCES↗
DOE OSTI2023

Scalable Incremental Checkpointing using GPU-Accelerated De-Duplication

Writing large amounts of data concurrently to stable storage is a typical I/O pattern of many HPC workflows. This pattern introduces high I/O overheads and results in increased storage space utilization especially for workflows that need to capture the evolution of data structures with high frequency as checkpoints. In this context, many applications, such as graph pattern matching, perform sparse updates to large data structures between checkpoints. For these applications, incremental checkpointing techniques that save only the differences from one checkpoint to another can dramatically reduce the checkpoint sizes, I/O bottlenecks, and storage space utilization. However, such techniques are not without challenges: it is non-trivial to transparently determine what data has changed since a previous checkpoint and assemble the differences in a compact fashion that does not result in excessive metadata. State-of-art data reduction techniques (e.g., compression and de-duplication) have significant limitations when applied to modern HPC applications that leverage GPUs: slow at detecting the differences, generate a large amount of metadata to keep track of the differences, and ignore crucial spatiotemporal checkpoint data redundancy. This paper addresses these challenges by proposing a Merkle tree-based incremental checkpointing method to exploit GPUs' high memory bandwidth and massive parallelism. Experimental results at scale show a significant reduction of the I/O overhead and space utilization of checkpointing compared with state-of-the-art incremental checkpointing and compression techniques.

Tan, Nigel↗
NASA NTRS1992

The evolution of the FIGARO data reduction system

The Figaro data reduction system originated at Caltech around 1983. It was based on concepts being developed in the U.K. by the Starlink organization, particularly the use of hierarchical self-defining data structures and the abstraction of most user-interaction into a set of 'parameter system' routines. Since 1984 it has continued to be developed at AAO, in collaboration with Starlink and Caltech. It was adopted as Starlink's main spectroscopic data reduction package, although it is by no means limited to spectra; it has operations for images and data cubes and even a few (very specialized) for four-dimensional data hypercubes. It continued to be used at Caltech and will be used at the Keck. It is also in use at a variety of other organizations around the world. Figaro was originally a system for VMS Vaxes. Recently it was ported (at Caltech) to run on SUN's, and work is underway at the University of New South Wales on a DecStation version. It is hoped to coordinate all this work into a unified release, but coordination of the development of a system by organizations covering three continents poses a number of interesting administrative problems. The hierarchical data structures used by Figaro allow it to handle a variety of types of data, and to add new items to data structures. Error and data quality information was added to the basic file format used, error information being particularly useful for infrared data. Cooperating sets of programs can add specific sub-structures to data files to carry information that they understand (polarimetry data containing multiple data arrays, for example), without this affecting the way other programs handle the files. Complex instrument-specific ancillary information can be added to data files written at a telescope and can be used by programs that understand the instrumental details in order to produce properly calibrated data files. Once this preliminary data processing was done the resulting files contain 'ordinary' spectra or images that can be processed by programs that are not instrument-specific. The structures holding the instrumental information can then be discarded from the files. Much effort has gone into trying to make it easy to write Figaro programs; data access subroutines are now available to handle access to all the conventional items found in Figaro files (main data arrays, error information, quality information etc), and programs that only need to access such items can be very simple indeed. A large number of Figaro users do indeed write their own Figaro applications using these routines. The fact that Figaro programs are written as callable subroutines getting information from the user through a small set of parameter routines means that they can be invoked in numerous ways; they are normally linked and run as individual programs (called by a small main routine that is generated automatically), but are also available linked to run under the ADAM data acquisition system and there is an interface that lets them be called as part of a user-written Fortran program. The long-term future of Figaro probably depends to a large extent on how successfully it manages the transition from being a VMS-only system to being a multi-platform system.

Shortridge, K.↗
NASA NTRS1993

SeaWiFS technical report series. Volume 9: The simulated SeaWiFS data set, version 1

Data system development activities for the Sea-viewing Wide Field-of-view Sensor (SeaWiFS) must begin well before the scheduled 1994 launch. To assist in these activities, it is essential to develop a simulated SeaWiFS data set as soon as possible. Realism is of paramount importance in this data set, including SeaWiFS spectral bands, orbital and scanning characteristics, and known data structures. Development of the simulated data set can assist in identification of problem areas that can be addressed and solved before the actual data are received. This paper describes the creation of the first version of the simulated SeaWiFS data set. The data set includes the spectral band, orbital, and scanning characteristics of the SeaWiFS sensor and SeaStar spacecraft. The information is output in the data structure as it is stored onboard. Thus, it is a level-0 data set which can be taken from start to finish through a prototype data system. The data set is complete and correct at the time of printing, although the values in the telemetry fields are left blank. The structure of the telemetry fields, however, is incorporated. Also, no account for clouds has been included. However, this version facilitates early prototyping activities by the SeaWiFS data system, providing a realistic data set to assess performance.

Gregg, Watson W.↗
DOE OSTI2018

Nuclear Data Sheets for A=164

Experimental nuclear structure data for the known A=164 isobaric nuclides (Sm, Eu, Gd, Tb, Dy, Ho, Er, Tm, Yb, Lu, Hf, Ta, W, Re, Os, Ir) have been evaluated, and presented together with Adopted properties of level energies, and associated γ rays. The decay data for these nuclides have also been evaluated, providing Adopted values of γ and β radiations, and log ft values. No excited states are known in 164 Eu, 164 Tb, and 164 Ir. Information for 164 Gd, 164 Re and 164 Os is limited due to insufficient experimental data. For radioactive nuclides, decay schemes of 164 Sm, 164 Gd and 164 Re are not known, and those of 164 W, 164 Tb, 164 Lu, 164 Hf, 164 Ta and 164 W are incomplete. The decay schemes of 164 Ho and the two activities of 164 Tm seem fairly complete. The decay scheme of 164 Yb presents a major problem that the Q(ε) value of 887 keV 29 recommended in 2017Wa10 is in disagreement with the population of levels at 928, 952 and 1060 keV in the daughter nucleus. This decay scheme, which so far has been mainly reported in a secondary reference (1982AdZZ) needs further investigation. Also the masses of 164 Yb and 164 Tm need either new measurements or a re-evaluation to resolve discrepancy of about 220 keV in the Q value of 164 Yb decay to 164 Tm. The reactions and decays for which no new experimental information has become available since the 2001 update have undergone revisions to incorporate conversion coefficients from BrIcc code, and evaluated Q values from 2017Wa10, but the essential content of such datasets may have remained the same as in previous evaluations. Finally, in this respect the present work greatly benefited from all the previous NDS evaluations (2001Si27,1992Sh07, 1986Sh03,1974Bu30), but at the same time data presented herein supersede all the previous published evaluations.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗
DOE OSTI2019

Nuclear Data Sheets for A=73☆

Experimental nuclear structure data for the known A=73 isobaric nuclides (Mn, Fe, Co, Ni, Cu, Zn, Ga, Ge, As, Se, Br, Kr, Rb and Sr) have been evaluated, and presented together with Adopted properties of level energies, and associated γ rays. The decay data for these nuclides have also been evaluated, providing Adopted values of γ and β radiations, and log ft values. For {sup 73}Mn, only the isotopic identification has been established, with no knowledge of its g.s. half-life. For {sup 73}Fe, {sup 73}Co and {sup 73}Sr, only the ground states and their half-lives are known with no information about the excited states. For {sup 73}Ni, {sup 73}Cu, {sup 73}Zn and {sup 73}Rb, little data are available for excited states. The half-life and decay modes of possibly proton-unbound {sup 73}Rb need firmly established. {sup 73}Ga structure presents a special challenge in that the 1/2{sup −} ground state and the first 3/2{sup −} state have recently been proposed, in a Coulomb excitation experiment by 2010Di14, to form an almost degenerate doublet with an estimated spacing of 229 Th with its first excited state at 7.8 eV, and {sup 235}U with its first excited state at 76 eV. Ultra-high resolution gamma-ray spectroscopic studies are warranted to search for the low-lying (73 Ga, and to determine its half-life. Level structures of {sup 73}Ga, {sup 73}Ge, {sup 73}As, {sup 73}Se, {sup 73}Br and {sup 73}Kr are quite well known, although decay schemes of radioactive ground states of {sup 73}Co, {sup 73}Cu and {sup 73}Br are considered incomplete. The reactions and decays for which no new experimental information has become available since the 2003 update have undergone revisions to incorporate conversion coefficients from BrIcc code, and evaluated Q values from 2017Wa10, but essential content of such datasets may have remained the same as in previous evaluations. In this respect the present work greatly benefited from all the previous NDS evaluations (2004Si08,1993Ki25,1987Ki13, 1980Ek01,1974Al33), but at the same time data presented herein supersede all the previous published evaluations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

The Stellar decomposition: A compact representation for simplicial complexes and beyond

Here, we introduce the Stellar decomposition, a model for efficient topological data structures over a broad range of simplicial and cell complexes. A Stellar decomposition of a complex is a collection of regions indexing the complex’s vertices and cells such that each region has sufficient information to locally reconstruct the star of its vertices, i.e., the cells incident in the region’s vertices. Stellar decompositions are general in that they can compactly represent and efficiently traverse arbitrary complexes with a manifold or non-manifold domain. They are scalable to complexes in high dimension and of large size, and they enable users to easily construct tailored application-dependent data structures using a fraction of the memory required by a corresponding global topological data structure on the complex. As a concrete realization of this model for spatially embedded complexes, we introduce the Stellar tree, which combines a nested spatial tree with a simple tuning parameter to control the number of vertices in a region. Stellar trees exploit the complex’s spatial locality by reordering vertex and cell indices according to the spatial decomposition and by compressing sequential ranges of indices. Stellar trees are competitive with state-of-the-art topological data structures for manifold simplicial complexes and offer significant improvements for cell complexes and non-manifold simplicial complexes. We conclude with a high-level description of several mesh processing and analysis applications that utilize Stellar trees to process large datasets.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

RCSB Protein Data Bank tools for 3D structure-guided cancer research: human papillomavirus (HPV) case study

Abstract Atomic-level three-dimensional (3D) structure data for biological macromolecules often prove critical to dissecting and understanding the precise mechanisms of action of cancer-related proteins and their diverse roles in oncogenic transformation, proliferation, and metastasis. They are also used extensively to identify potentially druggable targets and facilitate discovery and development of both small-molecule and biologic drugs that are today benefiting individuals diagnosed with cancer around the world. 3D structures of biomolecules (including proteins, DNA, RNA, and their complexes with one another, drugs, and other small molecules) are freely distributed by the open-access Protein Data Bank (PDB). This global data repository is used by millions of scientists and educators working in the areas of drug discovery, vaccine design, and biomedical and biotechnology research. The US Research Collaboratory for Structural Bioinformatics Protein Data Bank (RCSB PDB) provides an integrated portal to the PDB archive that streamlines access for millions of worldwide PDB data consumers worldwide. Herein, we review online resources made available free of charge by the RCSB PDB to basic and applied researchers, healthcare providers, educators and their students, patients and their families, and the curious public. We exemplify the value of understanding cancer-related proteins in 3D with a case study focused on human papillomavirus.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2021

Evolution of standardization and dissemination of cryo-EM structures and data jointly by the community, PDB, and EMDB

Cryogenic electron microscopy (cryo-EM) methods began to be used in the mid-1970s to study thin and periodic arrays of proteins. Following a half-century of development in cryo-specimen preparation, instrumentation, data collection, data processing and modeling software, cryo-EM has become a routine method for solving structures from large biological assemblies to small biomolecules at near to true atomic resolution. This review explores the critical roles played by the Protein Data Bank (PDB) and Electron Microscopy Data Bank (EMDB) in partnership with the community to develop the necessary infrastructure to archive cryo-EM maps and associated models. Public access to cryo-EM structure data has in turn facilitated better understanding of structure-function relationships and advancement of image processing and modeling tool development. The partnership between the global cryo-EM community and PDB and EMDB leadership has synergistically shaped the standards for metadata, one-stop deposition of maps and models, and validation metrics to assess the quality of cryo-EM structures. The advent of cryo-electron tomography (cryo-ET) for in situ molecular cell structures at a broad resolution range and their correlations with other imaging data introduces new data archival challenges in terms of data size and complexity in the years to come.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1987

A hypermatrix formulation for subspace iteration

The computational efficiency of subspace iteration is addressed relative to the data structures adopted for the very large and generally sparse coefficient matrices. The frequent triangulations and matrix multiplications demand that access to the terms in the coefficient matrices be unbiased. Reliance on virtual memory (paging) operating systems with no special considerations for localized data access is not adequate. Specific data structures must be designed that accommodate the needs of the numerical algorithm yet eliminate unnecessary paging. An implementation of the subspace iteration method using hypermatrix data structures is presented. Use of hypermatrices is shown to provide unbiased and localized data access. The various modifications to the conventional formulation are described and an example problem illustrates the potential benefits of the hypermatrix formulation. Possibilities for adapting hypermatrix data structures to new supercomputer architectures are discussed.

Schmidt, Richard J.↗
DOE OSTI2023

A decay database of coincident γ–γ and γ–X -ray branching ratios for in-field spectroscopy applications

Current fieldable spectroscopy techniques often use single detector systems heavily impacted by interferences from intense background radiation fields. These effects result in low-confidence measurements that can lead to misinterpretation of the collected spectrum. To help improve interpretation of the fission products and short-lived radionuclides produced in a composite sample, a coincidence-database is being developed in support of a robust portable and X-ray coincidence detector system concurrently under development at the Pacific Northwest National Laboratory for in-field deployment. Hitherto, no database exists containing coincident γ–γ and γ–X-ray branching-ratio intensities on an absolute scale that will greatly enhance isotopic identification for in-field applications. As part of this project, software has been developed to parse all radioactive-decay data sets from the Evaluated Nuclear Structure Data File (ENSDF) archive to enable translation into a more useful JavaScript Object Notation (JSON) formats that more readily supports query-based data manipulation. The coincident database described in this work is the first of its kind and contains coincidence γ–γ and γ–X-ray intensities and their corresponding uncertainties, together with auxiliary metadata associated with each decay data set. The new JSON format provides a convenient and portable means of data storage that can be imported into analysis frameworks with relatively low overhead allowing for meaningful comparison with measured data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗