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 451 records · Page 25

STAR'S Approach to Highly Efficient End-To-End Grid Production

STAR's RHIC computing facility provides over 15K dedicated slots for data reconstruction. This number of slots is not always sufficient to satisfy an ambitious and data-challenging physics program, and harvesting resources from outside facilities is paramount to scientific success. However, constraints of remote sites (e.g. CPU time limits) do not always provide the flexibility of a dedicated farm. STAR has a breadth of smaller datasets (both in runtime and size) that can be easily offloaded to remote facilities with many such limits. Scavenged resources can be run with efficiency comparable to that of the local production and contributes additional computing time to an experiment that runs every year and therefore needs fast turnaround. We will discuss STAR's software stack of our grid production framework including features dealing with multi-site submission, automated re-submission, job tracking, as well as new challenges and possible improvements.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Computation of magnetic fields from field components on a plane grid

An algorithm is presented to calculate the field components of the magnetic field [B x (x, y, z), B y (x, y, z), B z (x, y, z)] at a point (x, y, z) in space, from the knowledge of the components [B x (x, y) = 0, z), B y (x, y = 0, z), B z (x, y = 0,z)] on a “reference plane”, which is normal to the y-axis at . The algorithm, which is a general one and is not restricted to fields with mid-plane symmetry is based on the Maclaurin series expansion of the magnetic field components at any point in space in terms of the distance (y) of the point from the reference plane. The coefficients of the Maclaurin series expansion are expressed in terms of the on-plane field components and their partial derivatives with respect to spatial coordinates (). The field components are usually generated from magnetic field measurements on a rectangular grid on the plane. This algorithm was employed in 1986 in the RAYTRACE computer code to help calculate the optical properties of magnets and of the Alternating Gradient Synchrotron (AGS) at the Brookhaven National Laboratory (BNL). Here, a general mathematical formulation of this algorithm based on the differential algebraic method was presented by Makino in 2011. This paper presents the step by step derivation of the algorithm and provides the necessary formulas to be introduced by the reader in any computer code which requires the field components generated by magnetic devices. In addition provides an example of the use of the algorithm and its limitations as applied to a Halbach type magnet with or without median plane symmetry.

43 PARTICLE ACCELERATORS↗

A frozen Gaussian approximation-based multi-level particle swarm optimization for seismic inversion

In this paper, we propose a frozen Gaussian approximation (FGA)-based multi-level particle swarm optimization (MLPSO) method for seismic inversion of high-frequency wave data. The method addresses two challenges in it: First, the optimization problem is highly non-convex, which makes hard for gradient-based methods to reach global minima. This is tackled by MLPSO which can escape from undesired local minima. Second, the character of high-frequency of seismic waves requires a large number of grid points in direct computational methods, and thus renders an extremely high computational demand on the simulation of each sample in MLPSO. We overcome this difficulty by three steps: First, we use FGA to compute high-frequency wave propagation based on asymptotic analysis on phase plane; Then we design a constrained full waveform inversion problem to prevent the optimization search getting into regions of velocity where FGA is not accurate; Last, we solve the constrained optimization problem by MLPSO that employs FGA solvers with different fidelity. The performance of the proposed method is demonstrated by a two-dimensional full-waveform inversion example of the smoothed Marmousi model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A High-Performance Hybrid Computing Approach to Massive Contingency Analysis in the Power Grid

Operating the electrical power grid to prevent power black-outs is a complex task. An important aspect of this is contingency analysis, which involves understanding and mitigating potential failures in power grid elements such as transmission lines. When taking into account the potential for multiple simultaneous failures (known as the N-x contingency problem), contingency analysis becomes a massively computational task. In this paper we describe a novel hybrid computational approach to contingency analysis. This approach exploits the unique graph processing performance of the Cray XMT in conjunction with a conventional massively parallel compute cluster to identify likely simultaneous failures that could cause widespread cascading power failures that have massive economic and social impact on society. The approach has the potential to provide the first practical and scalable solution to the N-x contingency problem. When deployed in power grid operations, it will increase the grid operator’s ability to deal effectively with outages and failures with power grid components while preserving stable and safe operation of the grid. The paper describes the architecture of our solution and presents preliminary performance results that validate the efficacy of our approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Fast multipole methods for multiparticle simulations

The fast multipole method (FMM) reduces the computation cost of the pairwise non-oscillating interaction between N particles from O(N^2) to O(N). In the FMM, the contribution from a source particle is represented as a multipole expansion, while the contributions from multiple faraway sources can be combined into a local expansion around an objective particle. Without the dependence on a grid covering the whole domain under study, the FMM treats any charge distribution and geometry in a natural way. It avoids artificial smoothing due to the grid size and redundant computation on the free space grids. We will introduce the concept of the FMM using the Coulomb interaction as an example and then explain how the FMM can be extended to arbitrary non-oscillating interactions. Examples and discussions on how the FMM can be used in scientific simulations, especially in accelerator physics will also be provided.

Zhang, He↗

Notes from the Unit Commitment Linear Programming Project

The Unit Commitment Problem (UCP) is a computational bottleneck in electrical grid optimization. The problem bears a close resemblance to a similar problem in High Performance Computing: the Dynamic Volt age/Frequency Scheduling (DVFS) problem. In my earlier work I successfully tranformed the DVFS into a closely related problem amenable to a linear programming solution and was thus able to schedule problem instances several orders of magnitude larger than any that had been at tempted before. This technical report details my unsuccessful efforts to derive a similar transformation for the UCP. The problem proved impossible not because generators were either on or off, but because the state of an earlier timeslice constrains the states of latter timeslices in ways that cannot be sufficiently well approximated for useful solutions.

97 MATHEMATICS AND COMPUTING↗

A Sparse-Grid Probabilistic Scheme for Approximation of the Runaway Probability of Electrons in Fusion Tokamak Simulation

Runaway electrons (RE) generated during magnetic disruptions present a major threat to the safe operation of plasma nuclear fusion reactors. A critical aspect of understanding RE dynamics is to calculate the runaway probability, i.e., the probability that an electron in the phase space will runaway on, or before, a prescribed time. Such probability can be obtained by solving the adjoint equation of the underlying Fokker-Planck equation that controls the electron dynamics. In this effort, we present a sparse-grid probabilistic scheme for computing the runaway probability. The key ingredient of our approach is to represent the solution of the adjoint equation as a conditional expectation, such that discretizing the differential operator reduces to the approximation of a set of integrals. Adaptive sparse grid interpolation is utilized to approximate the map from the phase space to the runaway probability. The main novelties of this effort are the integration of the sparse-grid method into the probabilistic numerical scheme for computing escape probability, and the application of the proposed method in computing RE probabilities. Two numerical examples are given to illustrate that the proposed method can achieve O(Δt) convergence, and that the local anisotropic adaptive refinement strategy (M. Stoyanov, Adaptive sparse grid construction in a context of local anisotropy and multiple hierarchical parents. In: Sparse Grids and Applications-Miami 2016, Springer, Berlin, 2018, pp. 175–199) can effectively handle the sharp transition layer between the runaway and non-runaway regions.

Yang, Minglei↗

Power system observability and dynamic state estimation for stability monitoring using synchrophasor measurements

Growing penetration of intermittent resources such as renewable generations increases the risk of instability in a power grid. This paper introduces the concept of observability and its computational algorithms for a power grid monitored by the wide-area measurement system (WAMS) based on synchrophasors, e.g. phasor measurement units (PMUs). The goal is to estimate real-time states of generators, especially for potentially unstable trajectories, the information that is critical for the detection of rotor angle instability of the grid. The paper studies the number and siting of synchrophasors in a power grid so that the state of the system can be accurately estimated in the presence of instability. An unscented Kalman filter (UKF) is adopted as a tool to estimate the dynamic states that are not directly measured by synchrophasors. The theory and its computational algorithms are illustrated in detail by using a 9-bus 3-generator power system model and then tested on a 140-bus 48-generator Northeast Power Coordinating Council power grid model. Case studies on those two systems demonstrate the performance of the proposed approach using a limited number of synchrophasors for dynamic state estimation for stability assessment and its robustness against moderate inaccuracies in model parameters.

Observability, Dynamic state estimation, Synchroph↗

CRADA Number NFE-19-07846 with Grid Fruit, LLC (CRADA Final Report)

Cooperative Research and Development Agreement (CRADA) NFE-19-07846 between Oak Ridge National Laboratory (ORNL) and Grid Fruit, LLC (Grid Fruit) focused on simulating, monitoring, and adjusting controls of commercial refrigerator and freezer systems to provide load flexibility and demand response services from these machines. Viewing these medium and low-temp coolers as thermal masses, the volumes of chilled air in these coolers make them time-shiftable loads ripe for deployment at optimal times. Grid Fruit is a startup company developing methods to schedule the chilling cycles (e.g., in “build load” and “shed load” grid events) to provide energy efficiency, peak shifting, and other benefits both to the grid and the broader environment. These benefits can be magnified by coordinating chillers with HVAC, lights, computers, and other loads. Grid Fruit completed simulations and then selected and ordered controls hardware to prove the technology were successful, but the diversity of chiller models in the field without digital controls, as well as limited market demand at present, make further exploration necessary before commercialization.

42 ENGINEERING↗

Investigation of CO 2 capture using solid sorbents in a fluidized bed reactor: Cold flow hydrodynamics

Both experimental tests and numerical simulations were conducted to investigate the fluidization behavior of a solid CO 2 sorbent with a mean diameter of 100 μm and density of about 480 kg/m, which belongs to Geldart's Group A powder. A carefully designed fluidized bed facility was used to perform a series of experimental tests to study the flow hydrodynamics. Numerical simulations using the two-fluid model indicated that the grid resolution has a significant impact on the bed expansion and bubbling flow behavior. Due to the limited computational resource, no good grid independent results were achieved using the standard models as far as the bed expansion is concerned. In addition, all simulations tended to under-predict the bubble size substantially. Effects of various model settings including both numerical and physical parameters have been investigated with no significant improvement observed. The latest filtered sub-grid drag model was then tested in the numerical simulations. Compared to the standard drag model, the filtered drag model with two markers not only predicted reasonable bed expansion but also yielded realistic bubbling behavior. As a result, a grid sensitivity study was conducted for the filtered sub-grid model and its applicability and limitation were discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Algebraic multigrid domain and range decomposition (AMG-DD / AMG-RD)*

In modern large-scale supercomputing applications, algebraic multigrid (AMG) is a leading choice for solving matrix equations. However, the high cost of communication relative to that of computation is a concern for the scalability of traditional implementations of AMG on emerging architectures. This paper introduces two new algebraic multilevel algorithms, algebraic multigrid domain decomposition (AMG-DD) and algebraic multigrid range decomposition (AMG-RD), that replace traditional AMG V-cycles with a fully overlapping domain decomposition approach. While the methods introduced here are similar in spirit to the geometric methods developed by Brandt and Diskin [Multigrid solvers on decomposed domains, in Domain Decomposition Methods in Science and Engineering, Contemp. Math. 157, AMS, Providence, RI, 1994, pp. 135--155], Mitchell [Electron. Trans. Numer. Anal., 6 (1997), pp. 224--233], and Bank and Holst [SIAM J. Sci. Comput., 22 (2000), pp. 1411--1443], they differ primarily in that they are purely algebraic: AMG-RD and AMG-DD trade communication for computation by forming global composite “grids” based only on the matrix, not the geometry. (As is the usual AMG convention, “grids” here should be taken only in the algebraic sense, regardless of whether or not it corresponds to any geometry.) Another important distinguishing feature of AMG-RD and AMG-DD is their novel residual communication process that enables effective parallel computation on composite grids, avoiding the all-to-all communication costs of the geometric methods. The main purpose of this paper is to study the potential of these two algebraic methods as possible alternatives to existing AMG approaches for future parallel machines. As a result, this paper develops some theoretical properties of these methods and reports on serial numerical tests of their convergence properties over a spectrum of problem parameters.

97 MATHEMATICS AND COMPUTING↗

Computation-Efficient Algorithm for Distributed Feedback Optimization of Distribution Grids

Feedback-based optimization algorithms use real-time measurements to update the optimal control for the underlying system which may not be fully identified. Recently, we have developed a distributed feedback-based algorithm [1] that avoids the requirement of fast communication between central computing and local actuator/sensor agents. This paper extends the work by greatly reducing the number of copies of variables involved in the distributed feedback-based algorithm, which results in faster convergence and lower communication requirement. The main idea is to leverage the specific structural properties of the admittance matrix for distribution systems with tree network topology. We also show the effectiveness of the proposed algorithm in simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Conservative velocity mappings for discontinuous Galerkin kinetics

Continuum computational kinetic plasma models evolve the distribution function of a plasma species f s on a phase-space grid over time. In many problems of interest the distribution function has limited extent in velocity space; hence, using a uniform, highly refined mesh would be costly and slow. Nonuniform velocity grids can reduce the computational cost by placing more degrees of freedom where f s is appreciable and fewer where it is not. In this work we introduce a first-of-its kind discontinuous Galerkin approach to nonuniform velocity-space discretization using mapped velocity coordinates. This new method is presented in the context of a gyrokinetic model used to study magnetized plasmas. We create discretizations of collisionless and collisional terms using mappings in a way that exactly conserves particles and energy. Numerical tests of such properties are presented, and we show that this new discretization can reproduce earlier gyrokinetic simulations using grids with up to 6–60 times fewer cells and 22X-60X speed-ups depending on dimensionality, geometry and plasma parameters.

Discontinuous Galerkin↗

The Quantum Hydrodynamic Description of Tunneling

The quantum hydrodynamic approach is based on the de Broglie-Bohm formulation of quantum mechanics. The resulting fluid-like equations of motion describe the flow of probability and an accurate solution to these equations is equivalent to solving the time-dependent Schroedinger equation. Furthermore, the hydrodynamic approach provides new insight into the mechanisms as well as an alternative computational approach for treating tunneling phenomena. New concepts include well-defined 'quantum trajectories', 'quantum potential', and 'quantum force' all of which have classical analogues. The quantum potential and its associated force give rise to all quantum mechanical effects such as zero point energy, tunneling, and interference. A new numerical approach called the Iterative Finite Difference Method (IFDM) will be discussed. The IFDM is used to solve the set of non-linear coupled hydrodynamic equations. It is 2nd-order accurate in both space and time and exhibits exponential convergence with respect to the iteration count. The stability and computational efficiency of the IFDM is significantly improved by using a 'smart' Eulerian grid which has the same computational advantages as a Lagrangian or Arbitrary Lagrangian Eulerian (ALE) grid. The IFDM is also capable of treating anharmonic potentials. Example calculations using the IFDM will be presented which include: a one-dimensional Gaussian wave packet tunneling through an Eckart barrier, a one-dimensional bound-state Morse oscillator, and a two-dimensional (2D) model collinear reaction using an anharmonic potential energy surface. Approximate treatments of the quantum hydrodynamic equations will also be discussed which could allow scaling of the calculations to hundreds of degrees of freedom which is important for treating tunneling phenomena in condensed phase systems.

36 MATERIALS SCIENCE↗

Women in Science: Fermilab Scientific Computing Specialist Krista Majewski

With February 11 marking the International Day of Women and Girls in Science, female physicists, engineers and computer scientists from CERN and Fermilab share their experiences of building careers in science. Krista Majewski came to Fermilab nine years ago as a software developer and now works in an operations role. She is a computing services specialist and part of the grid and cloud operations group, which manages computing clusters for the CMS experiment and other intensity frontier experiments at the lab. "My typical day would be maintaining the services that our group is responsible for and the machines that they run on. So if there are problems with a computing cluster where a user can't run their jobs, or they're trying to run on resources on the grid and they're unable to, then our group would be responsible for helping debug some of those issues," Krista says. Her path to programming at Fermilab has been winding. After receiving a degree in biomedical engineering, she went to work doing web development and programming for a large consulting firm, then moved to the financial industry. But programming called her back, and she earned a master's degree in computer science to start her new career. For Krista, programming is similar to something she enjoyed as child: solving puzzles. "I think it's a skill that you use in a lot of different ways," she says. Credits: Video production - Fermilab Creative Services Music Copyright: Universal Production Music Astral Light Chevalier Idea originally conceived by Tanya Levshina, Fermilab and Maria Dimou, CERN.

99 GENERAL AND MISCELLANEOUS↗

Reducing Operator Complexity of Galerkin Coarse-grid Operators with Machine Learning

Here, we propose a data-driven and machine-learning-based approach to compute non-Galerkin coarse-grid operators in multigrid (MG) methods, addressing the well-known issue of increasing operator complexity. Guided by the MG theory on spectrally equivalent coarse-grid operators, we have developed novel machine learning algorithms that utilize neural networks combined with smooth test vectors from multigrid eigenvalue problems. The proposed method demonstrates promise in reducing the complexity of coarse-grid operators while maintaining overall MG convergence for solving parametric partial differential equation problems. Numerical experiments on anisotropic rotated Laplacian and linear elasticity problems are provided to showcase the performance and comparison with existing methods for computing non-Galerkin coarse-grid operators.

97 MATHEMATICS AND COMPUTING↗

Final Technical Report: Sparse Grid Scenario Generation and Interior Algorithms for Stochastic Optimization in a Parallel Computing Environment

The support from this grant resulted in seven published papers and a technical report. Two papers are published in SIAM J. on Optimization [87, 88]; two papers are published in IEEE Transactions on Power Systems [77, 78]; one paper is published in Smart Grid [79]; one paper is published in Computational Optimization and Applications [44] and one in INFORMS J. on Computing [67]). The works in [44, 67, 87, 88] were funded primarily by this DOE grant. The applied papers in [77, 78, 79] were also supported through a subcontract from the Argonne National Lab. We start by presenting our main research results on the scenario generation problem in Sections 1–2. We present our algorithmic results on interior point methods for convex optimization problems in Section 3. We describe a new ‘central’ cutting surface algorithm developed for solving large scale convex programming problems (as is the case with our proposed research) with semi-infinite number of constraints in Section 4. In Sections 5–6 we present our work on two application problems of interest to DOE.

97 MATHEMATICS AND COMPUTING↗