Search NASA⌕ Search

SEARCH · Search NASA

Results for “program architectures”

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 739 records · Page 41

Channel Access in Erlang

We have developed an Erlang language implementation of the Channel Access protocol. Included are low-level functions for encoding and decoding Channel Access protocol network packets as well as higher level functions for monitoring or setting EPICS process variables. This provides access to EPICS process variables for the Fermilab Acnet control system via our Erlang-based front-end architecture without having to interface to C/C++ programs and libraries. Erlang is a functional programming language originally developed for real-time telecommunications applications. Its network programming features and list management functions make it particularly well-suited for the task of managing multiple Channel Access circuits and PV monitors.

Nicklaus, Dennis J.↗

Home Energy Management System - VOLTTRON Integration

In most Home Energy Management Systems (HEMS) available in the market, different devices running different communication protocols cannot interact with each other and exchange information. As a result of this integration, the information about different devices running different communication protocol can be accessible by other agents and devices running on VOLTTRON platform. The integration process can be used by any HEMS available in the market regardless of the programming language they use. If the existing HEMS provides an Application Programming Interface (API) based on the RESTFul architecture, that API can be used for integration. Our candidate HEMS in this project is home-assistant (Hass). An agent is implemented which can communicate with the Hass API and receives information about the devices loaded on the API. The agent publishes the information it receives on the VOLTTRON message bus so other agents can have access to this information. On the other side, for each type of devices, an agent is implemented such as Climate Agent, Lock Agent, Switch Agent, Light Agent, etc. Each of these agents is subscribed to the messages published on the message bus about their associated devices. These agents can also change the status of the devices by sending appropriate service calls to the API. Other agents and services on the platform can also access this information and coordinate their decision-making process based on this information.

Zandi, Helia↗

BISON Robustness and Performance Improvements

BISON is a modern finite-element based nuclear fuel performance code that has been under development at the Idaho National Laboratory (USA) since 2009 [1]. The code is applicable to both steady and transient fuel behavior and can be used to analyze 1D (spherically symmetric), 2D (axisymmetric and generalized plane strain) or 3D geometries. BISON is the fuel performance code used within CASL for LWR fuel under both normal operating and accident conditions. BISON is built using the INL Multiphysics ObjectOriented Simulation Environment, or MOOSE [2, 3]. MOOSE is a massively parallel, finite element-based framework to solve systems of coupled non-linear partial differential equations using the Jacobian-Free Newton Krylov (JFNK) method [4]. This enables investigation of computationally large problems, for example a full stack of discrete pellets in a LWR fuel rod, or every rod in a full reactor core. MOOSE supports the use of complex two and three-dimensional meshes and uses implicit time integration, important for the widely varied time scale in nuclear fuel simulation. An object-oriented architecture is employed which greatly minimizes the programming effort required to add new material and behavioral models. The flexibility of the implicit and fully coupled multiphysics approach comes with a need for constructing suitable approximations for the Jacobian matrix of the coupled system used for either preconditioning a Krylov solve or in a direct Newton solve. Preconditioning options for Bison problems need to be revisited with new preconditioning methods becoming available.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

The Next Generation System Analysis Model: Capabilities for Simulating a Waste Management System - 19131

The U.S. Department of Energy (DOE) Office of Nuclear Energy Office of Spent Fuel and Waste Disposition's Integrated Waste Management System (IWMS) program is applying integrated waste management system architecture analysis, system engineering, and decision analysis principles to inform potential future decisions regarding potential nuclear waste management system architectures. Architecture analyses of the IWMS are being conducted to support the future deployment of a comprehensive system for managing nuclear waste that considers all major aspects of the back end of the nuclear fuel cycle (i.e., transportation, storage, and disposal). The system architecture analyses consider alternative disposition pathways for commercial spent nuclear fuel (SNF) being stored dry in at-reactor Independent Spent Fuel Storage Installations (ISFSIs) or wet in spent-fuel pools. One method for evaluating these alternatives is simulating the movement of SNF throughout the system components. Successfully simulating a system on the scale of a national waste management system requires - accurate baseline information (e.g., historic fuel discharges from reactors and dry storage loadings at reactor sites), - modeling all logistic interactions between components of the proposed system, and - tracking and reporting all relevant details regarding the simulation's execution. The Next Generation System Analysis Model (NGSAM) is an agent-based simulation software tool designed for the express purpose of modeling the IWMS. It is based on the Performance Analysis Tool, a simulation platform that has been used to model logistics for the Department of Defense and the Federal Emergency Management Agency. Using existing, government-owned software allows NGSAM developers to modify the software at the level of source code and to develop flexible usability and modeling solutions for developing and running simulations of the IWMS. NGSAM imports data from the Oak Ridge National Laboratory (ORNL) Unified Database (e.g., historic assembly information, thermal profiles for assembly heat, at-reactor dry storage loadings) to ensure that the simulation initializes with a realistic representation of the state of commercial SNF in the United States. NGSAM is designed with the flexibility to model and track the behavior of virtually any IWMS architecture assumptions or design considerations. For example, NGSAM can model multiple interim storage facilities or repositories or none at all. Similarly, all assumptions regarding shipment schedules, operating schedules, and reactor operation assumptions can be modeled and adjusted in NGSAM with relative ease. The development of NGSAM was targeted to waste management system analysts as the primary users. With that in mind, analysts from ORNL, Sandia National Laboratories (SNL), and Argonne National Laboratory (ANL) were intimately involved in the development process. That involvement extended beyond merely defining requirements. System analysts have been involved with design decisions and software benchmarking and tests, and they have provided subject-matter expertise where necessary. The result is a high degree of interaction between professional software developers and system analysts, with a multitude of benefits to both groups. This paper explores some of the underlying methodology of the agile software development process used in the creation of NGSAM. It illustrates the capabilities of NGSAM. Some example use cases are discussed as well, with relevant results providing context for how NGSAM is used by system analysts to gain a greater understanding of alternative waste management system architectures. This is a technical paper that does not take into account the contractual limitations under the Standard Contract for Disposal of Spent Nuclear Fuel and/or High-Level Radioactive Waste (Standard Contract) (10 CFR Part 961). Under the provisions of the Standard Contract, DOE does not consider spent nuclear fuel in multi-assembly canisters to be an acceptable waste form, absent a mutually agreed-to contract amendment. To the extent discussions or recommendations in this paper conflict with the provisions of the Standard Contract, the Standard Contract provisions prevail. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

CUDA Computation of the Feynman Distribution

In 2006, NVIDIA Corporation introduced the Computer Unified Device Architecture (CUDA) for C, C++, and Fortran programming languages. The CUDA parallel computing platform uses the Graphics Processing Unit (GPU) of NVIDIA graphics card, and it is designed for parallel computations. In these computations, the same algorithms are executed on the data in parallel. The GPU contains many Streaming Multiprocessors (SM) that can independently execute blocks of threads. A thread is a sequence of serial programmed instructions. The SM executes threads in groups of 32 and a group of 32 threads is called warp. The threads within a block can be synchronized and have access to a shared memory that is visible only to them. Conversely, blocks of threads cannot be synchronized and have access only to the global memory of the graphics card. This memory is called device memory and is independent of the host memory controlled by the Central Processing Unit (CPU). A single thread has access to a local memory (register) that is not visible to any other thread. The part of the program that is executed on the graphics card is called kernel. Each thread of the kernel has a unique identification index that is accessible by the in-built variable threadIdx; the latter is a 3-component vector. A threads block can contain up to 1024 threads. Blocks of threads have a unique identification index that is accessible by the in-built variable blockIdx; the latter is a 3-component vector. The in-built variable blockDim contains the number of threads per block; this variable is a 3-component vector. Threads and blocks represent different levels of parallelism; a kernel is executed as a grid of blocks of threads. Figure 1 illustrates a grid of thread blocks for a GPU with 2 SM. A SM can execute multiple blocks of threads in parallel; a block of threads is executed on a single SM. A GPU can execute multiple kernels concurrently. This work has used the Quadro M5000 graphics card with the following technical specifications: - 2048 cores with 861 MHz frequency, - 16 streaming multiprocessors, - 5.2 trillion transistors, - 8.2 Gb device memory, - 64 kb register memory (per thread), - 48 kb shared memory (per block) - 211.6 GB/s memory bandwidth, and - 3.5 GFLOPS floating point performance.

97 MATHEMATICS AND COMPUTING↗

The Automatic Reactor Control System (ARCS) Upgrade, version 2.0 for TREAT

The Transient REActor Test Facility (TREAT) recently underwent an upgraded to the Automatic Reactor Control System (ARCS). The purpose of the upgrade was to institute a new software architecture that is better suited for the programming environment, patched software bugs and applied two new segments for reactor control. This paper will focus on the new segments for reactor control. The two new control segments added to ARCS are called Generic Power and Generic Rods. The original version of ARCS provided only two power related functions, namely periods and ramps, that had to be spliced together to generate any power shape. The Generic Power segment allows the user to input data points to define the function and then the algorithm does its best to create the desired shape. The original ARCS program utilized two direct rod commands (i.e. open loop control), these were a rod stop and clip. A Generic Rod segment extends the ability of the computer to directly command any rod position. The functionality of these new segments was proven during the TREAT outage in 2024.

46 - INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AN↗

Modeling the Nuclear Fuel Cycle

A review of existing nuclear fuel cycle systems analysis codes was performed to determine if any existing codes meet technical and functional requirements defined for a U.S. national program supporting the global and domestic assessment, development and deployment of nuclear energy systems. The program would be implemented using an interconnected architecture of different codes ranging from the fuel cycle analysis code, which is the subject of the review, to fundamental physical and mechanistic codes. Four main functions are defined for the code: (1) the ability to characterize and deploy individual fuel cycle facilities and reactors in a simulation, while discretely tracking material movements, (2) the capability to perform an uncertainty analysis for each element of the fuel cycle and an aggregate uncertainty analysis, (3) the inclusion of an optimization engine able to optimize simultaneously across multiple objective functions, and (4) open and accessible code software and documentation to aid in collaboration between multiple entities and facilitate software updates. Existing codes, categorized as annualized or discrete fuel tracking codes, were assessed according to the four functions and associated requirements. These codes were developed by various government, education and industrial entities to fulfill particular needs. In some cases, decisions were made during code development to limit the level of detail included in a code to ease its use or to focus on certain aspects of a fuel cycle to address specific questions. The review revealed that while no two of the codes are identical, they all perform many of the same basic functions. No code was able to perform defined function 2 or several requirements of functions 1 and 3. Based on this review, it was concluded that the functions and requirements will be met only with development of a new code, referred to as GENIUS.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

NASA 2nd Generation RLV Program Introduction, Status and Future Plans

The Space Launch Initiative (SLI), managed by the Second Generation Reusable Launch Vehicle (2ndGen RLV) Program, was established to examine the possibility of revolutionizing space launch capabilities, define conceptual architectures, and concurrently identify the advanced technologies required to support a next-generation system. Initial Program funds have been allocated to design, evaluate, and formulate realistic plans leading to a 2nd Gen RLV full-scale development (FSD) decision by 2006. Program goals are to reduce both risk and cost for accessing the limitless opportunities afforded outside Earth's atmosphere fo civil, defense, and commercial enterprises. A 2nd Gen RLV architecture includes a reusable Earth-to-orbit launch vehicle, an on-orbit transport and return vehicle, ground and flight operations, mission planning, and both on-orbit and on-the-ground support infrastructures All segments of the architecture must advance in step with development of the RLV if a next-generation system is to be fully operational early next decade. However, experience shows that propulsion is the single largest contributor to unreliability during ascent, requires the largest expenditure of time for maintenance, and takes a long time to develop; therefore, propulsion is the key to meeting safety, reliability, and cost goals. For these reasons, propulsion is SLI's top technology investment area.

Dumbacher, Dan L.↗

Summer Proceedings 2019

The Computer Science Research Institute (CSRI) brings university faculty and students to Sandia for focused collaborative research on Department of Energy (DOE) computer and computational science problems. The institute provides an opportunity for university researchers to learn about problems in computer and computational science at DOE laboratories. Participants conduct leading-edge research, interact with scientists and engineers at the laboratories, and help transfer results of their research to programs at the labs. Some specific CSRI research interest areas are: scalable solvers, optimization, adaptivity and mesh refinement, graph-based, discrete, and combinatorial algorithms, uncertainty estimation, mesh generation, dynamic load-balancing, virus and other malicious-code defense, visualization, scalable cluster computers and heterogeneous computers, data-intensive computing, environments for scalable computing, parallel input/output, advanced architectures, and theoretical computer science. The CSRI Summer Program includes the organization of a weekly seminar series and the publication of this summer proceedings.

97 MATHEMATICS AND COMPUTING↗

A study of System Interface Sets (SIS) for the host, target and integration environments of the Space Station Program (SSP)

System interface sets (SIS) for large, complex, non-stop, distributed systems are examined. The SIS of the Space Station Program (SSP) was selected as the focus of this study because an appropriate virtual interface specification of the SIS is believed to have the most potential to free the project from four life cycle tyrannies which are rooted in a dependance on either a proprietary or particular instance of: operating systems, data management systems, communications systems, and instruction set architectures. The static perspective of the common Ada programming support environment interface set (CAIS) and the portable common execution environment (PCEE) activities are discussed. Also, the dynamic perspective of the PCEE is addressed.

Mckay, Charles↗

Life support technology investment strategies for flight programs: An application of decision analysis

Applied research and technology development (R&TD) is often characterized by uncertainty, risk, and significant delays before tangible returns are obtained. Given the increased awareness of limitations in resources, effective R&TD today needs a method for up-front assessment of competing technologies to help guide technology investment decisions. Such an assessment approach must account for uncertainties in system performance parameters, mission requirements and architectures, and internal and external events influencing a development program. The methodology known as decision analysis has the potential to address these issues. It was evaluated by performing a case study assessment of alternative carbon dioxide removal technologies for NASA's proposed First Lunar Outpost program. An approach was developed that accounts for the uncertainties in each technology's cost and performance parameters as well as programmatic uncertainties such as mission architecture. Life cycle cost savings relative to a baseline, adjusted for the cost of money, was used as a figure of merit to evaluate each of the alternative carbon dioxide removal technology candidates. The methodology was found to provide a consistent decision-making strategy for development of new life support technology. The case study results provided insight that was not possible from more traditional analysis approaches.

Schlater, Nelson J.↗

Life support technology investment strategies for flight programs: An application of decision analysis

Applied research and technology development (R&TD) is often characterized by uncertainty, risk, and significant delays before tangible returns are obtained. Given the increased awareness of limitations in resources, effective R&TD today needs a method for up-front assessment of competing technologies to help guide technology investment decisions. Such an assessment approach must account for uncertainties in system performance parameters, mission requirements and architectures, and internal and external events influencing a development program. The methodology known as decision analysis has the potential to address these issues. It was evaluated by performing a case study assessment of alternative carbon dioxide removal technologies for NASA"s proposed First Lunar Outpost program. An approach was developed that accounts for the uncertainties in each technology's cost and performance parameters as well as programmatic uncertainties such as mission architecture. Life cycle cost savings relative to a baseline, adjusted for the cost of money, was used as a figure of merit to evaluate each of the alternative carbon dioxide removal technology candidates. The methodology was found to provide a consistent decision-making strategy for the develpoment of new life support technology. The case study results provided insight that was not possible from more traditional analysis approaches.

Schlater, Nelson J.↗

The semi-Markov unreliability range evaluator program

The SURE program is a design/validation tool for ultrareliable computer system architectures. The system uses simple algebraic formulas to compute accurate upper and lower bounds for the death state probabilities of a large class of semi-Markov models. The mathematical formulas used in the program were derived from a mathematical theorem proven by Allan White under contract to NASA Langley Research Center. This mathematical theorem is discussed along with the user interface to the SURE program.

Butler, R. W.↗

KokkACC: Enhancing Kokkos with OpenACC

Template metaprogramming is gaining popularity as a high-level solution for achieving performance portability on heterogeneous computing resources. Kokkos is a representative approach that offers programmers high-level abstractions for generic programming while most of the device-specific code generation and optimizations are delegated to the compiler through template specializations. For this, Kokkos provides a set of device-specific code specializations in multiple back ends, such as CUDA and HIP. Unlike CUDA or HIP, OpenACC is a high-level and directive-based programming model. This descriptive model allows developers to insert hints (pragmas) into their code that help the compiler to parallelize the code. The compiler is responsible for the transformation of the code, which is completely transparent to the programmer. This paper presents an OpenACC back end for Kokkos: KokkACC. As an alternative to Kokkos’s existing device-specific back ends, KokkACC is a multi-architecture back end providing a high-productivity programming environment enabled by OpenACC’s high-level and descriptive programming model. Moreover, we have observed competitive performance; in some cases, KokkACC is faster (up to 9×) than NVIDIA’s CUDA back end and much faster than OpenMP’s GPU offloading back end. This work also includes implementation details and a detailed performance study conducted with a set of mini-benchmarks (AXPY and DOT product) and three mini-apps (LULESH, miniFE and SNAP, a LAMMPS proxy mini-app).

Valero Lara, Pedro↗

A-SST Initial Specification

The U.S. Army Research Office (ARO), in partnership with IARPA, are investigating innovative, efficient, and scalable computer architectures that are capable of executing next-generation large scale data-analytic applications. These applications are increasingly sparse, unstructured, non-local, and heterogeneous. Under the Advanced Graphic Intelligence Logical computing Environment (AGILE) program, Performer teams will be asked to design computer architectures to meet the future needs of the DoD and the Intelligence Community (IC). This design effort will require flexible, scalable, and detailed simulation to assess the performance, efficiency, and validity of their designs. To support AGILE, Sandia National Labs will be providing the AGILE-enhanced Structural Simulation Toolkit (A-SST). This toolkit is a computer architecture simulation framework designed to support fast, parallel, and multi-scale simulation of novel architectures. This document describes the A-SST framework, some of its library of simulation models, and how it may be used by AGILE Performers.

97 MATHEMATICS AND COMPUTING↗

Performance Modeling and Measurement of Parallelized Code for Distributed Shared Memory Multiprocessors

This paper presents a model to evaluate the performance and overhead of parallelizing sequential code using compiler directives for multiprocessing on distributed shared memory (DSM) systems. With increasing popularity of shared address space architectures, it is essential to understand their performance impact on programs that benefit from shared memory multiprocessing. We present a simple model to characterize the performance of programs that are parallelized using compiler directives for shared memory multiprocessing. We parallelized the sequential implementation of NAS benchmarks using native Fortran77 compiler directives for an Origin2000, which is a DSM system based on a cache-coherent Non Uniform Memory Access (ccNUMA) architecture. We report measurement based performance of these parallelized benchmarks from four perspectives: efficacy of parallelization process; scalability; parallelization overhead; and comparison with hand-parallelized and -optimized version of the same benchmarks. Our results indicate that sequential programs can conveniently be parallelized for DSM systems using compiler directives but realizing performance gains as predicted by the performance model depends primarily on minimizing architecture-specific data locality overhead.

Waheed, Abdul↗

Lunar Outpost Life Support Trade Studies

Engineering trade-off studies of life support system architecture and technology options were conducted for potential lunar surface mission scenarios within NASA's Constellation Program. The scenarios investigated are based largely on results of the NASA Lunar Architecture Team (LAT) Phase II study. In particular, the possibility of Hosted Sortie missions, the high cost of power during eclipse periods, and the potential to reduce life support consumables through scavenging, in-situ resources, and alternative EVA technologies were all examined. These trade studies were performed within the Systems Integration, Modeling and Analysis (SIMA) element of NASA's Exploration Life Support (ELS) technology development project. The tools and methodology used in the study are described briefly, followed by a discussion of mission scenarios, life support technology options and results presented in terms of equivalent system mass for various regenerative life support technologies and architectures. Three classes of repeated or extended lunar surface missions were investigated in this study along with several life support resource scenarios for each mission class. Individual mission durations of 14 days, 90 days and 180 days were considered with 10 missions assumed for each at a rate of 2 missions per year. The 14-day missions represent a class of Hosted Sortie missions where a pre-deployed and potentially mobile habitat provides life support for multiple crews at one or more locations. The 90-day and 180-day missions represent lunar outpost expeditions with a larger fixed habitat. The 180-day missions assume continuous human presence and must provide life support through eclipse periods of up to 122 hours while the 90-day missions are planned for best-case periods of nearly continuous sunlight. This paper investigates system optimization within the assumptions of each scenario and addresses how the scenario selected drives the life support system to different designs. Subsequently, these analysis results can be used to determine which technologies may be good choices throughout a broad range of architectures.

Lange, Kevin E.↗

Architecture-Aware Algorithms for Scalable Performance and Resilience on Heterogeneous Architectures. Final Report

With the coming end of Moore's law, it has become essential to develop new algorithms and techniques that can provide the performance needed by demanding computational science applications, especially those that are part of the DOE science mission. This work was part of a multi-institution, multi-investigator project that explored several approaches to develop algorithms that would be effective at the extreme scales and with the complex processor architectures that are expected at the end of this decade. The work by this group developed new performance models that have already helped guide the development of highly scalable versions of an algebraic multigrid solver, new programming approaches designed to support numerical algorithms on heterogeneous architectures, and a new, more scalable version of conjugate gradient, an important algorithm in the solution of very large linear systems of equations.

97 MATHEMATICS AND COMPUTING↗