Search NASA⌕ Search

SEARCH · Search NASA

Results for “spatial partitioning”

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 37 records · Page 2

Multitasking a three-dimensional Navier-Stokes algorithm on the Cray-2

A three-dimensional computational aerodynamics algorithm has been multitasked for efficient parallel execution on the Cray-2. It provides a means for examining the multitasking performance of a complete CFD application code. An embedded zonal multigrid scheme is used to solve the Reynolds-averaged Navier-Stokes equations for an internal flow model problem. The explicit nature of each component of the method allows a spatial partitioning of the computational domain to achieve a well-balanced task load for MIMD computers with vector-processing capability. Experiments have been conducted with both two- and three-dimensional multitasked cases. The best speedup attained by an individual task group was 3.54 on four processors of the Cray-2, while the entire solver yielded a speedup of 2.67 on four processors for the three-dimensional case. The multiprocessing efficiency of various types of computational tasks is examined, performance on two Cray-2s with different memory access speeds is compared, and extrapolation to larger problems is discussed.

Swisshelm, Julie M.↗

Geology of the Terra Cimmeria-Utopia Planitia Highland Lowland Transitional Zone: Final Technical Approach and Scientific Results

The southern Utopia highland-lowland transitional zone extends from northern Terra Cimmeria to southern Utopia Planitia and contains broad, bench-like platforms with depressions, pitted cones, tholi, and lobate flows. The locally occurring geologic units and landforms contrast other transitional regions and record a spatially partitioned geologic history. We systematically delineated and described the geologic units and landforms of the southern Utopia-Cimmeria highland-lowland transitional zone for the production of a 1:1,000,000-scale geologic map (MTMs 10237, 15237, 20237, 10242, 15242, 20242, 10247, 15247, and 20247). Herein, we present technical and scientific results of this mapping project.

Skinner, J. A., Jr.↗

Hybrid Glacier Inventory, Gravimetry and Altimetry (HIGA) Mass Balance Product for Greenland and the Canadian Arctic

We present a novel inversion algorithm that generates a mass balance field that is simultaneously consistent with independent observations of glacier inventory derived from optical imagery, cryosphere-attributed mass trends derived from satellite gravimetry, and ice surface elevation trends derived from airborne and satellite altimetry. We use this algorithm to assess mass balance across Greenland and the Canadian Arctic over the Sep-2003 to Oct- 2009 period at 26 kilometers resolution. We evaluate local algorithm-inferred mass balance against forty in situ point observations. This evaluation yields a root mean squared error (RMSE) of 0.15 mWE/a ( 0.15 meters (water equivalent) per annum), and highlights a paucity of in situ observations from regions of high dynamic mass loss and peripheral glaciers. We assess mass losses of 212 plus or minus 67 Gigatons per annum to the Greenland ice sheet proper, 38 Gigatons per annum to peripheral glaciers in Greenland, and 42 Gigatons per annum to glaciers in the Canadian Arctic. These magnitudes of mass loss are dependent on the gravimetry-derived spherical harmonic mass trend we invert. We spatially partition the transient glacier continuity equation by differencing algorithm inferred mass balance from modeled surface mass balance, in order to solve the horizontal divergence of ice flux as a residual. This residual ice dynamic field infers flux divergence (or submergent flow) in the ice sheet accumulation area and at tidewater margins, and flux convergence (or emergent flow) in land-terminating ablation areas, which is consistent with continuum mechanics theory.

Altimetry↗

A mesh partitioning algorithm for preserving spatial locality in arbitrary geometries

Highlights: •An algorithm for partitioning computational meshes is proposed. •The Morton order space-filling curve is modified to achieve improved locality. •A spatial locality metric is defined to compare results with existing approaches. •Results indicate improved performance of the algorithm in complex geometries. -- Abstract: A space-filling curve (SFC) is a proximity preserving linear mapping of any multi-dimensional space and is widely used as a clustering tool. Equi-sized partitioning of an SFC ignores the loss in clustering quality that occurs due to inaccuracies in the mapping. Often, this results in poor locality within partitions, especially for the conceptually simple, Morton order curves. We present a heuristic that improves partition locality in arbitrary geometries by slicing a Morton order curve at points where spatial locality is sacrificed. In addition, we develop algorithms that evenly distribute points to the extent possible while maintaining spatial locality. A metric is defined to estimate relative inter-partition contact as an indicator of communication in parallel computing architectures. Domain partitioning tests have been conducted on geometries relevant to turbulent reactive flow simulations. The results obtained highlight the performance of our method as an unsupervised and computationally inexpensive domain partitioning tool.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spatial Locality-Aware Cache Partitioning for Effective Cache Sharing, In: 2015 44th International Conference on Parallel Processing

In modern multi-core processors, last-level caches (LLCs) are typically shared among multiple cores. Previous works have shown that such sharing is beneficial as different workloads have different needs for cache capacity, and logical partitioning of capacity can improve system performance. However, what is missing in previous works on partitioning shared LLCs is that the heterogeneity in spatial locality among workloads has not been explored. In other words, all the cores use the same block/line size in shared LLCs. In this work, we highlight that exploiting spatial locality enables much more effective cache sharing. The fundamental reason is that for many memory intensive workloads, their cache capacity requirements can be drastically reduced when a large block size is employed, therefore they can effectively donate more capacity to other workloads. To leverage spatial locality for cache partitioning effectively, we first propose a simple yet effective mechanism to measure both spatial and temporal locality at run-time. The locality information is then used to determine both the proper block size and the capacity assigned to each workload. Our experiments show that our Spatial Locality-aware Cache Partitioning (SLCP) significantly outperforms the previous works. We also present several case studies that dissect the effectiveness of SLCP compared to the existing approaches.

Computer Science↗

AutoAtlas: Neural Network for 3D Unsupervised Partitioning and Representation Learning

Here we present a novel neural network architecture called AutoAtlas for fully unsupervised partitioning and representation learning of 3D brain Magnetic Resonance Imaging (MRI) volumes. AutoAtlas consists of two neural network components: one neural network to perform multi-label partitioning based on local texture in the volume, and a second neural network to compress the information contained within each partition. We train both of these components simultaneously by optimizing a loss function that is designed to promote accurate reconstruction of each partition, while encouraging spatially smooth and contiguous partitioning, and discouraging relatively small partitions. We show that the partitions adapt to the subject specific structural variations of brain tissue while consistently appearing at similar spatial locations across subjects. AutoAtlas also produces very low dimensional features that represent local texture of each partition. We demonstrate prediction of metadata associated with each subject using the derived feature representations and compare the results to prediction using features derived from FreeSurfer anatomical parcellation. Since our features are intrinsically linked to distinct partitions, we can then map values of interest, such as partition-specific feature importance scores onto the brain for visualization.

42 ENGINEERING↗

Geometric Mapping of Tasks to Processors on Parallel Computers with Mesh or Torus Networks

We present a new method for reducing parallel applications' communication time by mapping their MPI tasks to processors in a way that lowers the distance messages travel and the amount of congestion in the network. Assuming geometric proximity among the tasks is a good approximation of their communication interdependence, we use a geometric partitioning algorithm to order both the tasks and the processors, assigning task parts to the corresponding processor parts. In this way, interdependent tasks are assigned to “nearby” cores in the network. We also present a number of algorithmic optimizations that exploit specific features of the network or application to further improve the quality of the mapping. We specifically address the case of sparse node allocation, where the nodes assigned to a job are not necessarily located in a contiguous block nor within close proximity to each other in the network. Furthermore, our methods generalize to contiguous allocations as well, and results are shown for both contiguous and non-contiguous allocations. We show that, for the structured finite difference mini-application MiniGhost, our mapping methods reduced communication time up to 75% relative to MiniGhost's default mapping on 128K cores of a Cray XK7 with sparse allocation. For the atmospheric modeling code E3SM/HOMME, our methods reduced communication time up to 31% on 16K cores of an IBM BlueGene/Q with contiguous allocation.

97 MATHEMATICS AND COMPUTING↗

Exploiting Geometric Partitioning in Task Mapping for Parallel Computes

We present a new method for mapping applications' MPI tasks to cores of a parallel computer such that applications' communication time is reduced. We address the case of sparse node allocation, where the nodes assigned to a job are not necessarily located in a contiguous block nor within close proximity to each other in the network, although our methods generalize to contiguous allocations as well. The goal is to assign tasks to cores so that interdependent tasks are performed by "nearby' cores, thus lowering the distance messages must travel, the amount of congestion in the network, and the overall cost of communication. Our new method applies a geometric partitioning algorithm to both the tasks and the processors, and assigns task parts to the corresponding processor parts. We also present a number of algorithmic optimizations that exploit specific features of the network or application. We show that, for the structured finite difference mini-application MiniGhost, our mapping methods reduced communication time up to 75% relative to MiniGhost's default mapping on 128K cores of a Cray XK7 with sparse allocation. For the atmospheric modeling code E3SM/HOMME, our methods reduced communication time up to 31% on 32K cores of an IBM BlueGene/Q with contiguous allocation.

97 MATHEMATICS AND COMPUTING↗

The Influence of Tungsten on the Chemical Composition of a Temporally Evolving Nanostructure of a Model Ni-Al-Cr Superalloy

The influence of W on the temporal evolution of gamma' precipitation toward equilibrium in a model Ni-Al-Cr alloy is investigated by three-dimensional atom-probe (3DAP) microscopy and transmission electron microscopy (TEM). We report on the alloys Ni-10 Al-8.5 Cr (at.%) and Ni-10 Al-8.5 Cr-2 W (at.%), which were aged isothermally in the gamma + gamma' two-phase field at 1073 K, for times ranging from 0.25 to 264 h. Spheroidal-shaped gamma' precipitates, 5-15 nm diameter, form during quenching from above the solvus temperature in both alloys at a high number density (approx. 10(exp 23/cu m). As gamma' precipitates grow with aging at 1073 K, a transition from spheriodal- to cuboidal-shaped precipitates is observed in both alloys. The elemental partitioning and spatially resolved concentration profiles across the gamma' precipitates are obtained as a function of aging time from three-dimensional atom-by-atom reconstructions. Proximity histogram concentration profiles of the quaternary alloy demonstrate that W concentration gradients exist in gamma' precipitates in the as-quenched and 0.25-h aging states, which disappear after 1 h of aging. The diffusion coefficient of W in gamma' is estimated to be 6.2 x 10(exp -20) sq m/s at 1073 K. The W addition decreases the coarsening rate constant, and leads to stronger partitioning of Al to gamma' and Cr to gamma.

Sudbrack, Chantal K.↗

Variability of Snow and Rainfall Partitioning Into Evapotranspiration and Summer Runoff Across Nine Mountainous Catchments

Abstract Understanding the partitioning of snow and rain contributing to either catchment streamflow or evapotranspiration (ET) is of critical relevance for water management in response to climate change. To investigate this partitioning, we use endmember splitting and mixing analyses based on stable isotope ( 18 O) data from nine headwater catchments in the East River, Colorado. Our results show that one third of the snow partitions to ET and 13% of the snowmelt sustains summer streamflow. Only 8% of the rainfall contributes to the summer streamflow, because most of the rain (67%) partitions to ET. The spatial variability of precipitation partitioning is mainly driven by aspect and tree cover across the sub‐catchments. Catchments with higher tree cover have a higher share of snow becoming ET, resulting in less snow in summer streamflow. Summer streamflow did not contain more rain with higher rainfall sums, but more rain was taken up in ET.

58 GEOSCIENCES↗

The Case for Strong Scaling in Deep Learning: Training Large 3D CNNs with Hybrid Parallelism

Here, we present scalable hybrid-parallel algorithms for training large-scale 3D convolutional neural networks. Deep learning-based emerging scientific workflows often require model training with large, high-dimensional samples, which can make training much more costly and even infeasible due to excessive memory usage. We solve these challenges by extensively applying hybrid parallelism throughout the end-to-end training pipeline, including both computations and I/O. Our hybrid-parallel algorithm extends the standard data parallelism with spatial parallelism, which partitions a single sample in the spatial domain, realizing strong scaling beyond the mini-batch dimension with a larger aggregated memory capacity. We evaluate our proposed training algorithms with two challenging 3D CNNs, CosmoFlow and 3D U-Net. Our comprehensive performance studies show that good weak and strong scaling can be achieved for both networks using up to 2K GPUs. More importantly, we enable training of CosmoFlow with much larger samples than previously possible, realizing an order-of-magnitude improvement in prediction accuracy.

97 MATHEMATICS AND COMPUTING↗

Sources of Variability in the Stratospheric Column of Nitrogen Dioxide

Instruments such as the Global Ozone Monitoring Experiment (GOME, on the European Remote Sensing Satellite (ERS-2), launched 1995), the Scanning Imaging Absorption Spectrometer for Atmospheric Chartography (SCIAMACHY, on ENVISAT, to be launched July 2001) and the Ozone Monitoring Instrument (OMI on EOS Aura, to be launched 2003) make measurements of the total column of NO2. There is interest in separating the stratospheric and tropospheric contributions to the column, as the tropospheric column provides a measure of pollution. We are using a 3D chemistry and transport model driven by winds from the Goddard Space Flight Center Data Assimilation System to examine variability in the stratospheric NO2 column. Model results for NOx = NO + NO2 + 2N2O5 will be shown to compare well with sunset observations from the Halogen Occultation Experiment on the Upper Atmosphere Research Satellite, and to exhibit similar temporal and spatial dependence. Partitioning between NO, NO2, and N2O5 is also shown to compare well with observations. This good agreement supports the use of simulated fields in the stratosphere to derive the tropospheric column from the total column. Preliminary comparisons of the tropospheric column with model simulations for the troposphere will also be shown.

Douglass, Anne↗

Spatially Aware Linear Transformer (SAL-T) for Particle Jet Tagging

Transformers are very effective in capturing both global and local correlations within high-energy particle collisions, but they present deployment challenges in high-data-throughput environments, such as the CERN LHC. The quadratic complexity of transformer models demands substantial resources and increases latency during inference. In order to address these issues, we introduce the Spatially Aware Linear Transformer (SAL-T), a physics-inspired enhancement of the linformer architecture that maintains linear attention. Our method incorporates spatially aware partitioning of particles based on kinematic features, thereby computing attention between regions of physical significance. Additionally, we employ convolutional layers to capture local correlations, informed by insights from jet physics. In addition to outperforming the standard linformer in jet classification tasks, SAL-T also achieves classification results comparable to full-attention transformers, while using considerably fewer resources with lower latency during inference. Experiments on a generic point cloud classification dataset (ModelNet10) further confirm this trend. Our code is available at https://github.com/aaronw5/SAL-T4HEP.

Wang, Aaron [Illinois U., Chicago] (ORCID:00000003↗

Mesoscopic-microscopic spatial stochastic simulation with automatic system partitioning

The reaction-diffusion master equation (RDME) is a model that allows for efficient on-lattice simulation of spatially resolved stochastic chemical kinetics. Compared to off-lattice hard-sphere simulations with Brownian dynamics or Green’s function reaction dynamics, the RDME can be orders of magnitude faster if the lattice spacing can be chosen coarse enough. However, strongly diffusion-controlled reactions mandate a very fine mesh resolution for acceptable accuracy. It is common that reactions in the same model differ in their degree of diffusion control and therefore require different degrees of mesh resolution. This renders mesoscopic simulation inefficient for systems with multiscale properties. Mesoscopic-microscopic hybrid methods address this problem by resolving the most challenging reactions with a microscale, off-lattice simulation. However, all methods to date require manual partitioning of a system, effectively limiting their usefulness as “black-box” simulation codes. In this paper, we propose a hybrid simulation algorithm with automatic system partitioning based on indirect a priori error estimates. We demonstrate the accuracy and efficiency of the method on models of diffusion-controlled networks in 3D.

97 MATHEMATICS AND COMPUTING↗

Intelligent automated surface grid generation

The goal of our research is to produce a flexible, general grid generator for automated use by other programs, such as numerical optimizers. The current trend in the gridding field is toward interactive gridding. Interactive gridding more readily taps into the spatial reasoning abilities of the human user through the use of a graphical interface with a mouse. However, a sometimes fruitful approach to generating new designs is to apply an optimizer with shape modification operators to improve an initial design. In order for this approach to be useful, the optimizer must be able to automatically grid and evaluate the candidate designs. This paper describes and intelligent gridder that is capable of analyzing the topology of the spatial domain and predicting approximate physical behaviors based on the geometry of the spatial domain to automatically generate grids for computational fluid dynamics simulators. Typically gridding programs are given a partitioning of the spatial domain to assist the gridder. Our gridder is capable of performing this partitioning. This enables the gridder to automatically grid spatial domains of wide range of configurations.

Yao, Ke-Thia↗

Quantifying Spatial Drought Propagation Potential in North America Using Complex Network Theory

Droughts have a dominant three-dimensional (3-D) spatiotemporal structure typically spanning hundreds of kilometers and often lasting for months to years. Here, we introduced a novel framework to explore the 3-D structure of the evolution of droughts based on network theory concepts. The proposed framework is applied to identify critical source regions responsible for large-scale drought onsets during 1901–2014 for the North American continent using the Standardized Precipitation Evaporation Index (SPEI). We built a spatial network connecting the drought onset timings for the North American continent. Using a spatially weighted network partitioning algorithm, the whole continent is then classified into regional spatial drought networks (RSN), where droughts are more likely to propagate within these regional systems. Finally, a customized network metric was applied to identify locations (source regions) where the drought onsets further propagate to other areas within the regional spatial network. Our results indicated that the West coast, Texas coastal region, and Southeastern Arkansas as major source regions through which atmospheric drought propagates to Western, South Central, and Eastern North America. The formation of drought source regions are due to presence of high pressure ridges and anomalous wind patterns. Furthermore, our results indicate that the drought propagation from these source regions may be due to inadequate moisture transport. The proposed framework can help to develop an early warning detection system for droughts and other spatially extensive extreme events such as heatwaves and floods.

Goutam Konapala↗

Influence of Soil Heterogeneity on Mesoscale Land Surface Fluxes During Washita '92

The influence of soil heterogeneity on the partitioning of mesoscale land surface energy fluxes at diurnal time scales is investigated over a 10(exp 6) sq km domain centered on the Little Washita Basin, Oklahoma, for the period June 10 - 18, 1992. The sensitivity study is carried out using MM5/PLACE, the Penn State/NCAR MM5 model enhanced with the Parameterization for Land-Atmosphere-Cloud Exchange or PLACE. PLACE is a one-dimensional land surface model possessing detailed plant and soil water physics algorithms, multiple soil layers, and the capacity to model subgrid heterogeneity. A series of 12-hour simulations were conducted with identical atmospheric initialization and land surface characterization but with different initial soil moisture and texture. A comparison then was made of the simulated land surface energy flux fields, the partitioning of net radiation into latent and sensible heat, and the soil moisture fields. Results indicate that heterogeneity in both soil moisture and texture affects the spatial distribution and partitioning of mesoscale energy balance. Spatial averaging results in an overprediction of latent heat flux, and an underestimation of sensible heat flux. In addition to the primary focus on the partitioning of the land surface energy, the modeling effort provided an opportunity to examine the issue of initializing the soil moisture fields for coupled three-dimensional models. For the present case, the initial soil moisture and temperature were determined from off-line modeling using PLACE at each grid box, driven with a combination of observed and assimilated data fields.

Jasinski, Michael F.↗