Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Grid Partition”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

A coupled discontinuous Galerkin-Finite Volume framework for solving gas dynamics over embedded geometries

Herein, we present a computational framework for solving the equations of inviscid gas dynamics using structured grids with embedded geometries. The novelty of the proposed approach is the use of high-order discontinuous Galerkin (dG) schemes and a shock-capturing Finite Volume (FV) scheme coupled via an hp adaptive mesh refinement (hp-AMR) strategy that offers high-order accurate resolution of the embedded geometries. The hp-AMR strategy is based on a multi-level block-structured domain partition in which each level is represented by block-structured Cartesian grids and the embedded geometry is represented implicitly by a level set function. The intersection of the embedded geometry with the grids produces the implicitly-defined mesh that consists of a collection of regular rectangular cells plus a relatively small number of irregular curved elements in the vicinity of the embedded boundaries. High-order quadrature rules for implicitly-defined domains enable high-order accuracy resolution of the curved elements with a cell-merging strategy to address the small-cell problem. The hp-AMR algorithm treats the system with a second-order finite volume scheme at the finest level to dynamically track the evolution of solution discontinuities while using dG schemes at coarser levels to provide high-order accuracy in smooth regions of the flow. On the dG levels, the methodology supports different orders of basis functions on different levels. The space-discretized governing equations are then advanced explicitly in time using high-order Runge-Kutta algorithms. Numerical tests are presented for two-dimensional and three-dimensional problems involving an ideal gas. The results are compared with both analytical solutions and experimental observations and demonstrate that the framework provides high-order accuracy for smooth flows and accurately captures solution discontinuities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Interplay of waves and eddies in rotating stratified turbulence and the link with kinetic-potential energy partition

The interplay between waves and eddies in stably stratified rotating flows is investigated by means of world-class direct numerical simulations using up to 3072 3 grid points. Strikingly, we find that the shift from vortex- to wave-dominated dynamics occurs at a wave number kR which does not depend on the Reynolds number, suggesting that the partition of energy between wave and vortical modes is not sensitive to the development of turbulence at the smaller scales. Additionally, we also show that k R is comparable to the wave number at which exchanges between kinetic and potential modes stabilize at close to equipartition, emphasizing the role of potential energy, as conjectured in the atmosphere and the oceans. Moreover, k R varies as the inverse of the Froude number as explained by the scaling prediction proposed, consistently with recent observations and modeling of the Mesosphere–Lower Thermosphere and of the ocean.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Evolution of CMS Workload Management Towards Multicore Job Support

The successful exploitation of multicore processor architectures is a key element of the LHC distributed computing system in the coming era of the LHC Run 2. High-pileup complex-collision events represent a challenge for the traditional sequential programming in terms of memory and processing time budget. The CMS data production and processing framework is introducing the parallel execution of the reconstruction and simulation algorithms to overcome these limitations. CMS plans to execute multicore jobs while still supporting singlecore processing for other tasks difficult to parallelize, such as user analysis. The CMS strategy for job management thus aims at integrating single and multicore job scheduling across the Grid. This is accomplished by employing multicore pilots with internal dynamic partitioning of the allocated resources, capable of running payloads of various core counts simultaneously. An extensive test programme has been conducted to enable multicore scheduling with the various local batch systems available at CMS sites, with the focus on the Tier-0 and Tier-1s, responsible during 2015 of the prompt data reconstruction. Scale tests have been run to analyse the performance of this scheduling strategy and ensure an efficient use of the distributed resources. This paper presents the evolution of the CMS job management and resource provisioning systems in order to support this hybrid scheduling model, as well as its deployment and performance tests, which will enable CMS to transition to a multicore production model for the second LHC run.

Perez-Calero Yzquierdo, A.↗
NASA NTRS1997

Evaluating and Understanding Parameterized Convective Processes and their Role in the Development of Mesoscale Precipitation Systems

Research efforts during the second year have centered on improving the manner in which convective stabilization is achieved in the Penn State/NCAR mesoscale model MM5. Ways of improving this stabilization have been investigated by (1) refining the partitioning between the Kain-Fritsch convective parameterization scheme and the grid scale by introducing a form of moist convective adjustment; (2) using radar data to define locations of subgrid-scale convection during a dynamic initialization period; and (3) parameterizing deep-convective feedbacks as subgrid-scale sources and sinks of mass. These investigations were conducted by simulating a long-lived convectively-generated mesoscale vortex that occurred during 14-18 Jul. 1982 and the 10-11 Jun. 1985 squall line that occurred over the Kansas-Oklahoma region during the PRE-STORM experiment. The long-lived vortex tracked across the central Plains states and was responsible for multiple convective outbreaks during its lifetime.

Fritsch, J. Michael↗
NASA NTRS1994

Automated Instrumentation, Monitoring and Visualization of PVM Programs Using AIMS

We present views and analysis of the execution of several PVM (Parallel Virtual Machine) codes for Computational Fluid Dynamics on a networks of Sparcstations, including: (1) NAS Parallel Benchmarks CG and MG; (2) a multi-partitioning algorithm for NAS Parallel Benchmark SP; and (3) an overset grid flowsolver. These views and analysis were obtained using our Automated Instrumentation and Monitoring System (AIMS) version 3.0, a toolkit for debugging the performance of PVM programs. We will describe the architecture, operation and application of AIMS. The AIMS toolkit contains: (1) Xinstrument, which can automatically instrument various computational and communication constructs in message-passing parallel programs; (2) Monitor, a library of runtime trace-collection routines; (3) VK (Visual Kernel), an execution-animation tool with source-code clickback; and (4) Tally, a tool for statistical analysis of execution profiles. Currently, Xinstrument can handle C and Fortran 77 programs using PVM 3.2.x; Monitor has been implemented and tested on Sun 4 systems running SunOS 4.1.2; and VK uses XIIR5 and Motif 1.2. Data and views obtained using AIMS clearly illustrate several characteristic features of executing parallel programs on networked workstations: (1) the impact of long message latencies; (2) the impact of multiprogramming overheads and associated load imbalance; (3) cache and virtual-memory effects; and (4) significant skews between workstation clocks. Interestingly, AIMS can compensate for constant skew (zero drift) by calibrating the skew between a parent and its spawned children. In addition, AIMS' skew-compensation algorithm can adjust timestamps in a way that eliminates physically impossible communications (e.g., messages going backwards in time). Our current efforts are directed toward creating new views to explain the observed performance of PVM programs. Some of the features planned for the near future include: (1) ConfigView, showing the physical topology of the virtual machine, inferred using specially formatted IP (Internet Protocol) packets: and (2) LoadView, synchronous animation of PVM-program execution and resource-utilization patterns.

Mehra, Pankaj↗
DOE OSTI2013

Minimal multi-element stochastic collocation for uncertainty quantification of discontinuous functions

We propose a multi-element stochastic collocation method that can be applied in high-dimensional parameter space for functions with discontinuities lying along manifolds of general geometries. The key feature of the method is that the parameter space is decomposed into multiple elements defined by the discontinuities and thus only the minimal number of elements are utilized. On each of the resulting elements the function is smooth and can be approximated using high-order methods with fast convergence properties. The decomposition strategy is in direct contrast to the traditional multi-element approaches which define the sub-domains by repeated splitting of the axes in the parameter space. Such methods are more prone to the curse-of-dimensionality because of the fast growth of the number of elements caused by the axis based splitting. The present method is a two-step approach. Firstly a discontinuity detector is used to partition parameter space into disjoint elements in each of which the function is smooth. The detector uses an efficient combination of the high-order polynomial annihilation technique along with adaptive sparse grids, and this allows resolution of general discontinuities with a smaller number of points when the discontinuity manifold is low-dimensional. After partitioning, an adaptive technique based on the least orthogonal interpolant is used to construct a generalized Polynomial Chaos surrogate on each element. The adaptive technique reuses all information from the partitioning and is variance-suppressing. We present numerous numerical examples that illustrate the accuracy, efficiency, and generality of the method. When compared against standard locally-adaptive sparse grid methods, the present method uses many fewer number of collocation samples and is more accurate.

97 MATHEMATICS AND COMPUTING↗
NASA NTRSDate not supplied

Evaluating Subgrid-Scale Properties of Low Clouds over the Beaufort Sea in Arctic System Reanalysis using ARISE Airborne In Situ Observations

Arctic low clouds influence the evolution of the Arctic system through their effects on radiative fluxes, boundary layer mixing, stability, turbulence, humidity, and precipitation. Unfortunately, atmospheric models and retrospective analysis (reanalysis) products struggle to accurately simulate the occurrence and properties of low clouds in the Arctic. To better understand the magnitude and possible causes of this problem, we analyze the disagreements between the Arctic System Reanalysis version 2 (ASR) and data taken during the September 2014 Arctic Radiation-IceBridge Sea and Ice Experiment (ARISE) airborne campaign conducted over the Beaufort Sea. Previous analysis of grid scale-averaged meteorological variables revealed a lack of cloud water produced in ASR, related to warm/dry biases, a failure to produce sufficient cloud water in conditions that are observed to be favorable for large cloud water values, and sampling issues with the ARISE flight paths. However, ARISE collected meteorological observations at one second intervals, offering spatial data resolution comparable to the subgrid scale of ASR. Subgrid scale properties and processes must be parameterized in conventional atmospheric models and reanalyses such as ASR, and often rely on assumed distributions of meteorological variables about the grid box mean state. To enable an examination of the realism of ASR’s subgrid scale properties, we use high resolution data from ARISE determine the “subgrid scale” distributions of cloud water and thermodynamic variables in the real atmosphere. Preliminary results show that the subgrid scale distribution of thermodynamic variables about the grid scale mean resembles the triangular distribution assumed in many bulk microphysical parameterization schemes, but also with tails resembling Gaussian distributions. The main goal is to understand the partitioning of the total available atmospheric water into water vapor and cloud water. Models typically covert some percentage of total water in a grid box to cloud water based on the estimated amount of supersaturation from the assumed vapor distribution. The ARISE measurements can reveal the relationship between subgrid scale supersaturation and the partition between cloud water and water vapor.

Jason Brant Dodson↗
NASA NTRS1995

Computations of Viscous Flows in Complex Geometries Using Multiblock Grid Systems

Generating high quality, structured, continuous, body-fitted grid systems (multiblock grid systems) for complicated geometries has long been a most labor-intensive and frustrating part of simulating flows in complicated geometries. Recently, new methodologies and software have emerged that greatly reduce the human effort required to generate high quality multiblock grid systems for complicated geometries. These methods and software require minimal input form the user-typically, only information about the topology of the block structure and number of grid points. This paper demonstrates the use of the new breed of multiblock grid systems in simulations of internal flows in complicated geometries. The geometry used in this study is a duct with a sudden expansion, a partition, and an array of cylindrical pins. This geometry has many of the features typical of internal coolant passages in turbine blades. The grid system used in this study was generated using a commercially available grid generator. The simulations were done using a recently developed flow solver, TRAF3D.MB, that was specially designed to use multiblock grid systems.

Steinthorsson, Erlendur↗
DOE OSTI2019

Immersed Boundary Method Halo Exchange in a Hemodynamics Application

In recent years, highly parallelized simulations of blood flow resolving individual blood cells have been demonstrated. Simulating such dense suspensions of deformable particles in flow often involves a partitioned fluid-structure interaction (FSI) algorithm, with separate solvers for Eulerian fluid and Lagrangian cell grids, plus a solver - e.g., immersed boundary method - for their interaction. Managing data motion in parallel FSI implementations is increasingly important, particularly for inhomogeneous systems like vascular geometries. In this study, we evaluate the influence of Eulerian and Lagrangian halo exchanges on efficiency and scalability of a partitioned FSI algorithm for blood flow. We describe an MPI+OpenMP implementation of the immersed boundary method coupled with lattice Boltzmann and finite element methods. We consider how communication and recomputation costs influence the optimization of halo exchanges with respect to three factors: immersed boundary interaction distance, cell suspension density, and relative fluid/cell solver costs.

Gounley, John↗
NASA NTRS1985

A partitioning strategy for nonuniform problems on multiprocessors

The partitioning of a problem on a domain with unequal work estimates in different subddomains is considered in a way that balances the work load across multiple processors. Such a problem arises for example in solving partial differential equations using an adaptive method that places extra grid points in certain subregions of the domain. A binary decomposition of the domain is used to partition it into rectangles requiring equal computational effort. The communication costs of mapping this partitioning onto different microprocessors: a mesh-connected array, a tree machine and a hypercube is then studied. The communication cost expressions can be used to determine the optimal depth of the above partitioning.

Berger, M. J.↗
NASA NTRS1987

A partitioning strategy for nonuniform problems on multiprocessors

The partitioning of a problem on a domain with unequal work estimates in different subdomains is considered in a way that balances the work load across multiple processors. Such a problem arises for example in solving partial differential equations using an adaptive method that places extra grid points in certain subregions of the domain. A binary decomposition of the domain is used to partition it into rectangles requiring equal computational effort. The communication costs of mapping this partitioning onto different microprocessors: a mesh-connected array, a tree machine and a hypercube is then studied. The communication cost expressions can be used to determine the optimal depth of the above partitioning.

Berger, Marsha J.↗
NASA NTRS1994

Simulating fluxes from heterogeneous land surfaces: Explicit subgrid method employing the biosphere-atmosphere transfer scheme (BATS)

A vectorized version of the biosphere-atmosphere transfer scheme (VBATS) is used to study moisture, energy, and momentum fluxes from heterogeneous land surfaces st the scale of an atmospheric model (AM) grid cells. To incorporate subgrid scale inhomogeneity, VBATS includes two important features: (1) characterization of the land surface (vegetation and soil parameters) at N subgrid points within an AM grid cell and (2) explicit distribution of climate forcing (precipitation, clouds, etc.) over the subgrid. In this study, VBATS is used in stand-alone mode to simulate a single AM grid cell and to evaluate the effects of subgrid scale vegetation and climate specification on the surface fluxes and hydrology. It is found that the partitioning of energy can be affected by up to 30%, runoff by 50%, and surface stress in excess of 60%. Distributing climate forcing over the AM grid cell increases the Bowen ratio, as a result of enhanced sensible heat flux and reduced latent heat flux. The combined effect of heterogeneous vegetation and distribution of climate is found to be dependent on the dominat vegetation class in the AM grid cell. Development of this method is part of a larger program to explore the importance of subgrid scale processes in regional and global climate simulations.

Seth, Anji↗
NASA NTRS1994

Automated Instrumentation, Monitoring and Visualization of PVM Programs Using AIMS

We present views and analysis of the execution of several PVM codes for Computational Fluid Dynamics on a network of Sparcstations, including (a) NAS Parallel benchmarks CG and MG (White, Alund and Sunderam 1993); (b) a multi-partitioning algorithm for NAS Parallel Benchmark SP (Wijngaart 1993); and (c) an overset grid flowsolver (Smith 1993). These views and analysis were obtained using our Automated Instrumentation and Monitoring System (AIMS) version 3.0, a toolkit for debugging the performance of PVM programs. We will describe the architecture, operation and application of AIMS. The AIMS toolkit contains (a) Xinstrument, which can automatically instrument various computational and communication constructs in message-passing parallel programs; (b) Monitor, a library of run-time trace-collection routines; (c) VK (Visual Kernel), an execution-animation tool with source-code clickback; and (d) Tally, a tool for statistical analysis of execution profiles. Currently, Xinstrument can handle C and Fortran77 programs using PVM 3.2.x; Monitor has been implemented and tested on Sun 4 systems running SunOS 4.1.2; and VK uses X11R5 and Motif 1.2. Data and views obtained using AIMS clearly illustrate several characteristic features of executing parallel programs on networked workstations: (a) the impact of long message latencies; (b) the impact of multiprogramming overheads and associated load imbalance; (c) cache and virtual-memory effects; and (4significant skews between workstation clocks. Interestingly, AIMS can compensate for constant skew (zero drift) by calibrating the skew between a parent and its spawned children. In addition, AIMS' skew-compensation algorithm can adjust timestamps in a way that eliminates physically impossible communications (e.g., messages going backwards in time). Our current efforts are directed toward creating new views to explain the observed performance of PVM programs. Some of the features planned for the near future include: (a) ConfigView, showing the physical topology of the virtual machine, inferred using specially formatted IP (Internet Protocol) packets; and (b) LoadView, synchronous animation of PVM-program execution and resource-utilization patterns.

Mehra, Pankaj↗
DOE OSTI2012

Systems Engineering Applications to Wind Energy Research, Design, and Development (Poster)

Over the last few decades, wind energy has evolved into a large international industry involving major players in the manufacturing, construction, and utility sectors. Coinciding with the industry's growth, significant innovation in the technology has resulted in larger turbines with lower associated costs of energy and more complex designs in all subsystems. However, as the deployment of thetechnology grows, and its role within the electricity sector becomes more prominent, so has the expectations of the technology in terms of performance, reliability, and cost. The industry currently partitions its efforts into separate paths for turbine design, plant design and development, grid interaction and operation, and mitigation of adverse community and environmental impacts. Theseactivities must be integrated to meet a diverse set of goals while recognizing trade-offs between them. To address these challenges, the National Renewable Energy Laboratory (NREL) has embarked on the Wind Energy Systems Engineering (WESE) initiative to use methods of systems engineering in the research, design, and development of wind energy systems. Systems engineering is a field that has along history of application to complex technical systems. The work completed to date represents a first step in understanding this potential. It reviews systems engineering methods as applied to related technical systems and illustrates how these methods can be combined in a WESE framework to meet the research, design, and development needs for the future of the industry.

17 WIND ENERGY↗
DOE OSTI2017

A stable partitioned FSI algorithm for rigid bodies and incompressible flow. Part I: Model problem analysis

A stable partitioned algorithm is developed for fluid-structure interaction (FSI) problems involving viscous incompressible flow and rigid bodies. This added-mass partitioned (AMP) algorithm remains stable, without sub-iterations, for light and even zero mass rigid bodies when added-mass and viscous added-damping effects are large. The scheme is based on a generalized Robin interface condition for the fluid pressure that includes terms involving the linear acceleration and angular acceleration of the rigid body. Added mass effects are handled in the Robin condition by inclusion of a boundary integral term that depends on the pressure. Added-damping effects due to the viscous shear forces on the body are treated by inclusion of added-damping tensors that are derived through a linearization of the integrals defining the force and torque. Added-damping effects may be important at low Reynolds number, or, for example, in the case of a rotating cylinder or rotating sphere when the rotational moments of inertia are small. In this second part of a two-part series, the general formulation of the AMP scheme is presented including the form of the AMP interface conditions and added-damping tensors for general geometries. A fully second-order accurate implementation of the AMP scheme is developed in two dimensions based on a fractional-step method for the incompressible Navier-Stokes equations using finite difference methods and overlapping grids to handle the moving geometry. Here, the numerical scheme is verified on a number of difficult benchmark problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Parallel adaptive wavelet collocation method for PDEs

A parallel adaptive wavelet collocation method for solving a large class of Partial Differential Equations is presented. The parallelization is achieved by developing an asynchronous parallel wavelet transform, which allows one to perform parallel wavelet transform and derivative calculations with only one data synchronization at the highest level of resolution. The data are stored using tree-like structure with tree roots starting at a priori defined level of resolution. Both static and dynamic domain partitioning approaches are developed. For the dynamic domain partitioning, trees are considered to be the minimum quanta of data to be migrated between the processes. This allows fully automated and efficient handling of non-simply connected partitioning of a computational domain. Dynamic load balancing is achieved via domain repartitioning during the grid adaptation step and reassigning trees to the appropriate processes to ensure approximately the same number of grid points on each process. The parallel efficiency of the approach is discussed based on parallel adaptive wavelet-based Coherent Vortex Simulations of homogeneous turbulence with linear forcing at effective non-adaptive resolutions up to 2048{sup 3} using as many as 2048 CPU cores.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1999

Performance and Application of Parallel OVERFLOW Codes on Distributed and Shared Memory Platforms

The presentation discusses recent studies on the performance of the two parallel versions of the aerodynamics CFD code, OVERFLOW_MPI and _MLP. Developed at NASA Ames, the serial version, OVERFLOW, is a multidimensional Navier-Stokes flow solver based on overset (Chimera) grid technology. The code has recently been parallelized in two ways. One is based on the explicit message-passing interface (MPI) across processors and uses the _MPI communication package. This approach is primarily suited for distributed memory systems and workstation clusters. The second, termed the multi-level parallel (MLP) method, is simple and uses shared memory for all communications. The _MLP code is suitable on distributed-shared memory systems. For both methods, the message passing takes place across the processors or processes at the advancement of each time step. This procedure is, in effect, the Chimera boundary conditions update, which is done in an explicit "Jacobi" style. In contrast, the update in the serial code is done in more of the "Gauss-Sidel" fashion. The programming efforts for the _MPI code is more complicated than for the _MLP code; the former requires modification of the outer and some inner shells of the serial code, whereas the latter focuses only on the outer shell of the code. The _MPI version offers a great deal of flexibility in distributing grid zones across a specified number of processors in order to achieve load balancing. The approach is capable of partitioning zones across multiple processors or sending each zone and/or cluster of several zones into a single processor. The message passing across the processors consists of Chimera boundary and/or an overlap of "halo" boundary points for each partitioned zone. The MLP version is a new coarse-grain parallel concept at the zonal and intra-zonal levels. A grouping strategy is used to distribute zones into several groups forming sub-processes which will run in parallel. The total volume of grid points in each group are approximately balanced. A proper number of threads are initially allocated to each group, and in subsequent iterations during the run-time, the number of threads are adjusted to achieve load balancing across the processes. Each process exploits the multitasking directives already established in Overflow.

Djomehri, M. Jahed↗
DOE OSTI2011

Control Volume Finite Element Method with Multidimensional Edge Element Scharfetter-Gummel upwinding. Part 2. Computational Study

In [3] we proposed a new Control Volume Finite Element Method with multi-dimensional, edge- based Scharfetter-Gummel upwinding (CVFEM-MDEU). This report follows up with a detailed computational study of the method. The study compares the CVFEM-MDEU method with other CVFEM and FEM formulations for a set of standard scalar advection-diffusion test problems in two dimensions. The first two CVFEM formulations are derived from the CVFEM-MDEU by simplifying the computation of the flux integrals on the sides of the control volumes, the third is the nodal CVFEM [2] without upwinding, and the fourth is the streamline upwind version of CVFEM [10]. The finite elements in our study are the standard Galerkin, SUPG and artificial diffusion methods. All studies employ logically Cartesian partitions of the unit square into quadrilateral elements. Both uniform and non-uniform grids are considered. Our results demonstrate that CVFEM-MDEU and its simplified versions perform equally well on rectangular or nearly rectangular grids. However, performance of the simplified versions significantly degrades on non-affine grids, whereas the CVFEM-MDEU remains stable and accurate over a wide range of mesh Peclet numbers and non-affine grids. Compared to FEM formulations the CVFEM-MDEU appears to be slightly more dissipative than the SUPG, but has much less local overshoots and undershoots.

97 MATHEMATICS AND COMPUTING↗