Results for “Distributed computation” — Page 91

DOE OSTI2018

New approach based on group technology for the consolidation problem in cloud computing-mathematical model and genetic algorithm

Resource management is a hotspot issue in distributed systems like cloud computing (CC). It means how to prepare the computational resources, i.e., servers and virtual machines (VMS), to execute the tasks. This paper offers a new approach based on Group Technology (GT)—known as a powerful philosophy for the resource management in cellular manufacturing systems—to deal with the resource management problem in CC. We develop a mathematical model to optimally consolidate the VMs, servers and tasks simultaneously to control several important factors such as task migrations and server load variation, as well as the number of VMs. To test the validity of our proposed model, several small problems are generated randomly and solved by LINGO 9 software. Furthermore, to cope with larger problems, which cannot be solved optimally, a genetic algorithm is proposed. We, finally, compare our methods with the most well-known algorithms in this context, round robin (RR) and first-come, first-served (FCFS) algorithms.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2013

Lattice study of quark distribution amplitudes in the pion and its excitations

Lattice QCD serves as a computational framework capable of predicting the spectrum of hadronic excitations from first principles. Our desire to describe the wealth of existing experimental data on the spectrum and to predict the outcomes of future experiments poses numerous challenges. Thus, obtaining an accurate resolution of excited states using methods of LQCD is complicated due to the faster decay of excited state correlation functions in Euclidean space in comparison with those of ground states, which we overcome through the use of anisotropic lattices with a finer temporal than spatial discretization. The aim of this project is to go beyond the spectrum to discern the structure of the states through the computation of the quark distribution amplitudes for both the ground and excited pion states on improved anisotropic lattices developed by the Hadron Spectrum Collaboration. Application of variational method allows us to extract the excited-state spectrum. When combined with undergoing parallel perturbative study of renormalization coefficients for quark bilinear operators, this work will enable us to explore the internal structure of the excited states, and to investigate the approach to a quark and gluon description of hadrons when probed at high-momentum transfers.

Mastropas, Ekaterina↗

DOE OSTI2022

Approximate Bayesian Computation applied to the Diffuse Gamma-Ray Sky

ABSTRACT Many sources contribute to the diffuse gamma-ray background (DGRB), including star forming galaxies, active galactic nuclei, and cosmic ray interactions in the Milky Way. Exotic sources, such as dark matter annihilation, may also make some contribution. The photon counts-in-pixels distribution is a powerful tool for analysing the DGRB and determining the relative contributions of different sources. However, including photon energy information in a likelihood analysis of the counts-in-pixels distribution quickly becomes computationally intractable as the number of source types and energy bins increase. Here, we apply the likelihood-free method of approximate Bayesian computation (ABC) to the problem. We consider a mock analysis that includes contributions from dark matter annihilation in Galactic subhaloes as well as astrophysical backgrounds. We show that our results using ABC are consistent with the exact likelihood when energy information is discarded, and that significantly tighter parameter constraints can be obtained with ABC when energy information is included. ABC presents a powerful tool for analysing the DGRB and understanding its varied origins.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2019

Multigrid treatment of implicit continuum diffusion

Implicit treatment of diffusive terms of various differential orders common in continuum mechanics modeling, such as computational fluid dynamics, is investigated with spectral and multigrid algorithms in non-periodic 2D domains. In doubly periodic time dependent problems these terms are handled efficiently by spectral methods, but in non-periodic systems solved with distributed memory parallel computing and 2D domain decomposition, this efficiency is lost for a large number of processors. Here, we built and present here a multigrid algorithm for these types of problems that outperforms a spectral solution employing the highly optimized FFTW library. This solver is suitable for high performance computing and may be able to efficiently treat implicit diffusion of arbitrary order by introducing auxiliary equations of lower order. We test these solvers for fourth and sixth order diffusion with harmonic test functions as well as turbulent 2D magnetohydrodynamic simulations. It is also shown that an anisotropic operator without mixed-derivative terms improves model accuracy and speed, and we examine the impact that the various diffusion operators have on the energy, the enstrophy, and the qualitative aspect of a simulation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2014

Localized overlap algorithm for unexpanded dispersion energies

First-principles-based, linearly scaling algorithm has been developed for calculations of dispersion energies from frequency-dependent density susceptibility (FDDS) functions with account of charge-overlap effects. The transition densities in FDDSs are fitted by a set of auxiliary atom-centered functions. The terms in the dispersion energy expression involving products of such functions are computed using either the unexpanded (exact) formula or from inexpensive asymptotic expansions, depending on the location of these functions relative to the dimer configuration. This approach leads to significant savings of computational resources. In particular, for a dimer consisting of two elongated monomers with 81 atoms each in a head-to-head configuration, the most favorable case for our algorithm, a 43-fold speedup has been achieved while the approximate dispersion energy differs by less than 1% from that computed using the standard unexpanded approach. In contrast, the dispersion energy computed from the distributed asymptotic expansion differs by dozens of percent in the van der Waals minimum region. A further increase of the size of each monomer would result in only small increased costs since all the additional terms would be computed from the asymptotic expansion.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NASA NTRS1984

Inversion of vegetation canopy reflectance models for estimating agronomic variables. III - Estimation using only canopy reflectance data as illustrated by the suits model. IV - Total inversion of the SAIL model

The possibility of estimating agronomic and spectral parameters for a vegetation canopy from the canopy reflectance (CR) data in the infrared region is investigated for a set of solar/view directions. It is shown that such an estimation is possible, in principle, for the Suits (1972) model for a homogeneous canopy. The technique is then applied to a more complex model, the SAIL (scattering by arbitrarily inclined leaves) model which explicitly includes the leaf angle distribution in the computation of the canopy reflectance. It is concluded that, given the expected accuracy of CR measurements and the accuracy of the SAIL model in representing CR in the infrared region, the agronomic parameters, leaf area index, and leaf angle distribution can be estimated fairly accurately using ancillary data on spectral parameters.

Goel, N. S.↗

DOE OSTI2011

Net-charge probability distributions in heavyion collisions at chemical freeze-out

We compute net-proton probability distributions in heavy ion collisions within the hadron resonance gas model. The model results are compared with data taken by the STAR Collaboration in Au-Au collisions at {radical}s{sub NN} = 200 GeV for different centralities and for the central energy bin at {radical}s{sub NN} = 39 GeV. We show that, in central Au-Au collisions at {radical}s{sub NN} = 39 GeV, the measured distribution is consistent with the hadron resonance gas model but differs from the predictions of the model at {radical}s{sub NN} = 200 GeV. At the highest energy, deviations from model results are smaller for peripheral collisions. We argue that such properties of probability distributions are expected if the freeze-out conditions probed by fluctuations are located close to the QCD crossover transition.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1986

Implementation of Ada protocols on Mil-STD-1553 B data bus

Standardization activity of data communication in avionic systems started in 1968 for the purpose of total system integration and the elimination of heavy wire bundles carrying signals between various subassemblies. The growing complexity of avionic systems is straining the capabilities of MIL-STD-1553 B (first issued in 1973), but a much greater challenge to it is posed by Ada, the standard language adopted for real-time, computer embedded-systems. Hardware implementation of Ada communication protocols in a contention/token bus or token ring network is proposed. However, during the transition period when the current command/response multiplex data bus is still flourishing and the development environment for distributed multi-computer Ada systems is as yet lacking, a temporary accomodation of the standard language with the standard bus could be very useful and even highly desirable. By concentrating all status informtion and decisions at the bus controller, it was found to be possible to construct an elegant and efficient harware impelementation of the Ada protocols at the bus interface. This solution is discussed.

Ruhman, Smil↗

NASA NTRS1990

A study of fracture mechanisms in ATD roller bearing

The purpose was to investigate how microstructures, especially anisotropy, affects internal stresses and the overall mechanical response of bearings. Samples with the stress axis along the aligned carbide direction possessed high modulus values compared to those with their axis perpendicular to the carbide stringers. The difference in the modulus was found to be more than a factor of two. A series of experiments was conducted on rolled samples to further investigate this effect; the two sets of results were consistent with each other. The degree of anisotropy of the microstructure in terms of the carbide and matrix orientations was determined using x-ray diffraction. The stress state determination was conducted using neutron diffraction. It was found that there was little variation in the distribution of the internal stresses amongst different samples, indicating that small changes in the processing and geometrical conditions did not result in significant variations in the internal stress. A nominal tensile hoop stress of 39 ksi was obtained for the inner raceway. Furthermore, during the course of the investigation, it was apparent that there was a need to determine the stress state induced by the shrink fitting process. Therefore, a series of experiments was conducted using strain gages to identify the stress distribution in a shrink fitting process in three different types of geometries. Correlations were obtained to estimate the highest stress values in the outer and inner groove geometry. A finite element program based on the ANSYS system was developed to compute the stress distribution in the inner raceway geometry. This analysis indicates that the highest tensile stress in the system occurs at the ID of the ring with a stress value of over 5 times that of the applied radial stress. Results from all these facets were correlated with one another. It appears that the material does not fail as a result of any one single factor, but results from a combination of the various factors investigated.

Zee, Ralph H.↗

NASA NTRS1991

Address tracing for parallel machines

Recently implemented parallel system address-tracing methods based on several metrics are surveyed. The issues specific to collection of traces for both shared and distributed memory parallel computers are highlighted. Five general categories of address-trace collection methods are examined: hardware-captured, interrupt-based, simulation-based, altered microcode-based, and instrumented program-based traces. The problems unique to shared memory and distributed memory multiprocessors are examined separately.

Stunkel, Craig B.↗

NASA NTRS1994

Integral-moment analysis of the BATSE gamma-ray burst intensity distribution

We have applied the technique of integral-moment analysis to the intensity distribution of the first 260 gamma-ray bursts observed by the Burst and Transient Source Experiment (BATSE) on the Compton Gamma Ray Observatory. This technique provides direct measurement of properties such as the mean, variance, and skewness of the convolved luminosity-number density distribution, as well as associated uncertainties. Using this method, one obtains insight into the nature of the source distributions unavailable through computation of traditional single parameters such as V/V(sub max)). If the luminosity function of the gamma-ray bursts is strongly peaked, giving bursts only a narrow range of luminosities, these results are then direct probes of the radial distribution of sources, regardless of whether the bursts are a local phenomenon, are distributed in a galactic halo, or are at cosmological distances. Accordingly, an integral-moment analysis of the intensity distribution of the gamma-ray bursts provides for the most complete analytic description of the source distribution available from the data, and offers the most comprehensive test of the compatibility of a given hypothesized distribution with observation.

Horack, John M.↗

DOE OSTI2019

UPC++ Programmer’s Guide (v1.0-2019.3.0)

UPC++ is a C++11 library that provides Partitioned Global Address Space (PGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The PGAS model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. However, PGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

UPC++ v1.0 Programmer’s Guide (Revision 2019.9.0)

UPC++ is a C++11 library that provides Partitioned Global Address Space (PGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The PGAS model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. However, PGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

UPC++ Programmer’s Guide, v1.0-2018.9.0

UPC++ is a C++11 library that provides Partitioned Global Address Space (PGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The PGAS model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. However, PGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

UPC++ v1.0 Programmer’s Guide, Revision 2020.10.0

UPC++ is a C++11 library that provides Partitioned Global Address Space (PGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The PGAS model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. However, PGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

UPC++ v1.0 Programmer’s Guide, Revision 2020.3.0

UPC++ is a C++11 library that provides Partitioned Global Address Space (PGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The PGAS model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. However, PGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

Considerations on the implementation and use of Anderson acceleration on distributed memory and GPU-based parallel computers

Abstract not provided

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Spatially distributed infection increases viral load in a computational model of SARS-CoV-2 lung infection

A key question in SARS-CoV-2 infection is why viral loads and patient outcomes vary dramatically across individuals. Because spatial-temporal dynamics of viral spread and immune response are challenging to study in vivo, we developed Spatial Immune Model of Coronavirus (SIMCoV), a scalable computational model that simulates hundreds of millions of lung cells, including respiratory epithelial cells and T cells. SIMCoV replicates viral growth dynamics observed in patients and shows how spatially dispersed infections can lead to increased viral loads. The model also shows how the timing and strength of the T cell response can affect viral persistence, oscillations, and control. By incorporating spatial interactions, SIMCoV provides a parsimonious explanation for the dramatically different viral load trajectories among patients by varying only the number of initial sites of infection and the magnitude and timing of the T cell immune response. When the branching airway structure of the lung is explicitly represented, we find that virus spreads faster than in a 2D layer of epithelial cells, but much more slowly than in an undifferentiated 3D grid or in a well-mixed differential equation model. These results illustrate how realistic, spatially explicit computational models can improve understanding of within-host dynamics of SARS-CoV-2 infection.

59 BASIC BIOLOGICAL SCIENCES↗