Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “grid computing”

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 217 records · Page 12

Residual estimation for grid modification in wall-modeled large eddy simulation using unstructured high-order methods

Here, the accuracy and computational cost of a large eddy simulation are highly dependent on the computational grid. Building optimal grids manually from a priori knowledge is not feasible in most practical use cases; instead, solution-adaptive strategies can provide a robust and cost-efficient method to generate a grid with the desired accuracy. We adapt the residual estimation algorithm developed by Toosi and Larsson for Discontinuous Galerkin Spectral Elements Methods (DGSEM) to guide the grid-adaptation process. The core of the method is the computation of the estimated modeling residual using the polynomial basis functions used in DGSEM, and the averaging of the estimated residual over each element. The final method is assessed in multiple channel flow test cases and for the transonic flow over an airfoil, in both cases making use of mortar interfaces between elements with hanging nodes. The method is found to be robust and reliable, and to provide solutions on grids with significantly fewer elements at comparable accuracy compared to when using human-generated grids.

97 MATHEMATICS AND COMPUTING↗

FTS3: Data Movement Service in containers deployed in OKD [Slides]

The File Transfer Service (FTS3) is a data movement service developed at CERN which is used to distribute the majority of the Large Hadron Collider's data across the Worldwide LHC Computing Grid (WLCG) infrastructure. At Fermilab, we have deployed a couple of FTS3 instances for Intensity Frontier experiments (e.g. DUNE) to transfer data in America and Europe, using a container-based strategy. During this talk, we are going to present the two different configurations currently running at Fermilab, comparing and contrasting a Docker-based OKD deployment against a traditional RPM-based deployment and giving an overview of the possible issues encountered. In addition, we discuss our method of certificate management and maintenance utilizing Kubernetes cronjobs.

97 MATHEMATICS AND COMPUTING↗

A Wall-Distance Method for Turbulence Modeling

The distance from a grid point to the closest wall surface, wall distance, is a funda- mental quantity in turbulence modeling. Efficiency of wall-distance calculations has become more critical as the size of computational grids has significantly increased in recent years. This paper reports on an initial implementation of a new search-based wall-distance method that is suitable for general unstructured computational fluid dynamics (CFD) grids and tailored for requirements specific for turbulence modeling. The method represents a two-step approach to calculate the wall distance. In the first step, the wall distance is approximated for each grid point as the minimum distance from this point to a vertex of a triangular face at the wall. The point-to-vertex distance calculation is relatively inexpensive but may lead to a significant error in the wall-distance ap- proximation, especially for grid points near the wall. In the second step, for grid points located within a predefined distance ( threshold ) from the wall, the wall distance is computed as the minimum distance to wall faces. As a result, the wall distance is exact for all grid points within the threshold. This two-step approach reduces the computational cost yet achieves high and controllable accuracy in the evaluation of the wall distance. Algorithmic enhancements are presented to improve efficiency of wall-distance computations. Comprehensive assessment of the new method is reported for large-scale unstructured CFD grids generated for the Fifth AIAA CFD High-Lift Prediction Workshop. The performance of the new wall-distance method compares favorably with performance of two established methods implemented in high-performance CFD codes.

Wall Distance↗

Evolution of the Distributed Computing Model of the CMS experiment at the LHC

The Computing Model of the CMS experiment was prepared in 2005 and described in detail in the CMS Computing Technical Design Report. With the experience of the first years of LHC data taking and with the evolution of the available technologies, the CMS Collaboration identified areas where improvements were desirable. In this work we describe the most important modifications that have been, or are being implemented in the Distributed Computing Model of CMS. The Worldwide LHC computing Grid (WLCG) project acknowledged that the whole distributed computing infrastructure is impacted by this kind of changes that are happening in most LHC experiments and decided to create several Technical Evolution Groups (TEG) aiming at assessing the situation and at developing a strategy for the future. In this work we describe the CMS view on the TEG activities as well.

Grandi, C.↗

Generating Three-Dimensional Grids About Anything

Three-Dimensional Grids About Anything by Poisson's Equation (3DGRAPE) computer program designed to make computational grids in or about almost any shape. Generated by solution of Poisson's differential equations in three dimensions. Program automatically finds its own values for inhomogeneous terms giving near-orthogonality and controlled grid-cell height at boundaries. Grids generated applied to both viscous and inviscid aerodynamic problems, and to problems in other areas of fluid dynamics. Written in 100 percent FORTRAN 77.

Sorenson, Reese L.↗

Gridding strategies and associated results for winged entry vehicles

Two volume grid strategies based on similar software are presented for a geometrically complex entry vehicle. It is shown that quick relatively simple grid generation techniques can be used to construct computational grids about entry vehicles with nontrivial geometric complexity. Particular attention is given to both single- and dual-block grid topologies for a lifting body and solution generated on each grid. Results indicate that the grid topology can have an effect on the nature of the solution.

Weilmuenster, K. J.↗

The Future of Electronic Device Design: Device and Process Simulation Find Intelligence on the World Wide Web

We are on the path to meet the major challenges ahead for TCAD (technology computer aided design). The emerging computational grid will ultimately solve the challenge of limited computational power. The Modular TCAD Framework will solve the TCAD software challenge once TCAD software developers realize that there is no other way to meet industry's needs. The modular TCAD framework (MTF) also provides the ideal platform for solving the TCAD model challenge by rapid implementation of models in a partial differential solver.

Biegel, Bryan A.↗

Fibonacci Grids

Recent years have seen a resurgence of interest in a variety of non-standard computational grids for global numerical prediction. The motivation has been to reduce problems associated with the converging meridians and the polar singularities of conventional regular latitude-longitude grids. A further impetus has come from the adoption of massively parallel computers, for which it is necessary to distribute work equitably across the processors; this is more practicable for some non-standard grids. Desirable attributes of a grid for high-order spatial finite differencing are: (i) geometrical regularity; (ii) a homogeneous and approximately isotropic spatial resolution; (iii) a low proportion of the grid points where the numerical procedures require special customization (such as near coordinate singularities or grid edges). One family of grid arrangements which, to our knowledge, has never before been applied to numerical weather prediction, but which appears to offer several technical advantages, are what we shall refer to as "Fibonacci grids". They can be thought of as mathematically ideal generalizations of the patterns occurring naturally in the spiral arrangements of seeds and fruit found in sunflower heads and pineapples (to give two of the many botanical examples). These grids possess virtually uniform and highly isotropic resolution, with an equal area for each grid point. There are only two compact singular regions on a sphere that require customized numerics. We demonstrate the practicality of these grids in shallow water simulations, and discuss the prospects for efficiently using these frameworks in three-dimensional semi-implicit and semi-Lagrangian weather prediction or climate models.

Swinbank, Richard↗

NAS Grid Benchmarks: A Tool for Grid Space Exploration

We present an approach for benchmarking services provided by computational Grids. It is based on the NAS Parallel Benchmarks (NPB) and is called NAS Grid Benchmark (NGB) in this paper. We present NGB as a data flow graph encapsulating an instance of an NPB code in each graph node, which communicates with other nodes by sending/receiving initialization data. These nodes may be mapped to the same or different Grid machines. Like NPB, NGB will specify several different classes (problem sizes). NGB also specifies the generic Grid services sufficient for running the bench-mark. The implementor has the freedom to choose any specific Grid environment. However, we describe a reference implementation in Java, and present some scenarios for using NGB.

Frumkin, Michael↗

Multiscale Modeling of Porous Medium Systems. In: Handbook of Porous Media, Third edition

The use of computers over the last 60 years for simulating subsurface “ow problems has provided an impressive, ever-expanding ability to model processes at a high resolution. Whereas in the 1960s a computational grid with 500 œxed nodes would have pushed the boundaries of computer power [59], simulations today involve millions of spatial grid points and adaptive meshes [40,57].

Dye, Amanda↗

Turbulence statistics in fully developed channel flow at low Reynolds number

A direct numerical simulation of a turbulent channel flow is performed. The unsteady Navier-Stokes equations are solved numerically at a Reynolds number of 3300, based on the mean centerline velocity and channel half-width, with about 4 million grid points. All essential turbulence scales are resolved on the computational grid and no subgrid model is used. A large number of turbulence statistics are computed and compared with the existing experimental data at comparable Reynolds numbers. Agreements as well as discrepancies are discussed in detail. Particular attention is given to the behavior of turbulence correlations near the wall. A number of statistical correlations which are complementary to the existing experimental data are reported for the first time.

Kim, John↗

Kestrel Results at Liftoff Conditions for a Space Launch System Configuration in Proximity to the Launch Tower

Aerodynamic data books for Space Launch System vehicles require databases for the integrated forces and moments and section loads during liftoff and transition to the ascent phase of flight. While the force and moment database can be generated from wind tunnel results, computational analyses are necessary to provide the extensive surface information required to generate proper lineloads. Of the two flight regimes, the liftoff problem is the more costly and complex situation to simulate, as it requires modeling of the vehicle in proximity to the launch tower. The effects of massive separation on the leeward pressure fields of both the tower and vehicle are not well captured with RANS methods, necessitating the use of more advanced methods, such as Delayed Detached Eddy Simulation, in conjunction with computational grids sufficiently refined to resolve the wakes. Details on the computational setup for employing the Kestrel flow solver to address the liftoff problem are presented. The methodology involves the use of independent unstructured near-body grids for the vehicle and the tower, overset by a solution adaptive Cartesian off-body grid. Results from the simulations are compared to experimental results from a test in the NASA Langley Research Center 14- by 22-Foot Subsonic Tunnel.

Computational fluid dynamics↗

Using Computing and Data Grids for Large-Scale Science and Engineering

We use the term "Grid" to refer to a software system that provides uniform and location independent access to geographically and organizationally dispersed, heterogeneous resources that are persistent and supported. These emerging data and computing Grids promise to provide a highly capable and scalable environment for addressing large-scale science problems. We describe the requirements for science Grids, the resulting services and architecture of NASA's Information Power Grid (IPG) and DOE's Science Grid, and some of the scaling issues that have come up in their implementation.

Johnston, William E.↗

Unit physics performance of a mix model in Eulerian fluid computations

In this report, we evaluate the performance of a K-L drag-buoyancy mix model, described in a reference study by Dimonte-Tipton [1] hereafter denoted as [D-T]. The model was implemented in an Eulerian multi-material AMR code, and the results are discussed here for a series of unit physics tests. The tests were chosen to calibrate the model coefficients against empirical data, principally from RT (Rayleigh-Taylor) and RM (Richtmyer-Meshkov) experiments, and the present results are compared to experiments and to results reported in [D-T]. Results show the Eulerian implementation of the mix model agrees well with expectations for test problems in which there is no convective flow of the mass averaged fluid, i.e., in RT mix or in the decay of homogeneous isotropic turbulence (HIT). In RM shock-driven mix, the mix layer moves through the Eulerian computational grid, and there are differences with the previous results computed in a Lagrange frame [D-T]. The differences are attributed to the mass averaged fluid motion and examined in detail. Shock and re-shock mix are not well matched simultaneously. Results are also presented and discussed regarding model sensitivity to coefficient values and to initial conditions (IC), grid convergence, and the generation of atomically mixed volume fractions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Navier-Stokes Computations On Zonal Grids

Report describes numerical simulations of transonic flow of air about isolated wing and about wing and fuselage (not tail assembly) of F-16A aircraft. Fast, diagonalized Beam-Warming numerical-integration algorithm for solution of Euler and Navier-Stokes equations applied via Transonic Navier-Stokes computer program, using computational grids divided into zones of coarse and finer meshes.

Flores, Jolen↗

Storage Resource Manager version 2.2: Design, implementation, and testing experience

Storage Services are crucial components of the Worldwide LHC Computing Grid Infrastructure spanning more than 200 sites and serving computing and storage resources to the High Energy Physics LHC communities. Up to tens of Petabytes of data are col lected every year by the four LHC experiments at CERN. To process these large data volumes it is important to establish a protocol and a very efficient interface to the various storage solutions adopted by the WLCG sites. In this work we report on the exp erience acquired during the definition of the Storage Resource Manager v2.2 protocol. In particular, we focus on the study performed to enhance the interface and make it suitable for use by the WLCG communities. At the moment 5 different storage solutions implement the SRM v2.2 interface: BeStMan (LBNL), CASTOR (CERN and RAL), dCache (DESY and FNAL), DPM (CERN), and StoRM (INFN and ICTP). After a detailed inside review of the protocol, various test suites have been written identifying the most effective s et of tests: the S2 test suite from CERN and the SRM-Tester test suite from LBNL. Such test suites have helped verifying the consistency and coherence of the proposed protocol and validating existing implementations. We conclude our work describing the re sults achieved.

Donno, Flavia↗

Development of a computer code for calculating the steady super/hypersonic inviscid flow around real configurations. Volume 1: Computational technique

A numerical procedure has been developed to compute the inviscid super/hypersonic flow field about complex vehicle geometries accurately and efficiently. A second order accurate finite difference scheme is used to integrate the three dimensional Euler equations in regions of continuous flow, while all shock waves are computed as discontinuities via the Rankine Hugoniot jump conditions. Conformal mappings are used to develop a computational grid. The effects of blunt nose entropy layers are computed in detail. Real gas effects for equilibrium air are included using curve fits of Mollier charts. Typical calculated results for shuttle orbiter, hypersonic transport, and supersonic aircraft configurations are included to demonstrate the usefulness of this tool.

Marconi, F.↗