SEARCH · Search NASA
Results for “computational”
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.
Computer architectures for computational physics work done by Computational Research and Technology Branch and Advanced Computational Concepts Group
Slides are reproduced that describe the importance of having high performance number crunching and graphics capability. They also indicate the types of research and development underway at Ames Research Center to ensure that, in the near term, Ames is a smart buyer and user, and in the long-term that Ames knows the best possible solutions for number crunching and graphics needs. The drivers for this research are real computational physics applications of interest to Ames and NASA. They are concerned with how to map the applications, and how to maximize the physics learned from the results of the calculations. The computer graphics activities are aimed at getting maximum information from the three-dimensional calculations by using the real time manipulation of three-dimensional data on the Silicon Graphics workstation. Work is underway on new algorithms that will permit the display of experimental results that are sparse and random, the same way that the dense and regular computed results are displayed.
Hierarchical calibration and validation framework of bench-scale computational fluid dynamics simulations for solvent-based carbon capture. Part 2: Chemical absorption across a wetted wall column: Original Research Article: Hierarchical calibration and validation framework of bench-scale computational fluid dynamics simulations
Part 1 of this paper presents a numerical model for non-reactive physical mass transfer across a wetted wall column (WWC). In Part 2, we improved the existing computational fluid dynamics (CFD) model to simulate chemical absorption occurring in a WWC as a bench-scale study of solvent-based carbon dioxide (CO 2 ) capture. In this study, to generate data for WWC model validation, CO 2 mass transfer across a monoethanolamine (MEA) solvent was first measured on a WWC experimental apparatus. The numerical model developed in this work can account for both chemical absorption and desorption of CO 2 in MEA. In addition, the overall mass transfer coefficient predicted using traditional/empirical correlations is conducted and compared with CFD prediction results for both steady and wavy falling films. A Bayesian statistical calibration algorithm is adopted to calibrate the reaction rate constants in chemical absorption/desorption of CO 2 across a falling film of MEA. The posterior distributions of the two transport properties, i.e., Henry's constant and gas diffusivity in the non-reacting nitrous oxide (N 2 O)/MEA system obtained from Part 1 of this study, serves as priors for the calibration of CO 2 reaction rate constants after using the N 2 O/CO 2 analogy method. Finally, the calibrated model can be used to predict the CO 2 mass transfer in a WWC for a wider range of operating conditions.
A general purpose computer-to-computer interface Xerox Sigma computer-to-DEC PDP 11 computer
The Sigma/PDP 11 Interface is a general-purpose system for interconnecting a Xerox Sigma series computer and a DEC PDP 11 series computer. Although the unit is designed to operate in a real-time environment, it can be used in nonreal-time modes as well. Several features, designed to facilitate using the system in varied applications are included in the unit; for example, the features can be used to isolate software or hardware faults. This paper contains descriptions of the hardware and software operations of the interface and examples of real-time applications in the research environment at Ames Research Center.
Accelerating Simulation for High-Fidelity PV Inverter System Reliability Assessment with High-Performance Computing
The overall cost of photovoltaic (PV) systems has shown a downward trend during the last decade; however, PV inverter failures account for the highest cost of operation and maintenance. To address this, reliability tools with powerful computation and better accuracy are required for the lifetime prediction and degradation evaluation of PV inverters. This paper proposes an event-driven parallel computing-based simulator. The proposed simulator applies high-performance computing techniques and other accessory optimization techniques-including cluster merging, adaptive model updates, and steady-state identification-to make reliability assessments for PV inverters under given input mission profiles and operating conditions with high efficiency and high fidelity. The main idea of the simulator and its workflow are introduced. Then, a demo PV inverter system simulator is implemented, and the speedup of the total simulations of the switching model reaches 123.03 times.
Modulating factors of hydrologic exchanges in a large-scale river reach: Insights from three-dimensional computational fluid dynamics simulations
Hyporheic exchange is a critical mechanism shaping hydrological and biogeochemical processes along a river corridor. Recent studies on quantifying the hyporheic exchange were mostly limited to local scales due to field inaccessibility, computational demand, and complexity of geomorphology and subsurface geology. Surface flow conditions and subsurface physical properties are well known factors on modulating the hyporheic exchange, but quantitative understanding of their impacts on the strength and direction of hyporheic exchanges at reach scales is absent. In this study, a high resolution computational fluid dynamics (CFD) model that couples surface and subsurface flow and transport is employed to simulate hyporheic exchanges in a 7-km long reach along the main-stem of the Columbia River. Assuming that the hyporheic exchange does not affect surface water flow conditions due to its negligible magnitude compared to the volume and velocity of river water, we developed a one-way coupled surface and subsurface water flow model using the commercial CFD software STAR-CCM+. The model integrates the Reynolds-averaged Navier-Stokes (RANS) equation solver with a realizable k-e two-layer turbulence model, a two-layer all y^+ wall treatment, and the volume of fluid (VOF) method, and is used to simulate hyporheic exchanges by tracking the free water-air interface as well as flow in the river and the subsurface porous media. The model is validated against measurements from acoustic Doppler current profiler (ADCP) in the stream water and hyporheic fluxes derived from a set of temperature profilers installed across the riverbed. The validated model is then employed to systematically investigate how hyporheic exchanges are influenced by surface water fluid dynamics strongly regulated by upstream dam operations, as well as subsurface structures (e.g. thickness of riverbed and subsurface formation layers) and hydrogeological properties (e.g. permeability). The results suggest that the thickness of riverbed alluvium layer is the dominant factor for reach-scale hyporheic exchanges, followed by the alluvium permeability, the depth of the underlying impermeable layer, and the assumption of hydrostatic pressure.
Translational computer science at the scientific computing and imaging institute
Not provided.
Computational complexity of the landscape II—Cosmological considerations
We propose a new approach for multiverse analysis based on computational complexity, which leads to a new family of “computational” measure factors. By defining a cosmology as a space–time containing a vacuum with specified properties (for example small cosmological constant) together with rules for how time evolution will produce the vacuum, we can associate global time in a multiverse with clock time on a supercomputer which simulates it. We argue for a principle of “limited computational complexity” governing early universe dynamics as simulated by this supercomputer, which translates to a global measure for regulating the infinities of eternal inflation. The rules for time evolution can be thought of as a search algorithm, whose details should be constrained by a stronger principle of “minimal computational complexity”. Unlike previously studied global measures, ours avoids standard equilibrium considerations and the well-known problems of Boltzmann Brains and the youngness paradox. We also give various definitions of the computational complexity of a cosmology, and argue that there are only a few natural complexity classes.
Computations of permeability of large rock images by dual grid domain decomposition
Not Available
Linking process and structure in the friction stir scribe joining of dissimilar materials: A computational approach with experimental support
We present that friction stir welding (FSW) is a popular technique to join dissimilar materials in numerous applications. The solid state nature of the process enables joining materials with strikingly different physical properties. For welds in lap configuration, an enhancement to this technology is made by introducing a short, hard insert, referred to as a cutting-scribe, at the bottom of the tool pin. The cutting-scribe induces deformation in the bottom plate which leads to the formation of mechanical interlocks or hook like structures at the interface of two materials. A thermo-mechanical computational model employing a coupled Eulerian-Lagrangian approach is developed to quantitatively capture the morphology of these interlocks during the FSW process. Simulations using this model are validated by experimental observations. In conclusion, the identified interface morphology coupled with the predicted temperature field from this process–structure model can be used to estimate the post-weld microstructure and joint strength.
Reconfigurable G and C computer study for space station use. Volume 7, appendix 5 - D-200 computer family. Appendix 6 - System error analysis. Appendix 7 - Reliability derivation for candidate computers. Appendix 8 - Power converter design data. Appendix 9 - Data transmission medium design Final report, 29 Dec. 1969 - 31 Jan. 1971
D-200 computer family, system error analysis, reliability derivation, and power converter design for reconfigurable guidance and control computer - Vol. 7
Computational Complexity of Neuromorphic Algorithms
Neuromorphic computing has several characteristics that make it an extremely compelling computing paradigm for post Moore computation. Some of these characteristics include intrinsic parallelism, inherent scalability, collocated processing and memory, and event-driven computation. While these characteristics impart energy efficiency to neuromorphic systems, they do come with their own set of challenges. One of the biggest challenges in neuromorphic computing is to establish the theoretical underpinnings of the computational complexity of neuromorphic algorithms. In this paper, we take the first steps towards defining the space and time complexity of neuromorphic algorithms. Specifically, we describe a model of neuromorphic computation and state the assumptions that govern the computational complexity of neuromorphic algorithms. Next, we present a theoretical framework to define the computational complexity of a neuromorphic algorithm. We explicitly define what space and time complexities mean in the context of neuromorphic algorithms based on our model of neuromorphic computation. Finally, we leverage our approach and define the computational complexities of six neuromorphic algorithms: constant function, successor function, predecessor function, projection function, neuromorphic sorting algorithm and neighborhood subgraph extraction algorithm.
New trends in photonic switching and optical networking architectures for data centers and computing systems [Invited]
The rapid increases in data traffic coupled with user preferences are driving the data center and computing system service providers to offer energy-efficient, intelligent, flexible, cost-effective, high-capacity, and low-latency data services without added complexity to the users. Disaggregated heterogeneous reconfigurable computing systems realized by photonic switching and interconnects can enhance throughput and energy efficiency for artificial intelligence/machine learning (AI/ML) workloads, especially when aided by the AI/ML-enhanced control plane. Photonic switching and new optical networking architectures are expected to solve many of these challenging problems. This paper discusses new trends in photonic switching and optical network architectures for future data centers and computing systems summarized as follows: (1) flat reconfigurable disaggregated computing enabled by high-radix photonic switching and interconnects in data centers; (2) chiplet-based computing architectures empowered by embedded photonics toward heterogeneous reconfigurable computing; (3) nanosecond-scale photonic switching in data centers and computing systems; (4) AI/ML in self-driving, application-aware, and situation-aware data centers; (5) the emergence of flexible networking for cloud computing, edge computing, and split computing, as well as flexible networking for 5G/6G RF-optical networks; and (6) the deployment of embedded co-designed silicon photonics being considered for future data centers.
Electronic structure simulations in the cloud computing environment
The transformative impact of modern computational paradigms and technologies, such as high-performance computing, quantum computing, and cloud computing, has opened up profound new opportunities for scientific simulations. Scalable computational chemistry is one beneficiary of this technological progress. The main focus of this paper is on the performance of various quantum chemical formulations, ranging from low-order methods to high-accuracy approaches, implemented in different computational chemistry packages, such as NWChem, NWChemEx, SPEC, ExaChem, and FLOSIC codes on the Azure Quantum Element (AQE) Microsoft cloud services. We pay particular attention to the intricate workflows for performing composite chemistry simulations, associated data curation, and mechanisms for accuracy assessment, as defined by the enabling cloud Computational Chemistry as a Service (CCaaS). Our focus also extends to Arrows' automated workflow for high throughput simulations. Finally, we provide a perspective on the role of cloud computing in supporting the mission of leadership computational facilities (LCFs).
Distributing an executable job load file to compute nodes in a parallel computer
Distributing an executable job load file to compute nodes in a parallel computer, the parallel computer comprising a plurality of compute nodes, including: determining, by a compute node in the parallel computer, whether the compute node is participating in a job; determining, by the compute node in the parallel computer, whether a descendant compute node is participating in the job; responsive to determining that the compute node is participating in the job or that the descendant compute node is participating in the job, communicating, by the compute node to a parent compute node, an identification of a data communications link over which the compute node receives data from the parent compute node; constructing a class route for the job, wherein the class route identifies all compute nodes participating in the job; and broadcasting the executable load file for the job along the class route for the job.
Distributing an executable job load file to compute nodes in a parallel computer
Distributing an executable job load file to compute nodes in a parallel computer, the parallel computer comprising a plurality of compute nodes, including: determining, by a compute node in the parallel computer, whether the compute node is participating in a job; determining, by the compute node in the parallel computer, whether a descendant compute node is participating in the job; responsive to determining that the compute node is participating in the job or that the descendant compute node is participating in the job, communicating, by the compute node to a parent compute node, an identification of a data communications link over which the compute node receives data from the parent compute node; constructing a class route for the job, wherein the class route identifies all compute nodes participating in the job; and broadcasting the executable load file for the job along the class route for the job.
Extreme Heterogeneity 2018 - Productive Computational Science in the Era of Extreme Heterogeneity: Report for DOE ASCR Workshop on Extreme Heterogeneity
The 2018 Basic Research Needs Workshop on Extreme Heterogeneity identified five Priority Research Directions for realizing the capabilities needed to address the challenges posed in this era of rapid technological change. This report captures the outcomes of that workshop. In the context of extreme heterogeneity, it defines basic research needs and opportunities in computer science research to develop smart and trainable operating and runtime systems, programming environments, and predictive tools that will make future systems easier to adapt to scientists’ computing needs and easier for facilities to deploy securely.