Results for “future of computing” — Page 59

NASA NTRS2015

Advances in Orion's On-Orbit Guidance and Targeting System Architecture

NASA's manned spaceflight programs have a rich history of advancing onboard guidance and targeting technology. In order to support future missions, the guidance and targeting architecture for the Orion Multi-Purpose Crew Vehicle must be able to operate in complete autonomy, without any support from the ground. Orion's guidance and targeting system must be sufficiently flexible to easily adapt to a wide array of undecided future missions, yet also not cause an undue computational burden on the flight computer. This presents a unique design challenge from the perspective of both algorithm development and system architecture construction. The present work shows how Orion's guidance and targeting system addresses these challenges. On the algorithm side, the system advances the state-of-the-art by: (1) steering burns with a simple closed-loop guidance strategy based on Shuttle heritage, and (2) planning maneuvers with a cutting-edge two-level targeting routine. These algorithms are then placed into an architecture designed to leverage the advantages of each and ensure that they function in concert with one another. The resulting system is characterized by modularity and simplicity. As such, it is adaptable to the on-orbit phases of any future mission that Orion may attempt.

Scarritt, Sara K.↗

NASA NTRS1991

Mark 4A antenna control system data handling architecture study

A high-level review was conducted to provide an analysis of the existing architecture used to handle data and implement control algorithms for NASA's Deep Space Network (DSN) antennas and to make system-level recommendations for improving this architecture so that the DSN antennas can support the ever-tightening requirements of the next decade and beyond. It was found that the existing system is seriously overloaded, with processor utilization approaching 100 percent. A number of factors contribute to this overloading, including dated hardware, inefficient software, and a message-passing strategy that depends on serial connections between machines. At the same time, the system has shortcomings and idiosyncrasies that require extensive human intervention. A custom operating system kernel and an obscure programming language exacerbate the problems and should be modernized. A new architecture is presented that addresses these and other issues. Key features of the new architecture include a simplified message passing hierarchy that utilizes a high-speed local area network, redesign of particular processing function algorithms, consolidation of functions, and implementation of the architecture in modern hardware and software using mainstream computer languages and operating systems. The system would also allow incremental hardware improvements as better and faster hardware for such systems becomes available, and costs could potentially be low enough that redundancy would be provided economically. Such a system could support DSN requirements for the foreseeable future, though thorough consideration must be given to hard computational requirements, porting existing software functionality to the new system, and issues of fault tolerance and recovery.

Briggs, H. C.↗

NASA NTRSDate not supplied

Improving Computational Efficiency of Prognostics Algorithms in Resource-Constrained Settings

In engineering and aerospace applications, it is vital to operational success to have insight into the expected performance and health of physical systems. The field of prognostics and health management provides quantitative methods for monitoring, predicting, and managing system health. Prognostics algorithms can be employed to assess the current state of a system, propagate the system throughout time, and predict potential anomalies or failures that may occur. While they can provide accurate prediction results, effective prognostics algorithms can be challenging to use in resource-constrained settings due to computational limitations and high computational latency, leading to obsolete predictions. Thus, computationally efficient and accurate algorithms are necessary for future remaining useful life predictions. In this work, we implement new algorithmic approaches for prediction, quantitatively compare them via a battery degradation use-case, and provide recommendations of potential improvements to a prognostics framework. One approach to prediction is through sampling, whereby the current state of a physical system is sampled many times and each sample is propagated forward until failure is reached, resulting in a distribution of failure values. To improve the efficiency of this process, we implemented five new algorithmic approaches to prediction, including three distinct sampling methods (standard Monte Carlo, Quasi-Monte Carlo, and Latin Hypercube Sampling), a variable time step algorithm, and a variable sample size algorithm. To compare the algorithms, we employ a variety of metrics designed specifically to analyze both computational efficiency and model accuracy. Our metrics include accuracy to compare the average predicted value to ground truth, mean absolute deviation to illustrate dispersion, specific percentile error to describe accuracy within a user-defined risk tolerance, and code run-time. To quantitatively analyze our results, we employ a use-case of degradation of a Lithium-ion battery. We use an electrochemistry-based model to describe the current health state of the battery, and implement our prediction algorithms to propagate forward in time until end-of-discharge (EOD) is reached. Notably, through this work it was found that none of our sampling approaches had a significant impact on computational efficiency or model accuracy in predicting EOD of the battery. We find that while the sampling methods are unique, the distributions they generate are similar, ultimately producing final predictions that are nearly identical. In exploring the effect of the time step within the prediction algorithm, we found that prediction accuracy was highly dependent on the time step used, and that implementing a variable time step within a particular prediction may provide an increase in computational efficiency while also maintaining prediction accuracy. Finally, implementing a variable sample size also affected prediction, and our results show that tuning both the magnitude and timing of the sample size adjustment can result in improved computation speed and maintained prediction accuracy. Taken together, our findings highlight the challenge of performing prognostics in resource-constrained settings, and illustrate the potential of developing new prediction algorithms to improve computational efficiency.

prognostics↗

DOE OSTI2025

Electric Field Control of Magnetic Skyrmion Helicity in a Centrosymmetric 2D van der Waals Magnet

Two-dimensional van der Waals magnets hosting topological magnetic textures, such as skyrmions, show promise for spintronics and quantum computing. Electrical control of these topological spin textures is crucial for enhancing operational performance and functionality. Here, using electron microscopy combined with in situ electric and magnetic biasing, we show that the skyrmion helicity in insulating Cr 2 Ge 2 Te 6 can be controlled by the direction of the external electric field applied during the field cooling process. The electric field-tuned helicity remains stable at low temperature, even amid variations in magnetic and electric fields. Our theoretical investigation reveals that nonzero Dzyaloshinskii-Moriya interactions between nearest neighbors, induced by the electric field, change their sign upon reversing the electric field direction, thereby facilitating helicity selection. The electrical control of magnetic helicity demonstrated in this study can be extended to other centrosymmetric skyrmion-hosting magnets, paving the way for future device designs in topological spintronics and quantum computing.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2024

Response of hypoxia to future climate change is sensitive to methodological assumptions

Climate-induced changes in hypoxia are among the most serious threats facing estuaries, which are among the most productive ecosystems on Earth. Future projections of estuarine hypoxia typically involve long-term multi-decadal continuous simulations or more computationally efficient time slice and delta methods that are restricted to short historical and future periods. We make a first comparison of these three methods by applying a linked terrestrial–estuarine model to the Chesapeake Bay, a large coastal-plain estuary in the eastern United States. Results show that the time slice approach accurately captures the behavior of the continuous approach, indicating a minimal impact of model memory. However, increases in mean annual hypoxic volume by the mid-twenty-first century simulated by the delta approach (+ 19%) are approximately twice as large as the time slice and continuous experiments (+ 9% and + 11%, respectively), indicating an important impact of changes in climate variability. Our findings suggest that system memory and projected changes in climate variability, as well as simulation length and natural variability of system hypoxia, should be considered when deciding to apply the more computationally efficient delta and time slice methods.

54 ENVIRONMENTAL SCIENCES↗

NASA NTRSDate not supplied

Computational Modeling of Two Mars Powered Descent Vehicle Concepts Tested in the Langley Unitary Plan Wind Tunnel

Future human Mars missions will require powered descent starting at supersonic conditions, something which has never been done before at Mars. Computational powered descent flowfield simulations have been completed at full-scale Mars conditions, but the available ground test data are not suitable for calibrating computational uncertainties for aerodynamic interference on proposed Mars descent vehicles. Testing was conducted in the NASA Langley Unitary Plan Wind Tunnel in order to investigate the aerodynamic interference of sub-scale versions of two Mars powered descent vehicle concepts at supersonic Mach numbers (2.4 and 3.5): a model based on a blunt hypersonic inflatable aerodynamic decelerator (HIAD) and the second representing a more slender rigid vehicle with body flaps (CobraMRV). This paper covers computational flowfield predictions completed at wind tunnel conditions and comparisons to the test data. On the blowing HIAD models, the time-averaged pressure inboard of the nozzles was generally well-predicted, especially if the nozzles are canted outward, when the nozzles are located further from the nose. At intermediate CobraMRV thrust coefficients, CFD pressures are more accurately predicted than they are for the HIAD models, largely due to the nozzle locations and pointing directions. Overall, the CFD pressure coefficients were predicted within 0.2 of the steady pressure measurements for all blowing models, with smaller discrepancies at higher HIAD thrust, and larger discrepancies at lower HIAD CobraMRV thrust. All HIAD models were predicted to have a gradually decreasing axial force coefficient as the total thrust increases, in agreement with available pressure sensitive paint data. On models with canted nozzles or with nozzles further from the nose, the force coefficient was slightly higher for a given thrust. On the CobraMRV model, the CFD also shows consistent results between solvers and follows trends revealed in the data; the aerodynamic force coefficient remains near the non-blowing value at a tunnel Mach number of 2.4 regardless of thrust, and increases above that level at a Mach number of 3.5, consistent with the discrete pressure data. CFD analysis at tunnel and flight conditions will continue as flight system designs concepts mature.

Supersonic Retropropulsion↗

NASA NTRSDate not supplied

Computational Modeling of Two Mars Powered Descent Vehicle Concepts Tested in the Langley Unitary Plan Wind Tunnel

Future human Mars missions will require powered descent starting at supersonic conditions, something which has never been done before at Mars. Computational powered descent flowfield simulations have been completed at full-scale Mars conditions, but the available ground test data are not suitable for calibrating computational uncertainties for aerodynamic interference on proposed Mars descent vehicles. Testing was conducted in the NASA Langley Unitary Plan Wind Tunnel in order to investigate the aerodynamic interference of sub-scale versions of two Mars powered descent vehicle concepts at supersonic Mach numbers (2.4 and 3.5): a model based on a blunt hypersonic inflatable aerodynamic decelerator (HIAD) and the second representing a more slender rigid vehicle with body flaps (CobraMRV). This paper covers computational flowfield predictions completed at wind tunnel conditions and comparisons to the test data. On the blowing HIAD models, the time-averaged pressure inboard of the nozzles was generally well-predicted, especially if the nozzles are canted outward, when the nozzles are located further from the nose. At intermediate CobraMRV thrust coefficients, CFD pressures are more accurately predicted than they are for the HIAD models, largely due to the nozzle locations and pointing directions. Overall, the CFD pressure coefficients were predicted within 0.2 of the steady pressure measurements for all blowing models, with smaller discrepancies at higher HIAD thrust, and larger discrepancies at lower HIAD CobraMRV thrust. All HIAD models were predicted to have a gradually decreasing axial force coefficient as the total thrust increases, in agreement with available pressure sensitive paint data. On models with canted nozzles or with nozzles further from the nose, the force coefficient was slightly higher for a given thrust. On the CobraMRV model, the CFD also shows consistent results between solvers and follows trends revealed in the data; the aerodynamic force coefficient remains near the non-blowing value at a tunnel Mach number of 2.4 regardless of thrust, and increases above that level at a Mach number of 3.5, consistent with the discrete pressure data. CFD analysis at tunnel and flight conditions will continue as flight system designs concepts mature.

Supersonic Retropropulsion↗

DOE OSTI2025

Improving Projections of Antarctic Ice Sheet Contribution to Sea‐Level Change Through 2300 by Capturing Gravitational, Rotational, and Deformational Effects

Ice-mass change induces regionally varying patterns of sea-level change due to gravitational, rotational, and deformational (GRD) effects, which in turn influence marine-based ice stability in Antarctica. For improved projection of the Antarctic Ice Sheet (AIS), there is a need for including GRD effects in modeling and improving understanding of basin-by-basin sensitivity of ice evolution to GRD effects under a range of climate scenarios. We couple a high-resolution, higher-order ice-sheet model with a 1D global sea-level model that fully captures GRD effects, and simulate ice evolution in Antarctica under the Ice Sheet Model Intercomparison Project for CMIP6 experiments. We perform two sets of coupled simulations incorporating 1D Maxwell solid Earth structure suitable for West and East Antarctica and show that the Amundsen Sea Embayment (ASE) in West Antarctica has the highest sensitivity to GRD effects—in high-emission scenarios, grounding-line retreat accelerates by hundreds of kilometers by 2300 without GRD effects, but GRD effects delay this retreat on a timescale of decades. However, we find that delay times do not show a clear relationship to the strength of climate forcing alone. Furthermore, GRD effects can influence ice-sheet dynamics more than the choice of climate model for a given emissions scenario. In contrast, East Antarctica exhibits minimal sensitivity to GRD effects throughout the study period. These findings underscore the critical role of GRD effects in shaping future West AIS evolution, highlighting the importance of constraining the regional 3D Earth structure and bed topography in West Antarctica, particularly the ASE.

58 GEOSCIENCES↗

DOE OSTI2021

Benchmarking the Performance of Neuromorphic and Spiking Neural Network Simulators

Software simulators play a critical role in the development of new algorithms and system architectures in any field of engineering. Neuromorphic computing, which has shown potential in building brain-inspired energy-efficient hardware, suffers a slow-down in the development cycle due to a lack of flexible and easy-to-use simulators of either neuromorphic hardware itself or of spiking neural networks (SNNs), the type of neural network computation executed on most neuromorphic systems. While there are several openly available neuromorphic or SNN simulation packages developed by a variety of research groups, they have mostly targeted computational neuroscience simulations, and only a few have targeted small-scale machine learning tasks with SNNs. Evaluations or comparisons of these simulators have often targeted computational neuroscience-style workloads. In this work, we seek to evaluate the performance of several publicly available SNN simulators with respect to non-computational neuroscience workloads, in terms of speed, flexibility, and scalability. We evaluate the performance of the NEST, Brian2, Brian2GeNN, BindsNET and Nengo packages under a common front-end neuromorphic framework. Our evaluation tasks include a variety of different network architectures and workload types to mimic the computation common in different algorithms, including feed-forward network inference, genetic algorithms, and reservoir computing. We also study the scalability of each of these simulators when running on different computing hardware, from single core CPU workstations to multi-node supercomputers. Our results show that the BindsNET simulator has the best speed and scalability for most of the SNN workloads (sparse, dense, and layered SNN architectures) on a single core CPU. However, when comparing the simulators leveraging the GPU capabilities, Brian2GeNN outperforms the others for these workloads in terms of scalability. NEST performs the best for small sparse networks and is also the most flexible simulator in terms of reconfiguration capability NEST shows a speedup of at least 2x compared to the other packages when running evolutionary algorithms for SNNs. The multi-node and multi-thread capabilities of NEST show at least 2x speedup compared to the rest of the simulators (single core CPU or GPU based simulators) for large and sparse networks. We conclude our work by providing a set of recommendations on the suitability of employing these simulators for different tasks and scales of operations. We also present the characteristics for a future generic ideal SNN simulator for different neuromorphic computing workloads.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Quantum computing and quantum information storage

Quantum storage, transmission, and processing is the future of information technology. Here, the promise of quantum hardware stems from the inherent complexity of an entangled quantum system—the size of the wave-function scales exponentially with the number of particles, whether represented in real space or in a parameter space. In contrast, a classical N-body system can be completely represented by only 6N variables (positions and momenta of all particles). This complexity of quantum systems creates a yet-unsolved challenge of modeling quantum systems by means of classical computing—the curse of dimensionality. Indeed, although we can easily write the Schrödinger equation for any system of interacting nuclei and electrons, we can only solve it exactly on classical computers for very small systems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Reduction of the molecular hamiltonian matrix using quantum community detection

Abstract Quantum chemistry is interested in calculating ground and excited states of molecular systems by solving the electronic Schrödinger equation. The exact numerical solution of this equation, frequently represented as an eigenvalue problem, remains unfeasible for most molecules and requires approximate methods. In this paper we introduce the use of Quantum Community Detection performed using the D-Wave quantum annealer to reduce the molecular Hamiltonian matrix in Slater determinant basis without chemical knowledge. Given a molecule represented by a matrix of Slater determinants, the connectivity between Slater determinants (as off-diagonal elements) is viewed as a graph adjacency matrix for determining multiple communities based on modularity maximization. A gauge metric based on perturbation theory is used to determine the lowest energy cluster. This cluster or sub-matrix of Slater determinants is used to calculate approximate ground state and excited state energies within chemical accuracy. The details of this method are described along with demonstrating its performance across multiple molecules of interest and bond dissociation cases. These examples provide proof-of-principle results for approximate solution of the electronic structure problem using quantum computing. This approach is general and shows potential to reduce the computational complexity of post-Hartree–Fock methods as future advances in quantum hardware become available.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NASA NTRS2013

A Hybrid FPGA/Tilera Compute Element for Autonomous Hazard Detection and Navigation

To increase safety for future missions landing on other planetary or lunar bodies, the Autonomous Landing and Hazard Avoidance Technology (ALHAT) program is developing an integrated sensor for autonomous surface analysis and hazard determination. The ALHAT Hazard Detection System (HDS) consists of a Flash LIDAR for measuring the topography of the landing site, a gimbal to scan across the terrain, and an Inertial Measurement Unit (IMU), along with terrain analysis algorithms to identify the landing site and the local hazards. An FPGA and Manycore processor system was developed to interface all the devices in the HDS, to provide high-resolution timing to accurately measure system state, and to run the surface analysis algorithms quickly and efficiently. In this paper, we will describe how we integrated COTS components such as an FPGA evaluation board, a TILExpress64, and multi-threaded/multi-core aware software to build the HDS Compute Element (HDSCE). The ALHAT program is also working with the NASA Morpheus Project and has integrated the HDS as a sensor on the Morpheus Lander. This paper will also describe how the HDS is integrated with the Morpheus lander and the results of the initial test flights with the HDS installed. We will also describe future improvements to the HDSCE.

Multicore↗

NASA NTRS2013

A hybrid FPGA/Tilera compute element for autonomous hazard detection and navigation

To increase safety for future missions landing on other planetary or lunar bodies, the Autonomous Landing and Hazard Avoidance Technology (ALHAT) program is developing an integrated sensor for autonomous surface analysis and hazard determination. The ALHAT Hazard Detection System (HDS) consists of a Flash LIDAR for measuring the topography of the landing site, a gimbal to scan across the terrain, and an Inertial Measurement Unit (IMU), along with terrain analysis algorithms to identify the landing site and the local hazards. An FPGA and Manycore processor system was developed to interface all the devices in the HDS, to provide high-resolution timing to accurately measure system state, and to run the surface analysis algorithms quickly and efficiently. In this paper, we will describe how we integrated COTS components such as an FPGA evaluation board, a TILExpress64, and multi-threaded/multi-core aware software to build the HDS Compute Element (HDSCE). The ALHAT program is also working with the NASA Morpheus Project and has integrated the HDS as a sensor on the Morpheus Lander. This paper will also describe how the HDS is integrated with the Morpheus lander and the results of the initial test flights with the HDS installed. We will also describe future improvements to the HDSCE.

Trawny, Nikolas↗

NASA NTRS1972

Future techniques for tracking of synchronous satellites

A tracking system error analysis computer program is reported to study the feasibility of using range sum and range-rate sum measurements through a synchronous satellite to a user satellite, and range sum and range-rate sum measurements through a synchronous satellite to a ground based transponder for tracking of synchronous satellites. Error analysis transformed noise, bias, ground station location and orbit uncertainties into expected uncertainties in each of the orbits after tracking. Results show that both of the proposed measurement methods are feasible for determining and refining the orbits of future synchronous satellites.

Cooley, J. L.↗

DOE OSTI2026

Application of artificial intelligence methods in the international roughness index prediction of rigid and composite pavements: a systematic review

The International Roughness Index (IRI) is a widely adopted metric for quantifying pavement roughness, directly influencing vehicle safety, ride comfort, and overall roadway performance. In recent years, the use of Machine Learning (ML) models for IRI prediction has gained momentum, with the goal of improving the allocation of maintenance and rehabilitation resources by enabling accurate assessments of pavement conditions. Most prior reviews, however, have concentrated on flexible pavements, leaving a notable gap regarding rigid and composite pavements. To address this gap, the present study conducts a systematic review of Artificial Intelligence (AI) methods applied to IRI prediction for rigid and composite pavements. Literature published between 2004 and 2025 is synthesized to highlight prevailing trends, methodological contributions, and directions for future research. Particular attention is given to the types of models employed, the datasets used for training and validation, and the role of input variables and data-processing strategies. Across the included studies, ensemble learning methods (especially gradient boosting variants such as XGBoost), artificial neural networks, and hybrid architectures frequently achieved high predictive skill, with several models reporting test-set coefficients of determination approaching 0.9–0.96, indicating strong potential for capturing the influence of traffic, pavement structure, and climatic factors. Since these results are obtained from heterogeneous datasets and evaluation protocols, they are interpreted qualitatively rather than as strict cross-study rankings. Analysis of input variables revealed that pavement age and initial IRI were included in 91% (21 of 23) and 78% (18 of 23) of studies, respectively. Climatic variables such as the freezing index appeared in 57% (13 of 23), while traffic-related factors were considered in 65% (15 of 23). The findings underscore the importance of standardized, high-quality datasets, such as those from the Long-Term Pavement Performance (LTPP) program, along with data consistency, model interpretability, computational efficiency, and replicability in enhancing IRI prediction. Future research should focus on incorporating input variable selection techniques to identify the most influential predictors, thereby improving accuracy and robustness. Integrating these approaches with advanced non-linear data-driven models, coupled with robust hyperparameter optimization, holds considerable promise for strengthening the reliability of IRI prediction and supporting resilient pavement management strategies.

42 ENGINEERING↗

NASA NTRS2020

Multi-Agent Motion Planning using Deep Learning for Space Applications

State-of-the-art motion planners cannot scale to a large number of systems. Motion planning for multiple agents is an NP (non-deterministic polynomial-time) hard problem, so the computation time increases exponentially with each addition of agents. This computational demand is a major stumbling block to the motion planner's application to future NASA missions involving the swarm of space vehicles. We applied a deep neural network to transform computationally demanding mathematical motion planning problems into deep learning-based numerical problems. We showed optimal motion trajectories can be accurately replicated using deep learning-based numerical models in several 2D and 3D systems with multiple agents. The deep learning-based numerical model demonstrates superior computational efficiency with plans generated 1000 times faster than the mathematical model counterpart.

Madani, Ramtin↗

DOE OSTI2021

SST-GPU: A Scalable SST GPU Component for Performance Modeling and Profiling

Programmable accelerators have become commonplace in modern computing systems. Advances in programming models and the availability of unprecedented amounts of data have created a space for massively parallel accelerators capable of maintaining context for thousands of concurrent threads resident on-chip. These threads are grouped and interleaved on a cycle-by-cycle basis among several massively parallel computing cores. One path for the design of future supercomputers relies on an ability to model the performance of these massively parallel cores at scale. The SST framework has been proven to scale up to run simulations containing tens of thousands of nodes. A previous report described the initial integration of the open-source, execution-driven GPU simulator, GPGPU-Sim, into the SST framework. This report discusses the results of the integration and how to use the new GPU component in SST. It also provides examples of what it can be used to analyze and a correlation study showing how closely the execution matches that of a Nvidia V100 GPU when running kernels and mini-apps.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Balar: A SST GPU Component for Performance Modeling and Profiling

Programmable accelerators have become commonplace in modern computing systems. Advances in programming models and the availability of massive amounts of data have created a space for massively parallel accelerators capable of maintaining context for thousands of concurrent threads resident on-chip. These threads are grouped and interleaved on a cycle-by-cycle basis among several massively parallel computing cores. One path for the design of future supercomputers relies on an ability to model the performance of these massively parallel cores at scale. The SST framework has been proven to scale up to run simulations containing tens of thousands of nodes. A previous report described the initial integration of the open-source, execution-driven GPU simulator, GPGPU-Sim, into the SST framework. This report discusses the results of the integration and how to use the new GPU component in SST. It also provides examples of what it can be used to analyze and a correlation study showing how closely the execution matches that of a Nvidia V100 GPU when running kernels and mini-apps.

97 MATHEMATICS AND COMPUTING↗