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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Quantum Algorithm Implementations for Beginners

As quantum computers become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classical computer programs for most of their careers. While currently available quantum computers have less than 100 qubits, quantum computing hardware is widely expected to grow in terms of qubit count, quality, and connectivity. This review aims at explaining the principles of quantum programming, which are quite different from classical programming, with straightforward algebra that makes understanding of the underlying fascinating quantum mechanical principles optional. We give an introduction to quantum computing algorithms and their implementation on real quantum hardware. We survey 20 different quantum algorithms, attempting to describe each in a succinct and self-contained fashion. We show how these algorithms can be implemented on IBM’s quantum computer, and in each case, we discuss the results of the implementation with respect to differences between the simulator and the actual hardware runs. This article introduces computer scientists, physicists, and engineers to quantum algorithms and provides a blueprint for their implementations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Trabecula: A Random Generator of Computational Phantoms for Bone Marrow Dosimetry

This study was motivated by the efforts on evaluation of radiation risk for leukemia incidence in the Techa River Cohort, where the main bone marrow dose contributors were 89,90Sr (bone-seeking beta emitters). Energy deposition in bone marrow targets was evaluated by simulating radiation particle transport using computational phantoms. The present paper describes the computer program “Trabecula” implementing an algorithm for parametric generation of computational phantoms, which serve as the basis for calculating bone marrow doses. “Trabecula” is a user-friendly tool that automatically converts analytical models into voxelized representations that are directly compatible as input to MCNP.

Shishkina, Elena A.↗
DOE OSTI2025

The Right Time at the Right Places

In my undergraduate studies at the Massachusetts Institute of Technology (MIT), the short-lived chemical physics major allowed me to evade a number of courses required for chemistry majors. Thus, it was possible to take many physics courses and most of the advanced PhD-level courses in physical chemistry. I also took the introductory electrical engineering course in computer programming. The latter allowed me to write lots of computer code as a part of my (passing, but largely unsuccessful) senior thesis directed graciously by Professor Walter Thorson. As recommended by MIT Professor John C. Slater, I moved to Stanford University with Professor Frank Harris as my PhD supervisor. Frank was the perfect advisor for me, providing very close direction during the first year, and then allowing me to develop more and more independently. Within a few days of my twenty-fifth birthday, I became an assistant professor of chemistry at the University of California, Berkeley. Eighteen years later, I moved to the University of Georgia as director of a new research institute.

autobiography↗
DOE OSTI2018

I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Checkpointing using compute node health information

A method is disclosed, as well as an associated apparatus and computer program product, for checkpointing using a plurality of communicatively coupled compute nodes. The method comprises acquiring health information for a first node of the plurality of compute nodes, and determining a first failure probability for the first node using the health information. The first failure probability corresponds to a predetermined time interval. The method further comprises selecting a second node of the plurality of compute nodes as a partner node for the first node. The second node has a second failure probability for the time interval. A composite failure probability of the first node and the second node is less than the first failure probability. The method further comprises copying checkpoint information from the first node to the partner node.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

Chen, Dong↗
DOE OSTI2024

Shorter function summaries for finite state machine-based high consequence systems using logic synthesis and tautologies (Final Report LDRD 24-1302)

Computer programs are often viewed as collections of functions – each function has parameters (inputs) and computes a return value, and each has potential side effects that modify program state (outputs). In this research, a Sandia symbolic execution tool designed to support “human-in-the-loop” analysis was modified to automatically create “function summaries,” and a new tool, “diaboolical,” was created to support enhancing readability of the summary using a novel approach to bit-vector simplification that leverages logic synthesis and tautologies. For this effort, students at Auburn University created several finite state machines (FSMs) to serve as exemplars for high-consequence systems. Function summaries for each of the machines were obtained, and then portions of the summaries were simplified using both diaboolical and the simplification procedure of a popular SMT solver. A comparison of the results shows that diaboolical can often produce smaller function summaries, with expression length improvements over the unsimplified function summaries ranging from 0% to 90% for diaboolical and 0% to 65% for the SMT solver, though diaboolical had a significantly greater cost in time. Diaboolical was evaluated against a collection of “arbitrary” C-code as well as FSM exemplars, and for both datasets it achieved an approximately 10% improvement in expression length compared to simplifications that could be obtained using existing techniques. Function summaries can assist assurance efforts that evaluate existing systems and their executable code. A smaller function summary is likely easier for humans to understand and could thus increase the ability and efficacy of assurance practices centered around the analysis of executable artifacts.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Sierra/SD – Verification Test Manual – 5.22

Verification and validation (V&V) of scientific computing programs are important at Sandia National Labs due to the expanding role of computational simulation in managing the United States nuclear stockpile. The complexities of structural response calculations used to analyze physical problems, the varieties of codes applied to the calculations, and the importance of accurate predictions when assessing field conditions demand confidence in the consistency and accuracy of computer codes. Confidence in the accuracy of the predictions arising from computer simulations must ultimately be gained through verification and validation. The Sierra salinas structural dynamics analysis code, Sierra/SD, is used at the DOE Laboratories, and in several DOD projects. The roles of Sierra/SD in the qualification of weapon systems and components for normal and hostile environments throughout the Stockpile-to-Target Sequence include to, • Redesign weapon components. • Certify weapon components and systems for target environments such as hypersonic vehicles. • Certify that components will survive the thermal mechanical shock loads associated with hostile environments. • Evaluate current stockpile issues, including issues associated with uncertainty quantification. • Address many other problems that are encountered in stockpile management. The Sierra/SD verification plan is described, and an evolving set of key verification tests are described in detail. The verification tests ensure the correctness of the mathematics and numerical algorithms associated with functionality describing engineering phenomena. Development is in accordance with a set of tailored Software Quality Engineering (SQE) practices. SQE practices guide the overall verification and validation effort.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Serpent transient analyses of GIACINT geometrical change experiments

This paper simulates seven transient experiments with geometrical movements performed at the GIACINT facility of Belarus. These experiments include three slow control rods insertion in more than 25 s, one fast control rod insertion in less than 1 s, and three water moderator draining transients. In the fast control rod insertion experiment, the control rods are first pushed by a mechanical spring and then let fall by gravity in the assembly. In this experiment, the control rods speed varies because of the initial spring force, the gravitational acceleration, and the water buoyancy force. In all other transient experiments, the geometry change occurs with a constant speed. The Serpent computer program was utilized to simulate these transient experiments with geometrical changes by performing two separate computations. One time-independent computation is performed in criticality mode and the other time-dependent computation is performed in dynamic-source mode. The first computation writes the neutron population and delayed neutron precursors for starting the transient simulation. The second computation divides the transient time into several time bins, reads the two files from the first computation, and updates them at the end of each time bin. The Serpent simulation results obtained for this set of experiments are in good agreement with the time dependent experimental measurements. In addition, Serpent and MCNP simulations results show an excellent agreement for the water moderator transient

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2018

Sierra Structural Dynamics Code Verification Plan

Verification and validation (V&V) of scientific computing programs are important at San- dia National Laboratories (SNL) due to the expanding role of computational simulation in managing the United States nuclear stockpile. This document presents the verification plan for the Sierra Structural Dynamics application. This verification plan includes code devel- opment practices, structure of test suites, and additional quality assurance practices used by the Sierra/SD team.

42 ENGINEERING↗
DOE OSTI2020

Processing unit performance projection using dynamic hardware behaviors

Methods for estimating accelerator performance for dynamic hardware behaviors are disclosed. Computer program code to be executed on a first processing unit is received, and an execution of the computer code on the first processing unit is monitored to determine a plurality of performance characteristics. A plurality of dynamic hardware behaviors is determined by applying a clustering algorithm to the performance characteristics, and an equivalent accelerator portion of computer code to be executed on a second processing unit is generated by translating a set of instructions in a first portion of computer code corresponding to a first one of the plurality of dynamic hardware behaviors to an equivalent set of instructions to be executed on the second processing unit. An estimated measure of performance for executing the equivalent accelerator portion on the second processing unit is determined for the first one of the plurality of dynamic hardware behaviors.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Optimization-Driven Scenario Grouping

Scenario decomposition algorithms for stochastic programs compute bounds by dualizing all nonanticipativity constraints and solving individual scenario problems independently. Here, we develop an approach that improves on these bounds by reinforcing a carefully chosen subset of nonanticipativity constraints, effectively placing scenarios into groups. Specifically, we formulate an optimization problem for grouping scenarios that aims to improve the bound by optimizing a proxy metric based on information obtained from evaluating a subset of candidate feasible solutions. We show that the proposed grouping problem is NP-hard in general, identify a polynomially solvable case, and present two formulations for solving the problem: a matching formulation for a special case and a mixed-integer programming formulation for the general case. We use the proposed grouping scheme as a preprocessing step for a particular scenario decomposition algorithm and demonstrate its effectiveness in solving standard test instances of two-stage 0–1 stochastic programs. Using this approach, we are able to prove optimality for all previously unsolved instances of a standard test set. Additionally, we implement this scheme as a preprocessing step for PySP, a publicly available and widely used implementation of progressive hedging, and compare this grouping approach with standard grouping approaches on large-scale stochastic unit commitment instances. Finally, the idea is extended to propose a finitely convergent algorithm for two-stage stochastic programs with a finite feasible region.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Development and Porting of Nuclear Reactor Computational Models for the NRIC Virtual Test Bed in FY23

The U.S. DOE’s National Reactor Innovation Center (NRIC) hosts an open-source website and associated GitHub repository called the Virtual Test Bed (VTB) on which computational models for advanced reactors are documented and shared with the reactor community. In FY23 under the NRIC program, computational models for nuclear reactor analysis were developed and contributed to the VTB Github repository during FY23 by contributors at Argonne National Laboratory. Other models developed outside of NRIC were also ported to the VTB as part of this work, serving a broader mission to make computational reactor analysis models more widely available to the reactor community. The model development activities focused on demonstration of gas-cooled microreactor models including computational fluid dynamics simulations of flow through an industry-inspired air jacket design, and simulation of multiphysics transients for a gas-cooled microreactor assembly. Additionally, development of a molten salt reactor (led at Idaho National Laboratory) was supported through Argonne’s expertise in multigroup cross sections generation. Models for these two reactor types were targeted due to their relevancy to NRIC’s Demonstration of Microreactor Experiments (DOME) and Laboratory for Operation and Testing in the U.S. (LOTUS) physical test beds, which are slated to host microreactor and molten salt reactor experiments. The model porting activities consisted of developing detailed documentation for several physics models which originate from the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program. We include only contributions from Argonne National Laboratory in this report.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

HIGH BURNUP FUEL-COOLANT INTERACTION ANALYSIS SUPPORTING FUEL SAFETY TESTING AT IDAHO NATIONAL LABORATORY

In the near future, experiments on HBu fuel under loss-of-coolant accident (LOCA) and reactivity-initiated accident (RIA) conditions will be performed within the Transient Reactor Test Facility (TREAT) at Idaho National Laboratory (INL). These experiments will be performed using the Transient Water Irradiation System for TREAT (TWIST) experiment vehicle. To support these experiments, analysis of fuel-coolant interaction (FCI) energetics is underway. This paper discusses FCIs in the context of light water reactor (LWR) safety, differentiating between the severe accident focus of commercial reactors and experimental RIA test programs where FCIs have occurred. However, it is highlighted that as the nuclear industry aims for increased burnup limits, the FCI events observed in RIA test programs may become relevant to commercial LWR safety analysis. The paper then presents developments to the UW-FCI computer program to enable simulation of FCIs initiated by solid fuel particles dispersing into the coolant during RIAs.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2018

Spherical Radiative Transfer in C++ (SRTC++): A Parallel Monte Carlo Radiative Transfer Model for Titan

We present a new computer program, SRTC++, to solve spatial problems associated with explorations of Saturn’s moon Titan. The program implements a three-dimensional structure well-suited to addressing shortcomings arising from plane-parallel radiative transfer approaches. SRTC++'s design uses parallel processing in an object-oriented, compiled computer language (C++) leading to a flexible and fast architecture. We validate SRTC++ using analytical results, semianalytical radiative transfer expressions, and an existing Titan plane-parallel model. SRTC++ complements existing approaches, addressing spatial problems like near-limb and near-terminator geometries, non-Lambertian surface phase functions (including specular reflections), and surface albedo nonuniformity.

97 MATHEMATICS AND COMPUTING↗