Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Cluster computing”

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 397 records · Page 22

Glenn-ht/bem Conjugate Heat Transfer Solver for Large-scale Turbomachinery Models

A coupled Boundary Element/Finite Volume Method temperature-forward/flux-hack algorithm is developed for conjugate heat transfer (CHT) applications. A loosely coupled strategy is adopted with each field solution providing boundary conditions for the other in an iteration seeking continuity of temperature and heat flux at the fluid-solid interface. The NASA Glenn Navier-Stokes code Glenn-HT is coupled to a 3-D BEM steady state heat conduction code developed at the University of Central Florida. Results from CHT simulation of a 3-D film-cooled blade section are presented and compared with those computed by a two-temperature approach. Also presented are current developments of an iterative domain decomposition strategy accommodating large numbers of unknowns in the BEM. The blade is artificially sub-sectioned in the span-wise direction, 3-D BEM solutions are obtained in the subdomains, and interface temperatures are averaged symmetrically when the flux is updated while the fluxes are averaged anti-symmetrically to maintain continuity of heat flux when the temperatures are updated. An initial guess for interface temperatures uses a physically-based 1-D conduction argument to provide an effective starting point and significantly reduce iteration. 2-D and 3-D results show the process converges efficiently and offers substantial computational and storage savings. Future developments include a parallel multi-grid implementation of the approach under MPI for computation on PC clusters.

Divo, E.↗

What Multilevel Parallel Programs do when you are not Watching: A Performance Analysis Case Study Comparing MPI/OpenMP, MLP, and Nested OpenMP

With the current trend in parallel computer architectures towards clusters of shared memory symmetric multi-processors, parallel programming techniques have evolved that support parallelism beyond a single level. When comparing the performance of applications based on different programming paradigms, it is important to differentiate between the influence of the programming model itself and other factors, such as implementation specific behavior of the operating system (OS) or architectural issues. Rewriting-a large scientific application in order to employ a new programming paradigms is usually a time consuming and error prone task. Before embarking on such an endeavor it is important to determine that there is really a gain that would not be possible with the current implementation. A detailed performance analysis is crucial to clarify these issues. The multilevel programming paradigms considered in this study are hybrid MPI/OpenMP, MLP, and nested OpenMP. The hybrid MPI/OpenMP approach is based on using MPI [7] for the coarse grained parallelization and OpenMP [9] for fine grained loop level parallelism. The MPI programming paradigm assumes a private address space for each process. Data is transferred by explicitly exchanging messages via calls to the MPI library. This model was originally designed for distributed memory architectures but is also suitable for shared memory systems. The second paradigm under consideration is MLP which was developed by Taft. The approach is similar to MPi/OpenMP, using a mix of coarse grain process level parallelization and loop level OpenMP parallelization. As it is the case with MPI, a private address space is assumed for each process. The MLP approach was developed for ccNUMA architectures and explicitly takes advantage of the availability of shared memory. A shared memory arena which is accessible by all processes is required. Communication is done by reading from and writing to the shared memory.

Jost, Gabriele↗

Earth Science Data Fusion with Event Building Approach

Objectives of the NASA Information And Data System (NAIADS) project are to develop a prototype of a conceptually new middleware framework to modernize and significantly improve efficiency of the Earth Science data fusion, big data processing and analytics. The key components of the NAIADS include: Service Oriented Architecture (SOA) multi-lingual framework, multi-sensor coincident data Predictor, fast into-memory data Staging, multi-sensor data-Event Builder, complete data-Event streaming (a work flow with minimized IO), on-line data processing control and analytics services. The NAIADS project is leveraging CLARA framework, developed in Jefferson Lab, and integrated with the ZeroMQ messaging library. The science services are prototyped and incorporated into the system. Merging the SCIAMACHY Level-1 observations and MODIS/Terra Level-2 (Clouds and Aerosols) data products, and ECMWF re- analysis will be used for NAIADS demonstration and performance tests in compute Cloud and Cluster environments.

Lukashin, C.↗

X-ray clusters from a high-resolution hydrodynamic PPM simulation of the cold dark matter universe

A new three-dimensional hydrodynamic code based on the piecewise parabolic method (PPM) is utilized to compute the distribution of hot gas in the standard Cosmic Background Explorer (COBE)-normalized cold dark matter (CDM) universe. Utilizing periodic boundary conditions, a box with size 85 h(exp-1) Mpc, having cell size 0.31 h(exp-1) Mpc, is followed in a simulation with 270(exp 3)=10(exp 7.3) cells. Adopting standard parameters determined from COBE and light-element nucleosynthesis, Sigma(sub 8)=1.05, Omega(sub b)=0.06, we find the X-ray-emitting clusters, compute the luminosity function at several wavelengths, the temperature distribution, and estimated sizes, as well as the evolution of these quantities with redshift. The results, which are compared with those obtained in the preceding paper (Kang et al. 1994a), may be used in conjuction with ROSAT and other observational data sets. Overall, the results of the two computations are qualitatively very similar with regard to the trends of cluster properties, i.e., how the number density, radius, and temeprature depend on luminosity and redshift. The total luminosity from clusters is approximately a factor of 2 higher using the PPM code (as compared to the 'total variation diminishing' (TVD) code used in the previous paper) with the number of bright clusters higher by a similar factor. The primary conclusions of the prior paper, with regard to the power spectrum of the primeval density perturbations, are strengthened: the standard CDM model, normalized to the COBE microwave detection, predicts too many bright X-ray emitting clusters, by a factor probably in excess of 5. The comparison between observations and theoretical predictions for the evolution of cluster properties, luminosity functions, and size and temperature distributions should provide an important discriminator among competing scenarios for the development of structure in the universe.

Bryan, Greg L.↗

2D-FFTLog: efficient computation of real-space covariance matrices for galaxy clustering and weak lensing

ABSTRACT Accurate covariance matrices for two-point functions are critical for inferring cosmological parameters in likelihood analyses of large-scale structure surveys. Among various approaches to obtaining the covariance, analytic computation is much faster and less noisy than estimation from data or simulations. However, the transform of covariances from Fourier space to real space involves integrals with two Bessel integrals, which are numerically slow and easily affected by numerical uncertainties. Inaccurate covariances may lead to significant errors in the inference of the cosmological parameters. In this paper, we introduce a 2D-FFTLog algorithm for efficient, accurate, and numerically stable computation of non-Gaussian real-space covariances for both 3D and projected statistics. The 2D-FFTLog algorithm is easily extended to perform real-space bin-averaging. We apply the algorithm to the covariances for galaxy clustering and weak lensing for a Dark Energy Survey Year 3-like and a Rubin Observatory’s Legacy Survey of Space and Time Year 1-like survey, and demonstrate that for both surveys, our algorithm can produce numerically stable angular bin-averaged covariances with the flat sky approximation, which are sufficiently accurate for inferring cosmological parameters. The code CosmoCov for computing the real-space covariances with or without the flat-sky approximation is released along with this paper.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Radio Sources Toward Galaxy Clusters at 30 GHz

Extra-galactic radio sources are a significant contaminant in cosmic microwave background and Sunyaev-Zeldovich effect experiments. Deep interferometric observations with the BIMA and OVRO arrays are used to characterize the spatial, spectral, and flux distributions of radio sources toward massive galaxy clusters at 28.5 GHz. We compute counts of mJy source fluxes from 89 fields centered on known massive galaxy clusters and 8 non-cluster fields. We find that source counts in the inner regions of the cluster fields (within 0.5 arcmin of the cluster center) are a factor of 8.9 (+4.2 to -3.8) times higher than counts in the outer regions of the cluster fields (radius greater than 0.5 arcmin). Counts in the outer regions of the cluster fields are in turn a factor of 3.3 (+4.1 -1.8) greater than those in the noncluster fields. Counts in the non-cluster fields are consistent with extrapolations from the results of other surveys. We compute spectral indices of mJy sources in cluster fields between 1.4 and 28.5 GHz and find a mean spectral index of al[ja = 0.66 with an rms dispersion of 0.36, where flux S varies as upsilon(sup -alpha). The distribution is skewed, with a median spectral index of 0.72 and 25th and 75th percentiles of 0.51 and 0.92, respectively. This is steeper than the spectral indices of stronger field sources measured by other surveys.

Coble, K.↗

Finite-Temperature Structures of Supported Subnanometer Catalysts Inferred via Statistical Learning and Genetic Algorithm-Based Optimization

Single-atom catalysts (SACs) minimize noble metal utilization and can alter the activity and selectivity of supported metal nanoparticles. However, the morphology of active centers, including single atoms and subnanometer clusters of a few atoms, remains elusive due to experimental challenges. The computational cost to describe numerous cluster shapes and sizes makes direct first-principles calculations impractical. We present a computational framework to enable structure determination for single-atom and subnanometer cluster catalysts. As a case study, we obtained the low energy structures of Pd n (n = 1-21) clusters supported on CeO 2 (111), which are critical components of automobile three-way catalysts. Trained on density functional theory data, a three-dimensional cluster expansion is established using statistical learning to describe the Hamiltonian and predict energies of supported Pdn clusters of any structure. Low energy stable and metastable structures are identified using a Metropolis Monte Carlo-based genetic algorithm in the canonical ensemble at 300 K. We observe that supported single atoms sinter to form bilayer clusters and large cluster isomers share similarities in both shape and energy, and elucidate the significance of the support and microstructure on cluster stability. We discovered a simple surrogate structure-energy model, where the energy per atom scales with the square root of the average first coordination number, which can be used to estimate energies and compare the stability of clusters. Our framework, applicable to any metal/support system, fills an important methodological gap to predict the stability of supported metal catalysts in the subnanometer regime.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Andes Data Analysis System at the Oak Ridge Leadership Computing Facility

Andes is a (704)-node commodity-type Linux® cluster. Each of Andes’s 704 nodes contain two 16-core 3.0 GHz AMD EPYC 7302 processors with AMD’s Simultaneous Multithreading (SMT) Technology and 256GB of main memory. Andes also has nine large memory GPU nodes. These nodes each have 1TB of main memory and two NVIDIA K80 GPUs with two 14-core 2.30 GHz Intel Xeon processors with HT Technology.

AMD EPYC↗

On the clustering of multidimensional pictorial data

Obvious approaches to reducing the cost (in computer resources) of applying current clustering techniques to the problem of remote sensing are discussed. The use of spatial information in finding fields and in classifying mixture pixels is examined, and the AMOEBA clustering program is described. Internally, a pattern recognition program, from without, AMOEBA appears to be an unsupervised clustering program. It is fast and automatic. No choices (such as arbitrary thresholds to set split/combine sequences) need be made. The problem of finding the number of clusters is solved automatically. At the conclusion of the program, all points in the scene are classified; however, a provision is included for a reject classification of some points which, within the theoretical framework, cannot rationally be assigned to any cluster.

Bryant, J. D.↗

Exploiting a Shortcoming of Coupled-Cluster Theory: The Extent of Non-Hermiticity as a Diagnostic Indicator of Computational Accuracy

The fundamental non-Hermitian nature of the forms of the coupled-cluster (CC) theory widely used in quantum chemistry has usually been viewed as a negative, but the present paper shows how this can be used to an advantage. Specifically, the non-symmetric nature of the reduced one-particle density matrix (in the molecular orbital basis) is advocated as a diagnostic indicator of computational quality. In the limit of the full coupled-cluster theory [which is equivalent to full configuration interaction (FCI)], the electronic wave function and correlation energy are exact within a given one-particle basis set, and the symmetric character of the exact density matrix is recovered. The extent of the density matrix asymmetry is shown to provide a measure of “how difficult the problem is” (like the well-known T 1 diagnostic), but its variation with the level of theory also gives information about “how well this particular method works”, irrespective of the difficulty of the problem at hand. The proposed diagnostic is described and applied to a select group of small molecules, and an example of its overall utility for the practicing quantum chemist is illustrated through its application to the beryllium dimer (Be 2 ). Future application of this idea to excited states, open-shell systems, and symmetry-breaking problems and an extension of the method to the two-particle density are then proposed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Relativistic Effects From Coupled-Cluster Theory

We discuss the theory and computational challenges of the relativistic coupled-cluster methods. Example calculations of heavy-atom-containing molecules are then presented to demonstrate the importance of scalar-relativistic, spin-orbit coupling, and electron-correlation effects on molecular properties as well as the applicability and usefulness of relativistic coupled-cluster methods in calculations aiming at high-accuracy results. Here, a unique applicability of the spinor-based relativistic coupled-cluster methods is also highlighted using the calculations of open shell actinide-containing small molecules. As a result, a summary is given together with an outlook into future developments.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Computational ranking identifies Plexin-B2 in circulating tumor cell clustering with monocytes in breast cancer metastasis

Abstract Multicellular circulating tumor cell (CTC) clusters can be up to 50 times more efficient than single CTCs in mediating viable metastasis. Here, combining computational ranking and functional determination, we identify the transmembrane protein Plexin-B2 (PLXNB2) as one of the top molecular targets associated with unfavorable distant metastasis-free survival, showing enriched expression in CTC clusters versus single CTCs from patients with advanced breast cancer (mostly female). Loss of PLXNB2 (Plxnb2) reduces the formation of homotypic tumor cell clusters and heterotypic tumor-myeloid cell clusters, reducing spontaneous metastases in female mice bearing human (mouse) breast cancer. Interactions of PLXNB2 with its ligands SEMA4C on tumor cells and SEMA4A on myeloid cells (monocytes) promote homotypic and heterotypic CTC cluster formation, respectively, thereby driving lung metastasis. Global proteomic analysis reveals downstream effectors of the PLXNB2 pathway associated with tumor cell clustering. Thus, PLXNB2 is a therapeutic target for preventing new metastasis in breast cancer.

Science & Technology - Other Topics↗

Relativistic coupled‐cluster and equation‐of‐motion coupled‐cluster methods

Abstract The development of relativistic coupled‐cluster (CC) and equation‐of‐motion coupled‐cluster (EOM‐CC) methods is reviewed. An emphasis is placed on recent efforts to improve the computational efficiency of CC and EOM‐CC calculations with non‐perturbative treatments of spin‐orbit coupling (SO‐CC and EOM‐CC) by partially recovering spin symmetry in the formulations. Example calculations of electronic ground state as well as valence‐excited and core‐excited states for molecules containing heavy elements are presented to demonstrate the applicability and usefulness of the SO‐CC and EOM‐CC methods. Future directions for the development of the SO‐CC and EOM‐CC methods are also discussed. This article is categorized under: Electronic Structure Theory > Ab Initio Electronic Structure Methods

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An experimental and computational view of the photoionization of diol–water clusters

In the interstellar medium, diols and other prebiotic molecules adsorb onto icy mantles surrounding dust grains. Water in the ice may affect the reactivity and photoionization of these diols. Ethylene glycol (EG), 1,2-propylene glycol, and 1,3-propylene glycol clusters with water clusters were used as a proxy to study these interactions. The diol–water clusters were generated in a continuous supersonic molecular beam, photoionized by synchrotron-based vacuum ultraviolet light from the Advanced Light Source, and subsequently detected by reflectron time-of-flight mass spectrometry. The appearance energies for the detected clusters were determined from the mass spectra, collected at increasing photon energy. Clusters of both diol fragments and unfragmented diols with water were detected. The lowest energy geometry optimized conformers for the observed EG–water clusters and EG fragment–water clusters have been visualized using density functional theory (DFT), providing insight into hydrogen bonding networks and how these affect fragmentation and appearance energy. As the number of water molecules clustered around EG fragments (m/z 31 and 32) increased, the appearance energy for the cluster decreased, indicating a stabilization by water. This trend was supported by DFT calculations. Fragment clusters from 1,2-propylene glycol exhibited a similar trend, but with a smaller energy decrease, and no trend was observed from 1,3-propylene glycol. In conclusion, we discuss and suggest that the reactivity and photoionization of diols in the presence of water depend on the size of the diol, the location of the hydroxyl group, and the number of waters clustered around the diol.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Computer program documentation: ISOCLS iterative self-organizing clustering program, program C094

The author has identified the following significant results. This program implements an algorithm which, ideally, sorts a given set of multivariate data points into similar groups or clusters. The program is intended for use in the evaluation of multispectral scanner data; however, the algorithm could be used for other data types as well. The user may specify a set of initial estimated cluster means to begin the procedure, or he may begin with the assumption that all the data belongs to one cluster. The procedure is initiatized by assigning each data point to the nearest (in absolute distance) cluster mean. If no initial cluster means were input, all of the data is assigned to cluster 1. The means and standard deviations are calculated for each cluster.

Minter, R. T.↗

Understanding the Scalability of Bayesian Network Inference using Clique Tree Growth Curves

Bayesian networks (BNs) are used to represent and efficiently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to perform computation in BNs is clique tree clustering and propagation. In this approach, BN computation consists of propagation in a clique tree compiled from a Bayesian network. There is a lack of understanding of how clique tree computation time, and BN computation time in more general, depends on variations in BN size and structure. On the one hand, complexity results tell us that many interesting BN queries are NP-hard or worse to answer, and it is not hard to find application BNs where the clique tree approach in practice cannot be used. On the other hand, it is well-known that tree-structured BNs can be used to answer probabilistic queries in polynomial time. In this article, we develop an approach to characterizing clique tree growth as a function of parameters that can be computed in polynomial time from BNs, specifically: (i) the ratio of the number of a BN's non-root nodes to the number of root nodes, or (ii) the expected number of moral edges in their moral graphs. Our approach is based on combining analytical and experimental results. Analytically, we partition the set of cliques in a clique tree into different sets, and introduce a growth curve for each set. For the special case of bipartite BNs, we consequently have two growth curves, a mixed clique growth curve and a root clique growth curve. In experiments, we systematically increase the degree of the root nodes in bipartite Bayesian networks, and find that root clique growth is well-approximated by Gompertz growth curves. It is believed that this research improves the understanding of the scaling behavior of clique tree clustering, provides a foundation for benchmarking and developing improved BN inference and machine learning algorithms, and presents an aid for analytical trade-off studies of clique tree clustering using growth curves.

Mengshoel, Ole Jakob↗

Spatially Resolved Mapping of Three-Dimensional Molecular Orientations with ~2 nm Spatial Resolution through Tip-Enhanced Raman Scattering

We record local optical field images of silver nanocubes (75 nm) using tip-enhanced Raman (TER) spectral imaging. The images that we observe are consistent with several recent reports from our group, but here, we demonstrate sub-2 nm spatial resolution in local optical field nanoimaging under ambient laboratory conditions. This is achieved by scanning the substrate (nanocube on Si) relative to a 4-thiobenzonitrile (TBN)-functionalized Ag-coated TER probe. The spatial resolution that we obtain necessitates that only a few molecules govern the recorded optical response; molecular orientation becomes an important consideration in such measurements. We model the orientation through geometry optimization of a TBN molecule chemisorbed onto an Ag79 cluster (sphere with a ~1 nm diameter). Using the computed orientation of the cluster-bound molecule, we then model the optical response using formalism that accounts for the orientation of the molecule relative to vector components of the local optical fields. We find optimal agreement between experiment and theory. In effect, this work reveals the parallels between single-molecule Raman scattering and high-spatial-resolution TER spectroscopy, even when the images themselves cannot be used to visualize a single molecule in real space.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Proper orthogonal descriptors for efficient and accurate interatomic potentials

Here, we present the proper orthogonal descriptors for efficient and accuracy representation of the potential energy surface. The potential energy surface is represented as a many-body expansion of parametrized potentials in which the potentials are functions of atom positions and parameters. The proper orthogonal decomposition is employed to decompose the parametrized potentials into a set of proper orthogonal descriptors (PODs). Because of the rapid convergence of the proper orthogonal decomposition, relevant snapshots can be sampled exhaustively to represent the atomic neighborhood environment accurately with a small number of descriptors. The proper orthogonal descriptors are used to develop interatomic potentials by using a linear expansion of the descriptors and determining the expansion coefficients from a weighted least-squares regression against a density functional theory (DFT) training set. We present a comprehensive evaluation of the POD potentials on previously published DFT data sets comprising Li, Mo, Cu, Ni, Si, Ge, and Ta elements. The data sets represent a diverse pool of metals, transition metals, and semiconductors. The accuracy of the POD potentials are comparable to that of state-of-the-art machine learning potentials such as the spectral neighbor analysis potential (SNAP) and the atomic cluster expansion (ACE).

97 MATHEMATICS AND COMPUTING↗