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 55 records · Page 3

Dynamic remapping of parallel computations with varying resource demands

A large class of computational problems is characterized by frequent synchronization, and computational requirements which change as a function of time. When such a problem must be solved on a message passing multiprocessor machine, the combination of these characteristics lead to system performance which decreases in time. Performance can be improved with periodic redistribution of computational load; however, redistribution can exact a sometimes large delay cost. We study the issue of deciding when to invoke a global load remapping mechanism. Such a decision policy must effectively weigh the costs of remapping against the performance benefits. We treat this problem by constructing two analytic models which exhibit stochastically decreasing performance. One model is quite tractable; we are able to describe the optimal remapping algorithm, and the optimal decision policy governing when to invoke that algorithm. However, computational complexity prohibits the use of the optimal remapping decision policy. We then study the performance of a general remapping policy on both analytic models. This policy attempts to minimize a statistic W(n) which measures the system degradation (including the cost of remapping) per computation step over a period of n steps. We show that as a function of time, the expected value of W(n) has at most one minimum, and that when this minimum exists it defines the optimal fixed-interval remapping policy. Our decision policy appeals to this result by remapping when it estimates that W(n) is minimized. Our performance data suggests that this policy effectively finds the natural frequency of remapping. We also use the analytic models to express the relationship between performance and remapping cost, number of processors, and the computation's stochastic activity.

Nicol, D. M.↗

PLUM: Parallel Load Balancing for Adaptive Unstructured Meshes

Mesh adaption is a powerful tool for efficient unstructured-grid computations but causes load imbalance among processors on a parallel machine. We present a novel method called PLUM to dynamically balance the processor workloads with a global view. This paper presents the implementation and integration of all major components within our dynamic load balancing strategy for adaptive grid calculations. Mesh adaption, repartitioning, processor assignment, and remapping are critical components of the framework that must be accomplished rapidly and efficiently so as not to cause a significant overhead to the numerical simulation. A data redistribution model is also presented that predicts the remapping cost on the SP2. This model is required to determine whether the gain from a balanced workload distribution offsets the cost of data movement. Results presented in this paper demonstrate that PLUM is an effective dynamic load balancing strategy which remains viable on a large number of processors.

Oliker, Leonid↗

Metrics for Intercomparison of Remapping Algorithms (MIRA) protocol applied to Earth system models

Abstract. Strongly coupled nonlinear phenomena such as those described by Earth system models (ESMs) are composed of multiple component models with independent mesh topologies and scalable numerical solvers. A common operation in ESMs is to remap or interpolate component solution fields defined on their computational mesh to another mesh with a different combinatorial structure and decomposition, e.g., from the atmosphere to the ocean, during the temporal integration of the coupled system. Several remapping schemes are currently in use or available for ESMs. However, a unified approach to compare the properties of these different schemes has not been attempted previously. We present a rigorous methodology for the evaluation and intercomparison of remapping methods through an independently implemented suite of metrics that measure the ability of a method to adhere to constraints such as grid independence, monotonicity, global conservation, and local extrema or feature preservation. A comprehensive set of numerical evaluations is conducted based on a progression of scalar fields from idealized and smooth to more general climate data with strong discontinuities and strict bounds. We examine four remapping algorithms with distinct design approaches, namely ESMF Regrid (Hill et al., 2004), TempestRemap (Ullrich and Taylor, 2015), generalized moving least squares (GMLS) (Trask and Kuberry, 2020) with post-processing filters, and WLS-ENOR (Li et al., 2020). By repeated iterative application of the high-order remapping methods to the test fields, we verify the accuracy of each scheme in terms of their observed convergence order for smooth data and determine the bounded error propagation using challenging, realistic field data on both uniform and regionally refined mesh cases. In addition to retaining high-order accuracy under idealized conditions, the methods also demonstrate robust remapping performance when dealing with non-smooth data. There is a failure to maintain monotonicity in the traditional L2-minimization approaches used in ESMF and TempestRemap, in contrast to stable recovery through nonlinear filters used in both meshless GMLS and hybrid mesh-based WLS-ENOR schemes. Local feature preservation analysis indicates that high-order methods perform better than low-order dissipative schemes for all test cases. The behavior of these remappers remains consistent when applied on regionally refined meshes, indicating mesh-invariant implementations. The MIRA intercomparison protocol proposed in this paper and the detailed comparison of the four algorithms demonstrate that the new schemes, namely GMLS and WLS-ENOR, are competitive compared to standard conservative minimization methods requiring computation of mesh intersections. The work presented in this paper provides a foundation that can be extended to include complex field definitions, realistic mesh topologies, and spectral element discretizations, thereby allowing for a more complete analysis of production-ready remapping packages.

58 GEOSCIENCES↗

Parallel Load Balancing for Adaptive Unstructured Meshes

Mesh adaption is a powerful tool for efficient unstructured-grid computations but causes load imbalance among processors on a parallel machine. We describe a novel method to dynamically balance the processor workloads with a global view. Mesh question, repartitioning, processor assignment, and remapping are critical components of the framework that must be accomplished rapidly and efficiently so as not to cause a significant overhead to the numerical simulation. A data redistribution model will also be presented that predicts the remapping cost. This model is required to determine whether the gain from a balanced workload distribution offsets the cost of data movement. Results presented will demonstrate that this is an effective dynamic load balancing strategy which remains viable on a large number of processors.

Biswas, Rupak↗

Development of High Resolution Land Surface Parameters for the Community Land Model

There is a growing need for high-resolution land surface parameters as land surface models are being applied at increasingly higher spatial resolution offline as well as in regional and global models. The default land surface parameters for the most recent version of the Community Land Model (i.e. CLM 4.0) are at 0.5° or coarser resolutions, released with the Community Earth System Model (CESM). Plant Functional Types (PFTs), vegetation properties such as Leaf Area Index (LAI), Stem Area Index (SAI), and non-vegetated land covers were developed using remotely sensed datasets retrieved in late 1990’s and the beginning of this century. In this study, we developed new land surface parameters for CLM 4.0, specifically PFTs, LAI, SAI and non-vegetated land cover composition, at 0.05° resolution globally based on the most recent MODIS land cover and improved MODIS LAI products. Compared to the current CLM 4.0 parameters, the new parameters produced a decreased coverage by bare soil and trees, but an increased coverage by shrub, grass, and cropland. The new parameters result in a decrease in global seasonal LAI, with the biggest decrease in boreal forests; however, the new parameters also show a large increase in LAI in tropical forest. Differences between the new and the current parameters are mainly caused by changes in the sources of remotely sensed data and the representation of land cover in the source data. Advantages and disadvantages of each dataset were discussed in order to provide guidance on the use of the data. The new high-resolution land surface parameters have been used in a coupled land-atmosphere model (WRF-CLM) applied to the western U.S. to demonstrate their use in high-resolution modeling. A remapping method from the latitude/longitude grid of the CLM data to the WRF grids with map projection was also demonstrated. Future work will include global offline CLM simulations to examine the impacts of source data resolution and subsequent land parameter changes on simulated land surface processes.

Environmental Molecular Sciences Laboratory↗

Photogrammetric aspects of remapping procedures

Photogrammetric control generation is discussed. Techniques in remote sensing data reduction are described. Emphasis is placed on methods of rectification of aerial photography and frame photography. Examples of multispectral band scanner data that were processed are presented.

Mikhail, E. M.↗

Performance Analysis and Portability of the PLUM Load Balancing System

The ability to dynamically adapt an unstructured mesh is a powerful tool for solving computational problems with evolving physical features; however, an efficient parallel implementation is rather difficult. To address this problem, we have developed PLUM, an automatic portable framework for performing adaptive numerical computations in a message-passing environment. PLUM requires that all data be globally redistributed after each mesh adaption to achieve load balance. We present an algorithm for minimizing this remapping overhead by guaranteeing an optimal processor reassignment. We also show that the data redistribution cost can be significantly reduced by applying our heuristic processor reassignment algorithm to the default mapping of the parallel partitioner. Portability is examined by comparing performance on a SP2, an Origin2000, and a T3E. Results show that PLUM can be successfully ported to different platforms without any code modifications.

Oliker, Leonid↗

Toward adaptive radiotherapy for head and neck patients: Uncertainties in dose warping due to the choice of deformable registration algorithm

Purpose: The aims of this work were to evaluate the performance of several deformable image registration (DIR) algorithms implemented in our in-house software (NiftyReg) and the uncertainties inherent to using different algorithms for dose warping. Methods: The authors describe a DIR based adaptive radiotherapy workflow, using CT and cone-beam CT (CBCT) imaging. The transformations that mapped the anatomy between the two time points were obtained using four different DIR approaches available in NiftyReg. These included a standard unidirectional algorithm and more sophisticated bidirectional ones that encourage or ensure inverse consistency. The forward (CT-to-CBCT) deformation vector fields (DVFs) were used to propagate the CT Hounsfield units and structures to the daily geometry for “dose of the day” calculations, while the backward (CBCT-to-CT) DVFs were used to remap the dose of the day onto the planning CT (pCT). Data from five head and neck patients were used to evaluate the performance of each implementation based on geometrical matching, physical properties of the DVFs, and similarity between warped dose distributions. Geometrical matching was verified in terms of dice similarity coefficient (DSC), distance transform, false positives, and false negatives. The physical properties of the DVFs were assessed calculating the harmonic energy, determinant of the Jacobian, and inverse consistency error of the transformations. Dose distributions were displayed on the pCT dose space and compared using dose difference (DD), distance to dose difference, and dose volume histograms. Results: All the DIR algorithms gave similar results in terms of geometrical matching, with an average DSC of 0.85 ± 0.08, but the underlying properties of the DVFs varied in terms of smoothness and inverse consistency. When comparing the doses warped by different algorithms, we found a root mean square DD of 1.9% ± 0.8% of the prescribed dose (pD) and that an average of 9% ± 4% of voxels within the treated volume failed a 2%pD DD-test (DD{sub 2%-pp}). Larger DD{sub 2%-pp} was found within the high dose gradient (21% ± 6%) and regions where the CBCT quality was poorer (28% ± 9%). The differences when estimating the mean and maximum dose delivered to organs-at-risk were up to 2.0%pD and 2.8%pD, respectively. Conclusions: The authors evaluated several DIR algorithms for CT-to-CBCT registrations. In spite of all methods resulting in comparable geometrical matching, the choice of DIR implementation leads to uncertainties in dose warped, particularly in regions of high gradient and/or poor imaging quality.

60 APPLIED LIFE SCIENCES↗

Selection of a map grid for data analysis and archival

Arguments for selection of a map grid are reiterated by illustrating the quantitative effects on data quality caused by using different grids. It is shown that the use of the rectangular latitude-longitude grid actually degrades data quality, increases stored data volume, and increases the complexity of data manipulation. Use of an equal-area grid is shown to be a proper way to aggregate data, but such grids are thought to be inconvenient. A solution to this dilemma is proposed by showing that the analysis and archival map grids need not be the same. The results of a proper analysis of the data on an equal-area grid can be remapped to the more 'convenient' rectangular latitude-longitude grid without loss of quality.

Rossow, W. B.↗

Renewable Energy and Efficiency Modeling Analysis Partnership (REMAP): An Analysis of How Different Energy Models Addressed a Common High Renewable Energy Penetration Scenario in 2025

Energy system modeling can be intentionally or unintentionally misused by decision-makers. This report describes how both can be minimized through careful use of models and thorough understanding of their underlying approaches and assumptions. The analysis summarized here assesses the impact that model and data choices have on forecasting energy systems by comparing seven different electric-sector models. This analysis was coordinated by the Renewable Energy and Efficiency Modeling Analysis Partnership (REMAP), a collaboration among governmental, academic, and nongovernmental participants.

2050↗

Renewable Energy and Efficiency Modeling Analysis Partnership (REMAP): An Analysis of How Different Energy Models Addressed a Common High Renewable Energy Penetration Scenario in 2025

Energy system modeling can be intentionally or unintentionally misused by decision-makers. This report describes how both can be minimized through careful use of models and thorough understanding of their underlying approaches and assumptions. The analysis summarized here assesses the impact that model and data choices have on forecasting energy systems by comparing seven different electric-sector models. This analysis was coordinated by the Renewable Energy and Efficiency Modeling Analysis Partnership (REMAP), a collaboration among governmental, academic, and nongovernmental participants.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Missing components in ΛCDM from DESI Y1 baryonic acoustic oscillation measurements: Insights from redshift remapping

We explore transformations of the Friedman-Lemaître-Robertson-Walker (FLRW) metric and cosmological parameters that align with observational data while aiming to gain insights into potential extensions of standard cosmological models. We modified the FLRW metric by introducing a scaling factor, e 2Θ(a) –the cosmological scaling function (CSF), which alters the standard relationship between cosmological redshift and the cosmic scale factor without affecting angular measurements or cosmic microwave background (CMB) anisotropies. Using data from DESI Year 1, Pantheon+ supernovae, and the Planck CMB temperature power spectrum, we constrained both the CSF and cosmological parameters through a Markov chain Monte Carlo approach. Our results indicate that the CSF model fits observational data with a lower Hubble constant (although it is compatible with the value given by Planck 2018 within 1σ) and is predominantly dark matter dominated. Additionally, the CSF model produces temperature and lensing power spectra similar to those predicted by the standard model, though with lower values in the CSF model at large scales. We also checked that when fitting a CSF model without dark energy to the data, we obtain a more negative conformal function. This suggests that the CSF model may offer hints about missing elements and opens up a new avenue for exploring physical interpretations of cosmic acceleration.

79 ASTRONOMY AND ASTROPHYSICS↗

Tests of a simple data merging algorithm for the GONG project

The GONG (Global Oscillation Network Group) project proposes to reduce the impact of diurnal variations on helioseismic measurements by making long-term observations of solar images from six sites placed around the globe. The sun will be observed nearly constantly for three years, resulting in the acquisition of l+ terabyte of image data. To use the solar network to maximum advantage, the images from the sites must be combined into a single time series to determine mode frequencies, amplitudes, and line widths. Initial versions of combined, i.e., merged, time series were made using a simple weighted average of data from different sites taken simultaneously. In order to accurately assess the impact of the data merge on the helioseismic measurements, a set of artificial solar disk images was made using a standard solar model and containing a well known set of oscillation modes and frequencies. This undegraded data set and data products computed from it were used to judge the relative merits of various data merging schemes. The artificial solar disk images were subjected to various instrumental and atmospheric degradations, dependent on site and time, in order to create a set of images simulating those likely to be taken at the site. The degraded artificial solar disk images for the six observing sites were combined in various ways to form merged time series of images and mode coefficients. Various forms of a weighted average were used, including an equally-weighted average, an average with weights dependent upon air mass and averages with weights dependent on various quality assurance parameters. Both the undegraded solar disk image time series and several time series made up of various combinations of the degraded solar disk images from the six sites were subjected to standard helioseismic measurement processing. This processing consisted of coordinate remapping, detrending, spherical harmonic transformation, computation of power series for the oscillation mode coefficients, and mode frequency identification. Visual and statistical evaluation of the merged data sets themselves and differences between the merged and undegraded data set shows good agreement between the two data sets. Some slight differences in image scale and registration appear between the undegraded data set and the various merged data sets. In the set of power series made from the mode coefficients of the merged data sets, some power leakage is observed into the background and into slightly lower l-value modes, especially at higher l-value mode frequencies. The results of the comparison of time series and mode oscillation frequencies of the undegraded data with those of the data merged using weighted averages indicate that, at least for p-mode solar oscillations, a weighted average of either the detrended remapped images or the mode coefficients gives good determination of the mode frequencies and adequate-to-good determination of the amplitudes and widths of the mode frequency lines. This conclusion is most advantageous to the analysis of the massive amounts of data to be received by the GONG network.

Williams, W. E.↗

Rain volume estimation over areas using satellite and radar data

An investigation of the feasibility of rain volume estimation using satellite data following a technique recently developed with radar data called the Arera Time Integral was undertaken. Case studies were selected on the basis of existing radar and satellite data sets which match in space and time. Four multicell clusters were analyzed. Routines for navigation remapping amd smoothing of satellite images were performed. Visible counts were normalized for solar zenith angle. A radar sector of interest was defined to delineate specific radar echo clusters for each radar time throughout the radar echo cluster lifetime. A satellite sector of interest was defined by applying small adjustments to the radar sector using a manual processing technique. The radar echo area, the IR maximum counts and the IR counts matching radar echo areas were found to evolve similarly, except for the decaying phase of the cluster where the cirrus debris keeps the IR counts high.

Doneaud, A. A.↗

Improving climate model coupling through a complete mesh representation: a case study with E3SM (v1) and MOAB (v5.x)

One of the fundamental factors contributing to the spatiotemporal inaccuracy in climate modeling is the mapping of solution field data between different discretizations and numerical grids used in the coupled component models. The typical climate computational workflow involves evaluation and serialization of the remapping weights during the preprocessing step, which is then consumed by the coupled driver infrastructure during simulation to compute field projections. Tools like Earth System Modeling Framework (ESMF) and TempestRemap offer capability to generate conservative remapping weights, while the Model Coupling Toolkit (MCT) that is utilized in many production climate models exposes functionality to make use of the operators to solve the coupled problem. However, such multistep processes present several hurdles in terms of the scientific workflow and impede research productivity. In order to overcome these limitations, we present a fully integrated infrastructure based on the Mesh Oriented datABase (MOAB) library, which allows for a complete description of the numerical grids and solution data used in each submodel. Through a scalable advancing-front intersection algorithm, the supermesh of the source and target grids are computed, which is then used to assemble the high-order, conservative, and monotonicity-preserving remapping weights between discretization specifications. The Fortran-compatible interfaces in MOAB are utilized to directly link the submodels in the Energy Exascale Earth System Model (E3SM) to enable online remapping strategies in order to simplify the coupled workflow process. We demonstrate the superior computational efficiency of the remapping algorithms in comparison with other state-of-the-science tools and present strong scaling results on large-scale machines for computing remapping weights between the spectral element atmosphere and finite volume discretizations on the polygonal ocean grids.

58 GEOSCIENCES↗

Development of the Centralized Storm Information System (CSIS) for use in severe weather prediction

The centralized storm information system is now capable of ingesting and remapping radar scope presentations on a satellite projection. This can be color enhanced and superposed on other data types. Presentations from more than one radar can be composited on a single image. As with most other data sources, a simple macro establishes the loops and scheduling of the radar ingestions as well as the autodialing. There are approximately 60 NWS network 10 cm radars that can be interrogated. NSSFC forecasters have found this data source to be extremely helpful in severe weather situations. The capability to access lightning frequency data stored in a National Weather Service computer was added. Plans call for an interface with the National Meteorological Center to receive and display prognostic fields from operational computer forecast models. Programs are to be developed to plot and display locations of reported severe local storm events.

Mosher, F. R.↗

Programmable remapper with single flow architecture

The invention relates to image processing systems and methods and in particular to a machine which accepts a real time video image in the form of a matrix of picture elements (pixels) and remaps such image according to a selectable one of a plurality of mapping functions to create an output matrix of pixels. Such mapping functions, or transformations, may be any one of a number of different transformations depending on the objective of the user of the system. The system remaps input images from one coordinate system to another using a set of look-up tables for the data necessary for the transform. The transforms, which are operator selectable, are precomputed and loaded into massive look-up tables. Input pixels, via the look-up tables of any particular transform selected, are mapped into output pixels with the radiance information of the input pixels being appropriately weighted. An earlier embodiment of the system included two parallel processors: a collective processor which mapped multiple input pixels into a single output pixel and an interpolative processor. The interpolative processor performed an interpolation among pixels in the input image where a given input pixel may affect the value of many output pixels. Several advantages are provided over previous embodiments in that the two distinct processors are replaced by a single processor capable of performing both types of operations (collective and interpolative) with no more complexity. Previously, there has existed no image processor or 'remapper' that can operate with sufficient speed and flexibility to permit investigating different transformation patterns in real time.

Fisher, Timothy E.↗

New Levels of High Angular Resolution EBSD Performance via Inverse Compositional Gauss-Newton Digital Image Correlation

Conventional high angular resolution electron backscatter diffraction (HREBSD) uses cross-correlation to track features between diffraction patterns, which are then related to the relative elastic strain and misorientation between the diffracting volumes of material. This paper adapts inverse compositional Gauss Newton (ICGN) digital image correlation (DIC) to be compatible with HREBSD. ICGN works by efficiently tracking not just the shift in features, but also the change in their shape. Modeling a shape change as well as a shift results in greater accuracy. This method, ICGN HREBSD, is applied to a simulated data set, and its performance is compared to conventional cross-correlation HREBSD, and cross-correlation HREBSD with remapping. ICGN HREBSD is shown to have about half the strain error of the best cross-correlation method with a comparable computation time.

T. J. Ruggles↗