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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 361 records · Page 20

All sources NASA NTRS DOE OSTI

DOE OSTI2012

Computed versus measured ion velocity distribution functions in a Hall effect thruster

We compare time-averaged and time-varying measured and computed ion velocity distribution functions in a Hall effect thruster for typical operating conditions. The ion properties are measured by means of laser induced fluorescence spectroscopy. Simulations of the plasma properties are performed with a two-dimensional hybrid model. In the electron fluid description of the hybrid model, the anomalous transport responsible for the electron diffusion across the magnetic field barrier is deduced from the experimental profile of the time-averaged electric field. The use of a steady state anomalous mobility profile allows the hybrid model to capture some properties like the time-averaged ion mean velocity. Yet, the model fails at reproducing the time evolution of the ion velocity. This fact reveals a complex underlying physics that necessitates to account for the electron dynamics over a short time-scale. This study also shows the necessity for electron temperature measurements. Moreover, the strength of the self-magnetic field due to the rotating Hall current is found negligible.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2015

Heterogeneous high throughput scientific computing with APM X-Gene and Intel Xeon Phi

Electrical power requirements will be a constraint on the future growth of Distributed High Throughput Computing (DHTC) as used by High Energy Physics. Performance-per-watt is a critical metric for the evaluation of computer architectures for cost- efficient computing. Additionally, future performance growth will come from heterogeneous, many-core, and high computing density platforms with specialized processors. In this paper, we examine the Intel Xeon Phi Many Integrated Cores (MIC) co-processor and Applied Micro X-Gene ARMv8 64-bit low-power server system-on-a-chip (SoC) solutions for scientific computing applications. As a result, we report our experience on software porting, performance and energy efficiency and evaluate the potential for use of such technologies in the context of distributed computing systems such as the Worldwide LHC Computing Grid (WLCG).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2020

Development of low temperature fuel cell holders for Operando x-ray micro and nano computed tomography to visualize water distribution

Abstract Synchrotron x-ray imaging techniques, like x-ray computed tomography (CT) and radiography have proven instrumental in expanding the communities knowledge of complex transport and reaction kinetics in electrochemical devices such as fuel cells and electrolyzers. This work presents the development of novel x-ray CT imaging techniques for operando visualization of water within low temperature fuel cells at spatial resolutions spanning the micro and nano scales. The design of operando sample holders, for both micro x-ray CT and nano CT experiments is described in depth, and prototypes of these sample holders were evaluated across a set of requirements, the most important of which are x-ray transmissibility, electrical conductivity and mechanical stability. Water segmentation from micro x-ray CT data was enabled by an image subtraction method, where the image without water is subtracted from the one with water. Through iterative experimentations, the operando nano CT cell was developed to optimize mechanical compression, electric conductivity and gas flow. While three-dimensional fuel cell reconstructions were shown possible, there remain challenges to overcome at typical lower energies (8 keV) due to beam damage, whereas it is not as significant for higher energies (>17.5 keV).

Kulkarni, Devashish↗

DOE OSTI2017

Advances in the computation of the Sjöstrand, Rossi, and Feynman distributions

This study illustrates recent computational advances in the application of the Sjöstrand (area), Rossi, and Feynman methods to estimate the effective multiplication factor of a subcritical system driven by an external neutron source. The methodologies introduced in this study have been validated with the experimental results from the KUKA facility of Japan by Monte Carlo (MCNP6 and MCNPX) and deterministic (ERANOS, VARIANT, and PARTISN) codes. When the assembly is driven by a pulsed neutron source generated by a particle accelerator and delayed neutrons are at equilibrium, the Sjöstrand method becomes extremely fast if the integral of the reaction rate from a single pulse is split into two parts. These two integrals distinguish between the neutron counts during and after the pulse period. To conclude, when the facility is driven by a spontaneous fission neutron source, the timestamps of the detector neutron counts can be obtained up to the nanosecond precision using MCNP6, which allows obtaining the Rossi and Feynman distributions.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2017

PSelInv—A Distributed Memory Parallel Algorithm for Selected Inversion: The Symmetric Case

We describe an efficient parallel implementation of the selected inversion algorithm for distributed memory computer systems, which we call PSelInv. The PSelInv method computes selected elements of a general sparse matrix Athat can be decomposed as A= LU, where L is lower triangular and U is upper triangular. The implementation described in this article focuses on the case of sparse symmetric matrices. It contains an interface that is compatible with the distributed memory parallel sparse direct factorization SuperLU-DIST. Yet, the underlying data structure and design of PSelInv allows it to be easily combined with other factorization routines, such as PARDISO. We discuss general parallelization strategies such as data and task distribution schemes. Specifically, we describe how to exploit the concurrency exposed by the elimination tree associated with the LU factorization of A. We demonstrate the efficiency and accuracy of PSelInv by presenting several numerical experiments. In particular, we show that PSelInv can run efficiently on more than 4,000 cores for a modestly sized matrix. We also show how PSelInv can be used to accelerate large-scale electronic structure calculations.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

Distributions of Functionals of Switching Diffusions

The paper deals with methods of computation of distributions of functionals of switching diffusions. The switching between two collections of diffusion coefficients occurs at the Poisson time moments which are independent of the initial diffusions. One can also consider more general diffusions when the choice is made from three or more collections of diffusion coefficients.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

PanDA: Production and Distributed Analysis System

The Production and Distributed Analysis (PanDA) system is a data-driven workload management system engineered to operate at the LHC data processing scale. The PanDA system provides a solution for scientific experiments to fully leverage their distributed heterogeneous resources, showcasing scalability, usability, flexibility, and robustness. The system has successfully proven itself through nearly two decades of steady operation in the ATLAS experiment, addressing the intricate requirements such as diverse resources distributed worldwide at about 200 sites, thousands of scientists analyzing the data remotely, the volume of processed data beyond the exabyte scale, dozens of scientific applications to support, and data processing over several billion hours of computing usage per year. PanDA’s flexibility and scalability make it suitable for the High Energy Physics community and wider science domains at the Exascale. Beyond High Energy Physics, PanDA’s relevance extends to other big data sciences, as evidenced by its adoption in the Vera C. Rubin Observatory and the sPHENIX experiment. As the significance of advanced workflows continues to grow, PanDA has transformed into a comprehensive ecosystem, effectively tackling challenges associated with emerging workflows and evolving computing technologies. The paper discusses PanDA’s prominent role in the scientific landscape, detailing its architecture, functionality, deployment strategies, project management approaches, results, and evolution into an ecosystem.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Hybrid Entanglement Distribution between Remote Microwave Quantum Computers Empowered by Machine Learning

Superconducting microwave circuits with Josephson junctions, the major platform for quantum computing, can only reach the full capability when connected. This requires an efficient protocol to distribute microwave entanglement. While quantum computers typically use discrete-variable (DV) methods for information encoding, the entire continuous-variable (CV) degree of freedom in electromagnetic fields must be utilized to achieve the highest entanglement distribution rate. Here, we propose a hybrid protocol to resolve the incompatibility between DV microwave quantum computers and CV quantum communications. CV microwave entanglement is distributed using optical swapping of optical-microwave entanglement pairs. To interface with DV microwave quantum computers, we further design a hybrid circuit to simultaneously convert and distill high-quality DV entanglement from noisy CV entanglement. The hybrid circuit is trained with machine-learning algorithms, ensuring high entanglement fidelity and generation rate. In conclusion, our work not only provides a practical method to realize efficient quantum links for superconducting microwave quantum computers, but also opens avenues to bridge the gap between DV and CV quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2022

Virtual Time III, Part 2: Combining Conservative and Optimistic Synchronization

This is Part 2 of a trio of works intended to provide a unifying framework in which conservative and optimistic synchronization for parallel discrete event simulations can be freely and transparently combined in the same logical process on an event-by-event basis. Here, in this article, we continue the outline of an approach called Unified Virtual Time (UVT) that was introduced in Part 1, showing in detail via two extended examples how conservative synchronization can be refactored and combined with optimistic synchronization in the UVT framework. We describe UVT versions of both a basic time windowing algorithm called Unified Simple Time Windows and a refactored version of the Chandy-Misra-Bryant Null Message algorithm called Unified CMB.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

An Efficient Storage-Driven Machine Learning Model for Performance in the Era of Multimodal Scientific Data

Scientific workflows are increasingly relying on machine learning (ML), simulation, and hybrid techniques to predict, understand, and optimize the behavior of complex experiments. High-performance computing has greatly improved researchers’ ability to acquire diverse data modalities in these workflows. Recent studies suggest that the performance of machine learning models can be improved by integrating data from various sources. Unfortunately, these workloads pose unprecedent pressure on the network storage to meet the demands associated with accessing these multimodal data. To mitigate the impact of intensive IO, we propose a solution that utilizes a multi-tier High-Performance Computing (HPC) distributed storage and data processing framework, placing computation where the data resides for better performance. By adopting this project, the scientific community will gain new opportunities to explore multimodal storage-driven possibilities, integrating multiple scientific data sources with advanced streaming frameworks. Additionally, our framework effectively utilizes computing resources and bridges the gaps identified by HPC experts. Our proposed approach tackles scalability and persistence challenges by leveraging native persistency, which has posed difficulties in traditional approaches. Furthermore, we seek to enhance fault-tolerance and load-balance of computations by leveraging real-time streaming in diverse scientific computing environments, thereby propelling advanced scientific computing research into the next generation.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

Runtime Scheduling Policies for Distributed Graph Algorithms

In this paper we explore scheduling and runtime system support for unordered distributed graph computations that rely on optimistic (speculative) execution. Performance of such algorithms is impacted by two competing trends: the higher degree of parallelism enabled by optimistic execution in turn requires substantial runtime support. To address the potentially high overhead and scheduling complexity introduced by the runtime, we investigate customizable scheduling policies that augment the scheduler of the underlying runtime to adapt it to a specific graph application. We present several implementations of Distributed Control (DC), a data-driven unordered approach with work prioritization and demonstrate that customizable scheduling policies result in the most efficient implementation, outperforming the well-known -stepping Single-Source Shortest Paths (SSSP) and Jones-Plassmann vertex-coloring algorithms. We apply two scheduling techniques, flow control and adaptive frequency of network progress, which allow application-level control over the balance of domain work and the runtime work. Experimental results show the benefit of such application-aware scheduling for irregular distributed graph algorithms.

Firoz, Jesun S.↗

DOE OSTI2015

Computation of glint, glare, and solar irradiance distribution

Described herein are technologies pertaining to computing the solar irradiance distribution on a surface of a receiver in a concentrating solar power system or glint/glare emitted from a reflective entity. At least one camera captures images of the Sun and the entity of interest, wherein the images have pluralities of pixels having respective pluralities of intensity values. Based upon the intensity values of the pixels in the respective images, the solar irradiance distribution on the surface of the entity or glint/glare corresponding to the entity is computed.

14 SOLAR ENERGY↗

DOE OSTI2017

Computation of glint, glare, and solar irradiance distribution

14 SOLAR ENERGY↗

DOE OSTI2023

Accelerating Machine Learning Inference with GPUs in ProtoDUNE Data Processing

Abstract We study the performance of a cloud-based GPU-accelerated inference server to speed up event reconstruction in neutrino data batch jobs. Using detector data from the ProtoDUNE experiment and employing the standard DUNE grid job submission tools, we attempt to reprocess the data by running several thousand concurrent grid jobs, a rate we expect to be typical of current and future neutrino physics experiments. We process most of the dataset with the GPU version of our processing algorithm and the remainder with the CPU version for timing comparisons. We find that a 100-GPU cloud-based server is able to easily meet the processing demand, and that using the GPU version of the event processing algorithm is two times faster than processing these data with the CPU version when comparing to the newest CPUs in our sample. The amount of data transferred to the inference server during the GPU runs can overwhelm even the highest-bandwidth network switches, however, unless care is taken to observe network facility limits or otherwise distribute the jobs to multiple sites. We discuss the lessons learned from this processing campaign and several avenues for future improvements.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2024

Federated Access from DOE Labs to Distributed Storage in the EIC Era of Computing

The Electron Ion Collider (EIC) collaboration and future experiment is a unique scientific ecosystem within Nuclear Physics as the experiment starts right off as a crosscollaboration between Brookhaven National Lab (BNL) & Jefferson Lab (JLab). As a result, this muti-lab computing model tries at best to provide services accessible from anywhere by anyone who is part of the collaboration. While the computing model for the EIC is not finalized, it is anticipated that the computational and storage resources will be made accessible to a wide range of collaborators across the world. The use of federated ID seems to be a critical element to the strategy of providing such services, allowing seamless access to each lab site computing resources. However, providing Federated access to a Federated storage is not a trivial matter and has its share of technical challenges. In this contribution, we focus on the steps we took towards the deployment of a distributed object storage system that integrates with Amazon S3 and Federated ID. We will first cover for and explain the first stage storage solutions provided to the EIC during the detector design phase. Our initial test deployment consisted of Lustre storage using MinIO, hence providing an S3 interface. High Availability load balancers were added later to provide the initial scalability it lacked. Performance of that system will be shown. While this embryonic solution worked well, it had many limitations. Looking ahead, the Ceph object storage is considered a top-of-the-line solution in the storage community - since the Ceph Object Gateway is compatible with the Amazon S3 API out of the box, our next phase will use a native S3 storage. Our Ceph deployment will consist of erasure coded storage nodes to maximize storage potential along with multiple Ceph Object Gateways for redundant access. We will compare performance of our next stage implementations. Finally, we will present how to leverage OpenID Connect with the Ceph Object Gateway’s to enable Federated ID access. We hope this contribution will serve the community needs as we move forward with cross-lab collaborations and the need for Federated ID access to distributed compute facilities.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2016

An update to the computation of the Goudsmit-Saunderson distribution in MCNP® version 6.2

To demonstrate how the number of terms used to compute the Goudsmit- Saunderson distribution impacts results, we study a thin foil problem where the outgoing angular distribution is observed for 20-MeV electrons. The foil thickness is roughly 1.5 times the default substep size for a 20-MeV electron in gold ( 2.8e -3 cm). Therefore, for the default substep size, electrons are guaranteed to undergo at least one collision before encountering a boundary (at which point an approximation is applied). In theory, one can improve the accuracy of the MCNP6.2 electron transport method by reducing the substep size. However, one must assume that the underlying data are valid. We show that when a user reduces the substep size, the angular distribution observed is different than expected, the primary reason being that the underlying data were not computed using a sufficient number of terms. We also show that the distribution is recovered when the number of terms is increased from hundreds to thousands. Here, we showed that stabilizing the underlying angular deflection distributions used in transport improves simulation results, particularly when default parameters are adjusted such that the substep size is reduced. Stabilization is achieved by adding more terms when computing the Goudsmit-Sanderson distribution.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2017

The Einstein@Home gamma-ray pulsar survey. I. Search methods, sensitivity, and discovery of new young gamma-ray pulsars

We report on the results of a recent blind search survey for gamma-ray pulsars in Fermi Large Area Telescope (LAT) data being carried out on the distributed volunteer computing system, Einstein@Home. The survey has searched for pulsations in 118 unidentified pulsar-like sources, requiring about 10,000 years of CPU core time. In total, this survey has resulted in the discovery of 17 new gamma-ray pulsars, of which 13 are newly reported in this work, and an accompanying paper. These pulsars are all young, isolated pulsars with characteristic ages between 12 kyr and 2 Myr, and spin-down powers between 10{sup 34} and 4 × 10{sup 36} erg s{sup −1}. Two of these are the slowest spinning gamma-ray pulsars yet known. One pulsar experienced a very large glitch Δf/f≈3.5×10{sup −6} during the Fermi mission. In this, the first of two associated papers, we describe the search scheme used in this survey, and estimate the sensitivity of our search to pulsations in unidentified Fermi-LAT sources. One such estimate results in an upper limit of 57% for the fraction of pulsed emission from the gamma-ray source associated with the Cas A supernova remnant, constraining the pulsed gamma-ray photon flux that can be produced by the neutron star at its center. We also present the results of precise timing analyses for each of the newly detected pulsars.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2016

THE BRAKING INDEX OF A RADIO-QUIET GAMMA-RAY PULSAR

We report the discovery and timing measurements of PSR J1208−6238, a young and highly magnetized gamma-ray pulsar, with a spin period of 440 ms. The pulsar was discovered in gamma-ray photon data from the Fermi Large Area Telescope (LAT) during a blind-search survey of unidentified LAT sources, running on the distributed volunteer computing system Einstein@Home . No radio pulsations were detected in dedicated follow-up searches with the Parkes radio telescope, with a flux density upper limit at 1369 MHz of 30 μ Jy. By timing this pulsar’s gamma-ray pulsations, we measure its braking index over five years of LAT observations to be n = 2.598 ± 0.001 ± 0.1, where the first uncertainty is statistical and the second estimates the bias due to timing noise. Assuming its braking index has been similar since birth, the pulsar has an estimated age of around 2700 years, making it the youngest pulsar to be found in a blind search of gamma-ray data and the youngest known radio-quiet gamma-ray pulsar. Despite its young age, the pulsar is not associated with any known supernova remnant or pulsar wind nebula. The pulsar’s inferred dipolar surface magnetic field strength is 3.8 × 10{sup 13} G, almost 90% of the quantum-critical level. We investigate some potential physical causes of the braking index deviating from the simple dipole model but find that LAT data covering a longer time interval will be necessary to distinguish between these.

79 ASTRONOMY AND ASTROPHYSICS↗