Search NASA⌕ Search

SEARCH · Search NASA

Results for “future of computing”

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 613 records · Page 34
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

A crop yield change emulator for use in GCAM and similar models: Persephone v1.0

Abstract. Future changes in Earth system state will impact agricultural yields and, through these changed yields, can have profound impacts on the global economy. Global gridded crop models estimate the influence of these Earth system changes on future crop yields but are often too computationally intensive to dynamically couple into global multi-sector economic models, such as the Global Change Assessment Model (GCAM) and other similar-in-scale models. Yet, generalizing a faster site-specific crop model's results to be used globally will introduce inaccuracies, and the question of which model to use is unclear given the wide variation in yield response across crop models. To examine the feedback loop among socioeconomics, Earth system changes, and crop yield changes, rapidly generated yield responses with some quantification of crop response uncertainty are desirable. The Persephone v1.0 response functions presented in this work are based on the Agricultural Model Intercomparison and Improvement Project (AgMIP) Coordinated Climate-Crop Modeling Project (C3MP) sensitivity test data set and are focused on providing GCAM and similar models with a tractable number of rapid to evaluate dynamic yield response functions corresponding to a range of the yield response sensitivities seen in the C3MP data set. With the Persephone response functions, a new variety of agricultural impact experiments will be open to GCAM and other economic models: for example, examining the economic impacts of a multi-year drought in a key agricultural region and how economic changes in response to the drought can, in turn, impact the drought.

58 GEOSCIENCES↗
DOE OSTI2023

FEOTS v0.0.0: a new offline code for the fast equilibration of tracers in the ocean

Abstract. In this paper we introduce a new software framework for the offline calculation of tracer transport in the ocean. The Fast Equilibration of Ocean Tracers Software (FEOTS) is an end-to-end set of tools to efficiently calculate tracer distributions on a global or regional sub-domain using transport operators diagnosed from a comprehensive ocean model. To the best of our knowledge, this is the first application of a transport matrix model to an eddying ocean state. While a Newton–Krylov-based equilibration capability is still under development and not presented here, we demonstrate in this paper the transient modeling capabilities of FEOTS in an application focused on the Argentine Basin, where intense eddy activity and the Zapiola Anticyclone lead to strong mixing of water masses. The demonstration illustrates progress in developing offline passive tracer simulation capabilities, while highlighting the challenges of the impulse response functions approach in capturing tracer transports by a non-linear advection scheme. Our future work will focus on improving the computational efficiency of the code to reduce time-to-solution, using different basis functions to better represent non-linear advection operators, applying FEOTS to a parent model with unstructured grids (Ocean Model for Prediction Across Scales, MPAS-Ocean), and fully implementing a Newton–Krylov steady-state solver.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2015

Suitability of Synthetic Driving Profiles from Traffic Micro-Simulation for Real-World Energy Analysis: Preprint

A shift towards increased levels of driving automation is generally expected to result in improved safety and traffic congestion outcomes. However, little empirical data exists to estimate the impact that automated driving could have on energy consumption and greenhouse gas emissions. In the absence of empirical data on differences between drive cycles from present day vehicles (primarily operated by humans) and future vehicles (partially or fully operated by computers) one approach is to model both situations over identical traffic conditions. Such an exercise requires traffic micro-simulation to not only accurately model vehicle operation under high levels of automation, but also (and potentially more challenging) vehicle operation under present day human drivers. This work seeks to quantify the ability of a commercial traffic micro-simulation program to accurately model real-world drive cycles in vehicles operated primarily by humans in terms of driving speed, acceleration, and simulated fuel economy. Synthetic profiles from models of freeway and arterial facilities near Atlanta, Georgia, are compared to empirical data collected from real-world drivers on the same facilities. Empirical and synthetic drive cycles are then simulated in a powertrain efficiency model to enable comparison on the basis of fuel economy. Synthetic profiles from traffic micro-simulation were found to exhibit low levels of transient behavior relative to the empirical data. Even with these differences, the synthetic and empirical data in this study agree well in terms of driving speed and simulated fuel economy. The differences in transient behavior between simulated and empirical data suggest that larger stochastic contributions in traffic micro-simulation (relative to those present in the traffic micro-simulation tool used in this study) are required to fully capture the arbitrary elements of human driving. Interestingly, the lack of stochastic contributions from models of human drivers in this study did not result in a significant discrepancy between fuel economy simulations based on synthetic and empirical data; a finding with implications on the potential energy efficiency gains of automated vehicle technology.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2016

Mini-Ckpts: Surviving OS Failures in Persistent Memory

Concern is growing in the high-performance computing (HPC) community on the reliability of future extreme-scale systems. Current efforts have focused on application fault-tolerance rather than the operating system (OS), despite the fact that recent studies have suggested that failures in OS memory are more likely. The OS is critical to a system's correct and efficient operation of the node and processes it governs -- and in HPC also for any other nodes a parallelized application runs on and communicates with: Any single node failure generally forces all processes of this application to terminate due to tight communication in HPC. Therefore, the OS itself must be capable of tolerating failures. In this work, we introduce mini-ckpts, a framework which enables application survival despite the occurrence of a fatal OS failure or crash. Mini-ckpts achieves this tolerance by ensuring that the critical data describing a process is preserved in persistent memory prior to the failure. Following the failure, the OS is rejuvenated via a warm reboot and the application continues execution effectively making the failure and restart transparent. The mini-ckpts rejuvenation and recovery process is measured to take between three to six seconds and has a failure-free overhead of between 3-5% for a number of key HPC workloads. In contrast to current fault-tolerance methods, this work ensures that the operating and runtime system can continue in the presence of faults. This is a much finer-grained and dynamic method of fault-tolerance than the current, coarse-grained, application-centric methods. Handling faults at this level has the potential to greatly reduce overheads and enables mitigation of additional fault scenarios.

Fiala, David↗
DOE OSTI2024

Buffer-IPyC separation process in TRISO fuel particles simulated with Bison code

During High Temperature Gas-cooled Reactor (HTGR) operation, tristructural isotropic (TRISO) coated-particle fuel undergoes irradiation-induced changes in morphology and thermomechanical properties. Experimental results from the Advanced Gas Reactor (AGR) Fuel Development and Qualification Program show, among other things, the mechanism of gap formation between the buffer and inner pyrolytic carbon (IPyC) layers, which could be explored further via computational simulations using the Bison code. Two simulation models were developed, the debonding restricted model, where no gap formation between buffer and IPyC layers is permitted, and the debonding enabled model, where the gap between those layers is created. The inputs of the simulated models are based on the irradiation conditions from the AGR-1 experiment. The research included simulations on spherical and aspherical fuel types. Under the specific temperatures and fluences of the AGR-1 irradiation experiment, and the Bison simulations, it was concluded that the most common scenario is a gap formation along the buffer-IPyC interface, while the least possible scenario is the situation where there is no gap formation at the buffer-IPyC junction. The computational results confirmed that the sphericity of the fuel influences the thickness of the gap that occurs at the buffer-IPyC junction, in a way that with increasing aspect ratio the gap thickness increases. The results obtained for spherical and aspherical fuel are nearly identical. Finally, performed simulations match conclusions observed from the AGR-1 experiment, which as such shows that the Bison code is a good computational method for simulating the TRISO fuel. Future simulations will include the validation of performed research and comparison of the results between Bison and PARFUME codes.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2025

CHEMREASONER: Heuristic Search over a Large Language Model’s Knowledge Space using Quantum-Chemical Feedback

The discovery of new catalysts is essential for the design of new and more efficient chemical processes in order to transition to a sustainable future. We introduce an AI-guided computational screening framework unifying linguistic reasoning with quantum-chemistry based feedback from 3D atomistic representations. Our approach formulates catalyst discovery as an uncertain environment where an agent actively searches for highly effective catalysts via the iterative combination of large language model (LLM)-derived hypotheses and atomistic graph neural network (GNN)-derived feedback. Identified catalysts in intermediate search steps undergo structural evaluation based on spatial orientation, reaction pathways, and stability. Scoring functions based on adsorption energies and barriers steer the exploration in the LLM's knowledge space toward energetically favorable, high-efficiency catalysts. We introduce planning methods that automatically guide the exploration without human input, providing competitive performance against expert-enumerated chemical descriptor-based implementations. By integrating language-guided reasoning with computational chemistry feedback, our work pioneers AI-accelerated, trustworthy catalyst discovery.

artificial intelligence↗
DOE OSTI2020

A Computational Theory for the Emergence of Grammatical Categories in Cortical Dynamics

A general agreement in psycholinguistics claims that syntax and meaning are unified precisely and very quickly during online sentence processing. Although several theories have advanced arguments regarding the neurocomputational bases of this phenomenon, we argue that these theories could potentially benefit by including neurophysiological data concerning cortical dynamics constraints in brain tissue. In addition, some theories promote the integration of complex optimization methods in neural tissue. In this paper we attempt to fill these gaps introducing a computational model inspired in the dynamics of cortical tissue. In our modeling approach, proximal afferent dendrites produce stochastic cellular activations, while distal dendritic branches–on the other hand–contribute independently to somatic depolarization by means of dendritic spikes, and finally, prediction failures produce massive firing events preventing formation of sparse distributed representations. The model presented in this paper combines semantic and coarse-grained syntactic constraints for each word in a sentence context until grammatically related word function discrimination emerges spontaneously by the sole correlation of lexical information from different sources without applying complex optimization methods. By means of support vector machine techniques, we show that the sparse activation features returned by our approach are well suited—bootstrapping from the features returned by Word Embedding mechanisms—to accomplish grammatical function classification of individual words in a sentence. In this way we develop a biologically guided computational explanation for linguistically relevant unification processes in cortex which connects psycholinguistics to neurobiological accounts of language. We also claim that the computational hypotheses established in this research could foster future work on biologically-inspired learning algorithms for natural language processing applications.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2015

High-performance conjugate-gradient benchmark: A new metric for ranking high-performance computing systems

Here, we describe a new high-performance conjugate-gradient (HPCG) benchmark. HPCG is composed of computations and data-access patterns commonly found in scientific applications. HPCG strives for a better correlation to existing codes from the computational science domain and to be representative of their performance. Furthermore, HPCG is meant to help drive the computer system design and implementation in directions that will better impact future performance improvement.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

High-throughput cancer hypothesis testing with an integrated PhysiCell-EMEWS workflow

BackgroundCancer is a complex, multiscale dynamical system, with interactions between tumor cells and non-cancerous host systems. Therapies act on this combined cancer-host system, sometimes with unexpected results. Systematic investigation of mechanistic computational models can augment traditional laboratory and clinical studies, helping identify the factors driving a treatment's success or failure. However, given the uncertainties regarding the underlying biology, these multiscale computational models can take many potential forms, in addition to encompassing high-dimensional parameter spaces. Therefore, the exploration of these models is computationally challenging. We propose that integrating two existing technologiesone to aid the construction of multiscale agent-based models, the other developed to enhance model exploration and optimizationcan provide a computational means for high-throughput hypothesis testing, and eventually, optimization.ResultsIn this paper, we introduce a high throughput computing (HTC) framework that integrates a mechanistic 3-D multicellular simulator (PhysiCell) with an extreme-scale model exploration platform (EMEWS) to investigate high-dimensional parameter spaces. We show early results in applying PhysiCell-EMEWS to 3-D cancer immunotherapy and show insights on therapeutic failure. We describe a generalized PhysiCell-EMEWS workflow for high-throughput cancer hypothesis testing, where hundreds or thousands of mechanistic simulations are compared against data-driven error metrics to perform hypothesis optimization.ConclusionsWhile key notational and computational challenges remain, mechanistic agent-based models and high-throughput model exploration environments can be combined to systematically and rapidly explore key problems in cancer. These high-throughput computational experiments can improve our understanding of the underlying biology, drive future experiments, and ultimately inform clinical practice.

Agent-based model↗
DOE OSTI2020

Beyond Limber: efficient computation of angular power spectra for galaxy clustering and weak lensing

Angular two-point statistics of large-scale structure observables are important cosmological probes. To reach the high accuracy required by the statistical precision of future surveys, some of these statistics may need to be computed without the commonly employed Limber approximation; the exact computation however requires integration over Bessel functions, and a brute-force evaluation is slow to converge. Here, we present a new method based on our generalized FFTLog algorithm for the efficient computation of angular power spectra beyond the Limber approximation. The new method significantly simplifies the calculation and improves the numerical speed and stability. It is easily extended to handle integrals involving derivatives of Bessel functions, making it equally applicable to numerically more challenging cases such as contributions from redshift-space distortions and Doppler effects. We implement our method for galaxy clustering and galaxy-galaxy lensing power spectra. We find that using the Limber approximation for galaxy clustering in future analyses like LSST Year 1 and DES Year 6 may cause significant biases in cosmological parameters, indicating that going beyond the Limber approximation is necessary for these analyses.

weak gravitational lensing↗
DOE OSTI2024

Object Proxy Patterns for Accelerating Distributed Applications

Workflow and serverless frameworks have empowered new approaches to distributed application design by abstracting compute resources. However, their typically limited or one-size-fits-all support for advanced data flow patterns leaves optimization to the application programmer—optimization that becomes more difficult as data become larger. The transparent object proxy, which provides wide-area references that can resolve to data regardless of location, has been demonstrated as an effective low-level building block in such situations. Here we propose three high-level proxy-based programming patterns—distributed futures, streaming, and ownership—that make the power of the proxy pattern usable for more complex and dynamic distributed program structures. We motivate these patterns via careful review of application requirements and describe implementations of each pattern. As a result, we evaluate our implementations through a suite of benchmarks and by applying them in three meaningful scientific applications, in which we demonstrate substantial improvements in runtime, throughput, and memory usage.

Distributed Computing↗
DOE OSTI2020

Projecting Antarctica's contribution to future sea level rise from basal ice shelf melt using linear response functions of 16 ice sheet models (LARMIP-2)

Abstract. The sea level contribution of the Antarctic ice sheet constitutes a large uncertainty in future sea level projections. Here we apply a linear response theory approach to 16 state-of-the-art ice sheet models to estimate the Antarctic ice sheet contribution from basal ice shelf melting within the 21st century. The purpose of this computation is to estimate the uncertainty of Antarctica's future contribution to global sea level rise that arises from large uncertainty in the oceanic forcing and the associated ice shelf melting. Ice shelf melting is considered to be a major if not the largest perturbation of the ice sheet's flow into the ocean. However, by computing only the sea level contribution in response to ice shelf melting, our study is neglecting a number of processes such as surface-mass-balance-related contributions. In assuming linear response theory, we are able to capture complex temporal responses of the ice sheets, but we neglect any self-dampening or self-amplifying processes. This is particularly relevant in situations in which an instability is dominating the ice loss. The results obtained here are thus relevant, in particular wherever the ice loss is dominated by the forcing as opposed to an internal instability, for example in strong ocean warming scenarios. In order to allow for comparison the methodology was chosen to be exactly the same as in an earlier study (Levermann et al., 2014) but with 16 instead of 5 ice sheet models. We include uncertainty in the atmospheric warming response to carbon emissions (full range of CMIP5 climate model sensitivities), uncertainty in the oceanic transport to the Southern Ocean (obtained from the time-delayed and scaled oceanic subsurface warming in CMIP5 models in relation to the global mean surface warming), and the observed range of responses of basal ice shelf melting to oceanic warming outside the ice shelf cavity. This uncertainty in basal ice shelf melting is then convoluted with the linear response functions of each of the 16 ice sheet models to obtain the ice flow response to the individual global warming path. The model median for the observational period from 1992 to 2017 of the ice loss due to basal ice shelf melting is 10.2 mm, with a likely range between 5.2 and 21.3 mm. For the same period the Antarctic ice sheet lost mass equivalent to 7.4 mm of global sea level rise, with a standard deviation of 3.7 mm (Shepherd et al., 2018) including all processes, especially surface-mass-balance changes. For the unabated warming path, Representative Concentration Pathway 8.5 (RCP8.5), we obtain a median contribution of the Antarctic ice sheet to global mean sea level rise from basal ice shelf melting within the 21st century of 17 cm, with a likely range (66th percentile around the mean) between 9 and 36 cm and a very likely range (90th percentile around the mean) between 6 and 58 cm. For the RCP2.6 warming path, which will keep the global mean temperature below 2 ∘C of global warming and is thus consistent with the Paris Climate Agreement, the procedure yields a median of 13 cm of global mean sea level contribution. The likely range for the RCP2.6 scenario is between 7 and 24 cm, and the very likely range is between 4 and 37 cm. The structural uncertainties in the method do not allow for an interpretation of any higher uncertainty percentiles. We provide projections for the five Antarctic regions and for each model and each scenario separately. The rate of sea level contribution is highest under the RCP8.5 scenario. The maximum within the 21st century of the median value is 4 cm per decade, with a likely range between 2 and 9 cm per decade and a very likely range between 1 and 14 cm per decade.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

5G Enabled Transformative Co-design and Co-simulation Framework for Grid Decarbonization and Modernization

5G is a breakthrough technology to enable a fully mobile and connected society, and a 5G-enabled digital continuum will be one of the critical foundations for clean energy economy and grid modernization. The clean energy transformation not only requires innovative manufacturing, algorithm, application, and cross-domain co-simulation, but also a systematic evaluation and comprehensive support on the microelectronic and architectural computing customization to enable and maximize the high renewable penetration in the future power grid. The co-design of decarbonized grid, reliable yet efficient communication, and affordable yet ubiquitous computing will unlock the potential of almost any available tools for the undergoing clean energy transformation. 5G is also an opportunity to rethink the paradigm of infrastructure planning, as computing will be one of the core services for society alongside electricity and communication services.

5G↗
DOE OSTI2017

Seventy Years of Computing in the Nuclear Weapons Program

Los Alamos has continuously been on the forefront of scientific computing since it helped found the field. This talk will explore the rich history of computing in the Los Alamos weapons program. The current status of computing will be discussed, as will the expectations for the near future.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗
DOE OSTI2016

Basic Research Needs Workshop on Synthesis Science for Energy Relevant Technology

The technology that lies at our fingertips becomes more powerful each day. Smartphones connect us instantly to family, friends, and co-workers around the globe; give us access to a limitless stream of information; control the heating in our homes; and serve as our cameras, calculators, flashlights, music players, boarding passes and, on occasion, our phones. Cars are ever more fuel-efficient, safer, semi-autonomous, and have more computing power than the systems that guided humankind to the moon. LED lighting and solar panels are becoming commonplace, replacing less efficient technologies and expanding the energy options available worldwide. Novel polymers and nanoparticles are playing a crucial role in enhanced oil recovery. None of these advances would have been possible without the discovery and development of, and ability to create, new materials and chemical processes. Now imagine what our world would be like if we could accelerate those discoveries a thousandfold. What if the only limit to synthesizing new forms of matter were the imagination? We could build complex assemblies of atoms and molecules with architectures and capabilities far exceeding those of materials found in nature—for example, develop catalysts that turn garbage into fuels, design solar cells to power our homes directly from sunlight, make batteries with the energy density of gasoline, and create one- and two-dimensional solids that transport charge hundreds of times faster than silicon or allow us to build quantum bits based on the spins of electrons or photons to realize the promise of “beyond Moore’s law” computing. Advances in synthesis science are required to bring about this future—we not only must know how to design new molecules and materials with desired functions and properties through theory and computational techniques; we also must be able to make the materials we envision. New approaches to discovering as yet unimagined matter require a sea change in the way we think about the science of synthesis. Chemical and materials sciences have traditionally focused on understanding structure–function relationships with the goal of predicting where the atoms should be placed to achieve a targeted property or process. Much less effort has been directed toward a predictive science of synthesis—understanding how to get the atoms where they need to go to achieve the desired structure. This report, which is the result of the Basic Energy Sciences Workshop on Basic Research Needs for Synthesis Science for Energy Technologies, lays out the scientific challenges and opportunities in synthesis science. The workshop was attended by more than 100 leading national and international scientific experts. Its five topical and two crosscutting panels identified four priority research directions (PRDs) for realizing the vision of predictive, science-directed synthesis.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2021

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

DUNE Software and Computing Challenges

The DUNE experiment will begin running in the late 2020's. The goals of the experiment include 1) studying neutrino oscillations using a beam of neutrinos from Fermilab in Illinois to the Sanford Underground Research Facility, 2) studying astrophysical neutrino sources and rare processes and 3) understanding the physics of neutrino interactions in matter. The DUNE Far Detector, consisting of four 17 kt LArTPC modules, will produce "events" rang-ing in size from 6 GBs to more than 100 TBs, posing unique challenges for DUNE software and computing. The data processing algorithms, particularly for raw data, drive the requirements for the future DUNE software framework documented here.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Ising-Traffic: Using Ising Machine Learning to Predict Traffic Congestion under Uncertainty

This paper addresses the challenges in accurate and realtime traffic congestion prediction with uncertainty by proposing Ising-Traffic, a novel quantum-inspired dual-model Ising based traffic prediction framework which delivers higher accuracy and lower latency than SOTA solutions. While traditional and deep learning methods face the trade-off between algorithm complexity and computational efficiency, our Ising-based method leverages Ising’s inherent and unique capability of finding the state of a system with the lowest energy and applying it to traffic prediction. In this work, traffic prediction under uncertainty is formulated into two separate Ising models: Reconstruct-Ising and Predict-Ising. Reconstruct-Ising is mapped onto modern Ising machine and handles uncertainty in traffic accurately with negligible latency and energy consumption, while Predict-Ising is mapped onto traditional processors and predicts future congestion precisely with only at most 1.8% computational demands of existing solutions. Our evaluation shows Ising-Traffic delivers on average 98× speedups and 5% accuracy improvement over SOTA.

traffic flow control, Ising↗