Search NASA⌕ Search

SEARCH · Search NASA

Results for “computer programming”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Market Driven Residential Energy Codes: Comparing Performance in a Changing Technological Environment

The research project is undertaken to better understand the changing relationship between the two basic methods of building energy code compliance – prescriptive and performance – and how those methods relate to each other with respect to advancements in building energy computer simulation standards and capabilities. The International Energy Efficiency Code (IECC) is a model code adopted by many jurisdictions across the United States. Historically, the prescriptive compliance methodology has been preferred in most jurisdictions. The prescriptive methodology requires meeting or exceeding specific efficiency minimums for each envelope component. This tends to be a simple method to teach and verify. A more involved prescriptive alternative called the Total UA alternative is sometimes used. This method requires some multiplication, summing, and comparison to compute, so it is done with a fairly simple computer program. However, advances in computer and building energy simulation technology have resulted in increased use of more detailed performance compliance methods. The performance compliance method establishes the annual energy cost threshold via hourly simulation models. The compliance threshold is determined with a comparison building model simulation with geometry similar to the proposed home and with energy feature parameters and efficiencies as specified in the IECC. This project examines relationships between the two methods of building energy code compliance, including: • Overall annual energy use based on utility bill analysis by compliance method • Code official work processes with respect to compliance methods • Gaps and issues associated with building code compliance methods • Simulated energy use difference between compliance methods • Code compliance cost as a function of compliance method • Code compliance labeling effectiveness for high performance residences • Getting to net zero energy use and net zero greenhouse gas emissions through high performance code alternatives • Electronic code permitting and compliance alternatives

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2019

Brain-controlled body movement assistance devices and methods

Methods, devices, systems, and apparatus, including computer programs encoded on a computer storage medium, for brain-controlled body movement assistance devices. In one aspect, a device includes a brain-controlled body movement assistance device with a brain-computer interface (BCI) component adapted to be mounted to a user, a body movement assistance component operably connected to the BCI component and adapted to be worn by the user, and a feedback mechanism provided in connection with at least one of the BCI component and the body movement assistance component, the feedback mechanism being configured to output information relating to a usage session of the brain-controlled body movement assistance device.

42 ENGINEERING↗
DOE OSTI2022

Oppenheimer Science and Energy Leadership Program (OSELP) Simulation and Computation at LANL [Slides]

Simulation and Computation plays a pivotal role in maintaining confidence in the stockpile as the approach to underwrite that confidence has changed. The need for resolution and fidelity at scale drives our need for increased computing capability. DOE/NNSA Advanced Simulation and Computing (ASC) program provides the computational surrogate for testing. ASC provides simulation-based confidence in the U.S. stockpile.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Design Considerations for GPU-based Mixed Integer Programming on Parallel Computing Platforms

Mixed Integer Programming (MIP) is a powerful abstraction in combinatorial optimization that finds real-life application across many significant sectors. The recent proliferation of graphical processing unit (GPU)-based accelerated computing architectures in large-scale parallel computing or supercomputing presents new opportunities as well as challenges in the advancement of MIP solver technology to effectively use the new accelerated computing platforms and scale to large parallel systems. Here, we recount the conventional processor-based strategies and focus on configurations where the most promising intersection lies between parallel MIP solver approaches and the specific strengths of accelerated parallel platforms. We note that the best potential lies in solving problems whose individual matrix sizes (of the linear program relaxation) fit entirely within one accelerator's memory and whose branch-and-bound (or branch-and-cut) trees cannot be fully contained within a small number of computational nodes. Additionally, we identify ideal features of computational linear algebra support on GPU accelerators that would help advance this direction of scalable parallel solution of MIP problems on GPU-based accelerated computing architectures.

Perumalla, Kalyan↗
DOE OSTI2020

The Minos Computing Library: Efficient Parallel Programming for Extremely Heterogeneous Systems

Hardware specialization has become the silver bullet to achieve efficient high performance, from Systems-on-Chip systems, where hardware specialization can be ``extreme'', to large-scale HPC systems. As the complexity of the systems increases, so does the complexity of programming such architectures in a portable way. This work introduces the Minos Computing Library (MCL), as system software, programming model, and programming model runtime that facilitate programming extremely heterogeneous systems. MCL supports the execution of several multi-threaded applications within the same compute node, performs asynchronous execution of application tasks, efficiently balances computation across hardware resources, and provides performance portability. We show that code developed on a personal desktop automatically scales up to fully utilize powerful workstations with 8 GPUs and down to power-efficient embedded systems. MCL provides up to 17.5x speedup over OpenCL on NVIDIA DGX-1 systems and up to 1.88x speedup on single-GPU systems. In multi-application workloads, MCL dynamically resource allocation provides up to 2.43x performance improvement over manual, static allocation of computing resources.

Gioiosa, Roberto↗
DOE OSTI2023

Reducing the cost of n modular redundancy for neural networks

An N modular redundancy method, system, and computer program product include a computer-implemented N modular redundancy method for neural networks, the method including selectively replicating the neural network by employing one of checker neural networks and selective N modular redundancy (N-MR) applied only to critical computations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Quantum Programming Paradigms and Description Languages

Here, this article offers perspective on quantum computing programming languages, as well as their emerging runtimes and algorithmic modalities. With the scientific high-performance computing (HPC) community as a target audience, we describe the current state of the art in the field, and outline programming paradigms for scientific workflows. One take-home message is that there is significant work required to first refine the notion of the quantum processing unit in order to integrate in the HPC environments. Programming for today’s quantum computers is making significant strides toward modern HPC-compatible workflows, but key challenges still face the field.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Status of DUNE Offline Computing

We summarize the status of Deep Underground Neutrino Experiment (DUNE) Offline Software and Computing program. We describe plans for the computing infrastructure needed to acquire, catalog, reconstruct, simulate and analyze the data from the DUNE experiment and its prototypes in pursuit of the experiment's physics goals of precision measurements of neutrino oscillation parameters, detection of astrophysical neutrinos, measurement of neutrino interaction properties and searches for physics beyond the Standard Model. In contrast to traditional HEP computational problems, DUNE's Liquid Argon Time Projection Chamber data consist of simple but very large (many GB) data objects which share many characteristics with astrophysical images. We have successfully reconstructed and simulated data from 4% prototype detector runs at CERN. The data volume from the full DUNE detector, when it starts commissioning late in this decade will present memory management challenges in conventional processing but significant opportunities to use advances in machine learning and pattern recognition as a frontier user of High Performance Computing facilities capable of massively parallel processing. Our goal is to develop infrastructure resources that are flexible and accessible enough to support creative software solutions as HEP computing evolves.

43 PARTICLE ACCELERATORS↗
DOE OSTI2018

Computation of the Seismic Stability of Earth Retaining Structures Final Report CRADA No. TSB-954-94

The purpose of this CRADA project was to evaluate the seismic stability of block retaining wall systems. Retaining wall systems are used extensively in private and commercial developments. This study was designed to develop and demonstrate a computer modeling technology to be used to predict the seismic stability of any block wall system design. The nonlinear finite element computer programs developed at LLNL and employed in the Computational Earthquake Initiative were utilized in this small business CRADA to analyze the seismic stability of the block retaining walls. The unique capability of the LLNL programs to rigorously model frictional contact in a dynamic analysis problem were used in a computer simulation of the dynamic interaction the block waiVsoil systems under seismic excitation.

58 GEOSCIENCES↗
DOE OSTI2025

Genetic programming for the nuclear many-body problem: a guide

Genetic Programming (GP) is an evolutionary algorithm that generates computer programs, or mathematical expressions, to solve complex problems. In this Guide, we demonstrate how to use GP to develop surrogate models to mitigate the computational costs of modeling atomic nuclei with ever increasing complexity. The computational burden escalates when uncertainty quantification is pursued, or when observables must be globally computed for thousands of nuclei. By studying three models in which the mean field depends on the total particle density self-consistently, we show that by constructing reduced order models supported by GP one can speed up many-body computations by several orders of magnitude with a negligible loss in accuracy.

dimensionality reduction↗
DOE OSTI2019

DEFT: a program for operators in EFT

We describe a Python-based computer program, DEFT, for manipulating operators in effective field theories (EFTs). In its current incarnation, DEFT can be applied to 4-dimensional, Poincaré invariant theories with gauge group SU(3)×SU(2)×U(1), such as the Standard Model (SM), but a variety of extensions (e.g. to lower dimensions or to an arbitrary product of unitary gauge groups) are conceptually straightforward. Amongst other features, the program is able to: (i) check whether an input list of Lagrangian operators (of a given dimension in the EFT expansion) is a basis for the space of operators contributing to S-matrix elements, once redundancies (such as Fierz-Pauli identities, integration by parts, and equations of motion) are taken into account; (ii) generate such a basis (where possible) from an input algorithm; (iii) carry out a change of basis. We describe applications to the SM (where we carry out a number of non-trivial cross-checks) and extensions thereof, and outline how the program may be of use in precision tests of the SM and in the ongoing search for new physics at the LHC and elsewhere. The code and instructions can be downloaded from http://web.physics.ucsb.edu/~dwsuth/DEFT/.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2018

An Efficient Algorithm for Automatic Structure Optimization in X-ray Standing-Wave Experiments

We present that x-ray standing-wave photoemission experiments involving multilayered samples are emerging as unique probes of the buried interfaces that are ubiquitous in current device and materials research. Such data require for their analysis a structure optimization process comparing experiment to theory that is not straightforward. In this work, we present a new computer program for optimizing the analysis of standing-wave data, called SWOPT, that automates this trial-and-error optimization process. The program includes an algorithm that has been developed for computationally expensive problems: so-called black-box simulation optimizations. It also includes a more efficient version of the Yang X-ray Optics Program (YXRO) [Yang, S.-H., Gray, A.X., Kaiser, A.M., Mun, B.S., Sell, B.C., Kortright, J.B., Fadley, C.S., J. Appl. Phys. 113, 1 (2013)] which is about an order of magnitude faster than the original version. Human interaction is not required during optimization. We tested our optimization algorithm on real and hypothetical problems and show that it finds better solutions significantly faster than a random search approach. The total optimization time ranges, depending on the sample structure, from minutes to a few hours on a modern laptop computer, and can be up to 100x faster than a corresponding manual optimization. Finally, these speeds make the SWOPT program a valuable tool for realtime analyses of data during synchrotron experiments.

36 MATERIALS SCIENCE↗