Search NASA⌕ Search

SEARCH · Search NASA

Results for “Data Remapping”

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 19 records

Data Remapping Between One-Dimensional Meshes

In this report, we describe two approaches to the problem of remapping data from a source mesh (on which data is available) onto a target mesh. We consider two separate methods to solve the problem: Pointwise and Conservative remap, and determine why one is more advantageous when considering different physics applications and elements. We utilize C++ functionalities to derive our findings along with the C++ ”Chronos” library for timing measurements of our studies.

97 MATHEMATICS AND COMPUTING↗

Data Remapping Between One Dimensional Meshes [Slides]

Remapping involves two meshes (source and target), where a discrete set of field values (data) is available on only one of the meshes (source mesh). Since the source and target mesh can be different, we need to find an approximation of the field on the target mesh using the data available on the source mesh. We will consider two algorithms for this problem: point-wise remap and conservative remap.

79 ASTRONOMY AND ASTROPHYSICS↗

Remapping of Data Between One-Dimensional Meshes

In this report we present two approaches to data remapping between one-dimensional meshes implemented with the c++ programming language. Our goal was to test the performance of two search algorithms, linear and binary, and verify the accuracy of our implementations of the two methods. We first introduce the concept of data remap and meshing components, as well as their various uses. We then delve into the differences between point-wise and conservative remap, the algorithms used in the implementations, and lastly confirm the implementations work as intended when given various inputs. We expect that, after profiling, the binary search algorithm will be more efficient than the linear algorithm for sorted sets of data, the point-wise remap implementation to accurately approximate the data transfer between two meshes, and the conservative remap implementation to conserve the area underneath the curve of two distinct meshes.

97 MATHEMATICS AND COMPUTING↗

Data Remapping Between One-Dimensional Meshes [Slides]

Two different remapping algorithms were implemented: point wise (node-to-node date remapping) and conservative (conserves the area under the curve. The performance of both linear and binary searches were studied and it was found that the binary search was more efficient.

97 MATHEMATICS AND COMPUTING↗

Portage: A Modular Data Remap Library for Multiphysics Applications on Advanced Architectures

Portage is a scalable and extensible remap library for numerical simulations. It supports state-of-the-art remap schemes for meshes and particles in 2D and 3D up to a second-order accuracy. Portage ensures critical properties such as local/global conservation and bounds preservation for mesh remap. It enables multi-material field remap through a dedicated plugin, and leverages the hybrid parallelism exposed by advanced architectures using multi-processing and multi-threading.

97 MATHEMATICS AND COMPUTING↗

Divergence Reduction in Monte Carlo Neutron Transport with On-GPU Asynchronous Scheduling

While Monte Carlo Neutron Transport (MCNT) is near-embarrasingly parallel, the effectively unpredictable lifetime of neutrons can lead to divergence when MCNT is evaluated on GPUs. Divergence is the phenomenon of adjacent threads in a warp executing different control flow paths; on GPUS, it reduces performance because each work group may only execute one path at a time. The process of Thread Data Remapping (TDR) resolves these discrepancies by moving data across hardware such that data in the same warp will be processed through similar paths. A common issue among prior implementations of TDR is the synchronous nature of its remapping and processing cycles, which exhaustively sort data produced by prior processing passes and exhaustively evaluate the sorted data. In another work, we defined a method of remapping data through an asynchronous scheduler which allows for work to be stored in shared memory and deferred arbitrarily until that work is a viable option for low-divergence evaluation. This article surveys a wider set of cases, with the goal of characterizing performance trends across a more comprehensive set of parameters. These parameters include cross sections of scattering/capturing/fission, use of implicit capture, source neutron counts, simulation time spans, and tuned memory allocations. Across these cases, we have recorded minimum and average execution times, as well as a heuristically tuned near-optimal memory allocation size for both synchronous and asynchronous scheduling. Across the collected data, it is shown that the asynchronous method is faster and more memory efficient in the majority of cases, and that it requires less tuning to achieve competitive performance.

Computer Science↗

Compatible, energy conserving, bounds preserving remap of hydrodynamic fields for an extended ALE scheme

From the very origins of numerical hydrodynamics in the Lagrangian work of von Neumann and Richtmyer [83], the issue of total energy conservation as well as entropy production has been problematic. Because of well known problems with mesh deformation, Lagrangian schemes have evolved into Arbitrary Lagrangian–Eulerian (ALE) methods [39] that combine the best properties of Lagrangian and Eulerian methods. Energy issues have persisted for this class of methods. We believe that fundamental issues of energy conservation and entropy production in ALE require further examination. The context of the paper is an ALE scheme that is extended in the sense that it permits cyclic or periodic remap of data between grids of the same or differing connectivity. The principal design goals for a remap method then consist of total energy conservation, bounded internal energy, and compatibility of kinetic energy and momentum. We also have secondary objectives of limiting velocity and stress in a non-directional manner, keeping primitive variables monotone, and providing a higher than second order reconstruction of remapped variables. Particularly, the new contributions fall into three categories associated with: energy conservation and entropy production, reconstruction and bounds preservation of scalar and tensor fields, and conservative remap of nonlinear fields. Our paper presents a derivation of the methods, details of implementation, and numerical results for a number of test problems. The methods requires volume integration of polynomial functions in polytopal cells with planar facets, and the requisite expressions are derived for arbitrary order.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Development of a MODIS-Derived Surface Albedo Data Set: An Improved Model Input for Processing the NSRDB

A significant source of bias in the transposition of global horizontal irradiance to plane-of-array (POA) irradiance arises from inaccurate estimations of surface albedo. The current physics-based model used to produce the National Solar Radiation Database (NSRDB) relies on model estimations of surface albedo from a reanalysis climatalogy produced at relatively coarse spatial resolution compared to that of the NSRDB. As an input to spectral decomposition and transposition models, more accurate surface albedo data from remotely sensed imagery at finer spatial resolutions would improve accuracy in the final product. The National Renewable Energy Laboratory (NREL) developed an improved white-sky (bi-hemispherical reflectance) broadband (0.3-5.0 ..mu..m) surface albedo data set for processing the NSRDB from two existing data sets: a gap-filled albedo product and a daily snow cover product. The Moderate Resolution Imaging Spectroradiometer (MODIS) sensors onboard the Terra and Aqua satellites have provided high-quality measurements of surface albedo at 30 arc-second spatial resolution and 8-day temporal resolution since 2001. The high spatial and temporal resolutions and the temporal coverage of the MODIS sensor will allow for improved modeling of POA irradiance in the NSRDB. However, cloud and snow cover interfere with MODIS observations of ground surface albedo, and thus they require post-processing. The MODIS production team applied a gap-filling methodology to interpolate observations obscured by clouds or ephemeral snow. This approach filled pixels with ephemeral snow cover because the 8-day temporal resolution is too coarse to accurately capture the variability of snow cover and its impact on albedo estimates. However, for this project, accurate representation of daily snow cover change is important in producing the NSRDB. Therefore, NREL also used the Integrated Multisensor Snow and Ice Mapping System data set, which provides daily snow cover observations of the Northern Hemisphere for the temporal extent of the NSRDB (1998-2015). We provide a review of validation studies conducted on these two products and describe the methodology developed by NREL to remap the data products to the NSRDB grid and integrate them into a seamless daily data set.

14 SOLAR ENERGY↗

Conservative high-order data transfer method on generalized polygonal meshes

A conservative data transfer (remap) between two meshes is an important step of arbitrary Lagrangian-Eulerian (ALE) hydrodynamics simulations. High-order numerical methods for ALE simulations require both high-order (curvilinear) meshes and high-order remap algorithms. Here we develop a conservative and bounds-preserving method for accurate remapping of discrete fields on generalized polygonal meshes with curvilinear edges. The properties of the proposed method are studied theoretically and numerically for various (smooth and non-smooth) mesh deformations and discrete fields that represent smooth and discontinuous functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

BCLink User Documentation

BCLink is a shared programming library providing general functionality to read temporally- and spatially-varying boundary condition data (contained in Exodus files) into MDG codes (ParaDyn and Diablo). This document is intended for prospective users of BCLink, presenting a summary of the available features of the library, including details regarding the input syntax with accompanying examples. The library’s capabilities are demonstrated through example problems run in ParaDyn, and using the BCRemap command line utility – a stand-alone preprocessing tool which leverages the native functionality provided by the BCLink library to remap surface data between dissimilar meshes.

42 ENGINEERING↗

A seamless approach for evaluating climate models across spatial scales

In regions of the world where topography varies significantly with distance, most global climate models (GCMs) have spatial resolutions that are too coarse to accurately simulate key meteorological variables that are influenced by topography, such as clouds, precipitation, and surface temperatures. One approach to tackle this challenge is to run climate models of sufficiently high resolution in those topographically complex regions such as the North American Regionally Refined Model (NARRM) subset of the Department of Energy’s (DOE) Energy Exascale Earth System Model version 2 (E3SM v2). Although high-resolution simulations are expected to provide unprecedented details of atmospheric processes, running models at such high resolutions remains computationally expensive compared to lower-resolution models such as the E3SM Low Resolution (LR). Moreover, because regionally refined and high-resolution GCMs are relatively new, there are a limited number of observational datasets and frameworks available for evaluating climate models with regionally varying spatial resolutions. As such, we developed a new framework to quantify the added value of high spatial resolution in simulating precipitation over the contiguous United States (CONUS). To determine its viability, we applied the framework to two model simulations and an observational dataset. We first remapped all the data into Hierarchical Equal-Area Iso-Latitude Pixelization (HEALPix) pixels. HEALPix offers several mathematical properties that enable seamless evaluation of climate models across different spatial resolutions including its equal-area and partitioning properties. The remapped HEALPix-based data are used to show how the spatial variability of both observed and simulated precipitation changes with resolution increases. This study provides valuable insights into the requirements for achieving accurate simulations of precipitation patterns over the CONUS. It highlights the importance of allocating sufficient computational resources to run climate models at higher temporal and spatial resolutions to capture spatial patterns effectively. Furthermore, the study demonstrates the effectiveness of the HEALPix framework in evaluating precipitation simulations across different spatial resolutions. This framework offers a viable approach for comparing observed and simulated data when dealing with datasets of varying spatial resolutions. By employing this framework, researchers can extend its usage to other climate variables, datasets, and disciplines that require comparing datasets with different spatial resolutions.

54 ENVIRONMENTAL SCIENCES↗

The Role of Data Transfer on the Selection of a Single vs Multiple Mesh Architecture for Tightly Coupled Multiphysics Applications

Data transfer from one distinct mesh to another may be necessary in any number of applications, including prolongation operations supporting multigrid solution methods, spatial adaptation, remeshing, and arbitrary Lagrangian-Eulerian (ALE) and multiphysics simulation. This data transfer process is also referred to as remapping, rezoning and interpolation. Intermesh data transfer has the potential to introduce error into a simulation; the magnitude and importance of which depends on the transfer scenario and the algorithm used to perform the transfer. For a transient analysis, data transfer may occur many times during a simulation, with possible error accumulation at each transfer. The present study develops selected scenarios that illustrate data transfer error and how it might impact an analysis. This study examines remapping error by using static analytical functions to compare various remapping schemes. It also investigates the significance and nature of data transfer error for a simple multiphysics system involving a transient coupled system of partial differential equations. It concludes that remapping error can be significant both for static functions and for coupled multiphysics systems. Aggregate error is shown to be a function of remapping scheme, mesh coarseness, nature of the remapped function and mesh disparity. In cases of extreme mesh disparity, this study shows that remapping can lead to excessive error and even to solution instability. Further, this work motivates that remapping error should be included in the estimation of numerical error, if data transfer is employed in a numerical simulation.

99 GENERAL AND MISCELLANEOUS↗

Reliable automatic alignment of tomographic projection data by passive auto-focus

Purpose: The authors present a robust algorithm that removes the blurring and double-edge artifacts in high-resolution computed tomography (CT) images that are caused by misaligned scanner components. This alleviates the time-consuming process of physically aligning hardware, which is of particular benefit if components are moved or swapped frequently. Methods: The proposed method uses the experimental data itself for calibration. A parameterized model of the scanner geometry is constructed and the parameters are varied until the sharpest 3D reconstruction is found. The concept is similar to passive auto-focus algorithms of digital optical instruments. The parameters are used to remap the projection data from the physical detector to a virtual aligned detector. This is followed by a standard reconstruction algorithm, namely the Feldkamp algorithm. Feldkamp et al.[J. Opt. Soc. Am. A 1, 612-619 (1984)]. Results: An example implementation is given for a rabbit liver specimen that was collected with a circular trajectory. The optimal parameters were determined in less computation time than that for a full reconstruction. The example serves to demonstrate that (a) sharpness is an appropriate measure for projection alignment, (b) our parameterization is sufficient to characterize misalignments for cone-beam CT, and (c) the procedure determines parameter values with sufficient precision to remove the associated artifacts. Conclusions: The algorithm is fully tested and implemented for regular use at The Australian National University micro-CT facility for both circular and helical trajectories. It can in principle be applied to more general imaging geometries and modalities. It is as robust as manual alignment but more precise since we have quantified the effect of misalignment.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Applying an Oriented Divergence Theorem to Swept Face Remap

Here we present a novel oriented divergence theorem and apply the results to a swept face remap method (conservative data transfer between two meshes) in arbitrary Langrangian–Eulerian hydrodynamics. In our setting, we compute the material flux along swept regions between corresponding faces in the source and target meshes. Since the swept region may add material, subtract material, or do both when it intersects itself, we cannot apply the conventional divergence theorem without accounting for orientation and self-overlaps. In this work, we encode the swept region orientation and geometry with a map from the unit n -dimensional cube, and then apply an oriented analog of divergence theorem to compute the material flux. We present efficient implementation strategies for the presented method. We also provide numerical evidence supporting our results and discuss extensions to more general mesh topologies.

97 MATHEMATICS AND COMPUTING↗

Truly conserving with conservative remapping methods

Abstract. Conservative mapping of data from one horizontal grid to another should preserve certain integral or mean properties of the original data. This may be essential in some model applications, including ensuring realistic exchange of energy and mass between coupled model components. It can also be essential for certain types of analysis, such as evaluating how far a system is from an equilibrium state. For some common grids, existing remapping algorithms may fail to perfectly represent the shapes and sizes of grid cells, which leads to errors in the remapped fields. A procedure is presented here that enables users to rely on the mapping weights generated by remapping algorithms but corrects for their deficiencies. With this procedure, for a given pair of source and destination grids, a single set of remapping weights can be applied to remap any variable, including those with grid cells that are partially or fully masked.

58 GEOSCIENCES↗

Impacts of spatial heterogeneity of anthropogenic aerosol emissions in a regionally refined global aerosol–climate model

Abstract. Emissions of anthropogenic aerosol and their precursors are often prescribed in global aerosol models. Most of these emissions are spatially heterogeneous at model grid scales. When remapped from low-resolution data, the spatial heterogeneity in emissions can be lost, leading to large errors in the simulation. It can also cause the conservation problem if non-conservative remapping is used. The default anthropogenic emission treatment in the Energy Exascale Earth System Model (E3SM) is subject to both problems. In this study, we introduce a revised emission treatment for the E3SM Atmosphere Model (EAM) that ensures conservation of mass fluxes and preserves the original emission heterogeneity at the model-resolved grid scale. We assess the error estimates associated with the default emission treatment and the impact of improved heterogeneity and mass conservation in both globally uniform standard-resolution (∼ 165 km) and regionally refined high-resolution (∼ 42 km) simulations. The default treatment incurs significant errors near the surface, particularly over sharp emission gradient zones. Much larger errors are observed in high-resolution simulations. It substantially underestimates the aerosol burden, surface concentration, and aerosol sources over highly polluted regions, while it overestimates these quantities over less-polluted adjacent areas. Large errors can persist at higher elevation for daily mean estimates, which can affect aerosol extinction profiles and aerosol optical depth (AOD). We find that the revised treatment significantly improves the accuracy of the aerosol emissions from surface and elevated sources near sharp spatial gradient regions, with significant improvement in the spatial heterogeneity and variability of simulated surface concentration in high-resolution simulations. In the next-generation E3SM running at convection-permitting scales where the resolved spatial heterogeneity is significantly increased, the revised emission treatment is expected to better represent the aerosol emissions as well as their lifecycle and impacts on climate.

54 ENVIRONMENTAL SCIENCES↗