Search NASA⌕ Search

SEARCH · Search NASA

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 451 records · Page 25

Investigating the crust of neutron stars with neural-network quantum states

An accurate description of low-density nuclear matter is crucial for explaining the physics of neutron star crusts. In the density range between approximately 0.01 fm −3 and 0.1 fm −3 , matter transitions from neutron-rich nuclei to various higher-density pasta shapes, before ultimately reaching a uniform liquid. In this work, we introduce a variational Monte Carlo method based on a neural Pfaffian-Jastrow quantum state, which allows us to model the transition from the liquid phase to neutron-rich nuclei microscopically. At low densities, nuclear clusters dynamically emerge from the microscopic interactions among protons and neutrons, which we model based on pionless effective field theory. Our variational Monte Carlo approach represents a significant improvement over the state-of-the-art auxiliary-field diffusion Monte Carlo method, which is severely hindered by the fermion-sign problem in this low-density regime and cannot capture the onset of clusters. In addition to computing the energy per particle of symmetric nuclear matter and pure neutron matter, we analyze an intermediate isospin-asymmetry configuration to elucidate the formation of nuclear clusters. We also provide evidence that the presence of such nuclear clusters influences the amount of protons in the crust compared to protons in beta-equilibrated, neutrino-transparent matter.

Nuclear astrophysics↗

Performance portable ice-sheet modeling with MALI

High-resolution simulations of polar ice sheets play a crucial role in the ongoing effort to develop more accurate and reliable Earth system models for probabilistic sea-level projections. These simulations often require a massive amount of memory and computation from large supercomputing clusters to provide sufficient accuracy and resolution; therefore, it has become essential to ensure performance on these platforms. Many of today’s supercomputers contain a diverse set of computing architectures and require specific programming interfaces in order to obtain optimal efficiency. In an effort to avoid architecture-specific programming and maintain productivity across platforms, the ice-sheet modeling code known as MPAS-Albany Land Ice (MALI) uses high-level abstractions to integrate Trilinos libraries and the Kokkos programming model for performance portable code across a variety of different architectures. In this article, we analyze the performance portable features of MALI via a performance analysis on current CPU-based and GPU-based supercomputers. The analysis highlights not only the performance portable improvements made in finite element assembly and multigrid preconditioning within MALI with speedups between 1.26 and 1.82x across CPU and GPU architectures but also identifies the need to further improve performance in software coupling and preconditioning on GPUs. We perform a weak scalability study and show that simulations on GPU-based machines perform 1.24–1.92x faster when utilizing the GPUs. The best performance is found in finite element assembly, which achieved a speedup of up to 8.65x and a weak scaling efficiency of 82.6% with GPUs. We additionally describe an automated performance testing framework developed for this code base using a changepoint detection method. The framework is used to make actionable decisions about performance within MALI. We provide several concrete examples of scenarios in which the framework has identified performance regressions, improvements, and algorithm differences over the course of 2 years of development.

54 ENVIRONMENTAL SCIENCES↗

Quantum-Size Dependence of the Energy for Vacancy Formation in Charged Small Metal Clusters. Drop Model

Self-consistent computations of the monovacancy formation energy are performed for Na{sub N}, Mg{sub N}, and Al{sub N} (12 < N ≤ 168) spherical clusters in the drop model for stable jelly. Scenarios of the Schottky vacancy formation and “bubble vacancy blowing” are considered. It is shown that the asymptotic behavior of the size dependences of the energy for the vacancy formation by these two mechanisms is different and the difference between the characteristics of a charged and neutral cluster is entirely determined by the difference between the ionization potentials of clusters and the energies of electron attachment to them.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Peroxyacetyl radical: Electronic excitation energies, fundamental vibrational frequencies, and symmetry breaking in the first excited state

Peroxyacetyl radical [CH{sub 3}C(O)O{sub 2}] is among the most abundant peroxy radicals in the atmosphere and is involved in OH-radical recycling along with peroxyacetyl nitrate formation. Herein, the ground (X{sup ~}) and first (A{sup ~}) excited state surfaces of cis and trans peroxyacetyl radical are characterized using high-level ab initio methods. Geometries, anharmonic vibrational frequencies, and adiabatic excitation energies extrapolated to the complete basis-set limit are reported from computations with coupled-cluster theory. Excitation of the trans conformer is found to induce a symmetry-breaking conformational change due to second-order Jahn-Teller interactions with higher-lying excited states. Additional benchmark computations are provided to aid future theoretical work on peroxy radicals.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Ultra-fast computation of electronic spectra for large systems by tight-binding based simplified Tamm-Dancoff approximation (sTDA-xTB)

The computational bottleneck of the extremely fast simplified Tamm-Dancoff approximated (sTDA) time-dependent density functional theory procedure [S. Grimme, J. Chem. Phys. 138, 244104 (2013)] for the computation of electronic spectra for large systems is the determination of the ground state Kohn-Sham orbitals and eigenvalues. This limits such treatments to single structures with a few hundred atoms and hence, e.g., sampling along molecular dynamics trajectories for flexible systems or the calculation of chromophore aggregates is often not possible. The aim of this work is to solve this problem by a specifically designed semi-empirical tight binding (TB) procedure similar to the well established self-consistent-charge density functional TB scheme. The new special purpose method provides orbitals and orbital energies of hybrid density functional character for a subsequent and basically unmodified sTDA procedure. Compared to many previous semi-empirical excited state methods, an advantage of the ansatz is that a general eigenvalue problem in a non-orthogonal, extended atomic orbital basis is solved and therefore correct occupied/virtual orbital energy splittings as well as Rydberg levels are obtained. A key idea for the success of the new model is that the determination of atomic charges (describing an effective electron-electron interaction) and the one-particle spectrum is decoupled and treated by two differently parametrized Hamiltonians/basis sets. The three-diagonalization-step composite procedure can routinely compute broad range electronic spectra (0-8 eV) within minutes of computation time for systems composed of 500-1000 atoms with an accuracy typical of standard time-dependent density functional theory (0.3-0.5 eV average error). An easily extendable parametrization based on coupled-cluster and density functional computed reference data for the elements H–Zn including transition metals is described. The accuracy of the method termed sTDA-xTB is first benchmarked for vertical excitation energies of open- and closed-shell systems in comparison to other semi-empirical methods and applied to exemplary problems in electronic spectroscopy. As side products of the development, a robust and efficient valence electron TB method for the accurate determination of atomic charges as well as a more accurate calculation scheme of dipole rotatory strengths within the Tamm-Dancoff approximation is proposed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Photoelectron Spectroscopy and Computational Study on Microsolvated [B 10 H 10 ] 2– Clusters and Comparisons to Their [B 12 H 12 ] 2– Analogues

Microhydrated closo-Boranes have attracted great interests due to their superchaotropic activity related to well-known Hofmeister effect and important applications in biomedical and battery fields. In this work, we report a combined negative ion photoelectron spectroscopy and quantum chemical investigation on hydrated closo-decaborate clusters [B 10 H 10 ] 2- ·nH 2 O (n = 1 – 7) with a direct comparison to their analogues [B 12 H 12 ] 2- ·nH 2 O and free water clusters. A single H 2 O molecule is found sufficient to stabilize the intrinsically unstable [B 10 H 10 ] 2- dianion. The first two water molecules strongly interact with the solute forming B-H···H-O dihydrogen bonds while additional water molecules show substantially reduced binding energies. Unlike [B 12 H 12 ] 2- ·nH 2 O possessing highly structured water network with the attached H 2 O molecules arranged in a unified pattern by maximizing B-H···H-O dihydrogen bonding, distinct structural arrangements of the water clusters within [B 10 H 10 ] 2– ·nH 2 O are achieved with the water cluster networks from trimer to heptamer resembling free water clusters. Such a distinct difference arises from the variations in size, symmetry, and charge distributions between these two dianions. Finally, the present finding again confirms the structural diversity of hydrogen-bonding networks in microhydrated closo-boranes and enrich our understanding of aqueous borate chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Microcarbonation of Naphthalene: An Experimental and Computational Study of Photoionization in Naphthalene-Carbon Dioxide Clusters

The photoionization of naphthalene (N)-carbon dioxide (CO 2 ) clusters was studied using tunable vacuum ultraviolet (VUV) radiation from a synchrotron in the photon range of 8.0 to 13.7 eV, in combination with time-of-flight mass spectrometry. Clusters of monomer, dimer, and trimer naphthalene with CO 2 (N­(CO 2 ) 0–6 , N 2 ­(CO 2 ) 0–3 , N3) were observed. The lowest-energy conformers were obtained via a conformer search, followed by geometry optimizations at the ωB97X-V2/aug-cc-pVTZ (monomer) and ωB97X-V2/aug-cc-pVDZ (dimer) levels of theory. Carbon dioxide was found to preferentially cluster on top of the naphthalene molecule (in an out-of-plane configuration). From the mass spectra, photoionization intensity curves (PICs) were constructed, and appearance energies (AEs) were determined. No substantial trend in AE was observed with increasing size of the naphthalene-carbon dioxide clusters; rather, AE oscillations around the value for pure naphthalene were observed. These AE oscillations are also observed in a recently studied naphthalene-water cluster system, though in this system a slight downward trend in AE for pure naphthalene clusters (N1/2/3/4) was observed. The differences between the two systems are attributed to differing interaction strengths. In conclusion, understanding these differences may aid in determining how photoprocessing can proceed differently depending on the dominant matrix component in interstellar ices.

Wannenmacher, Anna [Lawrence Berkeley National Lab↗

A Multi-Armed Bayesian Ordinal Outcome Utility-Based Sequential Trial with a Pairwise Null Clustering Prior

A multi-armed trial based on ordinal outcomes is proposed that leverages a flexible non-proportional odds cumulative logit model and numerical utility scores for each outcome to determine treatment optimality. This trial design uses a Bayesian clustering prior on the treatment effects that encourages the pairwise null hypothesis of no differences between treatments. A group sequential design is proposed to determine which treatments are clinically different with an adaptive decision boundary that becomes more aggressive as the sample size or clinical significance grows, or the number of active treatments decreases. A simulation study is conducted for 3 and 5 treatment arms, which shows that the design has superior operating characteristics (family wise error rate, generalized power, average sample size) compared to utility designs that do not allow clustering, a frequentist proportional odds model, or a permutation test based on empirical mean utilities.

97 MATHEMATICS AND COMPUTING↗

Streaming Matching and Edge Cover in Practice

Graph algorithms with polynomial space and time requirements often become infeasible for massive graphs with billions of edges or more. State-of-the-art approaches therefore employ approximate serial, parallel, and distributed algorithms to tackle these challenges. However, such approaches require storing the entire graph in memory and thus need access to costly computing resources such as clusters and supercomputers. In this paper, we present practical streaming approaches for solving massive graph problems using limited memory for two prototypical graph problems: maximum weighted matching and minimum weighted edge cover. For matching, we conduct a thorough computational study on two of the semi-streaming algorithms including a recent breakthrough result that achieves a $1/(2+\varepsilon)$-approximation of the weight while using $O( n \log W /\epsilon)$ memory (here $n$ is the number of vertices and $W$ is the maximum edge weight), designed by Paz and Schwartzman [SODA, 2017]. Empirically, we show that the semi-streaming algorithms produce matchings whose weight is close to the best $1/2$-approximate offline algorithm while requiring less time and an order-of-magnitude less memory. For minimum weighted edge cover, we develop three novel semi-streaming algorithms. Two of these algorithms require a single pass through the input graph, require $O(n \log n)$ memory, and provide a 2-approximation guarantee on the objective. We also leverage a relationship between approximate maximum weighted matching and approximate minimum weighted edge cover to develop a two-pass $3/2+\epsilon$-approximate algorithm with the memory requirement of Paz and Schwartzman's semi-streaming matching algorithm. These streaming approaches are compared against the state-of-the-art 3/2-approximate offline algorithm. The semi-streaming matching and the novel edge cover algorithms proposed in this paper can process graphs with several billions of edges in under 30 minutes using 6 GB of memory, which is at least an order of magnitude improvement from the offline (non-streaming) algorithms. For the largest graph, the best alternative offline parallel approximation algorithm (GPA+ROMA) could not finish in three hours even while employing hundreds of processors and 1 TB of memory. We also demonstrate an application of the semi-streaming algorithm by computing a matching using linearly bounded memory on item intersection graphs derived from three machine learning datasets, whereas the existing offline algorithms could not complete on one of these datasets since their memory requirements exceeded 1TB.

Ferdous, S M.↗

Compiling on Linux Clusters

This is a presentation for LANL's Parallel Computing Summer Research Internship that describes the process of compiling Linux clusters.

97 MATHEMATICS AND COMPUTING↗

A Generic Advanced Computing Framework for Executing Windows-based Dynamic Contingency Analysis Tool in Parallel on Cluster Machines

Dynamic contingency analysis tool (DCAT) has been developed to assess the impact and likelihood of extreme contingencies and potential cascading events across their systems and interconnections. By including more customized protection models and corrective actions into the Windows-based commercial tools, DCAT can help operators understand the cascading behavior and find mitigation approaches to reduce the risk of cascading outages in a more realistic manner. In order to further enhance the capability of DCAT, this paper presents a design of an advanced computing framework that enables DCAT to run on a cluster machine to improve its computational performance. This framework is generic and can be applied to other Windows-based simulation tools to fill the technical gap of applying advanced computing technology to vendors' Windows-based tools. The preliminary tests using medium to large power systems have shown the effectiveness of this framework and its potential for accelerating the adoption of advanced computing in utilities.

Advanced computing, dynamic contingency analysis, ↗

Community detection in hypergraphs via mutual information maximization

Abstract The hypergraph community detection problem seeks to identify groups of related vertices in hypergraph data. We propose an information-theoretic hypergraph community detection algorithm which compresses the observed data in terms of community labels and community-edge intersections. This algorithm can also be viewed as maximum-likelihood inference in a degree-corrected microcanonical stochastic blockmodel. We perform the compression/inference step via simulated annealing. Unlike several recent algorithms based on canonical models, our microcanonical algorithm does not require inference of statistical parameters such as vertex degrees or pairwise group connection rates. Through synthetic experiments, we find that our algorithm succeeds down to recently-conjectured thresholds for sparse random hypergraphs. We also find competitive performance in cluster recovery tasks on several hypergraph data sets.

97 MATHEMATICS AND COMPUTING↗

Dark Energy Survey Year 1 Results: Cross-Correlation Redshifts in the DES -- Calibration of the Weak Lensing Source Redshift Distributions

We present the calibration of the Dark Energy Survey Year 1 (DES Y1) weak lensing source galaxy redshift distributions from clustering measurements. By cross-correlating the positions of source galaxies with luminous red galaxies selected by the redMaGiC algorithm we measure the redshift distributions of the source galaxies as placed into different tomographic bins. These measurements constrain any such shifts to an accuracy of $\sim0.02$ and can be computed even when the clustering measurements do not span the full redshift range. The highest-redshift source bin is not constrained by the clustering measurements because of the minimal redshift overlap with the redMaGiC galaxies. We compare our constraints with those obtained from $\texttt{COSMOS}$ 30-band photometry and find that our two very different methods produce consistent constraints.

79 ASTRONOMY AND ASTROPHYSICS↗

Adaptive Conformer Sampling for Property Prediction Using the Conductor-like Screening Model for Real Solvents

The valorization of lignocellulose-derived bioproducts requires effective separation from excessive water. Liquid–liquid extraction is a promising low-energy separation technology, but effective extraction requires solvent selection based on the thermodynamic properties of the bioproduct and solvent components. We propose a computational framework for predicting such properties by developing an adaptive conformer selection approach for use with COSMO-RS (conductor-like screening model for real solvents) calculations. In this framework, molecular dynamics simulations are used to generate many molecular structures (conformers) at representative temperatures in varying solvent environments. Conformers are then clustered based on structural metrics in a low-dimensional space and selected using a mixed-integer quadratic programming problem to iteratively insert a sampled conformer. At each iteration, we determine bioproduct properties using COSMO-RS. Here, we demonstrate the capability of the proposed framework on representative bioproducts to show convergence of the adaptive sampling toward experimentally measured properties with fewer calculations than required by random conformer sampling, enabling the improved screening of solvent systems for liquid-phase separation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum Chemistry via Walks in Determinant Space

There are many chemical questions of practical interest to the DOE that could be answered if there were an electronic structure method that provided consistently accurate results for all systems at an affordable computational cost. The coupled cluster method with single, double and perturbative triple excitations (CCSD(T)) is the most frequently used high-order method, but it has known deficiencies, e.g., in the description of stretched bonds. The full configuration interaction (FCI) method is the most robust method for treating electronic correlations, but it is little used because its computational cost scales exponentially in the size of the system. The largest calculation that has been done to date employed 10 billion determinants. In this regard, there was a major advance in 2010. The Alavi group at Cambridge University developed a stochastic approach to FCI --- combining it with ideas from quantum Monte Carlo (QMC) --- called FCIQMC, that allows one to go to a far larger number of determinants in certain circumstances. The computational cost is exponential in the system and basis size but with a much reduced exponent compared to conventional FCI. In this project Umrigar's group made several major improvements to the FCIQMC method that increased its efficiency by many orders of magnitude. In addition this project resulted in a cross-fertilization of ideas between the FCIQMC method, the older phaseless auxilliary-field quantum Monte Carlo (AFQMC) method developed by Zhang and Krakauer (two of the PI's of this project), and symmetry-restored wavefunctions developed by Scuseria (also a PI of this project).

36 MATERIALS SCIENCE↗

Structure of overheated metal clusters: MD simulation study

The structure of overheated metal clusters appeared in condensation process was studied by computer simulation techniques. It was found that clusters with size larger than several tens of atoms have three layers: core part, intermediate dense packing layer and a gas- like shell with low density. The change of the size and structure of these layers with the variation of internal energy and the size of cluster is discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The hyperfine structure in the rotational spectra of D{sub 2}{sup 17}O and HD{sup 17}O: Confirmation of the absolute nuclear magnetic shielding scale for oxygen

Guided by theoretical predictions, the hyperfine structures of the rotational spectra of mono- and bideuterated-water containing {sup 17}O have been experimentally investigated. To reach sub-Doppler resolution, required to resolve the hyperfine structure due to deuterium quadrupole coupling as well as to spin-rotation (SR) and dipolar spin-spin couplings, the Lamb-dip technique has been employed. The experimental investigation and in particular, the spectral analysis have been supported by high-level quantum-chemical computations employing coupled-cluster techniques and, for the first time, a complete experimental determination of the hyperfine parameters involved was possible. The experimentally determined {sup 17}O spin-rotation constants of D{sub 2}{sup 17}O and HD{sup 17}O were used to derive the paramagnetic part of the corresponding nuclear magnetic shielding constants. Together with the computed diamagnetic contributions as well as the vibrational and temperature corrections, the latter constants have been employed to confirm the oxygen nuclear magnetic shielding scale, recently established on the basis of spin-rotation data for H{sub 2}{sup 17}O [Puzzarini et al., J. Chem. Phys. 131, 234304 (2009)].

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗