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 1,603 records · Page 89
All sourcesNASA NTRSDOE OSTI
NASA NTRS2023

Development of a Computational Fluid Dynamics Model for a High-Speed Centrifugal Compressor

Computational fluid dynamics (CFD) has become widely used in the design and analysis of turbomachinery components such as centrifugal compressors. However, CFD is only a limited representation of experimental cases and struggles to model complex flows or can lack small model details to increase computation speed. To make advancements in compressor technology, designers need tools like CFD that can help them predict flow behavior in new designs. The High Efficiency Centrifugal Compressor (HECC) was designed by United Technologies Research Center (UTRC) for NASA to investigate the difficulties behind improving centrifugal compressor technology and to provide an open case to the turbomachinery research community. CFD analysis was completed by UTRC to aid in the design process. The pre-test study significantly overpredicted the compressor’s performance, and while post-test analysis was more representative, its results have yet to be publicly available. CFD technology has also since improved in recent years. In this study, a high-fidelity computational model for the vaneless configuration of HECC operating at its design point was developed and compared to an equivalent experimental case. This model incorporated GPU versions of mesh generation and solver codes from AeroDynamic Solutions, Inc. The development of such a model is significant since there has yet to be a published numerical simulation of HECC’s vaneless configuration. Additionally, the use of GPU codes decreases computation times for the model, which has allowed for the inclusion of impeller blade fillets. Initial results showed a general overprediction of compressor performance by the model. Predictions were more accurate for the impeller compared to predictions for the full compressor stage. Spanwise analyses showed that the model tended to follow flow behavior patterns exhibited in the experiment. Beyond this study, this model will be iterated upon and experimentally validated to further examine HECC performance.

centrifugal compressor↗
NASA NTRSDate not supplied

Efficient Implementation for Unitary Coupled Cluster State Preparation for Near-Term Quantum Computers

Unitary coupled cluster theory (UCC) is a common wave function ansatz for quantum simulation of molecular electronic structure using the variational quantum eigenvalue solver (VQE). Even for small molecules using a double-ζ basis, the number of variational parameters required to minimize the electronic energy (i.e., optimize the circuit) is large and beyond the reach of current quantum computers. For example, a circuit simulating C2 using the UCCSD ansatz and the cc-pVDZ basis set with frozen-core will require over 10,000 variational parameters and a Hilbert space of over 10^(8) determinants. To make progress on simulating such molecular systems on near-term quantum computers, we explore how much of the optimization can be approximately prepared with classical simulation while reducing the number of optimization steps performed on a quantum device. Recently, Chen, Cheng, and Freericks [J. Chem. Theory Comput. 2021, 17, 841-847] presented an algorithm for the factorized form of the UCC ansatz that allows for efficient UCC optimizations on classical hardware. We flip the algorithm around and use it to prepare approximate quantum circuits for systems that require a large number of qubits to represent. We will present results from our implementation and discuss strategies for incorporating this implementation for algorithms involving near-term quantum computers.

Quantum Computing↗
NASA NTRSDate not supplied

Efficient Implementation for Unitary Coupled Cluster State Preparation for Near-Term Quantum Computers

Unitary coupled cluster theory (UCC) is a common wave function ansatz for quantum simulation of molecular electronic structure using the variational quantum eigenvalue solver (VQE). Even for small molecules using a double-ζ basis, the number of variational parameters required to minimize the electronic energy (i.e., optimize the circuit) is large and beyond the reach of current quantum computers. For example, a circuit simulating C2 using the UCCSD ansatz and the cc-pVDZ basis set with frozen-core will require over 10,000 variational parameters and a Hilbert space of over 10^(8) determinants. To make progress on simulating such molecular systems on near-term quantum computers, we explore how much of the optimization can be approximately prepared with classical simulation while reducing the number of optimization steps performed on a quantum device. Recently, Chen, Cheng, and Freericks [J. Chem. Theory Comput. 2021, 17, 841-847] presented an algorithm for the factorized form of the UCC ansatz that allows for efficient UCC optimizations on classical hardware. We flip the algorithm around and use it to prepare approximate quantum circuits for systems that require a large number of qubits to represent. We will present results from our implementation and discuss strategies for incorporating this implementation for algorithms involving near-term quantum computers.

Quantum Computing↗
DOE OSTI2017

Distributed metadata in a high performance computing environment

A computer-executable method, system, and computer program product for managing meta-data in a distributed storage system, wherein the distributed storage system includes one or more burst buffers enabled to operate with a distributed key-value store, the co computer-executable method, system, and computer program product comprising receiving a request for meta-data associated with a block of data stored in a first burst buffer of the one or more burst buffers in the distributed storage system, wherein the meta data is associated with a key-value, determining which of the one or more burst buffers stores the requested metadata, and upon determination that a first burst buffer of the one or more burst buffers stores the requested metadata, locating the key-value in a portion of the distributed key-value store accessible from the first burst buffer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Non-harmful insertion of data mimicking computer network attacks

Non-harmful data mimicking computer network attacks may be inserted in a computer network. Anomalous real network connections may be generated between a plurality of computing systems in the network. Data mimicking an attack may also be generated. The generated data may be transmitted between the plurality of computing systems using the real network connections and measured to determine whether an attack is detected.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Why wait? Let's start computing while data is still on the wire

In this era of Big Data, computing useful information from data is becoming increasingly complicated, particularly due to the ever increasing volumes of data that need to travel over the network to data centers to be stored and processed, all highly expensive operations in the long haul. In this paper we suggest that we can do computing and analysis of data "on the wire," i.e., while data is still in transit. The nature of these computations include analysis, visualization, pattern recognition, and prediction, or forecasting, on the streaming data. We follow a service function chaining architecture to implement this, assuming that the data packets arrive within a single network administrative domain. As a demonstration of this new computing paradigm, we present three examples. Firstly, we demonstrate pattern recognition and data visualization on streaming forex data, which can be used for lucrative trading in the forex market. In our second example, we analyze and learn user buying patterns from clickstream data streaming from multiple websites. Finally, we monitor solar sensors for a zero reading while the packets are still on their way to the data center, to schedule any maintenance and requisite repairs with no time delay.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Checkpointing using compute node health information

A method is disclosed, as well as an associated apparatus and computer program product, for checkpointing using a plurality of communicatively coupled compute nodes. The method comprises acquiring health information for a first node of the plurality of compute nodes, and determining a first failure probability for the first node using the health information. The first failure probability corresponds to a predetermined time interval. The method further comprises selecting a second node of the plurality of compute nodes as a partner node for the first node. The second node has a second failure probability for the time interval. A composite failure probability of the first node and the second node is less than the first failure probability. The method further comprises copying checkpoint information from the first node to the partner node.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Systems, methods and computer program products for constructing complex geometries using layered and linked hexahedral element meshes

Systems, methods and computer program products for creating 3D representations of bodies are disclosed. The systems, methods and computer program products include the construction of FE meshes representing complex geometries. The complex geometries may be artificially or naturally formed or designed geometries. The techniques reduce the number of elements as much as possible to save on computer run time while maintaining computational accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A Generic Advanced Computing Framework for Executing Windows-based Dynamic Contingency Analysis Tool in Parallel on Cluster Machines

Dynamic contingency analysis tool (DCAT) has been developed to assess the impact and likelihood of extreme contingencies and potential cascading events across their systems and interconnections. By including more customized protection models and corrective actions into the Windows-based commercial tools, DCAT can help operators understand the cascading behavior and find mitigation approaches to reduce the risk of cascading outages in a more realistic manner. In order to further enhance the capability of DCAT, this paper presents a design of an advanced computing framework that enables DCAT to run on a cluster machine to improve its computational performance. This framework is generic and can be applied to other Windows-based simulation tools to fill the technical gap of applying advanced computing technology to vendors' Windows-based tools. The preliminary tests using medium to large power systems have shown the effectiveness of this framework and its potential for accelerating the adoption of advanced computing in utilities.

Advanced computing, dynamic contingency analysis, ↗
DOE OSTI2023

Late Breaking Results: COPPER: Computation Obfuscation by Producing Permutations for Encoding Randomly

Deployed embedded devices face security risks due to increased ease of physical access to the devices by unauthorized users. Capable adversaries can intercept a device to recover the data in memory, including results of performed sensitive computations. Device owners require data confidentiality on their physically insecure devices. To satisfy this goal we implement a novel method, COPPER (Computation Obfuscation by Producing Permutations for Encoding Randomly), to create data which never exists on the device digitally in plaintext format and which is subsequently used for computation. In this paper we utilize COPPER to calculate a moving average computation on encoded data.

embedded systems↗
DOE OSTI2017

Computer Security for I and C Systems at Nuclear Facilities - 116

Cyber-attacks on Instrumentation and Control (I and C) systems may jeopardize the safety and security of nuclear facilities by contributing to sabotage or aiding in the unauthorized removal of nuclear material. The effects of cyber-attacks on I and C systems important to safety to safety may result in a wide range of consequences, such as a temporary loss of process control or unacceptable radiological consequences. Public awareness of cyber-attacks that affect I and C systems may also undermine confidence in the safety and security of nuclear facilities. The International Atomic Energy Agency (IAEA) recognizes the need for the guidance on the protection of I and C systems that provide safety, security, or auxiliary functions at nuclear facilities from cyber-attacks. To meet this need, The IAEA has developed a new Nuclear Security Series publication with the provisional title Computer Security of Instrumentation and Control Systems at Nuclear Facilities which builds upon and expands the guidance published in Nuclear Security Series No. 17 Computer Security at Nuclear Facilities (2011) . This publication will be formally released in 2017 as Technical Guidance and will be the second international consensus publication dedicated to Computer Security at Nuclear Facilities. It was developed in parallel with the new IAEA Nuclear Safety publications providing recommendations on I and C systems at research reactors (RR) and nuclear power plants (NPP) . The purpose of this paper is to provide an overview of this publication and its application. The paper will also discuss its relation to other IAEA Nuclear Security Series (NSS) publications on computer security. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2017

CUDA Computation of the Feynman Distribution

In 2006, NVIDIA Corporation introduced the Computer Unified Device Architecture (CUDA) for C, C++, and Fortran programming languages. The CUDA parallel computing platform uses the Graphics Processing Unit (GPU) of NVIDIA graphics card, and it is designed for parallel computations. In these computations, the same algorithms are executed on the data in parallel. The GPU contains many Streaming Multiprocessors (SM) that can independently execute blocks of threads. A thread is a sequence of serial programmed instructions. The SM executes threads in groups of 32 and a group of 32 threads is called warp. The threads within a block can be synchronized and have access to a shared memory that is visible only to them. Conversely, blocks of threads cannot be synchronized and have access only to the global memory of the graphics card. This memory is called device memory and is independent of the host memory controlled by the Central Processing Unit (CPU). A single thread has access to a local memory (register) that is not visible to any other thread. The part of the program that is executed on the graphics card is called kernel. Each thread of the kernel has a unique identification index that is accessible by the in-built variable threadIdx; the latter is a 3-component vector. A threads block can contain up to 1024 threads. Blocks of threads have a unique identification index that is accessible by the in-built variable blockIdx; the latter is a 3-component vector. The in-built variable blockDim contains the number of threads per block; this variable is a 3-component vector. Threads and blocks represent different levels of parallelism; a kernel is executed as a grid of blocks of threads. Figure 1 illustrates a grid of thread blocks for a GPU with 2 SM. A SM can execute multiple blocks of threads in parallel; a block of threads is executed on a single SM. A GPU can execute multiple kernels concurrently. This work has used the Quadro M5000 graphics card with the following technical specifications: - 2048 cores with 861 MHz frequency, - 16 streaming multiprocessors, - 5.2 trillion transistors, - 8.2 Gb device memory, - 64 kb register memory (per thread), - 48 kb shared memory (per block) - 211.6 GB/s memory bandwidth, and - 3.5 GFLOPS floating point performance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Computational Modeling of Molten Salt Infiltration and Oxidation in Nuclear Graphite

Graphite is utilized as a moderator and reflector in advanced nuclear reactor designs due to its high thermal conductivity, neutron moderation properties, and resistance to radiation damage. However, its longterm performance and reliability are challenged by degradation mechanisms such as molten salt infiltration in molten salt reactors (MSRs) and oxidation in gas-cooled reactors (GCRs). These mechanisms can compromise the structural integrity and operational lifetime of graphite components, necessitating a more detailed assessment of their physical behavior. This report focuses on the development of computational models for molten salt infiltration and oxidation of graphite to aid the design and performance analysis of graphite components. For molten salt infiltration, a computational framework is developed that couples incompressible Navier-Stokes and phase-field model to simulate the penetration of molten salt into graphite?s interconnected pore structure. Initial model verification is performed using two-phase flows in two dimensions, demonstrating the models ability to capture fundamental physical behavior and agree with analytical solution. This framework is then applied to a realistic IG110 nuclear graphite , where a computed tomography extracted pore geometry is used to analyse the infiltration behavior of FLiNaK molten salt. This model provides insights into how the microstructure and other relevant parameters influence the transport pathways of molten salt into graphite, potentially offering a means to rapidly evaluate a graphite grade?s resistance to infiltration. For oxidation, the report details pore-scale mass and heat transport models, describing the diffusion of gases, reaction kinetics, and thermal effects. Additionally, this report highlights inconsistencies in the existing volume-averaged macroscopic model, particularly in upscaling of reaction kinetics and flux terms, and surface to volume transformations. These inconsistencies suggest that current formulations may not accurately capture the experimentally observed graphite oxidation process, highlighting the need for improved model development. This work advances the development of physics-based computational models for graphite degradation, contributing to improved predictive models for next-generation nuclear reactor designs. Future efforts will focus on refining the infiltration model to address non-physical behaviors and enhance its robustness. Additionally, for oxidation, further studies will employ the principles of volume averaging to rigorously derive the upscaled equations, potentially in collaboration with subject matter experts.

Computational Modeling of Molten Salt Infiltration↗
DOE OSTI2025

Network Anomaly Detection in Distributed Edge Computing Infrastructure

As networks continue to grow in complexity and scale, detecting anomalies has become increasingly challenging, particularly in diverse and geographically dispersed environments. Traditional approaches often struggle with managing the computational burden associated with analyzing large-scale network traffic to identify anomalies. This paper introduces a distributed edge computing framework that integrates federated learning with Apache Spark and Kubernetes to address these challenges. We hypothesize that our approach, which enables collaborative model training across distributed nodes, significantly enhances the detection accuracy of network anomalies across different network types. We show that by leveraging distributed computing and containerization technologies, our framework not only improves scalability and fault tolerance but also achieves superior detection performance compared to state-of-the-art methods. Extensive experiments on the UNSW-NB15 and ROAD datasets validate the effectiveness of our approach, demonstrating statistically significant improvements in detection accuracy and training efficiency over baseline models, as confirmed by MannWhitney U and Kolmogorov-Smirnov tests (p<0.05).

Marfo, William [University of Texas at El Paso,Dep↗
DOE OSTI2017

Unified, Cross-Platform, Open-Source Library Package for High-Performance Computing

Compute power is continually increasing, but this increased performance is largely found in sophisticated computing devices and supercomputer resources that are difficult to use, resulting in under-utilization. We developed a unified set of programming tools that will allow users to take full advantage of the new technology by allowing them to work at a level abstracted away from the platform specifics, encouraging the use of modern computing systems, including government-funded supercomputer facilities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Transforming ENERGY through Computational Excellence

Computational methods underpin advancing the science and engineering of energy efficiency, sustainable transportation, renewable power technologies, and developing a knowledge base to optimize energy systems. Researchers with access to enough computing, and the right type, can focus their ingenuity and creativity on addressing the energy challenges. NREL’s advanced computing influence spans several common themes across the Office of Energy Efficiency and Renewable Energy (EERE), including materials discovery, process modeling, fluid dynamics, resource mapping, and analysis of large-scale systems with real-time optimization.

advanced computing↗
DOE OSTI2020

Adaptive simulations enable computational design of electron beam processing of nanomaterials with supersonic micro-jet precursor

Focused Electron Beam Induced Processing (FEBIP) is a powerful tool for the “direct-write” of nanomaterials with the possibility of atomistic control on suspended 2D material substrates. FEBIP capabilities have been significantly expanded by using a localized jet-based delivery of precursors, and especially when a thermally energized supersonic micro-jet enhances the delivery of mass flux along with controlling the far-from-equilibrium thermodynamic state of adsorbed adatoms. The possibilities of growing nanomaterials with “dialed-in” composition with ultra-high growth rates and aspect ratios up to 100:1 have been demonstrated using the supersonic micro-jet-FEBIP. Bringing this scientific discovery to the level of maturity required for practical applications in additive nanomanufacturing requires simulation tools that are capable of capturing the complex flow physics of micro-jet-substrate interactions that bridge a wide range of flow regimes from the high-density gas micro-jet expanding into the vacuum environment of FEBIP. To address this significant computational challenge, a new approach has been developed and described in this work for a multiscale adaptive DSMC (Direct Simulation Monte Carlo) algorithm to predict the micro-jet gas dynamics in an FEBIP environment, spanning the full range of flow regimes from low Knudsen (Kn) number O(0.01) continuum flow to high Kn of O(10) for the molecular flow within a unified computational framework. Here, the fundamental principles of the adaptive DSMC algorithm are described, its viability as a DSMC technique is demonstrated, and computational improvements for the benchmark cases are discussed in the context of advancing 3D nanofabrication with FEBIP. Ultimately, combining the first principle simulations via adaptive DSMC with the complementary experimental data will enable the creation of the powerful CAD tools for in silico design and optimal operation of micro-jet-FEBIP.

36 MATERIALS SCIENCE↗
DOE OSTI2021

A Poisson equation method for prescribing fully developed non-Newtonian inlet conditions for computational fluid dynamics simulations in models of arbitrary cross-section

Prescribing inlet boundary conditions for computational fluid dynamics (CFD) simulations of internal flow in complex geometries such as anatomical vascular models is challenging. In the absence of patient-specific inlet velocity data, a common approach for long blood vessels is to assume that the inlet flow is fully developed. In vessels of irregular cross section, however, prescribing fully developed conditions is complicated due to the lack of a general closed-form analytical solution. In this study, we develop a simple Poisson equation method for prescribing fully developed inlet conditions for the flow of either Newtonian or non-Newtonian fluids in CFD models of arbitrary cross-section. We first derive the generalized Poisson equation for fully developed flow of a non-Newtonian fluid and we then develop and verify a methodology for numerically computing the solution on any planar boundary domain. In addition, we develop a simple extension of the method for prescribing a non-orthogonal inlet velocity that represents fully developed flow from an upstream tube that is connected to the CFD inlet at a non-orthogonal angle. This may be used to investigate a common source of uncertainty in CFD simulations of internal flow that is due to a lack of information concerning the exact streamwise flow direction at the inlets. Comparison to several Newtonian and non-Newtonian benchmark verification solutions shows the method to be extremely accurate. As a practical demonstration case, we use the method to prescribe fully developed conditions on multiple non-circular inlets for the non-Newtonian flow of blood in a patient-specific model of the inferior vena cava (IVC). Finally, we further demonstrate the utility of the method by performing a sensitivity study using the patient-specific IVC model, wherein we investigate the influence of inlet velocity flow direction on the non-Newtonian IVC hemodynamics. Given its simplicity and computational efficiency, the method is shown to be far superior to alternative approaches for prescribing fully developed inlet conditions in such complicated geometries. In conclusion, to facilitate the adoption of our Poisson equation method, we have distributed our OpenFOAM source code and the associated test cases from this study as open-source software.

97 MATHEMATICS AND COMPUTING↗