Search NASA⌕ Search

SEARCH · Search NASA

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 577 records · Page 32

Monte Carlo modeling of electron density in hypersonic rarefied gas flows

The electron density distribution around a vehicle employed in the RAM-C II flight test is calculated with the DSMC method. To resolve the mole fraction of electrons which is several orders lower than those of the primary species in the free stream, an algorithm named as trace species separation (TSS) is utilized. The TSS algorithm solves the primary and trace species separately, which is similar to the DSMC overlay techniques; however it generates new simulated molecules of trace species, such as ions and electrons in each cell, basing on the ionization and recombination rates directly, which differs from the DSMC overlay techniques based on probabilistic models. The electron density distributions computed by TSS agree well with the flight data measured in the RAM-C II test along a decent trajectory at three altitudes 81km, 76km, and 71km.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fault-tolerant quantum computation and communication on a distributed 2D array of small local systems

We propose a scheme for distributed quantum computation with small local systems connected via noisy quantum channels. We show that the proposed scheme tolerates errors with probabilities ∼30% and ∼ 0.1% in quantum channels and local operations, respectively, both of which are improved substantially compared to the previous works.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A comparison of non-local electron transport models for laser-plasmas relevant to inertial confinement fusion

Here, we compare the reduced non-local electron transport model developed to Vlasov-Fokker-Planck simulations. Two new test cases are considered: the propagation of a heat wave through a high density region into a lower density gas, and a one-dimensional hohlraum ablation problem. We find that the reduced model reproduces the peak heat flux well in the ablation region but significantly over-predicts the coronal preheat. The suitability of the reduced model for computing non-local transport effects other than thermal conductivity is considered by comparing the computed distribution function to the Vlasov-Fokker-Planck distribution function. It is shown that even when the reduced model reproduces the correct heat flux, the distribution function is significantly different to the Vlasov-Fokker-Planck prediction. Two simple modifications are considered which improve agreement between models in the coronal region.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Parallel EM Algorithm for Model-Based Clustering Applied to the Exploration of Large Spatio-Temporal Data

We develop a parallel EM algorithm for multivariate Gaussian mixture models and use it to perform model-based clustering of a large climate data set. Three variants of the EM algorithm are reformulated in parallel and a new variant that is faster is presented. All are implemented using the single program, multiple data (SPMD) programming model, which is able to take advantage of the combined collective memory of large distributed computer architectures to process larger data sets. Displays of the estimated mixture model rather than the data allow us to explore multivariate relationships in a way that scales to arbitrary size data. We study the performance of our methodology on simulated data and apply our methodology to a high resolution climate dataset produced by the community atmosphere model (CAM5). This article has supplementary material online.

Chen, Wei-Chen↗

Gauges, loops, and polynomials for partition functions of graphical models

Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and optimization applications. The problem is #P-hard that is of an exponential complexity with respect to the number of variables. Here, aimed at approximating the partition function, we consider multi-graph models where binary variables and multivariable factors are associated with edges and nodes, respectively, of an undirected multi-graph. We suggest a new methodology for analysis and computations that combines the Gauge function technique from Chertkov and Chernyak with the technique developed in Anari and Oveis Gharan 2017 arXiv:1702.02937; Gurvits 2011 arXiv:1106.2844; Straszak and Vishnoi 2017 55th Annual Allerton Conf. on Communication, Control, and Computing, based on the recent progress in the field of real stable polynomials. We show that the Gauge function, representing a single-out term in a finite sum expression for the partition function which achieves extremum at the so-called belief-propagation gauge, has a natural polynomial representation in terms of gauges/variables associated with edges of the multi-graph. Moreover, Gauge function can be used to recover the partition function through a sequence of transformations allowing appealing algebraic and graphical interpretations. Algebraically, one step in the sequence consists of the application of a differential operator over gauges associated with an edge. Graphically, the sequence is interpreted as a repetitive elimination/contraction of edges resulting in multi-graph models on decreasing in size (number of edges) graphs with the same partition function as in the original multi-graph model. Even though the complexity of computing factors in the sequence of the derived multi-graph models and respective Gauge functions grow exponentially with the number of eliminated edges, polynomials associated with the new factors remain bi-stable if the original factors have this property. Moreover, we show that BP estimations in the sequence do not decrease, each low-bounding the partition function.

97 MATHEMATICS AND COMPUTING↗

Distributed Monte Carlo production for D0

The D0 collaboration uses a variety of resources on four continents to pursue a strategy of flexibility and automation in the generation of simulation data. This strategy provides a resilient and opportunistic system which ensures an adequate and timely supply of simulation data to support D0's physics analyses. A mixture of facilities, dedicated and opportunistic, specialized and generic, large and small, grid job enabled and not, are used to provide a production system that has adapted to newly developing technologies. This strategy has increased the event production rate by a factor of seven and the data production rate by a factor of ten in the last three years despite diminishing manpower. Common to all production facilities is the SAM (Sequential Access to Metadata) data-grid. Job submission to the grid uses SAMGrid middleware which may forward jobs to the OSG, the WLCG, or native SAMGrid sites. The distributed computing and data handling system used by D0 will be described and the results of MC production since the deployment of grid technologies will be presented.

99 GENERAL AND MISCELLANEOUS↗

Large scale and low latency analysis facilities for the CMS experiment: Development and operational aspects

While a majority of CMS data analysis activities rely on the distributed computing infrastructure on the WLCG Grid, dedicated local computing facilities have been deployed to address particular requirements in terms of latency and scale. The CMS CERN Analysis Facility (CAF) was primarily designed to host a large variety of latency-critical workflows. These break down into alignment and calibration, detector commissioning and diagnosis, and high-interest physics analysis requiring fast turnaround. In order to reach the goal for fast turnaround tasks, the Workload Management group has designed a CRABServer based system to fit with two main needs: to provide a simple, familiar interface to the user (as used in the CRAB Analysis Tool[7]) and to allow an easy transition to the Tier-0 system. While the CRABServer component had been initially designed for Grid analysis by CMS end-users, with a few modifications it turned out to be also a very powerful service to manage and monitor local submissions on the CAF. Transition to Tier-0 has been guaranteed by the usage of the WMCore, a library developed by CMS to be the common core of workload management tools, for handing data driven workflow dependencies. This system is now being used with the first use cases, and important experience is being acquired. In addition to the CERN CAF facility, FNAL has CMS dedicated analysis resources at the FNAL LHC Physics Center (LPC). In the first few years of data collection FNAL has been able to accept a large fraction of CMS data. The remote centre is not well suited for the extremely low latency work expected of the CAF, but the presence of substantial analysis resources, a large resident community, and a large fraction of the data make the LPC a strong facility for resource intensive analysis. We present the building, commissioning and operation of these dedicated analysis facilities in the first year of LHC collisions, we also present the specific development to our software needed to allow for the use of these computing facilities in the special use cases of fast turnaround analyses.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

CMS resource utilization and limitations on the grid after the first two years of LHC collisions

After years of development, the CMS distributed computing system is now in full operation. The LHC continues to set records for operational performance, and CMS records data at more than 300 Hz. Because of the intensity of the beams, there are multiple proton-proton interactions per beam crossing, leading to ever-larger event sizes and processing times. The CMS computing system has responded admirably to these challenges, but some reoptimization of the computing model has been required to maximize the efficient delivery of data analysis results by the collaboration in the face of increasingly constrained computing resources. We present the current status of the system, describe the recent performance, and discuss the challenges ahead and how CMS intends to meet them.

Bagliesi, Giuseppe↗

Identifying gaps in grid middleware on fast networks with the advanced networking initiative

As of 2012, a number of US Department of Energy (DOE) National Laboratories have access to a 100 Gb/s wide-area network backbone. The ESnet Advanced Networking Initiative (ANI) project is intended to develop a prototype network, based on emerging 100 Gb/s Ethernet technology. The ANI network will support DOE's science research programs. A 100 Gb/s network test bed is a key component of the ANI project. The test bed offers the opportunity for early evaluation of 100Gb/s network infrastructure for supporting the high impact data movement typical of science collaborations and experiments. In order to make effective use of this advanced infrastructure, the applications and middleware currently used by the distributed computing systems of large-scale science need to be adapted and tested within the new environment, with gaps in functionality identified and corrected. As a user of the ANI test bed, Fermilab aims to study the issues related to end-to-end integration and use of 100 Gb/s networks for the event simulation and analysis applications of physics experiments. In this paper we discuss our findings from evaluating existing HEP Physics middleware and application components, including GridFTP, Globus Online, etc. in the high-speed environment. These will include possible recommendations to the system administrators, application and middleware developers on changes that would make production use of the 100 Gb/s networks, including data storage, caching and wide area access.

Dykstra, Dave↗

PD2P: PanDA Dynamic Data Placement for ATLAS

The PanDA (Production and Distributed Analysis) system plays a key role in the ATLAS distributed computing infrastructure. PanDA is the ATLAS workload management system for processing all Monte-Carlo (MC) simulation and data reprocessing jobs in addition to user and group analysis jobs. The PanDA Dynamic Data Placement (PD2P) system has been developed to cope with difficulties of data placement for ATLAS. We will describe the design of the new system, its performance during the past year of data taking, dramatic improvements it has brought about in the efficient use of storage and processing resources, and plans for the future.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Status and trends in networking at LHC Tier1 facilities

The LHC is entering its fourth year of production operation. Most Tier1 facilities have been in operation for almost a decade, when development and ramp-up efforts are included. LHC's distributed computing model is based on the availability of high capacity, high performance network facilities for both the WAN and LAN data movement, particularly within the Tier1 centers. As a result, the Tier1 centers tend to be on the leading edge of data center networking technology. In this paper, we analyze past and current developments in Tier1 LAN networking, as well as extrapolating where we anticipate networking technology is heading. Our analysis will include examination into the following areas: Evolution of Tier1 centers to their current state Evolving data center networking models and how they apply to Tier1 centers Impact of emerging network technologies (e.g. 10GE-connected hosts, 40GE/100GE links, IPv6) on Tier1 centers Trends in WAN data movement and emergence of software-defined WAN network capabilities Network virtualization

Bobyshev, A.↗

Coordinate-Space Hartree-Fock-Bogoliubov Solvers for Super fluid Fermi Systems in Large Boxes

The self-consistent Hartree-Fock-Bogoliubov problem in large boxes can be solved accurately in the coordinate space with the recently developed solvers HFB-AX (2D) and MADNESS-HFB (3D). This is essential for the description of superfluid Fermi systems with complicated topologies and significant spatial extend, such as fissioning nuclei, weakly-bound nuclei, nuclear matter in the neutron star rust, and ultracold Fermi atoms in elongated traps. The HFB-AX solver based on B-spline techniques uses a hybrid MPI and OpenMP programming model for parallel computation for distributed parallel computation, within a node multi-threaded LAPACK and BLAS libraries are used to further enable parallel calculations of large eigensystems. The MADNESS-HFB solver uses a novel multi-resolution analysis based adaptive pseudo-spectral techniques to enable fully parallel 3D calculations of very large systems. In this work we present benchmark results for HFB-AX and MADNESS-HFB on ultracold trapped fermions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

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

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

97 MATHEMATICS AND COMPUTING↗

PSR J1906+0722: an Elusive Gamma-Ray Pulsar

Here, we report the discovery of PSR J1906+0722, a gamma-ray pulsar detected as part of a blind survey of unidentified Fermi Large Area Telescope (LAT) sources being carried out on the volunteer distributed computing system, Einstein@Home. This newly discovered pulsar previously appeared as the most significant remaining unidentified gamma-ray source without a known association in the second Fermi-LAT source catalog (2FGL) and was among the top 10 most significant unassociated sources in the recent third catalog (3FGL). PSR J1906+0722 is a young, energetic, isolated pulsar, with a spin frequency of 8.9 Hz, a characteristic age of 49 kyr, and spin-down power $1.0\times {10}^{36}$ erg s -1 . In 2009 August it suffered one of the largest glitches detected from a gamma-ray pulsar (${\rm{\Delta }}f/f\approx 4.5\times {10}^{-6}$). Remaining undetected in dedicated radio follow-up observations, the pulsar is likely radio-quiet. An off-pulse analysis of the gamma-ray flux from the location of PSR J1906+0722 revealed the presence of an additional nearby source, which may be emission from the interaction between a neighboring supernova remnant and a molecular cloud. We discuss possible effects which may have hindered the detection of PSR J1906+0722 in previous searches and describe the methods by which these effects were mitigated in this survey. Lastly, we also demonstrate the use of advanced timing methods for estimating the positional, spin and glitch parameters of difficult-to-time pulsars such as this.

79 ASTRONOMY AND ASTROPHYSICS↗

PyDREAM: high-dimensional parameter inference for biological models in python

Biological models contain many parameters whose values are difficult to measure directly via experimentation and therefore require calibration against experimental data. Markov chain Monte Carlo (MCMC) methods are suitable to estimate multivariate posterior model parameter distributions, but these methods may exhibit slow or premature convergence in high-dimensional search spaces. Here, we present PyDREAM, a Python implementation of the (Multiple-Try) Differential Evolution Adaptive Metropolis [DREAM(ZS)] algorithm developed by Vrugt and ter Braak (2008) and Laloy and Vrugt (2012). PyDREAM achieves excellent performance for complex, parameter-rich models and takes full advantage of distributed computing resources, facilitating parameter inference and uncertainty estimation of CPU-intensive biological models.

59 BASIC BIOLOGICAL SCIENCES↗

A catalogue of Locus Algorithm pointings for optimal differential photometry for 23 779 quasars

ABSTRACT This paper presents a catalogue of optimized pointings for differential photometry of 23 779 quasars extracted from the Sloan Digital Sky Survey (SDSS) Catalogue and a Score for each indicating the quality of the Field of View (FoV) associated with that pointing. Observation of millimagnitude variability on a time-scale of minutes typically requires differential observations with reference to an ensemble of reference stars. For optimal performance, these reference stars should have similar colour and magnitude to the target quasar. In addition, the greatest quantity and quality of suitable reference stars may be found by using a telescope pointing which offsets the target object from the centre of the FoV. By comparing each quasar with the stars which appear close to it on the sky in the SDSS Catalogue, an optimum pointing can be calculated, and a figure of merit, referred to as the ‘Score’ is calculated for that pointing. Highly flexible software has been developed to enable this process to be automated and implemented in a distributed computing paradigm, which enables the creation of catalogues of pointings given a set of input targets. Applying this technique to a sample of 40 000 targets from the fourth SDSS quasar catalogue resulted in the production of pointings and Scores for 23 779 quasars based on their magnitudes in the SDSS r-band. This catalogue is a useful resource for observers planning differential photometry studies and surveys of quasars to select those which have many suitable celestial neighbours for differential photometry.

79 ASTRONOMY AND ASTROPHYSICS↗

Entanglement and communication-reducing properties of noisy N-qubit states

We consider properties of states of many qubits, which arise after sending certain entangled states via various noisy channels (white noise, colored noise, local depolarization, dephasing, and amplitude damping). Entanglement of these states and their ability to violate certain classes of Bell inequalities are studied. States which violate them allow a higher than classical efficiency in solving related distributed computational tasks with constrained communication. This is a direct property of such states--not requiring their further modification via stochastic local operations and classical communication such as entanglement purification or distillation procedures. We identify families of multiparticle states which are entangled but nevertheless allow the local realistic description of specific Bell experiments. For some of them, the 'gap' between the critical values for entanglement and violation of Bell inequality remains finite even in the limit of infinitely many qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Microscopic optical potentials for medium-mass isotopes derived at the first order of Watson multiple-scattering theory

We perform a first-principles calculation of optical potentials for nucleon elastic scattering off medium-mass isotopes. Fully based on a saturating chiral Hamiltonian, the optical potentials are derived by folding nuclear density distributions computed with self-consistent Green's function theory with a nucleon-nucleon t matrix computed with a consistent chiral interaction. The dependence on the folding interaction as well as the convergence of the target densities are investigated. Numerical results are presented and discussed for differential cross sections and analyzing powers, with focus on elastic proton scattering off calcium and nickel isotopes. Our optical potentials generally show a remarkable agreement with the available experimental data for laboratory energies in the range 65–200 MeV. We study the evolution of the scattering observables with increasing proton-neutron asymmetry by computing theoretical predictions of the cross section and analyzing power over the calcium and nickel isotopic chains. Published by the American Physical Society 2024

Physics↗