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 1,117 records · Page 62
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Accelerating Science Impact through Big Data Workflow Management and Supercomputing

The Large Hadron Collider (LHC), operating at the international CERN Laboratory in Geneva, Switzerland, is leading Big Data driven scientific explorations. ATLAS, one of the largest collaborations ever assembled in the the history of science, is at the forefront of research at the LHC. To address an unprecedented multi-petabyte data processing challenge, the ATLAS experiment is relying on a heterogeneous distributed computational infrastructure. To manage the workflow for all data processing on hundreds of data centers the PanDA (Production and Distributed Analysis)Workload Management System is used. An ambitious program to expand PanDA to all available computing resources, including opportunistic use of commercial and academic clouds and Leadership Computing Facilities (LCF), is realizing within BigPanDA and megaPanDA projects. These projects are now exploring how PanDA might be used for managing computing jobs that run on supercomputers including OLCF’s Titan and NRC-KI HPC2. The main idea is to reuse, as much as possible, existing components of the PanDA system that are already deployed on the LHC Grid for analysis of physics data. The next generation of PanDA will allow many data-intensive sciences employing a variety of computing platforms to benefit from ATLAS experience and proven tools in highly scalable processing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Integration Of PanDA Workload Management System With Supercomputers for ATLAS and Data Intensive Science

The.LHC, operating at CERN, is leading Big Data driven scientific explorations. Experiments at the LHC explore the fundamental nature of matter and the basic forces that shape our universe. ATLAS, one of the largest collaborations ever assembled in the sciences, is at the forefront of research at the LHC. To address an unprecedented multi-petabyte data processing challenge, the ATLAS experiment is relying on a heterogeneous distributed computational infrastructure. The ATLAS experiment uses PanDA (Production and Data Analysis) Workload Management System for managing the workflow for all data processing on over 150 data centers. Through PanDA, ATLAS physicists see a single computing facility that enables rapid scientific breakthroughs for the experiment, even though the data centers are physically scattered all over the world. While PanDA currently uses more than 250,000 cores with a peak performance of 0.3 petaFLOPS, LHC data taking runs require more resources than grid can possibly provide. To alleviate these challenges, LHC experiments are engaged in an ambitious program to expand the current computing model to include additional resources such as the opportunistic use of supercomputers. We will describe a project aimed at integration of PanDA WMS with supercomputers in United States, in particular with Titan supercomputer at Oak Ridge Leadership Computing Facility. Current approach utilizes modified PanDA pilot framework for job submission to the supercomputers batch queues and local data management, with light-weight MPI wrappers to run single threaded workloads in parallel on LCFs multi-core worker nodes. This implementation was tested with a variety of Monte-Carlo workloads on several supercomputing platforms for ALICE and ATLAS experiments and it is in full pro duction for the ATLAS since September 2015. We will present our current accomplishments with running PanDA at supercomputers and demonstrate our ability to use PanDA as a portal independent of the computing facilities infrastructure for High Energy and Nuclear Physics as well as other data-intensive science applications, such as bioinformatics and astro-particle physics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Regionally refined test bed in E3SM atmosphere model version 1 (EAMv1) and applications for high-resolution modelling

Climate simulation with more accurate process-level representation at finer resolutions is a pressing necessity in order to provide actionable information to policy-makers regarding extreme events in a changing climate. Computational limitation is a major obstacle for building, and running high-resolution (HR, here 0.25° average grid spacing at the equator) models (HRM). A more affordable path to HRM is to use a global regionally refined model (RRM), which only simulates a portion of the globe at HR while the remaining is at low-resolution (LR, 1°). In this study, we compare the Energy Exascale Earth System Model (E3SM) atmosphere model version 1 (EAMv1) RRM with the HR mesh over the contiguous United States (CONUS) to its corresponding globally uniform LR and HR configurations, as well as to observations and reanalysis data. The RRM has a significantly reduced computational cost (roughly proportional to the HR mesh size) relative to the globally uniform HRM. Over the CONUS, we evaluate the simulation of important dynamical and physical quantities as well as various precipitation measures. Differences between the RRM and HRM over the HR region are predominantly small, demonstrating that the RRM reproduces both well- and poorly simulated behaviours of the HRM over the CONUS. Further analysis based on RRM simulations with the LR vs. HR model parameters reveals that RRM performance is greatly influenced by the different parameter choices used in the LR and HR EAMv1. This is a result of the poor scale-aware behaviour of physical parameterizations, especially for variables influencing sub-grid scale physical processes. RRM can serve as a useful framework to test physics schemes across a range of scales, leading to improved consistency in future E3SM versions. Applying nudging-to-observations techniques within the RRM framework also demonstrates significant advantages over a free-running configuration for use as a testbed, and as such represents an efficient and more robust physics testbed capability. Our conclusions provide additional confirmatory evidence that the RRM is an efficient and effective approach for HRM development and hydrologic research.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2015

Computing an operating parameter of a unified power flow controller

A Unified Power Flow Controller described herein comprises a sensor that outputs at least one sensed condition, a processor that receives the at least one sensed condition, a memory that comprises control logic that is executable by the processor; and power electronics that comprise power storage, wherein the processor causes the power electronics to selectively cause the power storage to act as one of a power generator or a load based at least in part upon the at least one sensed condition output by the sensor and the control logic, and wherein at least one operating parameter of the power electronics is designed to facilitate maximal transmittal of electrical power generated at a variable power generation system to a grid system while meeting power constraints set forth by the electrical power grid.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

rabpro: global watershed boundaries, river elevation profiles, and catchment statistics

River and Basin Profiler (rabpro) is a Python package to delineate watersheds, extract river flowlines and elevation profiles, and compute watershed statistics for any location on the Earth’s surface. As fundamental hydrologically-relevant units of surface area, watersheds are areas of land that drain via aboveground pathways to the same location, or outlet. Delineations of watershed boundaries are typically performed on digital elevation models (DEMs) that represent surface elevations as gridded rasters. Depending on the resolution of the DEM and the size of the watershed, delineation may be very computationally expensive. With this in mind, we designed rabpro to provide user-friendly workflows to manage the complexity and computational expense of watershed calculations given an arbitrary coordinate pair. In addition to basic watershed delineation, rabpro will extract the elevation profile for a watershed’s mainchannel flowline. This enables the computation of river slope, which is a critical parameter in many hydrologic and geomorphologic models. Finally, rabpro provides a user-friendly wrapper around Google Earth Engine’s (GEE) Python API to enable cloud-computing of zonal watershed statistics and/or time-varying forcing data from hundreds of available datasets. Altogether, rabpro provides the ability to automate or semi-automate complex watershed analysis workflows across broad spatial extents.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Machine Committee Framework for Power Grid Disturbances Analysis Using Synchrophasors Data

Events detection is a key challenge in power grid frequency disturbances analysis. Accurate detection of events is crucial for situational awareness of the power system. In this paper, we study the problem of events detection in power grid frequency disturbance analysis using synchrophasors data streams. Current events detection approaches for power grid rely on individual detection algorithm. This study integrates some of the existing detection algorithms using the concept of machine committee to develop improved detection approaches for grid disturbance analysis. Specifically, we propose two algorithms—an Event Detection Machine Committee (EDMC) algorithm and a Change-Point Detection Machine Committee (CPDMC) algorithm. Both algorithms use parallel architecture to fuse detection knowledge of its individual methods to arrive at an overall output. The EDMC algorithm combines five individual event detection methods, while the CPDMC algorithm combines two change-point detection methods. Each method performs the detection task separately. The overall output of each algorithm is then computed using a voting strategy. The proposed algorithms are evaluated using three case studies of actual power grid disturbances. Compared with the individual results of the various detection methods, we found that the EDMC algorithm is a better fit for analyzing synchrophasors data; it improves the detection accuracy; and it is suitable for practical scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2016

Shape optimization using a NURBS-based interface-enriched generalized FEM

This study presents a gradient-based shape optimization over a fixed mesh using a non-uniform rational B-splines-based interface-enriched generalized finite element method, applicable to multi-material structures. In the proposed method, non-uniform rational B-splines are used to parameterize the design geometry precisely and compactly by a small number of design variables. An analytical shape sensitivity analysis is developed to compute derivatives of the objective and constraint functions with respect to the design variables. Subtle but important new terms involve the sensitivity of shape functions and their spatial derivatives. As a result, verification and illustrative problems are solved to demonstrate the precision and capability of the method.

42 ENGINEERING↗
DOE OSTI2019

High Order Anchoring and Reinitialization of Level Set Function for Simulating Interface Motion

A second order interface anchoring method has been developed and used with fast sweeping algorithm for reinitialization of a level set function. The algebraic anchoring formulation ensures that the location of the actual interface is preserved, leading to better mass conservation property. It also provides high order accurate algebraic constraint for solving the Eikonal equation on a finite difference grid. Geometric properties of the interface such as surface normal and curvature are subsequently computed from the reinitialized distance function. Various analytical functions for modeling distortion in level set field are considered and accuracy of reinitialization is evaluated using first and second order anchoring schemes. It is also shown that accurate computation of interface curvature requires a high order anchor in addition to a high order fast sweeping method. Mass conservation property of reinitialization is also analyzed by considering test problems from literature including the classic Rider–Kothe single vortex problem. The formulation is suitable for efficient parallelization for both distributed memory and on-node shared memory parallel systems. In conclusion, scalability and performance of the reinitialization scheme on multiple architectures are demonstrated.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Investigating capacity credit sensitivity to reliability metrics and computational methodologies

Assigning capacity value to renewable energy sources (RES) is a challenge faced in planning their integration with the grid. The difficulties stem from the natural characteristics of variability and intermittency of wind and solar sources. The capacity credit (CC) analysis evaluates the system’s actual power output compared with a constant capacity generator, i.e., conventional generator and determines an effective capacity to use for planning and operation. Herein this paper presents different factors that could affect the CC of a system. Two methods are proposed to determine the CC, namely equivalent firm capacity (EFC) and effective load carrying capability (ELCC). Since these methods are based on satisfying reliability criteria, daily loss of load expectation (LOLE), hourly loss of load (LOLH), and expected energy not served (EENS) have been employed as indices. To obtain the CC value, both methods apply two techniques: traditional and optimization. Genetic algorithm (GA) is the optimization approach used in this paper. Then, this work compares the two techniques and shows the superior performance of the optimization approach. Two hybrid systems, stand-alone (SA) and grid-connected (GC) modes, are proposed and used as case studies. The hybrid systems consist of photovoltaic (PV), wind turbine (WT), and battery energy storage system (BESS). In this work, three different scenarios are used to compare capacity credit: system as a whole, only wind, and no batteries. Finally, sensitivity analysis is carried out to examine the impact of varying the wind speed, solar irradiation, and load. It is demonstrated that the choice of reliability index plays an important role in determining the capacity credit and it is shown that EENS is a more comprehensive and consistent index of reliability.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2017

Scalable domain decomposition solvers for stochastic PDEs in high performance computing

Stochastic spectral finite element models of practical engineering systems may involve solutions of linear systems or linearized systems for non-linear problems with billions of unknowns. For stochastic modeling, it is therefore essential to design robust, parallel and scalable algorithms that can efficiently utilize high-performance computing to tackle such large-scale systems. Domain decomposition based iterative solvers can handle such systems. And though these algorithms exhibit excellent scalabilities, significant algorithmic and implementational challenges exist to extend them to solve extreme-scale stochastic systems using emerging computing platforms. Intrusive polynomial chaos expansion based domain decomposition algorithms are extended here to concurrently handle high resolution in both spatial and stochastic domains using an in-house implementation. Sparse iterative solvers with efficient preconditioners are employed to solve the resulting global and subdomain level local systems through multi-level iterative solvers. We also use parallel sparse matrix–vector operations to reduce the floating-point operations and memory requirements. Numerical and parallel scalabilities of these algorithms are presented for the diffusion equation having spatially varying diffusion coefficient modeled by a non-Gaussian stochastic process. Scalability of the solvers with respect to the number of random variables is also investigated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Direct Discontinuous Galerkin methods for the reacting multi-component flow equations

The Direct Discontinuous Galerkin (DDG (Liu and Yan, 2008)) method and a counterpart with Interface Correction (DDGIC (Danis and Yan, 2022)) are extended to compute diffusion terms that arise when solving the compressible multi-component flow equations in thermochemical nonequilibrium. Thermodynamic properties, transport properties, chemical reaction rates, and energy exchange terms are computed using Mutation++ (Scoggins et al., 2020). The DG method is applied on unstructured grids, where the accuracy and convergence rates can be sensitive to the numerical method chosen for parabolic terms. A method for determining the homogeneity tensor of the flow equations required for DDGIC is shown. The convergence properties of the DDG methods are studied and compared to the Interior Penalty (IP) method. A number of numerical experiments are conducted to assess the accuracy and performance of the method. The numerical results and convergence studies indicate that DDG and DDGIC provide accurate solutions and perform well for general flows in thermochemical nonequilibrium.

Diffusion↗
DOE OSTI2018

Performance analysis and implementation details of the Energy Conserving Semi-Implicit Method code (ECsim)

We present in this work the implementation of the Energy Conserving Semi-Implicit Method in a parallel code called ECsim. This new code is a three-dimensional, fully electromagnetic particle in cell (PIC) code. It is written in C/C++ and uses MPI to allow massive parallelization. ECsim is unconditionally stable in time, eliminates the finite grid instability, and has the same cycle scheme as the explicit code with a computational cost comparable to other semi-implicit PIC codes. All these features make it a very valuable tool to address situations which have not been possible to analyze until now with other PIC codes. In this work, we show the details of the algorithm implementation and we study its performance in different systems. ECsim is compared with another semi-implicit PIC code with different time and spectral resolution, showing its ability to address situations where other codes fail.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

An added-mass partition algorithm for fluid–structure interactions of compressible fluids and nonlinear solids

We describe an added-mass partitioned (AMP) algorithm for solving fluid–structure interaction (FSI) problems involving inviscid compressible fluids interacting with nonlinear solids that undergo large rotations and displacements. The computational approach is a mixed Eulerian–Lagrangian scheme that makes use of deforming composite grids (DCG) to treat large changes in the geometry in an accurate, flexible, and robust manner. The current work extends the AMP algorithm developed in Banks et al. [1] for linearly elasticity to the case of nonlinear solids. To ensure stability for the case of light solids, the new AMP algorithm embeds an approximate solution of a nonlinear fluid–solid Riemann (FSR) problem into the interface treatment. The solution to the FSR problem is derived and shown to be of a similar form to that derived for linear solids: the state on the interface being fundamentally an impedance-weighted average of the fluid and solid states. Numerical simulations demonstrate that the AMP algorithm is stable even for light solids when added-mass effects are large. The accuracy and stability of the AMP scheme is verified by comparison to an exact solution using the method of analytical solutions and to a semi-analytical solution that is obtained for a rotating solid disk immersed in a fluid. The scheme is applied to the simulation of a planar shock impacting a light elliptical-shaped solid, and comparisons are made between solutions of the FSI problem for a neo-Hookean solid, a linearly elastic solid, and a rigid solid. The ability of the approach to handle large deformations is demonstrated for a problem of a high-speed flow past a light, thin, and flexible solid beam.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Atom-partitioned multipole expansions for electrostatic potential boundary conditions

Applications such as grid-based real-space density functional theory (DFT) use the Poisson equation to compute electrostatics. However, the expected long tail of the electrostatic potential requires either the use of a large and costly outer domain or Dirichlet boundary conditions estimated via multipole expansion. We find that the oft-used single-center spherical multipole expansion is only appropriate for isotropic mesh domains such as spheres and cubes. In this work, we introduce a method suitable for high aspect ratio meshes whereby the charge density is partitioned into atomic domains and multipoles are computed for each domain. While this approach is moderately more expensive than a single-center expansion, it is numerically stable and still a small fraction of the overall cost of a DFT calculation. The net result is that when high aspect ratio systems are being studied, form-fitted meshes can now be used in lieu of cubic meshes to gain computational speedup.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

A robust and efficient finite volume method for compressible inviscid and viscous two-phase flows [A robust and efficient finite volume method for compressible viscous two-phase flows]

A robust and efficient density-based finite volume method is developed for solving the six-equation single pressure system of two-phase flows at all speeds on hybrid unstructured grids. Unlike conventional approaches where an expensive exact Riemann solver is normally required for computing numerical fluxes at the two-phase interfaces in addition to AUSM-type fluxes for single-phase interfaces in order to maintain stability and robustness in cases involving interactions of strong pressure and void-fraction discontinuities, a volume-fraction coupling term for the AUSM + -up fluxes is introduced in this work to impart the required robustness without the need of the exact Riemann solver. The resulting method is significantly less expensive in regions where otherwise the Riemann solver would be invoked. A transformation from conservative variables to primitive variables is presented and the primitive variables are then solved in the implicit method in order for the current finite volume method to be able to solve, effectively and efficiently, low Mach number flows in traditional multiphase applications, which otherwise is a great challenge for the standard density-based algorithms. Here, a number of benchmark test cases are presented to assess the performance and robustness of the developed finite volume method for both inviscid and viscous two-phase flow problems. The numerical results indicate that the current density-based method provides an attractive and viable alternative to its pressure-based counterpart for compressible two-phase flows at all speeds.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

A moment-conserving discontinuous Galerkin representation of the relativistic Maxwellian distribution

Kinetic simulations of relativistic gases and plasmas are critical for understanding diverse astrophysical and terrestrial systems, but the accurate construction of the relativistic Maxwellian, the Maxwell–Jüttner distribution, on a discrete simulation grid is challenging. Difficulties arise from the finite velocity bounds of the domain, which may not capture the entire distribution function, as well as errors introduced by projecting the function onto a discrete grid. Here, we present a novel scheme for iteratively correcting the moments of the projected distribution applicable to all grid-based discretizations of the relativistic kinetic equation. In addition, we describe how to compute the needed nonlinear quantities, such as Lorentz boost factors, in a discontinuous Galerkin scheme through a combination of numerical quadrature and weak operations. The resulting method accurately captures the distribution function and ensures that the moments match the desired values to machine precision.

astrophysical plasmas↗
DOE OSTI2019

GRACC: GRid ACcounting Collector

The OSG has long maintained a central accounting system called Gratia. It uses small probes on each computing and storage resource in order to collect resource usage. The probes report to a central collector which stores the usage in a database. The database is then queried to generate reports. As the OSG aged, the size of the database grew very large. It became too large for the database technology to efficiently query to generate detailed reports. The design of a replacement requires data storage that could be queried efficiently to generate multi-year reports. Additionally, it requires flexibilityto add new attributes to the collected data.In this paper we will describe updates to the GRACC architecture in the last 18 months. GRACC uses modern web technologies that were designed for large data storage, query, and visualization. That includes the open source database Elasticsearch, message broker software RabbitMQ, and Grafana and Kibana as data visualization platforms. It uses multiple agents that perform operations on the data to transform it for easier querying and summarization.

Weitzel, Derek↗
DOE OSTI2018

Efficient reactive Brownian dynamics

We develop a Split Reactive Brownian Dynamics (SRBD) algorithm for particle simulations of reaction-diffusion systems based on the Doi or volume reactivity model, in which pairs of particles react with a specified Poisson rate if they are closer than a chosen reactive distance. In our Doi model, we ensure that the microscopic reaction rules for various association and dissociation reactions are consistent with detailed balance (time reversibility) at thermodynamic equilibrium. The SRBD algorithm uses Strang splitting in time to separate reaction and diffusion and solves both the diffusion-only and reaction-only subproblems exactly, even at high packing densities. To efficiently process reactions without uncontrolled approximations, SRBD employs an event-driven algorithm that processes reactions in a time-ordered sequence over the duration of the time step. A grid of cells with size larger than all of the reactive distances is used to schedule and process the reactions, but unlike traditional grid-based methods such as reaction-diffusion master equation algorithms, the results of SRBD are statistically independent of the size of the grid used to accelerate the processing of reactions. We use the SRBD algorithm to compute the effective macroscopic reaction rate for both reaction-limited and diffusion-limited irreversible association in three dimensions and compare to existing theoretical predictions at low and moderate densities. We also study long-time tails in the time correlation functions for reversible association at thermodynamic equilibrium and compare to recent theoretical predictions. Finally, we compare different particle and continuum methods on a model exhibiting a Turing-like instability and pattern formation. Our studies reinforce the common finding that microscopic mechanisms and correlations matter for diffusion-limited systems, making continuum and even mesoscopic modeling of such systems difficult or impossible. We also find that for models in which particles diffuse off lattice, such as the Doi model, reactions lead to a spurious enhancement of the effective diffusion coefficients.

97 MATHEMATICS AND COMPUTING↗