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 865 records · Page 48
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

From Bethe–Salpeter Wave functions to Generalised Parton Distributions

We review recent works on the modelling of Generalised Parton Distributions within the Dyson-Schwinger formalism. We highlight how covariant computations, using the impulse approximation, allows one to fulfil most of the theoretical constraints of the GPDs. A specific attention is brought to chiral properties and especially the so-called soft pion theorem, and its link with the Axial-Vector Ward-Takahashi identity. The limitation of the impulse approximation are also explained. Beyond impulse approximation computations are reviewed in the forward case. Finally, we stress the advantages of the overlap of lightcone wave functions, and possible ways to construct covariant GPD models within this framework, in a two-body approximation

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Effect of flow field geometry on operating current density, capacity and performance of vanadium redox flow battery

We report that addition of flow fields to carbon paper electrodes in a vanadium redox flow battery (VRFB) can improve the peak power density through uniform distribution of electrolyte in the electrodes. However, it is unclear whether flow fields have a similar effect with graphite felt electrodes, as VRFBs with felt electrodes reported in literature show a large anomaly in obtained power density. In this work, we evaluate three flow fields; viz. serpentine, interdigitated and conventional (without flow pattern) type with felt electrodes and compare their performance with a serpentine flow field using carbon paper electrodes under identical experimental conditions. The conventional flow field provides highest energy efficiency (75%) followed by serpentine (64%) and interdigitated (55%) at 0.2 A cm -2 attributable to the deteriorating electrolyte distribution in the electrodes. Computation fluid dynamic simulations confirm the experimental finding of worsening electrolyte distribution (conventional < serpentine < interdigitated). A power density of 0.51 W cm -2 at 60 mL min -1 flow rate is obtained for serpentine and conventional flow fields with felt electrodes; comparable to the highest power density reported in literature for high performing zero-gap flow field architecture. Finally, this paper gives comprehensive insights on flow fields for VRFBs that can be extended to other flow batteries.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Temperature-dependent phonon lifetimes and thermal conductivity of silicon by inelastic neutron scattering and ab initio calculations

In this paper, inelastic neutron scattering on a single crystal of silicon was performed at temperatures from 100 to 1500 K. These experimental data were reduced to obtain phonon spectral intensity at all wave vectors $\overset{→}{Q}$ and frequencies ω in the first Brillouin zone. Thermal broadenings of the phonon peaks were obtained by fitting and by calculating with an iterative ab initio method that uses thermal atom displacements on an ensemble of superlattices. Agreement between the calculated and experimental broadenings was good, with possible discrepancies at the highest temperatures. Distributions of phonon widths versus phonon energy had similar shapes for computation and experiment. These distributions grew with temperature but maintained similar shapes. Parameters from the ab initio calculations were used to obtain the thermal conductivity from the Boltzmann transport equation, which was in good agreement with experimental data. Despite the high group velocities of longitudinal acoustic phonons, their shorter lifetimes reduced their contribution to the thermal conductivity, which was dominated by transverse acoustic modes.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2017

rvGAHP: push-based job submission using reverse SSH connections. In: WORKS '17 Proceedings of the 12th Workshop on Workflows in Support of Large-Scale Science, Article No. 3

Computational science researchers running large-scale scientific workflow applications often want to run their workflows on the largest available compute systems to improve time to solution. Workflow tools used in distributed, heterogeneous, high performance computing environments typically rely on either a push-based or a pull-based approach for resource provisioning from these compute systems. However, many large clusters have moved to two-factor authentication for job submission, making traditional automated push-based job submission impossible. On the other hand, pull-based approaches such as pilot jobs may lead to increased complexity and a reduction in node-hour efficiency. In this paper, we describe a new, efficient approach based on HTCondor-G called reverse GAHP (rvGAHP) that allows us to push jobs using reverse SSH submissions with better efficiency than pull-based methods. We successfully used this approach to perform a large probabilistic seismic hazard analysis study using SCEC's CyberShake workflow in March 2017 on the Titan Cray XK7 hybrid system at Oak Ridge National Laboratory.

Callaghan, Scott↗
DOE OSTI2023

An Initial Study of the Convergence Rate of Griffin’s Pebble Bed Reactors Algorithm

This paper presents an initial study of the convergence properties of an iterative algorithm for computing the burnup distribution in a pebble bed reactor (PBR) in its equilibrium core condition. The algorithm is implemented in the Griffin code. Griffin is a reactor multiphysics analysis application jointly developed by Idaho National Laboratory (INL) and Argonne National Laboratory (ANL). Griffin’s PBR algorithm is discussed and simulation data are presented. An alternative matrix formulation of the algorithm is presented that facilitates analysis of the iterative algorithm. The dependence of the spectral radius of the iterative algorithm on operational and discretization parameters is investigated.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

A Pervasive Parallel Processing Framework for Data Visualization and Analysis at Extreme Scale

The evolution of the computing world from teraflop to petaflop has been relatively effortless, with several of the existing programming models scaling effectively to the petascale. The migration to exascale, however, poses considerable challenges. All industry trends infer that the exascale machine will be built using processors containing hundreds to thousands of cores per chip. It can be inferred that efficient concurrency on exascale machines requires a massive amount of concurrent threads, each performing many operations on a localized piece of data. Currently, visualization libraries and applications are based off what is known as the visualization pipeline. In the pipeline model, algorithms are encapsulated as filters with inputs and outputs. These filters are connected by setting the output of one component to the input of another. Parallelism in the visualization pipeline is achieved by replicating the pipeline for each processing thread. This works well for today’s distributed memory parallel computers but cannot be sustained when operating on processors with thousands of cores. Our project investigates a new visualization framework designed to exhibit the pervasive parallelism necessary for extreme scale machines. Our framework achieves this by defining algorithms in terms of worklets, which are localized stateless operations. Worklets are atomic operations that execute when invoked unlike filters, which execute when a pipeline request occurs. The worklet design allows execution on a massive amount of lightweight threads with minimal overhead. Only with such fine-grained parallelism can we hope to fill the billions of threads we expect will be necessary for efficient computation on an exascale machine.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

On electron bunching and stratification of glow discharges

Plasma stratification and excitation of ionization waves is one of the fundamental problems in gas discharge physics. Significant progress in this field is associated with the name of Lev Tsendin. He advocated the need for the kinetic approach to this problem contrary to the traditional hydrodynamic approach, introduced the idea of electron bunching in spatially periodic electric fields, and developed a theory of kinetic resonances for analysis of moving striations in rare gases. The present paper shows how Tsendin's ideas have been further developed and applied for understanding the nature of the well-known S-, P-, and R-striations observed in glow discharges of inert gases at low pressures and currents. We review numerical solutions of a Fokker-Planck kinetic equation in spatially periodic electric fields under the effects of elastic and inelastic collisions of electrons with atoms. We illustrate the formation of kinetic resonances at specific field periods for different shapes of injected Electron Distribution Functions (EDF). Computer simulations illustrate how self-organization of the EDFs occurs under nonlocal conditions and how Gaussian-like peaks moving along resonance trajectories are formed in a certain range of discharge conditions. The calculated EDFs agree well with the experimentally measured EDFs for the S, P, and R striations in noble gases. We discuss how kinetic resonances affect dispersion characteristics of moving striations and mention some non-linear effects associated with glow discharge stratification. We propose further studies of stratification phenomena combining physical kinetics and non-linear physics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2018

User-level File Systems Specialized for HPC Workloads Year-End Report

High-performance computing (HPC) clusters attract the attention of Deep Learning (DL) training users due to the clusters' powerful computation capabilities. While there have been many existing efforts to enable deep neural works to leverage the powerful CPU and GPU processors from leadership high-performance computing (HPC) systems, large-scale deep learning with larger datasets requires efficient I/O support from the underlying file and storage systems. As some current and upcoming HPC clusters have large on-node memory or are equipped with NVMe SSD on compute nodes, more distributed DL trainings are considered to leverage those storages to store dataset for efficient dataset access. Our project goal is to design a specialized DL-oriented file system to improve datasets loading performance of any DL training applications. Over the past year, the team at Florida State University has performed research activities in three different aspects, including 1) completing a specialized memory-based I/O framework (DeepIO) for improving dataset loading performance on DL applications; 2) proposing a more generalized file system (DLFS) for DL applications on node-local SSDs; 3) completing the BeeGFS performance evaluation project for Deep Neural Networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Object Proxy Patterns for Accelerating Distributed Applications

Workflow and serverless frameworks have empowered new approaches to distributed application design by abstracting compute resources. However, their typically limited or one-size-fits-all support for advanced data flow patterns leaves optimization to the application programmer—optimization that becomes more difficult as data become larger. The transparent object proxy, which provides wide-area references that can resolve to data regardless of location, has been demonstrated as an effective low-level building block in such situations. Here we propose three high-level proxy-based programming patterns—distributed futures, streaming, and ownership—that make the power of the proxy pattern usable for more complex and dynamic distributed program structures. We motivate these patterns via careful review of application requirements and describe implementations of each pattern. As a result, we evaluate our implementations through a suite of benchmarks and by applying them in three meaningful scientific applications, in which we demonstrate substantial improvements in runtime, throughput, and memory usage.

Distributed Computing↗
DOE OSTI2020

SSA Monte Carlo and Master Equation Modeling of Neutron Leakage Distributions

Strongly stochastic neutron populations in highly subcritical multiplying media containing weak spontaneous fission sources are unique indicators of the presence of SNM. For instance, in neutron multiplicity counting, an extended tail in the count number probability distribution is observed that is a characteristic of and sensitive to the amount of SNM present. Theoretical modeling and efficient computation of stochastic neutron distributions are complementary to experimental measurements and moreover shed light on the fundamental interactions and transport processes that underlie nuclear signatures. Modeling approaches that are intermediate between gross-system level models and high-fidelity but computationally demanding Monte Carlo simulations are of particular interest in this regard. Furthermore we present three advances on existing work in point kinetic or lumped geometry: (i) implementation of the Stochastic Simulation Algorithm (SSA), a system state-updating Monte Carlo method that is more e cient than single-event Monte Carlo in lumped geometries, (ii) application of the backward Master equation to obtain time-gated count moments, and (iii) reconstructing the count number distribution from the deterministically computed moments using a generalized Laguerre polynomial expansion.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2012

EFFECTS OF PERPENDICULAR DIFFUSION ON ENERGETIC PARTICLES ACCELERATED BY THE INTERPLANETARY CORONAL MASS EJECTION SHOCK

In this work, based on a numerical solution of the focused transport equation, we obtained the intensity and anisotropy time profiles of solar energetic particles (SEPs) accelerated by an interplanetary shock in the three-dimensional Parker magnetic field. The shock is treated as a moving source of energetic particles with an assumed particle distribution function. We computed the time profiles of particle flux and anisotropy as measured by an observer at 1 AU, equatorial plane, and various longitudes with respect to the shock propagation direction. With perpendicular diffusion, energetic particles can cross magnetic field lines. Particles may be detected before the observer's field line is connected to the shock. After the observer's field line breaks from the shock front, the observer still can see more particles are injected into its field line. Our simulations show that the particle onset time, peak time, peak intensity, decay rate, and duration of SEP event could be significantly influenced by the effect of perpendicular diffusion. The anisotropy with perpendicular diffusion is almost the same as that without perpendicular diffusion, but there is an obvious difference at the moment when the observer's field line begins to be connected to the shock.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2015

Research in Elementary Particle Physics

This report details the accomplishments and research results for the High Energy Physics Group at the University of Texas at Arlington at the Energy and Intensity Frontiers. For the Energy Frontier we have made fundamental contributions in the search for supersymmetric particles, proposed to explain the stabilization of the mass of the Higgs Boson – the agent giving mass to all known particles. We have also made major contributions to the search for additional Higgs Bosons and to the planning for future searches. This work has been carried out in the context of the ATLAS Experiment at CERN (European Nuclear Research Laboratory) and for which we have made major contributions to computing and data distribution and processing, and have worked to calibrate the detector and prepare upgraded electronics for the future. Our other contribution to the Energy Frontier has been to the International Linear Collider (ILC) project, potentially hosted by Japan, and to the Silicon Detector Concept (SiD) in particular. We have lead the development of the SiD Concept and have worked on a new form of precise energy measurement for particles from the high energy collisions of electrons and positrons at the ILC. For the Intensity Frontier, we have worked to develop the concept of Long Baseline Neutrino Experiment(s) (LBNE) at the Fermi National Accelerator Laboratory. Our contributions to detector development, neutrino beam studies, particle identification, software development will facilitate future studies of the oscillation of one type of neutrino into other type(s), establish the order of the neutrino masses, and, through an innovative new idea, allow us to create a beam of dark matter particles.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2018

Distributed Link Removal Using Local Estimation of Network Topology

In this paper, we consider the problem of network structure manipulation in the absence of information on the global network topology. In particular, the problem of removing some of links is investigated in order to slow or stop the spread of disease in a network while preserving its connectivity. Existing methods solve this combinatorial problem in a centralized manner and they require the global information of network structure. In this paper, we propose a distributed design algorithm to compute a suboptimal solution to this problem efficiently by mimicking gradient based method, namely by iteratively removing one or multiple links at a time from the network. Specifically, using matrix perturbation analysis we formulate an optimization problem involving the eigenvector associated with the largest eigenvalue of the adjacency matrix and whose solution is equal to a suboptimal solution to the original problem. This strategy also enables us to overcome the combinatorial issue of the problem. Distributed algorithms to estimate the eigenvector and to verify network’s connectivity are then proposed which facilitate us to solve the new optimization problem. In addition, topological insights into the proposed algorithm and optimality of its solution are also discussed. Lastly, the proposed distributed design method is demonstrated and evaluated via several numerical examples.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2016

SU-F-T-620: Development of a Convolution/Superposition Dose Engine for CyberKnife System

Purpose: Current CyberKnife treatment planning system (TPS) provided two dose calculation algorithms: Ray-tracing and Monte Carlo. Ray-tracing algorithm is fast, but less accurate, and also can’t handle irregular fields since a multi-leaf collimator system was recently introduced to CyberKnife M6 system. Monte Carlo method has well-known accuracy, but the current version still takes a long time to finish dose calculations. The purpose of this paper is to develop a GPU-based fast C/S dose engine for CyberKnife system to achieve both accuracy and efficiency. Methods: The TERMA distribution from a poly-energetic source was calculated based on beam’s eye view coordinate system, which is GPU friendly and has linear complexity. The dose distribution was then computed by inversely collecting the energy depositions from all TERMA points along 192 collapsed-cone directions. EGSnrc user code was used to pre-calculate energy deposition kernels (EDKs) for a series of mono-energy photons The energy spectrum was reconstructed based on measured tissue maximum ratio (TMR) curve, the TERMA averaged cumulative kernels was then calculated. Beam hardening parameters and intensity profiles were optimized based on measurement data from CyberKnife system. Results: The difference between measured and calculated TMR are less than 1% for all collimators except in the build-up regions. The calculated profiles also showed good agreements with the measured doses within 1% except in the penumbra regions. The developed C/S dose engine was also used to evaluate four clinical CyberKnife treatment plans, the results showed a better dose calculation accuracy than Ray-tracing algorithm compared with Monte Carlo method for heterogeneous cases. For the dose calculation time, it takes about several seconds for one beam depends on collimator size and dose calculation grids. Conclusion: A GPU-based C/S dose engine has been developed for CyberKnife system, which was proven to be efficient and accurate for clinical purpose, and can be easily implemented in TPS.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2019

Accelerated Voltage Regulation in Multi-Phase Distribution Networks Based on Hierarchical Distributed Algorithm

Here, we introduce a hierarchical distributed algorithm to solve optimal power flow (OPF) problems that aim at dispatching controllable distributed energy resources (DERs) for voltage regulation at minimum cost. The proposed algorithm highlights unprecedented scalability to large multi-phase distribution networks by jointly exploring the tree/subtrees structure of a large radial distribution network and the structure of the linearized distribution power flow (LinDistFlow) model to derive a hierarchical, distributed implementation of the primal-dual gradient algorithm that solves OPF. The proposed implementation significantly reduces the computation loads compared to the centrally coordinated implementation of the same primal-dual algorithm without compromising optimality. Numerical findings on a 4,521-node test feeder show that the designed algorithm achieves more than 10-fold acceleration in the speed of convergence compared to the centrally coordinated primal-dual algorithm through reducing and distributing computational loads.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Computing an Optimal Entanglement Path with Throughput and Fidelity Considerations

Entanglement distribution is a core function of quantum networks essential for operations including teleportation, distributed quantum sensing, and multisite computation. Entanglement throughput and fidelity are two critical performance measures that depend on the quantum transmission along the links and swapping operations at the repeaters along the path. We study the problem of computing a end-to-end entanglement path that satisfies both fidelity and throughput requirements, leveraging qubit buffers at the nodes and considering the sequential swapping order. We show that the general problem of simultaneously satisfying both metrics to be NP-hard, and develop an algorithm to maximize throughput subject to a given fidelity threshold. We introduce the concepts of entanglement probability distribution and path domination and exploit them in the design of our algorithm. Extensive numerical results show that our algorithm can find optimal solutions in networks with thousands of nodes in less than a second. We also describe practical and possible implementation aspects of this algorithm in terms of devices and architecture support.

Xue, Guoliang [Arizona State University]↗
DOE OSTI2017

Multivariate quadrature for representing cloud condensation nuclei activity of aerosol populations

Here, sparse representations of atmospheric aerosols are needed for efficient regional- and global-scale chemical transport models. Here we introduce a new framework for representing aerosol distributions, based on the quadrature method of moments. Given a set of moment constraints, we show how linear programming, combined with an entropy-inspired cost function, can be used to construct optimized quadrature representations of aerosol distributions. The sparse representations derived from this approach accurately reproduce cloud condensation nuclei (CCN) activity for realistically complex distributions simulated by a particleresolved model. Additionally, the linear programming techniques described in this study can be used to bound key aerosol properties, such as the number concentration of CCN. Unlike the commonly used sparse representations, such as modal and sectional schemes, the maximum-entropy approach described here is not constrained to pre-determined size bins or assumed distribution shapes. This study is a first step toward a particle-based aerosol scheme that will track multivariate aerosol distributions with sufficient computational efficiency for large-scale simulations.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Enabling Modular Autonomous Feedback‐Loops in Materials Science through Hierarchical Experimental Laboratory Automation and Orchestration

Abstract Materials acceleration platforms (MAPs) operate on the paradigm of integrating combinatorial synthesis, high‐throughput characterization, automatic analysis, and machine learning. Within a MAP, one or multiple autonomous feedback loops may aim to optimize materials for certain functional properties or to generate new insights. The scope of a given experiment campaign is defined by the range of experiment and analysis actions that are integrated into the experiment framework. Herein, the authors present a method for integrating many actions within a hierarchical experimental laboratory automation and orchestration (HELAO) framework. They demonstrate the capability of orchestrating distributed research instruments that can incorporate data from experiments, simulations, and databases. HELAO interfaces laboratory hardware and software distributed across several computers and operating systems for executing experiments, data analysis, provenance tracking, and autonomous planning. Parallelization is an effective approach for accelerating knowledge generation provided that multiple instruments can be effectively coordinated, which the authors demonstrate with parallel electrochemistry experiments orchestrated by HELAO. Efficient implementation of autonomous research strategies requires device sharing, asynchronous multithreading, and full integration of data management in experimental orchestration, which to the best of the authors’ knowledge, is demonstrated for the first time herein.

36 MATERIALS SCIENCE↗