Search NASA⌕ Search

SEARCH · Search NASA

Results for “Compute”

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

Snowmass Computational Frontier: Topical Group Report on Quantum Computing

Quantum computing will play a pivotal role in the High Energy Physics (HEP) science program over the early parts of the 21$^{st}$ Century, both as a major expansion of our capabilities across the Computational Frontier, and in synthesis with quantum sensing and quantum networks. This report outlines how Quantum Information Science (QIS) and HEP are deeply intertwined endeavors that benefit enormously from a strong engagement together. Quantum computers do not represent a detour for HEP, rather they are set to become an integral part of our discovery toolkit. Problems ranging from simulating quantum field theories, to fully leveraging the most sensitive sensor suites for new particle searches, and even data analysis will run into limiting bottlenecks if constrained to our current computing paradigms. Easy access to quantum computers is needed to build a deeper understanding of these opportunities. In turn, HEP brings crucial expertise to the national quantum ecosystem in quantum domain knowledge, superconducting technology, cryogenic and fast microelectronics, and massive-scale project management. The role of quantum technologies across the entire economy is expected to grow rapidly over the next decade, so it is important to establish the role of HEP in the efforts surrounding QIS. Fully delivering on the promise of quantum technologies in the HEP science program requires robust support. It is important to both invest in the co-design opportunities afforded by the broader quantum computing ecosystem and leverage HEP strengths with the goal of designing quantum computers tailored to HEP science.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
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 OSTI2023

Editorial: Neuroscience, computing, performance, and benchmarks: Why it matters to neuroscience how fast we can compute

At the turn of the millennium the computational neuroscience community realized that neuroscience was in a software crisis: software development was no longer progressing as expected and reproducibility declined. The International Neuroinformatics Coordinating Facility (INCF) was inaugurated in 2007 as an initiative to improve this situation. The INCF has since pursued its mission to help the development of standards and best practices. In a community paper published this very same year, Brette et al. tried to assess the state of the field and to establish a scientific approach to simulation technology, addressing foundational topics, such as which simulation schemes are best suited for the types of models we see in neuroscience. In 2015, a Frontiers Research Topic “Python in neuroscience” by Muller et al. triggered and documented a revolution in the neuroscience community, namely in the usage of the scripting language Python as a common language for interfacing with simulation codes and connecting between applications. The review by Einevoll et al. documented that simulation tools have since further matured and become reliable research instruments used by many scientific groups for their respective questions. Open source and community standard simulators today allow research groups to focus on their scientific questions and leave the details of the computational work to the community of simulator developers. A parallel development has occurred, which has been barely visible in neuroscientific circles beyond the community of simulator developers: Supercomputers used for large and complex scientific calculations have increased their performance from ~10 TeraFLOPS (10 13 floating point operations per second) in the early 2000s to above 1 ExaFLOPS (10 18 floating point operations per second) in the year 2022. This represents a 100,000-fold increase in our computational capabilities, or almost 17 doublings of computational capability in 22 years. Moore's law (the observation that it is economically viable to double the number of transistors in an integrated circuit every other 18–24 months) explains a part of this; our ability and willingness to build and operate physically larger computers, explains another part. It should be clear, however, that such a technological advancement requires software adaptations and under the hood, simulators had to reinvent themselves and change substantially to embrace this technological opportunity. It actually is quite remarkable that—apart from the change in semantics for the parallelization—this has mostly happened without the users knowing. The current Research Topic was motivated by the wish to assemble an update on the state of neuroscientific software (mostly simulators) in 2022, to assess whether we can see more clearly which scientific questions can (or cannot) be asked due to our increased capability of simulation, and also to anticipate whether and for how long we can expect this increase of computational capabilities to continue.

biophysically detailed models↗
DOE OSTI2022

A computationally efficient algorithm for computing convex hull prices

Electricity markets worldwide allow participants to bid non-convex production offers. While non-convex offers can more accurately reflect a resource's capabilities, they create challenges for market clearing processes. For example, system operators may be required to execute side payments to participants whose costs are not covered through energy sales as determined via traditional locational marginal pricing schemes. Convex hull pricing minimizes this and other types of side payments while providing uniform (i.e., locationally and temporally consistent) prices. Computing convex hull prices involves solving either a large-scale linear program or the Lagrangian dual of the corresponding non-convex scheduling problem. Further, the former approach requires explicit descriptions of market participants' convex hulls. While linear programs for computing convex hull prices are large, their structure is naturally decomposable by generators. Here, in this work, we propose and empirically analyze a Benders decomposition approach to computing convex hull prices that leverages recent advances in convex hull formulations for thermal generating units. We demonstrate across a large set of test instances that our decomposition approach only requires modest computational effort, obtaining solutions at least an order of magnitude faster than the equivalent large-scale linear programming approach. Overall, we provide a computationally feasible method for computing convex hull prices for industrial scale market clearing problems, enabling the possibility of practical adoption of this advanced pricing mechanism.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2023

Understanding the Computing and Analysis Needs for Resiliency of Power Systems from Severe Weather Impacts

As the frequency and intensity of severe weather has increased, its effect on the electric grid has manifested in the form of significantly more and larger outages in the United States. This has become especially true for regions that were previously isolated from weather extremes. In this paper, we analyze the weather impacts on the electric power grid across a variety of weather conditions, draw correlations, and provide practical insights into the operational state of these systems. High resolution computational modeling of specific meteorological variables, computational approaches to solving power system models under these conditions, and the types of resiliency needs are highlighted as goal-oriented computing approaches are being built to address grid resiliency needs. An example analysis correlating outages to 1km day-ahead weather from two historical winter storms, calculated on a large cluster using a combination of interpolated and extrapolated inputs from multiple instrumented sites to workflows that produce primary meteorological outputs, is shown as initial proof of concept.

analysis↗
DOE OSTI2021

COVID19 Disease Map, a computational knowledge repository of virus–host interaction mechanisms

We need to effectively combine the knowledge from surging literature with complex datasets to propose mechanistic models of SARS-CoV-2 infection, improving data interpretation and predicting key targets of intervention. Here, we describe a large-scale community effort to build an open access, interoperable and computable repository of COVID-19 molecular mechanisms. The COVID-19 Disease Map (C19DMap) is a graphical, interactive representation of disease-relevant molecular mechanisms linking many knowledge sources. Notably, it is a computational resource for graph-based analyses and disease modelling. To this end, we established a framework of tools, platforms and guidelines necessary for a multifaceted community of biocurators, domain experts, bioinformaticians and computational biologists. The diagrams of the C19DMap, curated from the literature, are integrated with relevant interaction and text mining databases. We demonstrate the application of network analysis and modelling approaches by concrete examples to highlight new testable hypotheses. This framework helps to find signatures of SARS-CoV-2 predisposition, treatment response or prioritisation of drug candidates. Such an approach may help deal with new waves of COVID-19 or similar pandemics in the long-term perspective.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Quantum Computing Technology Roadmaps and Capability Assessment for Scientific Computing - An analysis of use cases from the NERSC workload

The National Energy Research Scientific Computing Center (NERSC), as the high-performance computing (HPC) facility for the Department of Energy’s Office of Science, recognizes the essential role of quantum computing in its future mission. In this report, we analyze the NERSC workload and identify materials science, quantum chemistry, and high-energy physics as the science domains and application areas that stand to benefit most from quantum computers. These domains jointly make up over 50% of the current NERSC production workload, which is illustrative of the impact quantum computing could have on NERSC’s mission going forward. We perform an extensive literature review and determine the quantum resources required to solve classically intractable problems within these science domains. This review also shows that the quantum resources required have consistently decreased over time due to algorithmic improvements and a deeper understanding of the problems. At the same time, public technology roadmaps from a collection of ten quantum computing companies predict a dramatic increase in capabilities over the next five to ten years. Our analysis reveals a significant overlap emerging in this time frame between the technological capabilities and the algorithmic requirements in these three scientific domains. We anticipate that the execution time of large-scale quantum workflows will become a major performance parameter and propose a simple metric, the Sustained Quantum System Performance (SQSP), to compare system-level performance and throughput for a heterogeneous workload.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Transforming Energy through Computational Science: Computing for Clean Energy

This fact sheet discusses the opportunity space for NREL's computational science capabilities to address national clean energy objectives. Achieving a carbon-free power sector by 2035 as a step towards a decarbonized U.S. energy economy in 2050 will require major advances in power generation, autonomous energy systems, transportation, and buildings/communities. Development of integrated modeling approaches for complex energy systems will be essential for deployment. Success requires developments in optimization and control theory, complemented by machine learning (ML) and artificial intelligence (AI), all of which in turn need targeted investments in breadth and scale of computing. This document defines an opportunity space where: embracing computing can link established research and development (R&D) to a decarbonization agenda; pursuing emerging approaches can accelerate the pace of technology advancement across the portfolio; and leading by example could reduce the carbon footprint of computing worldwide.

advanced computing↗
DOE OSTI2020

High-Performance Computing for Earth System Modeling

High-performance computing (HPC) plays an important role during the development of Earth system models. This chapter reviews HPC efforts related to Earth system models, including community Earth system models and energy exascale Earth system models. Specifically, this chapter evaluates computational and software design issues, analyzes several current HPC-related model developments, and provides an outlook for some promising areas within Earth system modeling in the era of exascale computing.

Wang, Dali↗
DOE OSTI2021

Scalable Programming Workflows for Validation of Quantum Computers

Hybrid quantum-classical workflows have become standard methods for executing variational algorithms and other quantum simulation techniques, which are key applications for noisy intermediate scale quantum (NISQ) computers. Validating these simulations is an important task which helps gauge the progress of quantum computer development, and classical simulation can serve as a tool to this end. Both exact and more scalable approximate methods with quantifiable error bounds can be used in validation tasks where the applicable metrics include the distance from a calculable ground truth, the quality of an error model fit to data, etc. Here we present a library extension that includes methods for validation of quantum simulations based on scalable hybrid workflows executable on high performance computers. We provide examples that use approximate methods based on tensor networks and stabilizer simulators to bound the error of quantum simulations on NISQ hardware.

Nguyen, Thien↗
DOE OSTI2020

Computationally aided, entropy-driven synthesis of highly efficient and durable multi-elemental alloy catalysts

Multi-elemental alloy nanoparticles (MEA-NPs) hold great promise for catalyst discovery in a virtually unlimited compositional space. However, rational and controllable synthesize of these intrinsically complex structures remains a challenge. Here, we report the computationally aided, entropy-driven design and synthesis of highly efficient and durable catalyst MEA-NPs. The computational strategy includes prescreening of millions of compositions, prediction of alloy formation by density functional theory calculations, and examination of structural stability by a hybrid Monte Carlo and molecular dynamics method. Selected compositions can be efficiently and rapidly synthesized at high temperature (e.g., 1500 K, 0.5 s) with excellent thermal stability. We applied these MEA-NPs for catalytic NH 3 decomposition and observed outstanding performance due to the synergistic effect of multi-elemental mixing, their small size, and the alloy phase. We anticipate that the computationally aided rational design and rapid synthesis of MEA-NPs are broadly applicable for various catalytic reactions and will accelerate material discovery.

36 MATERIALS SCIENCE↗
NASA NTRS1972

Development of equilibrium air computer programs suitable for numerical computation using time-dependent or shock-capturing methods

Computer programs were developed which compute the thermodynamic properties of equilibrium air for use in either the time-dependent or shock-capturing computational methods. For the time-dependent method, tne NASA-ARC RGAS computer program was modified to allow internal energy and density to be used as the independent variables. In addition, simplified-curve fits for p = p(e,rho), a = a(e,rho), and T = T(p,rho) were devised to reduce computer time. For the shock-capturing method a simplified curve fit for h = h(p,rho) was made. These approximate curve fits may be particularly useful when employed on advanced computers such as the Illiac 4 or the CDC Star since they avoid the cumbersome table-lookup feature of the RGAS program.

Tannehill, J. C.↗
NASA NTRS1973

Design of a fault tolerant airborne digital computer. Volume 2: Computational requirements and technology

This final report summarizes the work on the design of a fault tolerant digital computer for aircraft. Volume 2 is composed of two parts. Part 1 is concerned with the computational requirements associated with an advanced commercial aircraft. Part 2 reviews the technology that will be available for the implementation of the computer in the 1975-1985 period. With regard to the computation task 26 computations have been categorized according to computational load, memory requirements, criticality, permitted down-time, and the need to save data in order to effect a roll-back. The technology part stresses the impact of large scale integration (LSI) on the realization of logic and memory. Also considered was module interconnection possibilities so as to minimize fault propagation.

Ratner, R. S.↗
NASA NTRS1976

Computer-aided design and computer science technology

A description is presented of computer-aided design requirements and the resulting computer science advances needed to support aerospace design. The aerospace design environment is examined, taking into account problems of data handling and aspects of computer hardware and software. The interactive terminal is normally the primary interface between the computer system and the engineering designer. Attention is given to user aids, interactive design, interactive computations, the characteristics of design information, data management requirements, hardware advancements, and computer science developments.

Fulton, R. E.↗
NASA NTRS1983

Numerical computation of transonic flow about wing-fuselage configurations on a vector computer

The transonic wing analysis code TWING, which uses the AF2 relaxation algorithm, has been vectorized to run on the Cray-1S computer. Vectorization of this code improved computational efficiency over that of the CDC 7600 computer by factors of 11 to 13. The improvement compares favorably with the prediction of a theoretical performance model. A convenient generalization now permits the treatment of rudimentary wing-fuselage combinations. Flow predictions for a transport configuration in both isolated-wing and wing-fuselage modes show the expected trends in shock strength and position when compared with wind-tunnel results. An isolated fighter wing is examined in terms of execution time on three different computers and in comparison with experimental data. The computational fluid dynamics code produced during this study is a careful union of an efficient three-dimensional, transonic, numerical algorithm and the vector features presently available on modern computers.

Thomas, S. D.↗
NASA NTRS1985

The science of computing - Parallel computation

Although parallel computation architectures have been known for computers since the 1920s, it was only in the 1970s that microelectronic components technologies advanced to the point where it became feasible to incorporate multiple processors in one machine. Concommitantly, the development of algorithms for parallel processing also lagged due to hardware limitations. The speed of computing with solid-state chips is limited by gate switching delays. The physical limit implies that a 1 Gflop operational speed is the maximum for sequential processors. A computer recently introduced features a 'hypercube' architecture with 128 processors connected in networks at 5, 6 or 7 points per grid, depending on the design choice. Its computing speed rivals that of supercomputers, but at a fraction of the cost. The added speed with less hardware is due to parallel processing, which utilizes algorithms representing different parts of an equation that can be broken into simpler statements and processed simultaneously. Present, highly developed computer languages like FORTRAN, PASCAL, COBOL, etc., rely on sequential instructions. Thus, increased emphasis will now be directed at parallel processing algorithms to exploit the new architectures.

Denning, P. J.↗
NASA NTRS1989

Computational dynamics for robotics systems using a non-strict computational approach

A Non-Strict computational approach for real-time robotics control computations is proposed. In contrast to the traditional approach to scheduling such computations, based strictly on task dependence relations, the proposed approach relaxes precedence constraints and scheduling is guided instead by the relative sensitivity of the outputs with respect to the various paths in the task graph. An example of the computation of the Inverse Dynamics of a simple inverted pendulum is used to demonstrate the reduction in effective computational latency through use of the Non-Strict approach. A speedup of 5 has been obtained when the processes of the task graph are scheduled to reduce the latency along the crucial path of the computation. While error is introduced by the relaxation of precedence constraints, the Non-Strict approach has a smaller error than the conventional Strict approach for a wide range of input conditions.

Orin, David E.↗