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,171 records · Page 65

Camellia: A Rapid Development Framework for Finite Element Solvers

We report the discontinuous Petrov–Galerkin (DPG) methodology of Demkowicz and Gopalakrishnan guarantees the optimality of the finite element solution in a user-controllable energy norm, and provides several features supporting adaptive schemes. The approach provides stability automatically; there is no need for carefully derived numerical fluxes (as in DG schemes) or for mesh-dependent stabilization terms (as in stabilized methods). In this paper, we focus on features of Camellia that facilitate implementation of new DPG formulations; chief among these is a rich set of features in support of symbolic manipulation, which allow, e.g., bilinear formulations in the code to appear much as they would on paper. Many of these features are general in the sense that they can also be used in the implementation of other finite element formulations. In fact, because DPG’s requirements are essentially a superset of those of other finite element methods, Camellia provides built-in support for most common methods. We believe, however, that the combination of an essentially “hands-free” finite element methodology as found in DPG with the rapid development features of Camellia are particularly winsome, so we focus on use cases in this class. In addition to the symbolic manipulation features mentioned above, Camellia offers support for one-irregular adaptive meshes in 1D, 2D, 3D, and space-time. It provides a geometric multigrid preconditioner particularly suited for DPG problems, and supports distributed parallel execution using MPI. For its load balancing and distributed data structures, Camellia relies on packages from the Trilinos project, which simplifies interfacing with other computational science packages. Camellia also allows loading of standard mesh formats through an interface with the MOAB package. Camellia includes support for static condensation to eliminate element-interior degrees of freedom locally, usually resulting in substantial reduction of the cost of the global problem. Finally, we include a discussion of the variational formulations built into Camellia, with references to those formulations in the literature, as well as an MPI performance study.

97 MATHEMATICS AND COMPUTING↗

CalderaCast Example Output

A sample output file generated by CalderaCast, showcasing typical results and data structure. This example helps users understand expected outputs from the tool.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A Combined Experimental and Theoretical Study of Lithiation Mechanism in ZnFe2O4 Anode Materials

ABSTRACT ZnFe 2 O 4 (ZFO) represents a promising anode material for lithium ion batteries, but there is still a lack of deep understanding of the fundamental reduction mechanism associated with this material. In this paper, the complete visualization of reduction/oxidation products irrespective of their crystallinity was achieved experimentally through a compilation of in situ X-ray diffraction, synchrotron based powder diffraction, and ex-situ X-ray absorption fine structure data. Complementary theoretical modelling study further shed light upon the fundamental understanding of the lithiation mechanism, especially at the early stage from ZnFe 2 O 4 up to Li x ZnFe 2 O 4 (x = 2).

36 MATERIALS SCIENCE↗

Multiphysics modeling of accelerators through code integration

This work aims to improve the ability of particle accelerator researchers to develop high-performance accelerator cavity designs by creating an overall multiphysics framework that integrates and couples existing application codes. This framework will allow accelerator researchers to build multiphysics models that will optimize cavity design, improve understanding of whole-device performance, and reduce the development and fabrication costs of accelerator research. We utilize the open-source VizSchema data standard as an intermediate data structure interface layer to standardize interfaces between individual application codes. VizScema is extensively documented online, and plugins for VizSchema are available for popular visualization packages, including VisIt and ParaView. Currently, the work focuses on coupling the EM field solver COMSOL and the electron gun code MICHELLE to allow COMSOL field-solve results to be seamlessly used by MICHELLE for particle-solve. Later work will extend this integration to include other fields, particles, and thermodynamics simulation codes.

43 PARTICLE ACCELERATORS↗

Django Remote Submission

The Django Remote Submission (DRS) is a Django (Django, n.d.) application to manage long running job submission, including starting the job, saving logs, and storing results. It is an independent project available as a standalone pypi package (PyPi, n.d.). It can be easily integrated in any Django project. The source code is freely available as a GitHub repository (django-remote-submission, n.d.). To run the jobs in background, DRS takes advantage of Celery (Celery, n.d.), a powerful asynchronous job queue used for running tasks in the background, and the Redis Server (Redis, n.d.), an in-memory data structure store. Celery uses brokers to pass messages between a Django Project and the Celery workers. Redis is the message broker of DRS. In addition DRS provides real time monitoring of the progress of Jobs and associated logs. Through the Django Channels project (Channels, n.d.), and the usage of Web Sockets, it is possible to asynchronously display the Job Status and the live Job output (standard output and standard error) on a web page.

97 MATHEMATICS AND COMPUTING↗

EPiC-GAN: Equivariant point cloud generation for particle jets

With the vast data-collecting capabilities of current and future high-energy collider experiments, there is an increasing demand for computationally efficient simulations. Generative machine learning models enable fast event generation, yet so far these approaches are largely constrained to fixed data structures and rigid detector geometries. In this paper, we introduce EPiC-GAN - equivariant point cloud generative adversarial network - which can produce point clouds of variable multiplicity. This flexible framework is based on deep sets and is well suited for simulating sprays of particles called jets. The generator and discriminator utilize multiple EPiC layers with an interpretable global latent vector. Crucially, the EPiC layers do not rely on pairwise information sharing between particles, which leads to a significant speed-up over graph- and transformer-based approaches with more complex relation diagrams. We demonstrate that EPiC-GAN scales well to large particle multiplicities and achieves high generation fidelity on benchmark jet generation tasks.

Buhmann, Erik↗

NuHepMC: A standardized event record format for neutrino event generators

Simulations of neutrino interactions are playing an increasingly important role in the pursuit of high-priority measurements for the field of particle physics. A significant technical barrier for efficient development of these simulations is the lack of a standard data format for representing individual neutrino scattering events. We propose and define such a universal format, named NuHepMC, as a common standard for the output of neutrino event generators. The NuHepMC format uses data structures and concepts from the HepMC3 event record library adopted by other subfields of high-energy physics. These are supplemented with an original set of conventions for generically representing neutrino interaction physics within the HepMC3 infrastructure.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Using reconfigurable functional units in conventional microprocessors.

Scientific applications use highly specialized data structures that require complex, latency sensitive graphs of integer instructions for memory address calculations. Working with the Univeristy of Wisconsin, we have demonstrated significant differences between the Sandia's applications and the industry standard SPEC-FP (standard performance evaluation corporation-floating point) suite. Specifically, integer dataflow performance is critical to overall system performance. To improve this performance, we have developed a configurable functional unit design that is capable of accelerating integer dataflow.

99 GENERAL AND MISCELLANEOUS↗

Bringing Water into an Integrated Assessment Framework

We developed a modeling capability to understand how water is allocated within a river basin and examined present and future water allocations among agriculture, energy production, other human requirements, and ecological needs. Water is an essential natural resource needed for food and fiber production, household and industrial uses, energy production, transportation, tourism and recreation, and the functioning of natural ecosystems. Anthropogenic climate change and population growth are anticipated to impose unprecedented pressure on water resources during this century. Pacific Northwest National Laboratory (PNNL) researchers have pioneered the development of integrated assessment (IA) models for the analysis of energy and economic systems under conditions of climate change. This Laboratory Directed Research and Development (LDRD) effort led to the development of a modeling capability to evaluate current and future water allocations between human requirements and ecosystem services. The Water Prototype Model (WPM) was built in STELLA®, a computer modeling package with a powerful interface that enables users to construct dynamic models to simulate and integrate many processes (biological, hydrological, economics, sociological). A 150,404-km2 basin in the United States (U.S.) Pacific Northwest region served as the platform for the development of the WPM. About 60% of the study basin is in the state of Washington with the rest in Oregon. The Columbia River runs through the basin for 874 km, starting at the international border with Canada and ending (for the purpose of the simulation) at The Dalles dam. Water enters the basin through precipitation and from streamflows originating from the Columbia River at the international border with Canada, the Spokane River, and the Snake River. Water leaves the basin through evapotranspiration, consumptive uses (irrigation, livestock, domestic, commercial, mining, industrial, and off-stream power generation), and streamflow through The Dalles dam. Water also enters the Columbia River via runoff from land. The model runs on a monthly timescale to account for the impact of seasonal variations of climate, streamflows, and water uses. Data for the model prototype were obtained from national databases and ecosystem model results. The WPM can be run from three sources: 1) directly from STELLA, 2) with the isee Player®, or 3) the web version of WPM constructed with NetSim® software. When running any of these three versions, the user is presented a screen with a series of buttons, graphs, and a table. Two of the buttons provide the user with background and instructions on how to run the model. Currently, there are five types of scenarios that can be manipulated alone or in combination using the Sliding Input Devices: 1) interannual variability (e.g., El Niño), 2) climate change, 3) salmon policy, 4) future population, and 5) biodiesel production. Overall, the WPM captured the effects of streamflow conditions on hydropower production. Under La Niña conditions, more hydropower is available during all months of the year, with a substantially higher availability during spring and summer. Under El Niño conditions, hydropower would be reduced, with a total decline of 15% from normal weather conditions over the year. A policy of flow augmentation to facilitate the spring migration of smolts to the ocean would also reduce hydropower supply. Modeled hydropower generation was 23% greater than the 81 TWh reported in the 1995 U.S. Geological Survey (USGS) database. The modeling capability presented here contains the essential features to conduct basin-scale analyses of water allocation under current and future climates. Due to its underlying data structure iv and conceptual foundation, the WPM should be appropriate to conduct IA modeling at national and global scales.

54 ENVIRONMENTAL SCIENCES↗

Efficient Databases for MPC Microdata (Final Report)

The purpose of this grant was to develop the theory and practice of high-performance databases for massive streamed datasets. Over the last three years, we have developed fast indexing technology, that is, technology for rapidly ingesting data and storing that data so that it can be efficiently queried and analyzed. During this project we developed the technology so that high-bandwidth data streams can be indexed and queried efficiently. Our technology has been proven to work data sets composed of tens of billions of rows when the data streams arrives at over 40,000 rows per second. We achieved these numbers even on a single disk driven by two cores. Our work comprised (1) new write-optimized data structures with better asymptotic complexity than traditional structures, (2) implementation, and (3) benchmarking. We furthermore developed a prototype of TokuFS, a middleware layer that can handle microdata I/O packaged up in an MPI-IO abstraction.

97 MATHEMATICS AND COMPUTING↗

Thermal Conductivity Measurement of Xe-Implanted Uranium Dioxide Thick Films using Multilayer Laser Flash Analysis

The Fuel Cycle Research and Development program's Advanced Fuels campaign is currently pursuing use of ion beam assisted deposition to produce uranium dioxide thick films containing xenon in various morphologies. To date, this technique has provided materials of interest for validation of predictive fuel performance codes and to provide insight into the behavior of xenon and other fission gasses under extreme conditions. In addition to the structural data provided by such thick films, it may be possible to couple these materials with multilayer laser flash analysis in order to measure the impact of xenon on thermal transport in uranium dioxide. A number of substrate materials (single crystal silicon carbide, molybdenum, and quartz) containing uranium dioxide films ranging from one to eight microns in thickness were evaluated using multilayer laser flash analysis in order to provide recommendations on the most promising substrates and geometries for further investigation. In general, the uranium dioxide films grown to date using ion beam assisted deposition were all found too thin for accurate measurement. Of the substrates tested, molybdenum performed the best and looks to be the best candidate for further development. Results obtained within this study suggest that the technique does possess the necessary resolution for measurement of uranium dioxide thick films, provided the films are grown in excess of fifty microns. This requirement is congruent with the material needs when viewed from a fundamental standpoint, as this length scale of material is required to adequately sample grain boundaries and possible second phases present in ceramic nuclear fuel.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

PDSLin User Guide

This document describes a software package which implements a parallel hybrid (direct/iterative) linear solver based on the Schur complement method for solving a general sparse linear system of equations. The package is named parallel domain decomposition Schur complement based linear solver, or PDSLin in short. We give a brief description of the algorithm, installation, calling sequences, and data structures of PDSLin.

97 MATHEMATICS AND COMPUTING↗

Quantifying the Impact of Single Bit Flips on Floating Point Arithmetic

In high-end computing, the collective surface area, smaller fabrication sizes, and increasing density of components have led to an increase in the number of observed bit flips. If mechanisms are not in place to detect them, such flips produce silent errors, i.e. the code returns a result that deviates from the desired solution by more than the allowed tolerance and the discrepancy cannot be distinguished from the standard numerical error associated with the algorithm. These phenomena are believed to occur more frequently in DRAM, but logic gates, arithmetic units, and other circuits are also susceptible to bit flips. Previous work has focused on algorithmic techniques for detecting and correcting bit flips in specific data structures, however, they suffer from lack of generality and often times cannot be implemented in heterogeneous computing environment. Our work takes a novel approach to this problem. We focus on quantifying the impact of a single bit flip on specific floating-point operations. We analyze the error induced by flipping specific bits in the most widely used IEEE floating-point representation in an architecture-agnostic manner, i.e., without requiring proprietary information such as bit flip rates and the vendor-specific circuit designs. We initially study dot products of vectors and demonstrate that not all bit flips create a large error and, more importantly, expected value of the relative magnitude of the error is very sensitive on the bit pattern of the binary representation of the exponent, which strongly depends on scaling. Our results are derived analytically and then verified experimentally with Monte Carlo sampling of random vectors. Furthermore, we consider the natural resilience properties of solvers based on the fixed point iteration and we demonstrate how the resilience of the Jacobi method for linear equations can be significantly improved by rescaling the associated matrix.

Elliott, James J.↗

Summer Student Internship working on the GPU

This summer internship consisted of learning computer programming skills and languages including Thrust, CUDA, C++, C and Linux. The application of this programming is for use in GPU, graphics processing units, that are processors that perform math intensive calculations rapidly in three dimensions typically in advanced video games (“NVIDIA GeForce…”). Our goal is to apply this technology towards exa-scale computing on the LANL supercomputing infrastructure. My mentors use these machines to do computations. The completed algorithms include KD tree and Top K. In order to access the GPU, CUDA was used. CUDA is a parallel computer architecture for general computing on the GPUs. There are different means by which to access CUDA. The first approach uses libraries, like Thrust, Linear Algebra, and Signal and Image Processing. Another approach parallelizes loops in Fortran or C and in the last approach people develop custom parallel algorithms using familiar language (“What is CUDA”). The algorithms I worked on this summer use the first approach of using the thrust library of parallel algorithms and data structures.

97 MATHEMATICS AND COMPUTING↗

From OO to FPGA :

Consumer electronics today such as cell phones often have one or more low-power FPGAs to assist with energy-intensive operations in order to reduce overall energy consumption and increase battery life. However, current techniques for programming FPGAs require people to be specially trained to do so. Ideally, software engineers can more readily take advantage of the benefits FPGAs offer by being able to program them using their existing skills, a common one being object-oriented programming. However, traditional techniques for compiling object-oriented languages are at odds with today s FPGA tools, which support neither pointers nor complex data structures. Open until now is the problem of compiling an object-oriented language to an FPGA in a way that harnesses this potential for huge energy savings. In this paper, we present a new compilation technique that feeds into an existing FPGA tool chain and produces FPGAs with up to almost an order of magnitude in energy savings compared to a low-power microprocessor while still retaining comparable performance and area usage.

Kou, Stephen↗

IHT: Tools for Computing Insolation Absorption by Particle Laden Flows

This report describes IHT, a toolkit for computing radiative heat exchange between particles. Well suited for insolation absorption computations, it is also has potential applications in combustion (sooting flames), biomass gasification processes and similar processes. The algorithm is based on the 'Photon Monte Carlo' approach and implemented in a library that can be interfaced with a variety of computational fluid dynamics codes to analyze radiative heat transfer in particle-laden flows. The emphasis in this report is on the data structures and organization of IHT for developers seeking to use the IHT toolkit to add Photon Monte Carlo capabilities to their own codes.

09 BIOMASS FUELS↗

Final Report for Project DE-FC02-06ER25755 [Pmodels2]

In this report, we describe the research accomplished by the OSU team under the Pmodels2 project. The team has worked on various angles: designing high performance MPI implementations on modern networking technologies (Mellanox InfiniBand (including the new ConnectX2 architecture and Quad Data Rate), QLogic InfiniPath, the emerging 10GigE/iWARP and RDMA over Converged Enhanced Ethernet (RoCE) and Obsidian IB-WAN), studying MPI scalability issues for multi-thousand node clusters using XRC transport, scalable job start-up, dynamic process management support, efficient one-sided communication, protocol offloading and designing scalable collective communication libraries for emerging multi-core architectures. New designs conforming to the Argonne’s Nemesis interface have also been carried out. All of these above solutions have been integrated into the open-source MVAPICH/MVAPICH2 software. This software is currently being used by more than 2,100 organizations worldwide (in 71 countries). As of January ’14, more than 200,000 downloads have taken place from the OSU Web site. In addition, many InfiniBand vendors, server vendors, system integrators and Linux distributors have been incorporating MVAPICH/MVAPICH2 into their software stacks and distributing it. Several InfiniBand systems using MVAPICH/MVAPICH2 have obtained positions in the TOP500 ranking of supercomputers in the world. The latest November ’13 ranking include the following systems: 7th ranked Stampede system at TACC with 462,462 cores; 11th ranked Tsubame 2.5 system at Tokyo Institute of Technology with 74,358 cores; 16th ranked Pleiades system at NASA with 81,920 cores; Work on PGAS models has proceeded on multiple directions. The Scioto framework, which supports task-parallelism in one-sided and global-view parallel programming, has been extended to allow multi-processor tasks that are executed by processor groups. A quantum Monte Carlo application is being ported onto the extended Scioto framework. A public release of Global Trees (GT) has been made, along with the Global Chunks (GC) framework on which GT is built. The Global Chunks (GC) layer is also being used as the basis for the development of a higher level Global Graphs (GG) layer. The Global Graphs (GG) system will provide a global address space view of distributed graph data structures on distributed memory systems.

97 MATHEMATICS AND COMPUTING↗

Review of Graph Databases for Big Data Dynamic Entity Scoring

Modeling data as a graph enables users to quickly analyze networked phenomenon, such as social network-based marketing data (e.g., linking entities in social media based on their friends and their "likes", their friend-of-a-friend's "likes", etc.) and scientific data, such as in biology to assess a gene's proximity in a graph to particular disease phenotype. Numerous purpose-built graph databases (DBs) called “NoSQL” or “Not Only SQL” DBs are emerging to support this type of graph analysis. These DBs differ from traditional relational DBs in that they are optimized to improve storage and query performance across large, complex graphs. This document reviews the state of the art in graph DBs and identifies potential DBs that show promise for dynamic entity-scoring algorithms. Dynamic entity scoring is a new area of research that allows analysis of data within graphs using undirected methods to weigh the edges of the graph based on the proximity or ambient influence of near-by nodes. The EntityScore (eScore) methodology developed at Lawrence Livermore National Laboratory (LLNL) is one application of these emerging graph-analysis algorithms to help analysts identify and prioritize entities, based on complex, analyst-defined weighting criteria. Our review examines a wide range of different, well-known graph DBs in use since at least 2010 and identifies unique advantages and disadvantages that may impact eScore-specific requirements. Specifically, we review data structures employed, query features employed, load times, query calculation times, memory usage and several other important attributes reported in the literature. We limited our considerations for eScore to Blueprints-compliant graph DBs (https://github.com/tinkerpop/blueprints/) because they provide a standard, java application programming interface (API) based on the property graph model.

42 ENGINEERING↗