SEARCH · Search NASA
Results for “Mathematics and Computing, Computer science”
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.
Portable data parallel visualiza0on algorithms with VTK-m
No abstract provided
Survey and Analysis of Multiresolution Methods for Turbulence Data
Abstract Not Provided
LANL 2015 summer work: Coyote universe emulator for web
No abstract provided
Performance, power, and energy of in-situ and post-processing visualization
The goal of this project was to "study the performance, power, and energy trade-offs among traditional post-processing, modern post-processing, and in-situ visualization pipelines."
The Origin of a New Species
This report discusses methods for using code to determine the position and velocity of particles and other objects.
Scalable Codesign Performance Prediction for Computational Physics - Mid-Term- Appraisal: Overview Talk
No abstract provided.
OpenMC In Situ Source Convergence Detection
We designed and implemented an in situ version of particle source convergence for the OpenMC particle transport simulator. OpenMC is a Monte Carlo based-particle simulator for neutron criticality calculations. For the transport simulation to be accurate, source particles must converge on a spatial distribution. Typically, convergence is obtained by iterating the simulation by a user-settable, fixed number of steps, and it is assumed that convergence is achieved. We instead implement a method to detect convergence, using the stochastic oscillator for identifying convergence of source particles based on their accumulated Shannon Entropy. Using our in situ convergence detection, we are able to detect and begin tallying results for the full simulation once the proper source distribution has been confirmed. Our method ensures that the simulation is not started too early, by a user setting too optimistic parameters, or too late, by setting too conservative a parameter.
KIVA-hpFE. Predictive turbulent reactive and multiphase flow in engines - An Overview
Research and development of KIVA-hpFE for turbulent reactive and multiphase flow particularly as related to engine modeling program has relevance to National energy security and climate change. Climate change is a source problem, and energy national security is consumption of petroleum products problem. Accurately predicting engine processes leads to, lower greenhouse gas (GHG) emission, where engines in the transportation sector currently account for 26% of the U.S. GHG emissions. Less dependence on petroleum products leads to greater energy security. By Environmental Protection Agency standards, some vehicles are now reaching 42 to the 50 mpg mark. These are conventional gasoline engines. Continued investment and research into new technical innovations, the potential exists to save more than 4 million barrels of oil per day or approximately $200 to $400 million per day. This would be a significant decrease in emission and use of petroleum and a very large economic stimulus too! It is estimated with further advancements in combustion, the current emissions can be reduced up to 40%. Enabling better understanding of fuel injection and fuel-air mixing, thermodynamic combustion losses, and combustion/emission formation processes enhances our ability to help solve both problems. To provide adequate capability for accurately simulating these processes, minimize time and labor for development of engine technology, are the goals of our KIVA development program.
Sythesis of MCMC and Belief Propagation
Markov Chain Monte Carlo (MCMC) and Belief Propagation (BP) are the most popular algorithms for computational inference in Graphical Models (GM). In principle, MCMC is an exact probabilistic method which, however, often suffers from exponentially slow mixing. In contrast, BP is a deterministic method, which is typically fast, empirically very successful, however in general lacking control of accuracy over loopy graphs. In this paper, we introduce MCMC algorithms correcting the approximation error of BP, i.e., we provide a way to compensate for BP errors via a consecutive BP-aware MCMC. Our framework is based on the Loop Calculus (LC) approach which allows to express the BP error as a sum of weighted generalized loops. Although the full series is computationally intractable, it is known that a truncated series, summing up all 2-regular loops, is computable in polynomial-time for planar pair-wise binary GMs and it also provides a highly accurate approximation empirically. Motivated by this, we first propose a polynomial-time approximation MCMC scheme for the truncated series of general (non-planar) pair-wise binary models. Our main idea here is to use the Worm algorithm, known to provide fast mixing in other (related) problems, and then design an appropriate rejection scheme to sample 2-regular loops. Furthermore, we also design an efficient rejection-free MCMC scheme for approximating the full series. The main novelty underlying our design is in utilizing the concept of cycle basis, which provides an efficient decomposition of the generalized loops. In essence, the proposed MCMC schemes run on transformed GM built upon the non-trivial BP solution, and our experiments show that this synthesis of BP and MCMC outperforms both direct MCMC and bare BP schemes.
High Performance OpenMP. A Practical Guide
This document is a practical guide for high performance OpenMP, a shared memory machine.
ASC/NGC Gitlab Tutorial
This document summarizes version control systems and the source code it manages.
Distributed Computing (MPI)
This powerpoint is part of a Parallel Summer Computing Research Internship lecture on distributed computing (MPI). It goes over how MPI works and then shows examples.
Parallel Algorithms and Patterns
This is a powerpoint presentation on parallel algorithms and patterns. A parallel algorithm is a well-defined, step-by-step computational procedure that emphasizes concurrency to solve a problem. Examples of problems include: Sorting, searching, optimization, matrix operations. A parallel pattern is a computational step in a sequence of independent, potentially concurrent operations that occurs in diverse scenarios with some frequency. Examples are: Reductions, prefix scans, ghost cell updates. We only touch on parallel patterns in this presentation. It really deserves its own detailed discussion which Gabe Rockefeller would like to develop.
The Need for Reproducibility
The purpose of this presentation is to consider issues of reproducibility, specifically it determines whether bitwise reproducible computation is possible, if computational research in DOE improves its publication process, and if reproducible results can be achieved apart from the peer review process?
Los Alamos Programming Models
This is the PDF of a powerpoint presentation from a teleconference on Los Alamos programming models. It starts by listing their assumptions for the programming models and then details a hierarchical programming model at the System Level and Node Level. Then it details how to map this to their internal nomenclature. Finally, a list is given of what they are currently doing in this regard.