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 811 records · Page 45

Spin-singlet topological superconductivity in the attractive Rashba-Hubbard model

Fully gapped, spin-singlet superconductors with antisymmetric spin-orbit coupling in a Zeeman magnetic field provide a promising route to realize superconducting states with non-Abelian topological order and therefore fault-tolerant quantum computation. Here we use a quantum Monte Carlo dynamical cluster approximation to study the superconducting properties of a doped two-dimensional attractive Hubbard model with Rashba spin-orbit coupling in a Zeeman magnetic field. We generally find that the Rashba coupling has a beneficial effect towards s-wave superconductivity. In the presence of a finite Zeeman field, when superconductivity is suppressed by Pauli pair breaking, the Rashba coupling counteracts the spin imbalance created by the Zeeman field by mixing the spins, and thus restores superconductivity at finite temperatures. Further, we show that this favorable effect of the spin-orbit coupling is traced to a spin-flip driven enhancement of the amplitude for the propagation of a pair of electrons in time-reversed states. Moreover, by inspecting the Fermi surface of the interacting model, we show that for sufficiently large Rashba coupling and Zeeman field, the superconducting state is expected to be topologically nontrivial.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Machine learning at the Spallation Neutron Source accelerator and target

We describe the ongoing efforts to apply Machine Learning techniques to improve the performance of our accelerator and target. Specially, we are looking to minimize halo beam losses in the absence of a proper physics model, automatically detect and log anomalies in the target support systems such as cooling, and detect and prevent errant beam pulses in the linac. We also describe the infrastructure we use to acquire and stream data to the GPU cluster for training, our code development cycle, and edge computing for model inference. To minimize halo beam losses, we use a Reinforcement Learning technique tested on a virtual accelerator. The target anomaly detection is trained on archived data using incomplete physics models and is made part of the existing target reporting system. The errant beam prevention analyzes beam current and beam phase waveforms as well as accelerator configuration data to predict errant pulses. We also develop continual learning to adapt to changes in the accelerator.

Accelerator Physics↗

The Generalized Green’s function Cluster Expansion: A Python package for simulating polarons

We present an efficient implementation of the Generalized Green’s function Cluster Expansion (GGCE), which is a new method for computing the ground-state properties and dynamics of polarons (single electrons coupled to lattice vibrations) in model electron-phonon systems. The GGCE works at arbitrary temperature and is well suited for a variety of electron-phonon couplings, including, but not limited to, site and bond Holstein and Peierls (Su-SchriefferHeeger) couplings, and couplings to multiple phonon modes with different energy scales and coupling strengths. Quick calculations can be performed efficiently on a laptop using solvers from NumPy and SciPy, or in parallel at scale using the PETSc sparse linear solver engine.

36 MATERIALS SCIENCE↗

The estimation of masses of individual galaxies in clusters of galaxies.

Three different methods of estimating masses are discussed. The 'density method' is based on the analysis of the density distribution of galaxies around the object whose mass is to be found. The 'bound-galaxy method' gives estimates of the mass of a double, triple, or quadruple system from analysis of the orbital motion of the components. The 'virial method' utilizes the formulas derived for the second method to obtain estimates of the virial-theorem masses of whole clusters, and thus to obtain upper limits on the mass of an individual galaxy in a cluster. The analytic formulas are developed and compared with computer experiments, and some applications are given.

Wolf, R. A.↗

Theoretical studies of the electronic structure of small metal clusters

Theoretical studies of the electronic structure of metal clusters, in particular clusters of Group IIA and IIB atoms were conducted. Early in the project it became clear that electron correlation involving d orbitals plays a more important role in the binding of these clusters than had been previously anticipated. This necessitated that computer codes for calculating two electron integrals and for constructing the resulting CI Hamiltonions be replaced with newer, more efficient procedures. Program modification, interfacing and testing were performed. Results of both plans are reported.

Jordan, K. D.↗

Strake-generated vortex interactions for a fighter-like configuration

A combination of the Euler, and thin-layer Navier-Stokes equations were solved for the flowfield around a wing-strake-fuselage configuration similar to the F-16A aircraft. The flowfield was divided into multiple blocks using a zoning program, and the TNSWF solution program, based on an implicit solution algorithm, updates each subregion of the flowfield sequentially. The total grid contained approximately 300,000 grid points, and clustering was effected normal to all aircraft surfaces. The computed solutions agreed well quantitatively with wind-tunnel pressure distribution data, and they agreed well qualitatively with flow visualization from wind- and water-tunnel tests.

Reznick, Steven G.↗

Simulation of transonic viscous flow over a fighter-like configuration including inlet

The simulation of transonic viscous flow over a modified F-16A including inlet is presented. A zonal approach is utilized which allows appropriate clustering suitable for viscous calculations on all solid surfaces. Computational efficiency is enhanced by solving the thin-layer Navier-Stokes equations in viscous zones adjacent to the aircraft and the Euler equations on those coarse zones away from the aircraft. The flow conditions for this transonic case are freestream Mach number of 0.9, angle of attack of 4.12 deg, and a Reynolds number (based on root chord) of 4.5 million. A total of 19 zones are utilized yielding a total of 350,000 grid points. This case required about 3000 iterations to reduce the residual by three orders, which takes about 10 hr of CPU time on the Cray X-MP/48 computer. Pressure distributions on the wing and on cross sections through the inlet region compare favorably with the experimental data for this transonic case.

Flores, Jolen↗

The morphology of star clusters in the SMC

The projected ellipticities of 34 populous SMC star clusters have been derived by means of PDS 1010A scans and a computer interactive method of reduction implemented on an Apollo 570 workstation. A pair of J and R plates taken with the 1.2 m UK Schmidt telescope in Australia were used. Radial ellipticity variations within individual globular clusters seem to be a common phenomenon for the SMC clusters, similar to that observed in the LMC clusters where the innerparts are more elliptical than the outer ones in 95 percent of the cases. The derived ellipticities which correspond to the innermost part of the cluster at radial distances near to half-mass radii have been found to be statistically more elliptical than those of the LMC, known to be more elliptical than those of the Galaxy. The dynamical masses of the clusters seem to correlate with ellipticities supporting the hypothesis that, either the gravitational field of the parent galaxy being a dominant factor affect slower the shape of the high mass clusters and/or the most massive clusters, being dynamically younger, retain their original shape.

Kontizas, E.↗

Shared Memory Parallelization of an Implicit ADI-type CFD Code

A parallelization study designed for ADI-type algorithms is presented using the OpenMP specification for shared-memory multiprocessor programming. Details of optimizations specifically addressed to cache-based computer architectures are described and performance measurements for the single and multiprocessor implementation are summarized. The paper demonstrates that optimization of memory access on a cache-based computer architecture controls the performance of the computational algorithm. A hybrid MPI/OpenMP approach is proposed for clusters of shared memory machines to further enhance the parallel performance. The method is applied to develop a new LES/DNS code, named LESTool. A preliminary DNS calculation of a fully developed channel flow at a Reynolds number of 180, Re(sub tau) = 180, has shown good agreement with existing data.

Hauser, Th.↗

Comprehensive T-Matrix Reference Database: A 2007-2009 Update

The T-matrix method is among the most versatile, efficient, and widely used theoretical techniques for the numerically exact computation of electromagnetic scattering by homogeneous and composite particles, clusters of particles, discrete random media, and particles in the vicinity of an interface separating two half-spaces with different refractive indices. This paper presents an update to the comprehensive database of T-matrix publications compiled by us previously and includes the publications that appeared since 2007. It also lists several earlier publications not included in the original database.

Mishchenko, Michael I.↗

A Scalable Parallel Hypergraph Generator (HyGen)

Graphs are extensively used to model real-world complex systems. An edge in a graph can model pairwise relationships. However, multiway relationships (connections between three or more vertices) are common in many complex systems such as cellular process, image segmentation, and circuit design. A graph edge cannot model multiway relationships. A hypergraph, which can connect more than two vertices, is thus a better option to model multiway relationships. A large-scale hypergraph analysis has the potential to find useful insights from a complex system and assist in knowledge discovery. Currently a limited number of hypergraphs exists that are representative of real-world datasets. Moreover, real-world hypergraph datasets are small in size and inadequate to incorporate future needs. A graph generator that can produce large-scale synthetic hypergraphs can solve the above mentioned problems. In this paper, we present a scalable parallel hypergraph generator (HyGen) based on the Message Passing Interface (MPI) standard. To generate hypergraphs, HyGen takes the following parameter values as inputs: i) number of vertices, ii) number of hyperedges, iii) number of clusters, iv) vertex distribution, v) hyperedge distribution, vi) local cluster cardinality, and vii) global cluster cardinality. We have demonstrated that HyGen can generate hypergraphs of various sizes in a scalable fashion. HyGen takes approximately four minutes to generate a hypergraph with 4.8 million vertices, 1.6 million hyperedges, and 800 clusters using 1,024 processes on a leadership class computing platform. Our strong and weak scaling experiments on supercomputers demonstrate that HyGen can quickly create large-scale hypergraphs in a parallel manner, thus providing a useful capability for hypergraph analysis.

Hasan, S M Shamimul↗

A fuzzy clustering algorithm to detect planar and quadric shapes

In this paper, we introduce a new fuzzy clustering algorithm to detect an unknown number of planar and quadric shapes in noisy data. The proposed algorithm is computationally and implementationally simple, and it overcomes many of the drawbacks of the existing algorithms that have been proposed for similar tasks. Since the clustering is performed in the original image space, and since no features need to be computed, this approach is particularly suited for sparse data. The algorithm may also be used in pattern recognition applications.

Krishnapuram, Raghu↗

PVM Support for Clusters

The latest version of PVM (3.4.3) now contains support for a PC cluster running Linux, also known as a Beowulf system. A PVM user of a computer outside the Beowulf system can add the Beowulf as a single machine.

Beowulf PVM cluster interactive supercomputing↗

Strong Electronic and Magnetic Coupling in M 4 (M = Ni, Cu) Clusters via Direct Orbital Interactions between Low-Coordinate Metal Centers

In this report we present an extensive study of tetranuclear transition-metal cluster compounds M 4 (NP t Bu 3 ) 4 and [M 4 (NP t Bu 3 ) 4 ][B(C 6 F 5 ) 4 ] (M = Ni, Cu; t Bu = tert -butyl), which feature low-coordinate metal centers and direct metal-metal orbital overlap. X-ray diffraction, electrochemical, magnetic, spectroscopic, and computational analysis elucidate the nature of the bonding interactions in these clusters and the impact of these interactions on the electronic and magnetic properties. Direct orbital overlap results in strongly coupled, large-spin ground states in the [Ni 4 (NP t Bu 3 ) 4 ] +/0 clusters and fully delocalized, spin-correlated electrons. Correlated electronic structure calculations confirm the presence of ferromagnetic ground states that arise from direct exchange between magnetic orbitals, and, in the case of the neutral cluster, itinerant electron magnetism similar to that in metallic ferromagnets. The cationic nickel cluster also possesses large magnetic anisotropy exemplified by a large, positive axial zero-field splitting parameter of D = +7.95 or +9.2 cm -1 , as determined by magnetometry or electron paramagnetic resonance spectroscopy, respectively. The [Ni 4 (NP t Bu 3 ) 4 ] + cluster is also the first molecule with easy-plane magnetic anisotropy to exhibit zero-field slow magnetic relaxation, and under a small applied field, it exhibits relaxation exclusively through an Orbach mechanism with a spin relaxation barrier of 16 cm -1 . The S = 1 / 2 complex [Cu 4 (NP t Bu 3 ) 4 ] + exhibits slow magnetic relaxation via a Raman process on the millisecond time scale, supporting the presence of slow relaxation via an Orbach process in the nickel analogue. Overall, this work highlights the unique electronic and magnetic properties that can be realized in metal clusters featuring direct metal-metal orbital interactions between low-coordinate metal centers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A numerical investigation of a subsonic jet in a crossflow

The flowfield induced by a single, subsonic jet exhausting perpendicularly from a flat plate into a subsonic crossflow has been numerically investigated. The test case was chosen to match available experimental data where the jet Mach number was 0.78, and the freestream Mach number was 0.13. Time-averaged solutions were obtained using the thin-layer Navier-Stokes equations and two overlapping grids. The solutions were sensitive to the radial grid clustering near the edge of the jet and to the far-field boundary conditions. Experimental data comparisons were required to determine the most appropriate jet grid and satisfactory boundary conditions. Globally, the solutions converged in about 6000 iterations. The computational results accurately showed the deflected jet and associated contrarotating vortices. The fine clustered grid in the region upstream of the jet exit allowed the horseshoe vortex in the boundary layer near the jet exit to be captured. Most importantly for aircraft applications, the computed plate pressure distributions compared favorably with the experimental data over most of the surface. However, in the wake region immediately downstream of the jet exit, where there is extensive flow separation, some discrepancies with experimental data were observed. Two turbulence models were used in this study: (1) the zero-equation, two layer Baldwin-Lomax turbulence model; and (2) one-equation Baldwin-Barth turbulence model. The turbulence models gave results which generally compared no better with experimental data than the laminar computation results.

Chiu, Stephen H.↗

ConnectIt: a framework for static and incremental parallel graph connectivity algorithms

Connected components is a fundamental kernel in graph applications. The fastest existing multicore algorithms for solving graph connectivity are based on some form of edge sampling and/or linking and compressing trees. However, many combinations of these design choices have been left unexplored. In this paper, we design the ConnectIt framework, which provides different sampling strategies as well as various tree linking and compression schemes. ConnectIt enables us to obtain several hundred new variants of connectivity algorithms, most of which extend to computing spanning forest. In addition to static graphs, we also extend ConnectIt to support mixes of insertions and connectivity queries in the concurrent setting. We present an experimental evaluation of ConnectIt on a 72-core machine, which we believe is the most comprehensive evaluation of parallel connectivity algorithms to date. Compared to a collection of state-of-the-art static multicore algorithms, we obtain an average speedup of 12.4x (2.36x average speedup over the fastest existing implementation for each graph). Using ConnectIt, we are able to compute connectivity on the largest publicly-available graph (with over 3.5 billion vertices and 128 billion edges) in under 10 seconds using a 72-core machine, providing a 3.1x speedup over the fastest existing connectivity result for this graph, in any computational setting. For our incremental algorithms, we show that our algorithms can ingest graph updates at up to several billion edges per second. To guide the user in selecting the best variants in ConnectIt for different situations, we provide a detailed analysis of the different strategies. Finally, we show how the techniques in ConnectIt can be used to speed up two important graph applications: approximate minimum spanning forest and SCAN clustering.

Computer Science↗

Introducing the embedded random phase approximation: H 2 dissociative adsorption on Cu(111) as an exemplar

The random phase approximation (RPA) as a means of treating electron correlation recently has been shown to outperform standard density functional theory (DFT) approximations in a variety of cases. However, the computational cost of the RPA is substantially more than DFT, especially when aiming to study extended surfaces. Properly accounting for sufficient surface ensemble size, Brillouin zone sampling, and vacuum separation of periodic images in standard periodic-planewave-based DFT code raises the cost to achieve converged results. Here, we show that sub-system embedding schemes enable use of the RPA for modeling heterogeneous reactions at reduced computational cost. Further, we explore two different embedded RPA (emb-RPA) approaches, periodic emb-RPA and cluster emb-RPA. We use the (experimentally and theoretically) well-studied H 2 dissociative adsorption on Cu(111) as our exemplar, and first perform full periodic RPA calculations as a benchmark. The full RPA results match well the semi-empirical barrier fit to experimental observables and others derived from high-level computations, e.g., from recent embedded n-electron valence second order perturbation theory [Zhao et al., J. Chem. Theory Comput. 16(11), 7078–7088 (2020)] and quantum Monte Carlo [Doblhoff-Dier et al., J. Chem. Theory Comput. 13(7), 3208–3219 (2017)] simulations. Among the two emb-RPA approaches tested, the cluster emb-RPA accurately reproduces the energy profile (maximum error of 50 meV along the reaction pathway) while reducing the computational cost by approximately two orders of magnitude. We therefore expect that the embedded cluster approach will enable wider RPA implementation in heterogeneous catalysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Thorium Monosilicide, ThSi: An Experimental and Theoretical Study

The present theoretical and experimental combination study investigates the ThSi molecule in detail. Computationally, we utilized high-level multireference and coupled-cluster levels of theory conjoined with large correlation consistent basis sets to study a series of electronic and spin–orbit states of ThSi. Here, we report potential energy curves (PECs), electron configurations at equilibrium distances, spectroscopic constants, energetics, and spin–orbit coupling effects for 16 electronic states of ThSi. The studied 16 electronic states are arranged tightly within 0.9 eV, highlighting the complexity of the electronic spectrum of ThSi. The ground electronic state of ThSi is a single-reference 1 1 Σ + state that derives from the 1σ 2 2σ 2 1π 4 electronic configuration. The Ω = 0 + spin–orbit ground state of ThSi is composed of 1 1 Σ + (47%) and 13Π (44%) electronic states. Our measured bond energy (D0) of ThSi, obtained using resonant two-photon ionization (R2PI) spectroscopy is 3.146(4) eV, where the assigned error limit is given in parentheses in units of the last quoted digits. The computed D0 of ThSi (Ω = 0 + ) at the CBS-C-CCSD(T)-δT(Q)-δDK-δSO level (3.181 eV) is in good agreement with the experimental value. Our derived enthalpy of formation for ThSi, Δ f H 0K o (ThSi(g)), is 971.8(6.0) kJ/mol. Finally, we have performed density functional theory (DFT) calculations for ThSi(1 1 Σ + ) using 16 exchange correlation functionals that span multiple rungs of “Jacob’s ladder” of density functional approximation (DFA) to assess the DFT errors on D 0 , r e , and ω e of ThSi with respect to experimental and ab initio coupled-cluster values.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗