Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Distributed computation”

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 667 records · Page 37

Concurrent Cooling Effects of Dynamic Line Ratings on Wind Plant Gen-Tie Lines

This report was prepared for the Wind Energy Technology Office for the FY 2022, quarter 2 deliverable. This details the use of dynamic line rating technology to rate a series of gen tie lines connecting wind plants to the regional transmission lines. This consists of two primary study regions, the first on the desert west of Idaho Falls, and the second in the region east of the Cascades along the Columbia River Gorge. The TREAD program that was developed at INL was used to create generated gen-tie lines based on nearby regional transmission line connections. The capacity availability of the gen tie lines are compared with the power production of the wind farms. Overall, the INL Site location shows a much greater capacity for the gen-tie lines due to the higher wind speeds. Across both locations, the HRRR data shows higher wind speeds than observed at the observational weather stations. For both the Columbia Gorge and Idaho areas, the sites show that a statically rate gen-tie could carry additional capacity far above the rated during periods of high wind due to the concurrent cooling effects.

17 WIND ENERGY↗

Apparatus and method for providing workload distribution of threads among multiple compute units

In some examples, thermal aware optimization logic determines a characteristic (e.g., a workload or type) of a wavefront (e.g., multiple threads). For example, the characteristic indicates whether the wavefront is compute intensive, memory intensive, mixed, and/or another type of wavefront. The thermal aware optimization logic determines temperature information for one or more compute units (CUs) in one or more processing cores. The temperature information includes predictive thermal information indicating expected temperatures corresponding to the one or more CUs and historical thermal information indicating current or past thermal temperatures of at least a portion of a graphics processing unit (GPU). The logic selects the one or more compute units to process the plurality of threads based on the determined characteristic and the temperature information. The logic provides instructions to the selected subset of the plurality of CUs to execute the wavefront.

Rao, Karthik↗

PLANC: Parallel Low-rank Approximation with Nonnegativity Constraints

In this work, we consider the problem of low-rank approximation of massive dense nonnegative tensor data, for example, to discover latent patterns in video and imaging applications. As the size of data sets grows, single workstations are hitting bottlenecks in both computation time and available memory. We propose a distributed-memory parallel computing solution to handle massive data sets, loading the input data across the memories of multiple nodes, and performing efficient and scalable parallel algorithms to compute the low-rank approximation. We present a software package called Parallel Low-rank Approximation with Nonnegativity Constraints, which implements our solution and allows for extension in terms of data (dense or sparse, matrices or tensors of any order), algorithm (e.g., from multiplicative updating techniques to alternating direction method of multipliers), and architecture (we exploit GPUs to accelerate the computation in this work). We describe our parallel distributions and algorithms, which are careful to avoid unnecessary communication and computation, show how to extend the software to include new algorithms and/or constraints, and report efficiency and scalability results for both synthetic and real-world data sets.

97 MATHEMATICS AND COMPUTING↗

Real-Time Distributed Control of Smart Inverters for Network-level Optimization

The limitations of centralized optimization methods in managing electric power distribution systems operations have led to the distributed paradigm of computing and decision-making. Unfortunately, the existing distributed optimization algorithms are limited in their applicability to managing fast varying phenomena such as those resulting from highly variable Distributed Energy Resource (DER) generation patterns. They require a large number of communication rounds (in the order of 10 2 to 10 3 ) among the computing agents to solve one instance of the optimization problem. Related real-time distributed control methods are equally limited in their applications to power distribution systems with fast-changing DER generation; they require hundreds of rounds of communication and thus are slow in tracking the network-level optimal solutions. In this paper, we propose a novel distributed voltage controller that provides a fast-tracking of rapidly varying DER generation profiles while simultaneously converging to network-level optimal solutions within a few communication rounds. The proposed control algorithm leverages the radial topology of the system, which reduces the required communication rounds to reach the network-level optimum solution by order of magnitude. The novelty lies in carefully reducing the electrical network model from the perspective of each distributed controller and enabling appropriate data sharing among upstream and downstream nodes to achieve fast convergence. The simulation results demonstrate the effectiveness of the proposed approach in minimizing the feeder losses while maintaining the node voltage within the pre-specified limits.

voltage control, optimization, reactive power, inv↗

Accurate small and wide angle x-ray scattering profiles from atomic models of proteins and nucleic acids

A new method is introduced to compute X-ray solution scattering profiles from atomic models of macromolecules. The three-dimensional version of the Reference Interaction Site Model (RISM) from liquid-state statistical mechanics is employed to compute the solvent distribution around the solute, including both water and ions. X-ray scattering profiles are computed from this distribution together with the solute geometry. We describe an efficient procedure for performing this calculation employing a Lebedev grid for the angular averaging. The intensity profiles (which involve no adjustable parameters) match experiment and molecular dynamics simulations up to wide angle for two proteins (lysozyme and myoglobin) in water, as well as the small-angle profiles for a dozen biomolecules taken from the BioIsis.net database. The RISM model is especially well-suited for studies of nucleic acids in salt solution. Use of fiber-diffraction models for the structure of duplex DNA in solution yields close agreement with the observed scattering profiles in both the small and wide angle scattering (SAXS and WAXS) regimes. In addition, computed profiles of anomalous SAXS signals (for Rb{sup +} and Sr{sup 2+}) emphasize the ionic contribution to scattering and are in reasonable agreement with experiment. In cases where an absolute calibration of the experimental data at q = 0 is available, one can extract a count of the excess number of waters and ions; computed values depend on the closure that is assumed in the solution of the Ornstein–Zernike equations, with results from the Kovalenko–Hirata closure being closest to experiment for the cases studied here.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Evolution of DUNE’s Production System

The DUNE experiment will start running in 2029 and record 30 PB/year of raw waveforms from Liquid Argon TPCs and photon detectors. The size of individual readouts can range from 100 MB to a typical 8 GB full readout of the detector, and even 100 TB for extended readouts from supernova candidates. These data then need to be cataloged, stored and distributed for processing worldwide. This massive amount of data and a heterogeneous computing environment necessitates a powerful and robust distributed computing infrastructure. In the process of building up that infrastructure, DUNE’s production system has recently undergone an overhaul, in which it has integrated 1) a new workflow management system (justIN) 2) a new data catalog (MetaCat) and 3) a state-of-the-art data management system (Rucio). Simulations of DUNE’s Far Detector and its prototypes ProtoDUNE Horizontal Drift (ProtoDUNE-HD) and ProtoDUNE Vertical Drift (ProtoDUNE-VD), as well as data from ProtoDUNE-HD serve as the first tests of this infrastructure.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Sediment Resuspension and Transport in Water Distribution Storage Tanks

Computational and experimental studies were conducted to better understand conditions that affect particle resuspension and movement in water storage tanks. Parameters that were investigated included inlet/outlet (I/O) line location and diameter, flow rate, particle size, and filling versus draining cycles. Simulation results showed that smaller particle sizes, higher flow rates, and draining cycles yielded the greatest potential for particle resuspension, which was generally limited to regions near the I/O line. Small‐scale experiments were also performed using different sizes of glass beads and silica sand; the results generally validated the models. Mitigation methods were also presented to reduce the amount of particle resuspension. A pipe that extended from the I/O line into the tank (slightly above the bottom floor) was found to significantly reduce the potential for particle resuspension in both the computational models and experiments.

Ho, Clifford K.↗

Iterative Importance Sampling Algorithms for Parameter Estimation

In parameter estimation problems one computes a posterior distribution over uncertain parameters defined jointly by a prior distribution, a model, and noisy data. Markov chain Monte Carlo (MCMC) is often used for the numerical solution of such problems. An alternative to MCMC is importance sampling, which can exhibit near perfect scaling with the number of cores on high performance computing systems because samples are drawn independently. However, finding a suitable proposal distribution is a challenging task. Several sampling algorithms have been proposed over the past years that take an iterative approach to constructing a proposal distribution. We investigate the applicability of such algorithms by applying them to two realistic and challenging test problems, one in subsurface flow, and one in combustion modeling. More specifically, we implement importance sampling algorithms that iterate over the mean and covariance matrix of Gaussian or multivariate t-proposal distributions. Our implementation leverages massively parallel computers, and we present strategies to initialize the iterations using “coarse” MCMC runs or Gaussian mixture models.

97 MATHEMATICS AND COMPUTING↗

An Advanced Actuator Line Method for Wind Energy Applications and Beyond: Preprint

The actuator line method to represent rotor aerodynamics within computational fluid dynamics has been in use for over a decade. This method applies a body force to the flow field along rotating lines corresponding to the individual rotor blades and employs tabular airfoil data to compute the force distribution. The actuator line method is attractive because compared to blade-resolved simulations, the required mesh is much simpler and the computational cost is lower. This work proposes a higher fidelity variant of the actuator line method meant to fill the space between current actuator line and blade-resolved simulations. It contains modifications in two key areas. The first is that of freestream velocity vector estimation along the line, which is necessary to compute the lift and drag along the line using tabular airfoil data. Most current methods rely on point sampling in which the location of sampling is ambiguous. Here we test a velocity sampling method that uses a properly weighted integral over space, removing this ambiguity. The second area of improvement is the function used to project the one-dimensional actuator line force onto the three-dimensional fluid mesh as a body force. We propose and test a projection function that spreads the force over a region that looks something like a real blade with the hope that it will produce the blade local and near wake flow features with more accuracy and higher fidelity. Our goal is that between these two improvements, not only will the flow field predictions be enhanced, but also the spanwise loading will be made more accurate. We refer to this combination of improvements as the advanced actuator line method. We apply these improvements to two different wind turbine cases. Although there is a strong wind energy motivation in our work, there is no reason these advanced actuator line ideas cannot be used in other applications, such as helicopter rotors.

17 WIND ENERGY↗

Coordinated neutron and X-ray computed tomography of meteorites: Detection and distribution of hydrogen-bearing materials

The presence and distribution of hydrogen-bearing materials in meteorites are important constraints on processes in the early solar system, and the delivery of volatile constituents to growing planets. Here, in this paper, we show that coordinated neutron and X-ray computed tomography, NXCT, can reveal the presence and distributions of hydrogen-bearing materials in meteorites, and thus help constrain the presence and actions of water in the early solar system. NXCT is nearly nondestructive of meteorite samples. Neutron fluence in NXCT is approximately seven orders of magnitude less than in typical instrumental neutron activation analysis, and so produces little residual radioactivity and currently undetectable changes in isotope ratios. Heating during NXCT is minimal, but NXCT will overprint the record of cosmic ray exposure held in natural thermoluminescence. Two meteorites were examined. EET 87503 is a howardite, a regolith breccia inferred to be from the asteroid 4 Vesta, and contains fragments of eucrite basalt, diogenite pyroxenite, and H-rich carbonaceous chondrites. With NXCT, the chondrite fragments within the meteorite piece can be clearly located and characterized, in preparation for possible extraction and detailed analyses. Graves Nunataks (GRA) 06100 is a CR2 chondrite meteorite that contains abundant iron metal and H-bearing silicates from aqueous alteration. In NXCT, H-bearing altered material is clearly distinguished from metal, and its distribution in three dimensions is revealed as a constraint on the processes of alteration.

79 ASTRONOMY AND ASTROPHYSICS↗

Use of Constrained Gamma Emission Computed Tomography to Evaluate Fission Product Distributions in High-Temperature Materials from a TRISO Fuel Irradiation

An image reconstruction technique was developed to overcome problems with earlier methods of gamma emission computed tomography of graphite rings surrounding the AGR-3/4 TRISO fission product transport experiment. The profiles obtained from the tomography are compared with sampling done via radially resolved destructive sampling techniques. Generally, there is good agreement between profiles measured via destructive sampling of the rings and the tomographic profiles, though at low signal strengths, the tomographic profiles appear elevated.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Stationary Distribution and Perturbation Bounds for a Stochastic Inventory Model

In this paper, we use the theory of generalized inverses to compute the stationary distribution of the (s, S) inventory model directly from the transition matrix of the underlying Markov chain and to provide perturbation bounds. Indeed, approximations are employed to build a tractable model, and statistical methods are used to estimate the unknown parameters and distributions. Hence, the system is subject to perturbations that may cause deviation in the characteristics. The proposed perturbation bound provides a means to estimate the impact of the perturbations on the performance measures of the considered inventory system.

97 MATHEMATICS AND COMPUTING↗

A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization

In this paper, we present a distributed-memory library for computations with dense structured matrices. A matrix is considered structured if its off-diagonal blocks can be approximated by a rank-deficient matrix with low numerical rank. Here, we use Hierarchically Semi-Separable (HSS) representations. Such matrices appear in many applications, for example, finite-element methods, boundary element methods, and so on. Exploiting this structure allows for fast solution of linear systems and/or fast computation of matrix-vector products, which are the two main building blocks of matrix computations. The compression algorithm that we use, that computes the HSS form of an input dense matrix, relies on randomized sampling with a novel adaptive sampling mechanism. We discuss the parallelization of this algorithm and also present the parallelization of structured matrix-vector product, structured factorization, and solution routines. The efficiency of the approach is demonstrated on large problems from different academic and industrial applications, on up to 8,000 cores. Finally, this work is part of a more global effort, the STRUctured Matrices PACKage (STRUMPACK) software package for computations with sparse and dense structured matrices. Hence, although useful on their own right, the routines also represent a step in the direction of a distributed-memory sparse solver.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Velocity-Space Hybridization of Direct Simulation Monte Carlo and a Quasi-Particle Boltzmann Solver

This paper presents a new method for modeling rarefied gas flows based on hybridization of direct simulation Monte Carlo (DSMC) and discrete velocity method (DVM)-based quasi-particle representations of the velocity distribution function. It is aimed at improving the resolution of the tails of the distribution function (compared with DSMC) and computational efficiency (compared with DVM). Details of the method, such as the collision algorithm and the particle merging scheme, are discussed. The hybrid approach is applied to the study of noise in a Maxwellian distribution, computation of electron-impact ionization rate coefficient, as well as numerical simulation of a supersonic Couette flow. The hybrid-based solver is compared with pure DSMC and DVM approaches in terms of accuracy, computational speed, and memory use. It is shown that such a hybrid approach can provide a lower computational cost than a pure DVM approach, while being able to retain accuracy in modeling high-velocity tails of the distribution function. For problems where trace species have a significant impact on the flow physics, the proposed method is shown to be capable of providing better computational efficiency and accuracy compared with standard fixed-weight DSMC.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Distributed optimization for multi-commodity urban traffic control

A distributed method for concurrent traffic signal and routing control of traffic networks is proposed. The method is based on the multi-commodity store-and-forward model, in which the destinations are the commodities. The system benefits from the communication between vehicles and infrastructure, providing optimal signal timings to intersections and routes to vehicles on a link-by-link basis. Using the augmented Lagrangian to model the constraints into the objective, the baseline centralized problem is decomposed into a set of objective-coupled subproblems, one for each intersection, enabling the solution to be computed by a distributed- gradient projection algorithm. Further, the intersection agents only need to communicate and coordinate with neighboring intersections to ensure convergence to the optimal solution while tolerating suboptimal iterations that offer more flexibility, unlike other distributed approaches. Through microsimulation, we demonstrate the effectiveness of the proposed algorithm in traffic networks with time-varying demand. Computational analysis shows that the distributed problem is suitable for real-time applications. A robustness analysis show that the distributed formulation enables a graceful degradation of the system in case of failure.

Augmented Lagrangian↗

Techniques for collective operations in distributed systems

Various embodiments are generally directed to techniques for collective operations among compute nodes in a distributed processing set, such as by utilizing ring sets and local sets of the distributed processing set. In some embodiments, a ring set may include a subset of the distributed processing set in which each compute node is connected to a network with a separate router. In various embodiments, a local set may include a subset of the distributed processing set in which each compute node is connected to a network with a common router. In one or more embodiments, each compute node in a distributed processing set may belong to one ring set and one local set.

Langer, Akhil↗