Search NASA⌕ Search

SEARCH · Search NASA

Results for “task parallelism”

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,045 records · Page 58
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

Status on the Development of a Modeling and Simulation Framework for the Economic Assessment of Nuclear Hybrid Energy Systems

An effort to design and build a modeling and simulation framework to assess the economic viability of Nuclear Hybrid Energy Systems (NHES) was undertaken in fiscal year 2015 (FY15). The purpose of this report is to document the various tasks associated with the development of such a framework and to provide a status on its progress. Several tasks have been accomplished. First, starting from a simulation strategy, a rigorous mathematical formulation has been achieved in which the economic optimization of a Nuclear Hybrid Energy System is presented as a constrained robust (under uncertainty) optimization problem. Some possible algorithms for the solution of the optimization problem are presented. A variation of the Simultaneous Perturbation Stochastic Approximation algorithm has been implemented in RAVEN and preliminary tests have been performed. The development of the software infrastructure to support the simulation of the whole NHES has also moved forward. The coupling between RAVEN and an implementation of the Modelica language (OpenModelica) has been implemented, migrated under several operating systems and tested using an adapted model of a desalination plant. In particular, this exercise was focused on testing the coupling of the different code systems; testing parallel, computationally expensive simulations on the INL cluster; and providing a proof of concept for the possibility of using surrogate models to represent the different NHES subsystems. Another important step was the porting of the RAVEN code under the Windows™ operating system. This accomplishment makes RAVEN compatible with the development environment that is being used for dynamic simulation of NHES components. A very simplified model of a NHES on the electric market has been built in RAVEN to confirm expectations on the analysis capability of RAVEN to provide insight into system economics and to test the capability of RAVEN to identify limit surfaces even for stochastic constraints. This capability will be needed in the future to enforce the stochastic constraints on the electric demand coverage from the NHES. The development team gained experience with many of the tools that are currently envisioned for use in the economic analysis of NHES and completed several important steps. Given the complexity of the project, preference has been given to a structural approach in which several independent efforts have been used to build the cornerstone of the simulation framework. While this is good approach in establishing such a complex framework, it may delay reaching more complete results on the performance of analyzed system configurations. The integration of the previously reported exergy analysis approach was initially proposed as part of this milestone. However, in reality, the exergy-based apportioning of cost will take place only in a second stage of the implementation since it will be used to properly allocate cost among the different NHES subsystems. Therefore, exergy does not appear at the level of the main drivers in the analysis framework; the latter development of the base framework is the focus of this report.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2025

Dynamic Modeling, Trajectory Optimization, and Linear Control of Cable-Driven Parallel Robots for Automated Panelized Building Retrofits

The construction industry faces a growing need for automation to reduce costs, improve accuracy and productivity, and address labor shortages. One area that stands to benefit significantly from automation is panelized prefabricated building envelope retrofits, which can improve a building’s energy efficiency in heating and cooling interior spaces. In this paper, we propose using cable-driven parallel robots (CDPRs), which can effectively lift and handle large objects, to install these panels. However, implementing CDPRs presents significant challenges because of their nonlinear dynamics, complex trajectory planning, and precise control requirements. To tackle these challenges, this work focuses on a new application of established control and trajectory optimization theories in a CDPR simulation of a building envelope retrofit under real-world conditions. We first model the dynamics of CDPRs, highlighting the critical role of damping in system behavior. Building on this dynamic model, we formulate a trajectory optimization problem to generate feasible and efficient motion plans for the robot under operational and environmental constraints. Given the high precision required in the construction industry, accurately tracking the optimized trajectory is essential. However, challenges such as partial observability and external vibrations complicate this task. To address these issues, a Linear Quadratic Gaussian control framework is applied, enabling the robot to track the optimized trajectories with precision. Simulation results show that the proposed controller enables precise end effector positioning with errors under 4 mm, even in the presence of external wind disturbances. Through comprehensive simulations, our approach allows for an in-depth exploration of the system’s nonlinear dynamics, trajectory optimization, and control strategies under controlled yet highly realistic conditions. The results demonstrate the feasibility of CDPRs for automating panel installation and provide insights into their practical deployment.

CDPR↗
DOE OSTI2025

Uncertainty Visualization of Critical Points of 2D Scalar Fields for Parametric and Nonparametric Probabilistic Models

This paper presents a novel end-to-end framework for closed-form computation and visualization of critical point uncertainty in 2D uncertain scalar fields. Critical points are fundamental topological descriptors used in the visualization and analysis of scalar fields. The uncertainty inherent in data (e.g., observational and experimental data, approximations in simulations, and compression), however, creates uncertainty regarding critical point positions. Uncertainty in critical point positions, therefore, cannot be ignored, given their impact on downstream data analysis tasks. Here, in this work, we study uncertainty in critical points as a function of uncertainty in data modeled with probability distributions. Although Monte Carlo (MC) sampling techniques have been used in prior studies to quantify critical point uncertainty, they are often expensive and are infrequently used in production-quality visualization software. We, therefore, propose a new end-to-end framework to address these challenges that comprises a threefold contribution. First, we derive the critical point uncertainty in closed form, which is more accurate and efficient than the conventional MC sampling methods. Specifically, we provide the closed-form and semianalytical (a mix of closed-form and MC methods) solutions for parametric (e.g., uniform, Epanechnikov) and nonparametric models (e.g., histograms) with finite support. Second, we accelerate critical point probability computations using a parallel implementation with the VTK-m library, which is platform portable. Finally, we demonstrate the integration of our implementation with the ParaView software system to demonstrate near-real-time results for real datasets.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1992

Moving formal methods into practice. Verifying the FTPP Scoreboard: Results, phase 1

This report documents the Phase 1 results of an effort aimed at formally verifying a key hardware component, called Scoreboard, of a Fault-Tolerant Parallel Processor (FTPP) being built at Charles Stark Draper Laboratory (CSDL). The Scoreboard is part of the FTPP virtual bus that guarantees reliable communication between processors in the presence of Byzantine faults in the system. The Scoreboard implements a piece of control logic that approves and validates a message before it can be transmitted. The goal of Phase 1 was to lay the foundation of the Scoreboard verification. A formal specification of the functional requirements and a high-level hardware design for the Scoreboard were developed. The hardware design was based on a preliminary Scoreboard design developed at CSDL. A main correctness theorem, from which the functional requirements can be established as corollaries, was proved for the Scoreboard design. The goal of Phase 2 is to verify the final detailed design of Scoreboard. This task is being conducted as part of a NASA-sponsored effort to explore integration of formal methods in the development cycle of current fault-tolerant architectures being built in the aerospace industry.

Srivas, Mandayam↗
NASA NTRS1993

High-performance mass storage system for workstations

Reduced Instruction Set Computer (RISC) workstations and Personnel Computers (PC) are very popular tools for office automation, command and control, scientific analysis, database management, and many other applications. However, when using Input/Output (I/O) intensive applications, the RISC workstations and PC's are often overburdened with the tasks of collecting, staging, storing, and distributing data. Also, by using standard high-performance peripherals and storage devices, the I/O function can still be a common bottleneck process. Therefore, the high-performance mass storage system, developed by Loral AeroSys' Independent Research and Development (IR&D) engineers, can offload a RISC workstation of I/O related functions and provide high-performance I/O functions and external interfaces. The high-performance mass storage system has the capabilities to ingest high-speed real-time data, perform signal or image processing, and stage, archive, and distribute the data. This mass storage system uses a hierarchical storage structure, thus reducing the total data storage cost, while maintaining high-I/O performance. The high-performance mass storage system is a network of low-cost parallel processors and storage devices. The nodes in the network have special I/O functions such as: SCSI controller, Ethernet controller, gateway controller, RS232 controller, IEEE488 controller, and digital/analog converter. The nodes are interconnected through high-speed direct memory access links to form a network. The topology of the network is easily reconfigurable to maximize system throughput for various applications. This high-performance mass storage system takes advantage of a 'busless' architecture for maximum expandability. The mass storage system consists of magnetic disks, a WORM optical disk jukebox, and an 8mm helical scan tape to form a hierarchical storage structure. Commonly used files are kept in the magnetic disk for fast retrieval. The optical disks are used as archive media, and the tapes are used as backup media. The storage system is managed by the IEEE mass storage reference model-based UniTree software package. UniTree software will keep track of all files in the system, will automatically migrate the lesser used files to archive media, and will stage the files when needed by the system. The user can access the files without knowledge of their physical location. The high-performance mass storage system developed by Loral AeroSys will significantly boost the system I/O performance and reduce the overall data storage cost. This storage system provides a highly flexible and cost-effective architecture for a variety of applications (e.g., realtime data acquisition with a signal and image processing requirement, long-term data archiving and distribution, and image analysis and enhancement).

Chiang, T.↗
NASA NTRS1994

Very fast motion planning for highly dexterous-articulated robots

Due to the inherent danger of space exploration, the need for greater use of teleoperated and autonomous robotic systems in space-based applications has long been apparent. Autonomous and semi-autonomous robotic devices have been proposed for carrying out routine functions associated with scientific experiments aboard the shuttle and space station. Finally, research into the use of such devices for planetary exploration continues. To accomplish their assigned tasks, all such autonomous and semi-autonomous devices will require the ability to move themselves through space without hitting themselves or the objects which surround them. In space it is important to execute the necessary motions correctly when they are first attempted because repositioning is expensive in terms of both time and resources (e.g., fuel). Finally, such devices will have to function in a variety of different environments. Given these constraints, a means for fast motion planning to insure the correct movement of robotic devices would be ideal. Unfortunately, motion planning algorithms are rarely used in practice because of their computational complexity. Fast methods have been developed for detecting imminent collisions, but the more general problem of motion planning remains computationally intractable. However, in this paper we show how the use of multicomputers and appropriate parallel algorithms can substantially reduce the time required to synthesize paths for dexterous articulated robots with a large number of joints. We have developed a parallel formulation of the Randomized Path Planner proposed by Barraquand and Latombe. We have shown that our parallel formulation is capable of formulating plans in a few seconds or less on various parallel architectures including: the nCUBE2 multicomputer with up to 1024 processors (nCUBE2 is a registered trademark of the nCUBE corporation), and a network of workstations.

Challou, Daniel J.↗
DOE OSTI2022

Quantum annealing algorithms for Boolean tensor networks

Abstract Quantum annealers manufactured by D-Wave Systems, Inc., are computational devices capable of finding high-quality heuristic solutions of NP-hard problems. In this contribution, we explore the potential and effectiveness of such quantum annealers for computing Boolean tensor networks. Tensors offer a natural way to model high-dimensional data commonplace in many scientific fields, and representing a binary tensor as a Boolean tensor network is the task of expressing a tensor containing categorical (i.e., $$\{0, 1\}$$ { 0 , 1 } ) values as a product of low dimensional binary tensors. A Boolean tensor network is computed by Boolean tensor decomposition, and it is usually not exact. The aim of such decomposition is to minimize the given distance measure between the high-dimensional input tensor and the product of lower-dimensional (usually three-dimensional) tensors and matrices representing the tensor network. In this paper, we introduce and analyze three general algorithms for Boolean tensor networks: Tucker, Tensor Train, and Hierarchical Tucker networks. The computation of a Boolean tensor network is reduced to a sequence of Boolean matrix factorizations, which we show can be expressed as a quadratic unconstrained binary optimization problem suitable for solving on a quantum annealer. By using a novel method we introduce called parallel quantum annealing, we demonstrate that Boolean tensor’s with up to millions of elements can be decomposed efficiently using a DWave 2000Q quantum annealer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Unified Language Frontend for Physic-Informed AI/ML

Artificial intelligence and machine learning (AI/ML) are becoming important tools for scientific modeling and simulation as in several other fields such as image analysis and natural language processing. ML techniques can leverage the computing power available in modern systems and reduce the human effort needed to configure experiments, interpret and visualize results, draw conclusions from huge quantities of raw data, and build surrogates for physics based models. Domain scientists in fields like fluid dynamics, microelectronics and chemistry can automate many of their most difficult and repetitive tasks or improve the design times by use of the faster ML-surrogates. However, modern ML and traditional scientific highperformance computing (HPC) tend to use completely different software ecosystems. While ML frameworks like PyTorch and TensorFlow provide Python APIs, most HPC applications and libraries are written in C++. Direct interoperability between the two languages is possible but is tedious and error-prone. In this work, we show that a compiler-based approach can bridge the gap between ML frameworks and scientific software with less developer effort and better efficiency. We use the MLIR (multi-level intermediate representation) ecosystem to compile a pre-trained convolutional neural network (CNN) in PyTorch to freestanding C++ source code in the Kokkos programming model. Kokkos is a programming model widely used in HPC to write portable, shared-memory parallel code that can natively target a variety of CPU and GPU architectures. Our compiler-generated source code can be directly integrated into any Kokkosbased application with no dependencies on Python or cross-language interfaces.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1996

Paradise: A Parallel Information System for EOSDIS

The Paradise project was begun-in 1993 in order to explore the application of the parallel and object-oriented database system technology developed as a part of the Gamma, Exodus. and Shore projects to the design and development of a scaleable, geo-spatial database system for storing both massive spatial and satellite image data sets. Paradise is based on an object-relational data model. In addition to the standard attribute types such as integers, floats, strings and time, Paradise also provides a set of and multimedia data types, designed to facilitate the storage and querying of complex spatial and multimedia data sets. An individual tuple can contain any combination of this rich set of data types. For example, in the EOSDIS context, a tuple might mix terrain and map data for an area along with the latest satellite weather photo of the area. The use of a geo-spatial metaphor simplifies the task of fusing disparate forms of data from multiple data sources including text, image, map, and video data sets.

DeWitt, David↗
DOE OSTI2015

Application configuration selection for energy-efficient execution on multicore systems

Balanced performance and energy consumption are incorporated in the design of modern computer systems. Several runtime factors, such as concurrency levels, thread mapping strategies, and dynamic voltage and frequency scaling (DVFS) should be considered in order to achieve optimal energy efficiency fora workload. Selecting appropriate run-time factors, however, is one of the most challenging tasks because the run-time factors are architecture-specific and workload-specific. And while most existing works concentrate on either static analysis of the workload or run-time prediction results, we present a hybrid two-step method that utilizes concurrency levels and DVFS settings to achieve the energy efficiency configuration for a worldoad. The experimental results based on a Xeon E5620 server with NPB and PARSEC benchmark suites show that the model is able to predict the energy efficient configuration accurately. On average, an additional 10% EDP (Energy Delay Product) saving is obtained by using run-time DVFS for the entire system. An off-line optimal solution is used to compare with the proposed scheme. Finally, the experimental results show that the average extra EDP saved by the optimal solution is within 5% on selective parallel benchmarks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Knowledge Oriented Graph Unified Transformer (KOGUT) v0.1

KOGUT — Knowledge Oriented Graph Unified Transformer KOGUT implements the Relational Graph Transformer (RelGT) architecture for knowledge graph link prediction in biological domains, with a primary focus on microbial growth media prediction. While the original RelGT (arXiv:2505.10960) targets relational tables, time series, and multi-table databases, KOGUT adapts this architecture for heterogeneous biological knowledge graphs, providing first-in-class AI predictive models for microbial cultivation. Key Adaptations Beyond Original RelGT: - Knowledge Graph Focus: Applied to biological KGs with semantic node types (taxa, chemicals, media, phenotypes, environments) versus generic relational database tables, trained on the KG-Microbe knowledge graph (1.3M entities, 2.9M edges, 24 relation types). - Multimodal Node Encoding: Integrates node labels, categories, descriptions, and synonyms from KG metadata through learned embedding layers—adapting relational column features to graph node attributes with textual semantics. - Extended K-Hop Subgraph Strategy: Optimized neighborhood sampling (3-hop default, configurable up to 200 nodes) tuned for sparse biological networks, building on the original local-global attention framework with biological relation preservation. - Biolink Predicate Preservation: Type-specific transformations for 24 biological edge semantics (occurs_in, consumes, produces, has_phenotype, subclass_of) beyond standard relational foreign keys, enabling multi-relation link prediction. - Inductive Learning Support: Enables zero-shot predictions for novel taxa through feature-based embeddings (temperature, oxygen requirements, gram stain, cell shape), extending the original transductive relational benchmark scope to uncultured microorganisms. CheapSOTA Performance Optimizations (This Distribution): - VQ-EMA Centroid Attention: Vector quantization with exponential moving average for improved global context modeling (+5-10% MRR improvement). - HDF5 Precomputed Data Loading: One-time preprocessing of k-hop subgraphs to eliminate redundant graph traversals (2-5× training speedup). - Distributed Data Parallel Training: Multi-GPU support for scaling to larger knowledge graphs (tested on 4× NVIDIA A100 GPUs at NERSC Perlmutter). - Mixed Precision Training: Automatic mixed precision (AMP) for memory efficiency and faster training. Advantages Over Standard Knowledge Graph Embedding Models: Combines RelGT's proven multi-element tokenization (features, type, hop, structure) with graph-native biological representations, enabling interpretable link prediction across heterogeneous entities that standard embedding models (TransE, RotatE, ComplEx) and table-based transformers cannot directly model. Achieves near-perfect performance on microbial growth media prediction (MRR: 0.9966, Precision@1: 0.9932, Hit@10: 1.0000) while maintaining explainability through attention-based reasoning over biological pathways. Training Data: - KG-Microbe merged knowledge graph: 1,379,337 nodes, 2,960,472 edges - 24 biological relation types including taxonomic hierarchies, metabolic interactions, phenotype associations, and environmental relationships - Primary prediction task: Growth media suitability for microbial taxa (biolink:occurs_in, 50K edges) - Multi-relation capability: Predicts links for any of the 24 relation types, including chemical consumption/production, phenotype associations, and taxonomic classification Citation: Original RelGT Architecture: Dwivedi et al., "Relational Graph Transformer", arXiv:2505.10960, 2025 KOGUT Implementation: Knowledge Oriented Graph Unified Transformer for Microbial Growth Media Prediction Developed at Lawrence Berkeley National Laboratory (LBNL) Trained on NERSC Perlmutter supercomputer

Joachimiak, Marcin [Lawrence Berkeley National Lab↗
NASA NTRS2014

Dividing the Concentrator Target From the Genesis Mission

The Genesis spacecraft, launched in 2001, traveled to a Lagrangian point between the Earth and Sun to collect particles from the solar wind and return them to Earth. However, during the return of the spacecraft in 2004, the parachute failed to open during descent, and the Genesis spacecraft crashed into the Utah desert. Many of the solar wind collectors were broken into smaller pieces, and the field team rapidly collected the capsule and collector pieces for later assessment. On each of the next few days, the team discovered that various collectors had survived intact, including three of four concentrator targets. Within a month, the team had imaged more than 10,000 fragments and packed them for transport to the Astromaterials Acquisition and Curation Office within the ARES Directorate at JSC. Currently, the Genesis samples are curated along with the other extraterrestrial sample collections within ARES. Although they were broken and dirty, the Genesis solar wind collectors still offered the science community the opportunity to better understand our Sun and the solar system as a whole. One of the more highly prized concentrator collectors survived the crash almost completely intact. The Genesis Concentrator was designed to concentrate the solar wind by a factor of at least 20 so that solar oxygen and nitrogen isotopes could be measured. One of these materials was the Diamond-on-Silicon (DoS) concentrator target. Unfortunately, the DoS concentrator broke on impact. Nevertheless, the scientific value of the DoS concentrator target was high. The Genesis Allocation Committee received a request for approximately 1 cm(sup 2) of the DoS specimen taken near the focal point of the concentrator for the analysis of solar wind nitrogen isotopes. The largest fragment, Genesis sample 60000, was designated for this allocation and needed to be precisely cut. The requirement was to subdivide the designated sample in a manner that prevented contamination of the sample and minimized the risk of losing or breaking the precious requested sample fragment. The Genesis curator determined that the use of laser scribing techniques to "cut" a precise line and subsequently cleave the sample (in a controlled break of the sample along that line) was the best method for accomplishing the sample subdivision. However, there were risks, including excess heating of the sample, that could cause some of the implanted solar wind to be lost via thermal diffusion. Accidentally breaking the sample during the handling and cleaving process was an additional risk. Early in fiscal year 2013, to address this delicate, complicated task, the ARES Directorate assembled its top scientists to develop a cutting plan that would ensure success when applied to the actual concentrator target wafer; i.e., to produce an approximately 1 cm(sup 2) piece from the requested area of the wafer. The team, subsequently referred to as the JSC Genesis Tiger Team, spent months researching and testing parameters and techniques related to scribing, cleaving, transporting, handling, and holding (i.e., mounting) the specimen. The investigation required considerable "thinking outside the box," and many, many trials using nonflight wafer analogs. After all preliminary testing, the following method was adopted as the final cutting plan. It was used in two final end-to-end practice runs before being used on the actual flight target wafer. The wafer was oriented on the laser cutting stage with the 100 and 010 directions of the wafer parallel to the corresponding X and Y directions of the cutting stage. The laser was programed to scribe 31 lines of the appropriate length along the Y stage direction. The programed scribe lines were separated by 5 micron in the X direction. The laser parameters were set as follows: (1) The laser power was 0.5 watts; (2) each line consisted of 50 passes, with the Z position being advanced 5 micron per pass; and (3) 30 s would elapse before the next line was scribed to allow for wafer cool down from any possible heating via the laser. The ablated material that "stuck" in the "scribe-cut" was removed from the "cut" using an ultrasonic micro-tool. After all the ablated silicon was removed from the wafer, the wafer was repositioned in exactly the same orientation on the laser stage. The laser was focused using the bottom of the wafer channel, and the 31-line scribing pattern described above was reprogrammed using the Z position of the groove bottom as the starting Z value instead of the top wafer surface, which was used previously. Upon completion of the second set of scribes, the ultrasonic micro-tool was again used to clean out the cut. The wafer was remounted on the stage in exactly the same orientation as before. The laser was again focused on the bottom of the groove. This time, however, the laser was.programed to scribe only one line down the exact center of the channel. The final scribe line consisted of 100 passes with a Z advance of 5 micron per pass and with the laser power set at 0.5 watts. As mentioned above, the final cutting plan was practiced in two end-to-end trials using non-flight, triangular-shaped silicon wafers similar in size and orientation to the actual DOS 60000 target sample. The actual scribing of the triangular-shaped wafers required scribing two lines and cleaving (i.e. scribe-cleave, then scribe-cleave) to obtain the piece requested for allocation. Early in December 2012, after many months of experiments and practicing and perfecting the techniques and procedures, the team successfully subdivided the Genesis DoS 60000 target sample, one of the most scientifically important samples from the Genesis mission (figure 2). On December 17, 2012, the allocated piece of concentrator target sample was delivered to the requesting principal investigator.The cutting plan developed for the subdivision of this sample will be used as the model for subdividing future requested Genesis flight wafers (appropriately modified for different wafer types).

Lauer, H. V., Jr.↗
DOE OSTI2017

Advanced Tele-operation and Shared Autonomy for Nuclearized Robotic Systems - 17333

Remotely-initiated operations have existed for more than 50 years in the nuclear weapons complex, as the environments are far too extreme for humans. We introduce the scope of the nuclear waste cleanup effort and describe some existing applications of robotics technology at specific sites. We offer summaries of both the technology that is currently used, as well as a discussion of the types of problems that the technology is applied to. We contrast this with the current state of practice in other areas where robots are deployed in the real world, such as with military infantry units. We then go on to summarize and discuss the current state of the art in advanced tele-operation research and in shared autonomy, where humans collaborate with closed-loop automation to complete tasks. Our discussion focuses on areas with particular relevance to nuclear waste management, such as remote inspection and manipulation. Armed with this background, we then identify specific technology gaps that must be closed in order to successfully bring advanced tele-operation and shared autonomy technologies to bear on problems in nuclear waste management, such as (1) environmental remediation; (2) sampling, characterization, and disposition of tanks with hazardous and highly radioactive waste and (3) decontamination and decommissioning of facilities with gloveboxes and hot cells. We propose a roadmap for how to transition the current state of the art approaches in advanced robotics and shared autonomy to practice in the nuclear industry and how to close the technology gaps previously identified. This roadmap covers not only the technical advances that need to be made, but also considers the social and societal aspects. Drawing parallels with the adoption of similar technologies in the military and other areas, we offer concrete suggestions for how to deploy these new technologies effectively into the nuclear industry from a human-centered perspective. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
NASA NTRS2015

Affordable Development and Demonstration of a Small NTR Engine and Stage: How Small is Big Enough?

The Nuclear Thermal Rocket (NTR) derives its energy from fission of uranium-235 atoms contained within fuel elements that comprise the engine's reactor core. It generates high thrust and has a specific impulse potential of approximately 900 seconds - a 100% increase over today's best chemical rockets. The Nuclear Thermal Propulsion (NTP) project, funded by NASA's AES program, includes five key task activities: (1) Recapture, demonstration, and validation of heritage graphite composite (GC) fuel (selected as the "Lead Fuel" option); (2) Engine Conceptual Design; (3) Operating Requirements Definition; (4) Identification of Affordable Options for Ground Testing; and (5) Formulation of an Affordable Development Strategy. During FY'14, a preliminary DDT&E plan and schedule for NTP development was outlined by GRC, DOE and industry that involved significant system-level demonstration projects that included GTD tests at the NNSS, followed by a FTD mission. To reduce cost for the GTD tests and FTD mission, small NTR engines, in either the 7.5 or 16.5 klbf thrust class, were considered. Both engine options used GC fuel and a "common" fuel element (FE) design. The small approximately 7.5 klbf "criticality-limited" engine produces approximately 157 megawatts of thermal power (MWt) and its core is configured with parallel rows of hexagonal-shaped FEs and tie tubes (TTs) with a FE to TT ratio of approximately 1:1. The larger approximately 16.5 klbf Small Nuclear Rocket Engine (SNRE), developed by LANL at the end of the Rover program, produces approximately 367 MWt and has a FE to TT ratio of approximately 2:1. Although both engines use a common 35 inch (approximately 89 cm) long FE, the SNRE's larger diameter core contains approximately 300 more FEs needed to produce an additional 210 MWt of power. To reduce the cost of the FTD mission, a simple "1-burn" lunar flyby mission was considered to reduce the LH2 propellant loading, the stage size and complexity. Use of existing and flight proven liquid rocket and stage hardware (e.g., from the RL10B-2 engine and Delta Cryogenic Second Stage) was also maximized to further aid affordability. This paper examines the pros and cons of using these two small engine options, including their potential to support future human exploration missions to the Moon, near Earth asteroids, and Mars, and recommends a preferred size. It also provides a preliminary assessment of the key activities, development options, and schedule required to affordably build, ground test and fly a small NTR engine and stage within a 10-year timeframe.

Spacecraft design↗
DOE OSTI2023

BOTTLE 2 - Analysis

The use of analysis is foundational to BOTTLE. In particular, we conduct techno-economic analysis (TEA), life cycle assessment (LCA), and supply chain modeling for each new BOTTLE innovation, spanning new deconstruction and upcycling technologies to redesigned polymers. These critical analysis tools are used in parallel with laboratory research to ensure that BOTTLE technologies can ultimately meet our key metrics. The BOTTLE team used analysis early in the current 3-year project cycle to identify research priorities from a scale, energy, and economics perspective (Nicholson et al., Joule 2021), and recently we presented a comprehensive framework for comparing new circularity-focused approaches to linear, incumbent practices (Nicholson et al., Ann. Rev. Chem. Biomolec. Eng. 2022). This presentation will also review case studies in analysis for closed-loop PET recycling across a range of recycling methods, baseline studies that we have conducted for plastics pyrolysis and gasification as another comparator for BOTTLE technologies, and a comprehensive study of existing closed-loop recycling technologies from a full suite of environmental impacts and feedstock quality metrics. We have undertaken studies of circular polymers being developed in the Redesign task, and we will present an exemplary case for a bio-based acrylic polymer that can replace polymethyl methacrylate. Overall, analysis is critical to enable the BOTTLE Consortium to focus on impactful, realistic technologies.

BIOMASS FUELS↗
DOE OSTI2023

ExTreeM: Scalable Augmented Merge Tree Computation via Extremum Graphs

Over the last decade merge trees have been proven to support a plethora of visualization and analysis tasks since they effectively abstract complex datasets. Here, this paper describes the ExTreeM-Algorithm: A scalable algorithm for the computation of merge trees via extremum graphs. The core idea of ExTreeM is to first derive the extremum graph G of an input scalar field f defined on a cell complex K, and subsequently compute the unaugmented merge tree of f on G instead of K; which are equivalent. Any merge tree algorithm can be carried out significantly faster on G, since K in general contains substantially more cells than G. To further speed up computation, ExTreeM includes a tailored procedure to derive merge trees of extremum graphs. The computation of the fully augmented merge tree, i.e., a merge tree domain segmentation of K, can then be performed in an optional post-processing step. All steps of ExTreeM consist of procedures with high parallel efficiency, and we provide a formal proof of its correctness. Our experiments, performed on publicly available datasets, report a speedup of up to one order of magnitude over the state-of-the-art algorithms included in the TTK and VTK-m software libraries, while also requiring significantly less memory and exhibiting excellent scaling behavior.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2008

Automated Production of Movies on a Cluster of Computers

A method of accelerating and facilitating production of video and film motion-picture products, and software and generic designs of computer hardware to implement the method, are undergoing development. The method provides for automation of most of the tedious and repetitive tasks involved in editing and otherwise processing raw digitized imagery into final motion-picture products. The method was conceived to satisfy requirements, in industrial and scientific testing, for rapid processing of multiple streams of simultaneously captured raw video imagery into documentation in the form of edited video imagery and video derived data products for technical review and analysis. In the production of such video technical documentation, unlike in production of motion-picture products for entertainment, (1) it is often necessary to produce multiple video derived data products, (2) there are usually no second chances to repeat acquisition of raw imagery, (3) it is often desired to produce final products within minutes rather than hours, days, or months, and (4) consistency and quality, rather than aesthetics, are the primary criteria for judging the products. In the present method, the workflow has both serial and parallel aspects: processing can begin before all the raw imagery has been acquired, each video stream can be subjected to different stages of processing simultaneously on different computers that may be grouped into one or more cluster(s), and the final product may consist of multiple video streams. Results of processing on different computers are shared, so that workers can collaborate effectively.

Nail, Jasper↗
DOE OSTI2020

A fast particle-based approach for calibrating a 3-D model of the Antarctic ice sheet

We consider the scientifically challenging and policy-relevant task of understanding the past and projecting the future dynamics of the Antarctic ice sheet. The Antarctic ice sheet has shown a highly nonlinear threshold response to past climate forcings. Triggering such a threshold response through anthropogenic greenhouse gas emissions would drive drastic and potentially fast sea level rise with important implications for coastal flood risks. Previous studies have combined information from ice sheet models and observations to calibrate model parameters. These studies have broken important new ground but have either adopted simple ice sheet models or have limited the number of parameters to allow for the use of more complex models. These limitations are largely due to the computational challenges posed by calibration as models become more computationally intensive or when the number of parameters increases. Here, we propose a method to alleviate this problem: a fast sequential Monte Carlo method that takes advantage of the massive parallelization afforded by modern high-performance computing systems. We use simulated examples to demonstrate how our sample-based approach provides accurate approximations to the posterior distributions of the calibrated parameters. The drastic reduction in computational times enables us to provide new insights into important scientific questions, for example, the impact of Pliocene era data and prior parameter information on sea level projections. These studies would be computationally prohibitive with other computational approaches for calibration such as Markov chain Monte Carlo or emulation-based methods. We also find considerable differences in the distributions of sea level projections when we account for a larger number of uncertain parameters. For example, based on the same ice sheet model and data set, the 99th percentile of the Antarctic ice sheet contribution to sea level rise in 2300 increases from 6.5 m to 13.1 m when we increase the number of calibrated parameters from three to 11. With previous calibration methods, it would be challenging to go beyond five parameters. Here, this work provides an important next step toward improving the uncertainty quantification of complex, computationally intensive and decision-relevant models.

54 ENVIRONMENTAL SCIENCES↗