Search NASA⌕ Search

SEARCH · Search NASA

Results for “computer”

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,585 records · Page 88

Cloud object store for checkpoints of high performance computing applications using decoupling middleware

Cloud object storage is enabled for checkpoints of high performance computing applications using a middleware process. A plurality of files, such as checkpoint files, generated by a plurality of processes in a parallel computing system are stored by obtaining said plurality of files from said parallel computing system; converting said plurality of files to objects using a log structured file system middleware process; and providing said objects for storage in a cloud object storage system. The plurality of processes may run, for example, on a plurality of compute nodes. The log structured file system middleware process may be embodied, for example, as a Parallel Log-Structured File System (PLFS). The log structured file system middleware process optionally executes on a burst buffer node.

97 MATHEMATICS AND COMPUTING↗

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↗

HIGH-FIDELITY SIMULATION-DRIVEN MODEL DEVELOPMENT FOR COARSE-GRAINED COMPUTATIONAL FLUID DYNAMICS

Nuclear reactor safety analysis requires identifying various credible accident scenarios and determining their consequences. For a full-scale nuclear power plant system behavior, it is impossible to obtain sufficient experimental data for a broad range of risk-significant accident scenarios. In single-phase flow convective problems, Direct Numerical Simulation (DNS) and Large Eddy Simulation (LES) can provide us with high fidelity results when physical data are unavailable. However, these methods are computationally expensive and cannot be afforded for simulation of long transient scenarios in nuclear accidents despite extraordinary advances in high performance scientific computing over the past decades. The major issue is the inability to make the transient computation parallel, thus making number of time steps required in high-fidelity methods unaffordable for long transients. In this work, we propose to apply a high fidelity simulation-driven approach to model sub-grid scale (SGS) effect in Coarse Grained Computational Fluid Dynamics CG-CFD. This approach aims to develop a statistical surrogate model instead of the deterministic SGS model. We chose to start with a turbulent natural convection case with volumetric heating in a horizontal fluid layer with a rigid, insulated lower boundary and isothermal (cold) upper boundary. This scenario of unstable stratification is relevant to turbulent natural convection in a molten corium pool during a severe nuclear reactor accident, as well as in containment mixing and passive cooling. The presented approach demonstrates how to create a correction for the CG-CFD solution by modifying the energy balance equation. A global correction for the temperature equation proves to achieve a significant improvement to the prediction of steady state temperature distribution through the fluid layer.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

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↗

A Generalized Framework for Auto-tuning Stencil Computations

This work introduces a generalized framework for automatically tuning stencil computations to achieve superior performance on a broad range of multicore architectures. Stencil (nearest-neighbor) based kernels constitute the core of many important scientific applications involving block-structured grids. Auto-tuning systems search over optimization strategies to find the combination of tunable parameters that maximizes computational efficiency for a given algorithmic kernel. Although the auto-tuning strategy has been successfully applied to libraries, generalized stencil kernels are not amenable to packaging as libraries. Studied kernels in this work include both memory-bound kernels as well as a computation-bound bilateral filtering kernel. We introduce a generalized stencil auto-tuning framework that takes a straightforward Fortran expression of a stencil kernel and automatically generates tuned implementations of the kernel in C or Fortran to achieve performance portability across diverse computer architectures.

97 MATHEMATICS AND COMPUTING↗

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↗

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↗

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↗

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↗

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, ↗

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↗

Energy law preserving C{sup 0} finite element schemes for phase field models in two-phase flow computations

Highlights: {yields} We study phase-field models for multi-phase flow computation. {yields} We develop an energy-law preserving C0 FEM. {yields} We show that the energy-law preserving method work better. {yields} We overcome unphysical oscillation associated with the Cahn-Hilliard model. - Abstract: We use the idea in to develop the energy law preserving method and compute the diffusive interface (phase-field) models of Allen-Cahn and Cahn-Hilliard type, respectively, governing the motion of two-phase incompressible flows. We discretize these two models using a C{sup 0} finite element in space and a modified midpoint scheme in time. To increase the stability in the pressure variable we treat the divergence free condition by a penalty formulation, under which the discrete energy law can still be derived for these diffusive interface models. Through an example we demonstrate that the energy law preserving method is beneficial for computing these multi-phase flow models. We also demonstrate that when applying the energy law preserving method to the model of Cahn-Hilliard type, un-physical interfacial oscillations may occur. We examine the source of such oscillations and a remedy is presented to eliminate the oscillations. A few two-phase incompressible flow examples are computed to show the good performance of our method.

97 MATHEMATICS AND COMPUTING↗

Using Laguerre polynomials to compute the matrix exponential in burnup calculations

An essential part of burnup analysis is to solve the burnup equations. The burnup equations can be regarded as a first-order linear system and solved by means of matrix exponential methods. Because of its large spectrum, it is difficult to compute the exponential of the burnup matrix. Conventional methods of computing the matrix exponential, such as the truncated Taylor expansion and the Pade approximation, are not applicable to burnup calculations. Recently the Chebyshev Rational Approximation Method (CRAM) has been applied to solve burnup matrix exponential and shown to be robust and accurate. However, the main defect of CRAM is that its coefficients are not easy to obtain. In this paper, an orthogonal polynomial expansion method, called Laguerre Polynomial Approximation Method (LPAM), is proposed to compute the matrix exponential in burnup calculations. The polynomial sequence of LPAM can be easily computed in any order and thus LPAM is quite convenient to be utilized into burnup codes. Two typical test cases with the decay and cross-section data taken from the standard ORIGEN 2.1 libraries are calculated for validation, against the reference results provided by CRAM of 14 order. Numerical results show that, LPAM is sufficiently accurate for burnup calculations. The influences of the parameters on the convergence of LPAM are also discussed. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A fission matrix based validation protocol for computed power distributions in the advanced test reactor

The Idaho National Laboratory (INL) has been engaged in a significant multi year effort to modernize the computational reactor physics tools and validation procedures used to support operations of the Advanced Test Reactor (ATR) and its companion critical facility (ATRC). Several new protocols for validation of computed neutron flux distributions and spectra as well as for validation of computed fission power distributions, based on new experiments and well-recognized least-squares statistical analysis techniques, have been under development. In the case of power distributions, estimates of the a priori ATR-specific fuel element-to-element fission power correlation and covariance matrices are required for validation analysis. A practical method for generating these matrices using the element-to-element fission matrix is presented, along with a high-order scheme for estimating the underlying fission matrix itself. The proposed methodology is illustrated using the MCNP5 neutron transport code for the required neutronics calculations. The general approach is readily adaptable for implementation using any multidimensional stochastic or deterministic transport code that offers the required level of spatial, angular, and energy resolution in the computed solution for the neutron flux and fission source. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

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↗

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↗

Deterministic Simulation of First-Order Scattering in a Clinical X-ray Computed Tomography Scanner - Paper 81

In nondestructive testing (NDT) and medical diagnostic x-ray imaging (photon energy<140 keV), scattered x-ray caused by Compton and Rayleigh scattering should be eliminated. Scattered x-ray photons reduce image contrast, increase image noise, and introduce artifact into the reconstructed computed tomography (CT) images. In cone-beam CT, where the coverage of the x-ray beam and the area of the detector are significantly larger than those in fan-beam CT, x-ray photon scatter is one of the major sources of image degradation. The artifacts caused by scattered x-ray photon can be divided into two categories: 1) low spatial frequency scatter profile adds a positive bias to the detected radiation signal, thus reducing the effective attenuation of the imaged object, resulting in a negative bias in the measured linear attenuation coefficient in the image; 2) a high spatial frequency scatter profile causes a differential artifact, such as shading in uniform regions. A real x-ray scan is composed of both low and high frequency scatter profiles. Thus, the key to a successful scatter correction is the ability to accurately capture the scatter profile of a real x-ray imaging scan. The most accurate method for estimating a scatter profile is the Monte Carlo simulation. However, the computation cost of the Monte Carlo method makes it unfeasible for simulating real and complex scan geometries in clinical settings. A practical yet accurate scatter profile estimation method is through ray tracing techniques, where the scatter profiles are computed by tracking rays through the object's volume. The x-ray from the source is tracked when it interacts with the material in the volume. The interaction creates scattered x-rays, in all possible directions. These rays are again either attenuated or scattered, creating cascaded scatter events. In x-ray CT, the first-order scattering (where only one scatter interaction is encountered) accounts for the most severe image artifacts since this first-order scatter contains a high frequency component of the scatter profile. Previous studies have shown that ray tracing techniques are quite effective in simulating the contribution of first-order scattering in radiological images. In this study, a similar ray tracing technique is applied to simulate the scatter profile of a real x-ray computed tomography (CT) scan in clinical settings. A good agreement has been found between the simulated scatter profile and the experimental measurement result. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

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↗