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 343 records · Page 19

Equation-of-motion internally contracted multireference unitary coupled-cluster theory

The accurate computation of excited states remains a challenge in electronic structure theory, especially for systems with a ground state that requires a multireference treatment. In this work, we introduce a novel equation-of-motion (EOM) extension of the internally contracted multireference unitary coupled-cluster framework (ic-MRUCC), termed EOM-ic-MRUCC. EOM-ic-MRUCC follows the transform-then-diagonalize approach, in analogy to its non-unitary counterpart. By employing a projective approach to optimize the ground state, the method retains additive separability and proper scaling with system size. We show that excitation energies are size-intensive if the EOM operator satisfies the “killer” and the projective conditions. Furthermore, we propose to represent changes in the reference state upon electron excitation via projected many-body operators that span the active orbitals and show that the EOM equations formulated in this way are invariant with respect to active orbital rotations. We test the EOM-ic-MRUCC method truncated to single and double excitations by computing the potential energy curves for several excited states of a BeH2 model system, the HF molecule, and water undergoing symmetric dissociation. Across these systems, our method delivers accurate excitation energies and potential energy curves within 5 mE h (∼0.14 eV) from full configuration interaction. Here, we find that truncating the Baker–Campbell–Hausdorff series to fourfold commutators contributes negligible errors (on the order of 10 −5 E h or less), offering a practical route to highly accurate excited-state calculations with reduced computational overhead.

74 ATOMIC AND MOLECULAR PHYSICS↗

FPDeep: Scalable Acceleration of CNN Training on Deeply-Pipelined FPGA Clusters

In this paper, we propose a framework called FPDeep, which uses a hybrid of model and layer paral- lelism to configure distributed reconfigurable clusters to train DNNs. This approach has numerous benefits. First, the design does not suffer from batch size growth. Second, novel workload and weight partitioning leads to balanced loads of both among nodes. And third, the entire system is fine-grained pipeline. This leads to high parallelism and utilization and also minimizes the time features need to be cached while waiting for back-propagation.

Wang, Tianqi↗

Toward the “platinum standard” of quantum chemistry on quantum computers: Perturbative quadruple corrections in unitary coupled cluster theory

We propose a non-iterative, post-hoc correction to the unitary coupled cluster theory with the single, double, and triple excitations (UCCSDT) Ansatz, which considers the leading-order effects of neglected quadruple excitations. We present two ways to derive this correction, henceforth referred to as [Q-6], which leads to an improvement in the correlation energy shown to be truncated to sixth-order in many-body perturbation theory. Furthermore, a comparison between the UCC-based [Q-6] correction proposed in this work and analogous, “platinum standard” quadruple corrections proposed in conventional coupled cluster theory recognizes that [Q-6] is distinct from prior corrections since it is constructed entirely from internally connected components. Although trotterized (t) and full operator variants of UCCSDT exhibit errors in scans of small molecule potential energy surfaces that routinely exceed 1.6 mH, we find that t/UCCSDT[Q-6] is, nevertheless, able to achieve chemical accuracy as measured by the mean unsigned error.

Correlation energy↗

Beyond Limber: efficient computation of angular power spectra for galaxy clustering and weak lensing

Angular two-point statistics of large-scale structure observables are important cosmological probes. To reach the high accuracy required by the statistical precision of future surveys, some of these statistics may need to be computed without the commonly employed Limber approximation; the exact computation however requires integration over Bessel functions, and a brute-force evaluation is slow to converge. Here, we present a new method based on our generalized FFTLog algorithm for the efficient computation of angular power spectra beyond the Limber approximation. The new method significantly simplifies the calculation and improves the numerical speed and stability. It is easily extended to handle integrals involving derivatives of Bessel functions, making it equally applicable to numerically more challenging cases such as contributions from redshift-space distortions and Doppler effects. We implement our method for galaxy clustering and galaxy-galaxy lensing power spectra. We find that using the Limber approximation for galaxy clustering in future analyses like LSST Year 1 and DES Year 6 may cause significant biases in cosmological parameters, indicating that going beyond the Limber approximation is necessary for these analyses.

weak gravitational lensing↗

Iron(III)–Oxo Cluster Chemistry with Dimethylarsinate Ligands: Structures, Magnetic Properties, and Computational Studies

A program has been initiated to develop Fe III /oxo cluster chemistry with the ‘pseudo-carboxylate’ ligand dimethylarsinate (Me 2 AsO 2 - ) for comparison with the well investigated Fe III /oxo/carboxylate cluster area. The synthesis and characterization of three polynuclear Fe III complexes are reported, [Fe 12 O 4 (O 2 C t Bu) 8 (O 2 AsMe 2 ) 17 (H 2 O) 3 ]Cl 3 (1), Na 2 [Fe 12 Na 2 O 4 (O 2 AsMe 2 ) 20 (NO 3 ) 6 (Me 2 AsO 2 H) 2 (H 2 O) 4 ](NO 3 ) 6 (2) and [Fe 3 (O 2 AsMe 2 ) 6 (Me 2 AsO 2 H) 2 (hqn) 2 ](NO 3 ) (3), where hqn is 8-hydroxyquinoline. The Fe 12 core of 1 is a type never previously encountered in Fe III carboxylate chemistry, consisting of two Fe 6 units each of which comprises two {Fe 3 (μ 3 -O 2- )} units bridged by three Me 2 AsO 2 - groups and linked into an Fe 12 loop structure by two anti-anti η 1 :η 1 :μ Me 2 AsO 2 - groups, a bridging mode extremely rare with carboxylates. 2 also consists of two Fe 6 units, differing in their ligation from those in 1, and this time linked together into a linear structure by a central {Na 2 (NO 3 ) 2 } bridging unit. 3 is a linear Fe 3 complex with no monoatomic bridges between Fe III ions, a very rare situation in Fe III chemistry with any ligands, and unprecedented in Fe carboxylate chemistry. The distinct differences observed in arsinate vs carboxylate ligation modes are rationalized largely based on the greater basicity of the former vs the latter. Variable-temperature dc and ac magnetic susceptibility data reveal all Fe 2 pairwise interactions to be antiferromagnetic. For 1 and 2, the different J ij couplings were estimated by use of a magnetostructural correlation for high nuclearity Fe III -oxo clusters and by density functional theory calculations using broken symmetry methods, allowing identification of their relative spin vector alignments and thus rationalization of their S = 0 ground states. The J ij values were then used as input values to give excellent fits of the experimental χM T vs T data. For 3, the fits of the experimental χM T vs T data to the Van Vleck equation or with PHI gave a very weak J 12 = -0.8(1) cm -1 (H = –2JŠ i ·Š j convention) between adjacent Fe III ions, and an S = 5/2 ground state. Furthermore, these initial Fe III arsinate complexes also provide structural parameters that help validate literature assignments of arsinate binding modes to iron oxide/hydroxide minerals as part of environmental concerns of using arsenic-containing herbicides in agriculture.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

PVM Enhancement for Beowulf Multiple-Processor Nodes

A recent version of the Parallel Virtual Machine (PVM) computer program has been enhanced to enable use of multiple processors in a single node of a Beowulf system (a cluster of personal computers that runs the Linux operating system). A previous version of PVM had been enhanced by addition of a software port, denoted BEOLIN, that enables the incorporation of a Beowulf system into a larger parallel processing system administered by PVM, as though the Beowulf system were a single computer in the larger system. BEOLIN spawns tasks on (that is, automatically assigns tasks to) individual nodes within the cluster. However, BEOLIN does not enable the use of multiple processors in a single node. The present enhancement adds support for a parameter in the PVM command line that enables the user to specify which Internet Protocol host address the code should use in communicating with other Beowulf nodes. This enhancement also provides for the case in which each node in a Beowulf system contains multiple processors. In this case, by making multiple references to a single node, the user can cause the software to spawn multiple tasks on the multiple processors in that node.

Springer, Paul↗

Scheduling Operations for Massive Heterogeneous Clusters

High-performance computing (HPC) programming has become increasingly difficult with the advent of hybrid supercomputers consisting of multicore CPUs and accelerator boards such as the GPU. Manual tuning of software to achieve high performance on this type of machine has been performed by programmers. This is needlessly difficult and prone to being invalidated by new hardware, new software, or changes in the underlying code. A system was developed for task-based representation of programs, which when coupled with a scheduler and runtime system, allows for many benefits, including higher performance and utilization of computational resources, easier programming and porting, and adaptations of code during runtime. The system consists of a method of representing computer algorithms as a series of data-dependent tasks. The series forms a graph, which can be scheduled for execution on many nodes of a supercomputer efficiently by a computer algorithm. The schedule is executed by a dispatch component, which is tailored to understand all of the hardware types that may be available within the system. The scheduler is informed by a cluster mapping tool, which generates a topology of available resources and their strengths and communication costs. Software is decoupled from its hardware, which aids in porting to future architectures. A computer algorithm schedules all operations, which for systems of high complexity (i.e., most NASA codes), cannot be performed optimally by a human. The system aids in reducing repetitive code, such as communication code, and aids in the reduction of redundant code across projects. It adds new features to code automatically, such as recovering from a lost node or the ability to modify the code while running. In this project, the innovators at the time of this reporting intend to develop two distinct technologies that build upon each other and both of which serve as building blocks for more efficient HPC usage. First is the scheduling and dynamic execution framework, and the second is scalable linear algebra libraries that are built directly on the former.

Humphrey, John↗

Quantum annealing for jet clustering with thrust

Quantum computing holds the promise of substantially speeding up computationally expensive tasks, such as solving optimization problems over a large number of elements. In high-energy collider physics, quantum-assisted algorithms might accelerate the clustering of particles into jets. In this study, we benchmark quantum annealing strategies for jet clustering based on optimizing a quantity called “thrust” in electron-positron collision events. Here, we find that quantum annealing yields similar performance to exact classical approaches and classical heuristics, after tuning the annealing parameters. Without tuning, comparable performance can be obtained through a hybrid quantum/classical approach.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

SPIDERS: overview of the X-ray galaxy cluster follow-up and the final spectroscopic data release

ABSTRACT SPIDERS (The SPectroscopic IDentification of eROSITA Sources) is a large spectroscopic programme for X-ray selected galaxy clusters as part of the Sloan Digital Sky Survey-IV (SDSS-IV). We describe the final data set in the context of SDSS Data Release 16 (DR16): the survey overall characteristics, final targeting strategies, achieved completeness, and spectral quality, with special emphasis on its use as a galaxy cluster sample for cosmology applications. SPIDERS now consists of about 27 000 new optical spectra of galaxies selected within 4000 photometric red sequences, each associated with an X-ray source. The excellent spectrograph efficiency and a robust analysis pipeline yield a spectroscopic redshift measurement success rate exceeding 98 per cent, with a median velocity accuracy of 20 km s−1 (at z = 0.2). Using the catalogue of 2740 X-ray galaxy clusters confirmed with DR16 spectroscopy, we reveal the 3D map of the galaxy cluster distribution in the observable Universe up to z ∼ 0.6. We highlight the homogeneity of the member galaxy spectra among distinct regions of the galaxy cluster phase space. Aided by accurate spectroscopic redshifts and by a model of the sample selection effects, we compute the galaxy cluster X-ray luminosity function and we present its lack of evolution up to z = 0.6. Finally we discuss the prospects of forthcoming large multiplexed spectroscopic programmes dedicated to follow up the next generation of all-sky X-ray source catalogues.

Clerc, N.↗

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental tool in numerous image processing and remote sensing applications. For example, unsupervised clustering is often used to obtain vegetation maps of an area of interest. This approach is useful when reliable training data are either scarce or expensive, and when relatively little a priori information about the data is available. Unsupervised clustering methods play a significant role in the pursuit of unsupervised classification. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points (or samples) in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute a set of cluster centers in d-space. Although there is no specific optimization criterion, the algorithm is similar in spirit to the well known k-means clustering method in which the objective is to minimize the average squared distance of each point to its nearest center, called the average distortion. One significant feature of ISOCLUS over k-means is that clusters may be merged or split, and so the final number of clusters may be different from the number k supplied as part of the input. This algorithm will be described in later in this paper. The ISOCLUS algorithm can run very slowly, particularly on large data sets. Given its wide use in remote sensing, its efficient computation is an important goal. We have developed a fast implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm, the filtering algorithm, by Kanungo et al.. They showed that, by storing the data in a kd-tree, it was possible to significantly reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm. For technical reasons, which are explained later, it is necessary to make a minor modification to the ISOCLUS specification. We provide empirical evidence, on both synthetic and Landsat image data sets, that our algorithm's performance is essentially the same as that of ISOCLUS, but with significantly lower running times. We show that our algorithm runs from 3 to 30 times faster than a straightforward implementation of ISOCLUS. Our adaptation of the filtering algorithm involves the efficient computation of a number of cluster statistics that are needed for ISOCLUS, but not for k-means.

Memarsadeghi, Nargess↗

hydro-hifem v.1.0

SAND2021-3180 O The hydro-hifem 1.0 software is used to simulate transient physical processes in large geologic environments consisting of complex fractures and man-made infrastructures with affordable computational cost and mesh refinement. The Earth models with such complex model features can be designed by considering the reduction of insignificant dimensions of fractures/infrastructures and embracing their corresponding hierarchical material properties, and their computational meshes are generated by using Cubit. The finite element solutions are automatically distributed across nodes of parallel cluster for efficient computation of transient fluid flow or heat conduction in geologic media. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Beskardes, GungorDidem↗

Radio Point Sources Toward Galaxy Clusters at 30 GHz

Extra-galactic point sources are a significant contaminant in cosmic microwave background and Sunyaev-Zel'dovich effect experiments. Deep interferometric observations with the BIMA and OVRO arrays are used to characterize the spatial, spectral, and flux distributions of radio point sources toward galaxy clusters at 28.5 GHz. We compute counts of mJy point source fluxes from 90 fields centered on known massive galaxy clusters and 8 non-cluster fields. Counts in the non-cluster fields are consistent with extrapolations from the results of other surveys. We also compute counts towards clusters as a function of luminosity in three redshift bins out to z = 1.0 and see no clear evidence for evolution with redshift. We compute spectral indices of mJy sources in cluster fields between 1.4 and 28.5 GHz. The distribution is skewed, with a median spectral index of 0.76 and 25th and 75th percentiles of 0.55 and 0.95, respectively. This is steeper than the spectral indices of brighter field point sources measured by other surveys.

Coble, K.↗

How Cloud is Accelerating Research at NREL

This presentation coincides with AWS's announcement of their new Parallel Computing Service (PCS) which allows for easy creation of HPC-style clusters in their AWS cloud computing platform. I helped them beta test this service before it was made generally available in August. AWS asked if we would be interested in discussing our experience with the PCS service, and our experience with HPC workloads in the cloud in general, so this slideshow discusses a brief history of scientific computing at NREL and shares a bit of our experiences and approach to utilizing cloud services for HPC-style workloads.

97 MATHEMATICS AND COMPUTING↗

Convergence rate enhancement of navier-stokes codes on clustered grids

Our Sensitivity-Based Minimal Residual (SBMR) method which is based on our earlier Distributed Minimal Residual (DMR) method allows each component of the solution vector in a system of equations to have its own convergence speed. Our global SBMR method was found to consistently outperform the DMR method while requiring considerably less computer memory. Recently, we have developed and tested a new Line SBMR or LSBMR method and a Time-Step-Scaling (TSS) method that are even more robust and computationally efficient than our global SBMR method, especially on highly clustered computational grids in laminar and turbulent flow computations.

Choi, Kwang-Yoon↗

Oxidation Dynamics of Supported Catalytic Cu Clusters: Coupling to Fluxionality

Copper oxide nanoclusters have a wide range of catalytic applications, such as the selective oxidation of hydrocarbons. O 2 binding to the catalyst, activation, and release upon reagent oxidation are key events in these catalytic chemistries. Furthermore, these events are expected to be accompanied by significant structural changes of the Cu clusters, because O atoms integrate into the cluster, rather than bind to its surface. Topping the complexity of the problem, partially oxidized Cu clusters are known to exhibit strong fluxionality and feature diverse and interconverting structures and oxygen contents in conditions of oxidative dehydrogenation (ODH). Hence, a significant dynamic coupling between the “hot” O 2 molecule impacting the cluster at reaction temperatures and the cluster fluxionality can be expected. In this work, we focus on the dynamics of dioxygen integration into a partially oxidized Cu cluster supported on hydroxylated amorphous alumina–a system recently reported to be an exceptionally selective catalyst for cyclohexane ODH with very little CO produced, whose mechanistic underpinnings are of utmost interest. The statistics over a swarm of adsorption and scattering trajectories where O 2 hits various sites on the cluster at reaction temperature shows that the O 2 binding does not only follow the minimal energy paths. O 2 also rarely integrates into the cluster in a single step and instead first binds to a single Cu atom via either an η 1 -O 2 or an η 2 -O 2 mode. Surprisingly, this step often has a higher barrier than the subsequent O 2 integration and dissociation, which in turn take multiple steps and complete the oxidation process. Dynamic trajectories starting from the key transition state of integration of the adsorbed O 2 can also lead to different intermediate structures during or right after the dissociation, due to the energy released from the transition state and the thermal intracluster effects. From these activated O 2 chemisorbed structures, O 2 dissociation occurs with moderate barriers (~0.5 eV), producing multiple final oxidized Cu 4 O 4 states. Hence, a diversity of reaction profiles for the attack of supported Cu cluster by O 2 emerges due to the dynamic effects, with implications for mechanisms, kinetic models, and catalyst design principles.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Fast Implementation of the ISODATA Clustering Algorithm

Clustering is central to many image processing and remote sensing applications. ISODATA is one of the most popular and widely used clustering methods in geoscience applications, but it can run slowly, particularly with large data sets. We present a more efficient approach to ISODATA clustering, which achieves better running times by storing the points in a kd-tree and through a modification of the way in which the algorithm estimates the dispersion of each cluster. We also present an approximate version of the algorithm which allows the user to further improve the running time, at the expense of lower fidelity in computing the nearest cluster center to each point. We provide both theoretical and empirical justification that our modified approach produces clusterings that are very similar to those produced by the standard ISODATA approach. We also provide empirical studies on both synthetic data and remotely sensed Landsat and MODIS images that show that our approach has significantly lower running times.

Memarsadeghi, Nargess↗

A Fast Implementation of the Isodata Clustering Algorithm

Clustering is central to many image processing and remote sensing applications. ISODATA is one of the most popular and widely used clustering methods in geoscience applications, but it can run slowly, particularly with large data sets. We present a more efficient approach to IsoDATA clustering, which achieves better running times by storing the points in a kd-tree and through a modification of the way in which the algorithm estimates the dispersion of each cluster. We also present an approximate version of the algorithm which allows the user to further improve the running time, at the expense of lower fidelity in computing the nearest cluster center to each point. We provide both theoretical and empirical justification that our modified approach produces clusterings that are very similar to those produced by the standard ISODATA approach. We also provide empirical studies on both synthetic data and remotely sensed Landsat and MODIS images that show that our approach has significantly lower running times.

Memarsadeghi, Nargess↗

DECT-MULTRA: Dual-Energy CT Image Decomposition With Learned Mixed Material Models and Efficient Clustering

Dual-energy computed tomography (DECT) imaging plays an important role in advanced imaging applications due to its material decomposition capability. Image-domain decomposition operates directly on CT images using linear matrix inversion, but the decomposed material images can be severely degraded by noise and artifacts. This paper proposes a new method dubbed DECT-MULTRA for image-domain DECT material decomposition that combines conventional penalized weighted-least squares (PWLS) estimation with regularization based on a mixed union of learned transforms (MULTRA) model. Our proposed approach pre-learns a union of common-material sparsifying transforms from patches extracted from all the basis materials, and a union of cross-material sparsifying transforms from multi-material patches. The common-material transforms capture the common properties among different material images, while the cross-material transforms capture the cross-dependencies. The proposed PWLS formulation is optimized efficiently by alternating between an image update step and a sparse coding and clustering step, with both of these steps having closed-form solutions. The effectiveness of our method is validated with both XCAT phantom and clinical head data. The results demonstrate that our proposed method provides superior material image quality and decomposition accuracy compared to other competing methods.

47 OTHER INSTRUMENTATION↗