A Multiple Source and Target Sweeping Method for Generating All Hexahedral Finite Element Meshes

: This paper presents an algorithm to enhance the capabilities of generating all hexahedral finite element meshes by the sweeping process. Traditional sweeping techniques are very useful and robust. They create meshes by projecting an existing single-surface mesh along a specified trajectory to a specified singletarget surface. In this process the source surface is meshed by any surface meshing algorithm while the sides that couple the source to the target are limited to a regular mapped quadrilateral mesh. This process is often called two and one half dimensional meshing. The procedure presented in this paper enhances this traditional technique by developing a projection technique that minimizes mesh distortion; and allows multiple connected surfaces to single target, multiple unconnected surfaces to single target, and multiple unconnected surfaces to multiple unconnected target sweeping. Keywords: Sweeping, Hexahedrons, Multiple Targets 1. Introduction Swept representations are base..

Bringing task and data parallelism to analysis of climate model output

Climate models are both outputting larger and larger amounts of data and are doing it on more sophisticated numerical grids. The tools climate scientists have used to analyze climate output, an essential component of climate modeling, are single threade

ParNCL and ParGAL: Data-parallel Tools for Postprocessing of Large-scale Earth Science Data

AbstractEarth science high-performance applications often require extensive analysis of their output in order to complete the scien- tific goals or produce a visual image or animation. Often this analysis cannot be done in situ because it requires calculating time-series statistics from state sampled over the entire length of the run or analyzing the relationship between similar time series from previous simulations or observations. Many of the tools used for this postprocessing are not themselves high- performance applications, but the new Parallel Gridded Analysis Library (ParGAL) provides high-performance data-parallel versions of several common analysis algorithms for data from a structured or unstructured grid simulation. The library builds on several scalable systems, including the Mesh Oriented DataBase (MOAB), a library for representing mesh data that sup- ports structured, unstructured finite element, and polyhedral grids; the Parallel-NetCDF (PNetCDF) library; and Intrepid, an extensible library for computing operators (such as gradient, curl, and divergence) acting on discretized fields. We have used ParGAL to implement a parallel version of the NCAR Command Language (NCL) a scripting language widely used in the climate community for analysis and visualization. The data-parallel algorithms in ParGAL/ParNCL are both higher performing and more flexible than their serial counterparts