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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 523 records · Page 29

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Analytical and EZmock covariance validation for the DESI 2024 results

The estimation of uncertainties in cosmological parameters is an important challenge in Large-Scale-Structure (LSS) analyses. For standard analyses such as Baryon Acoustic Oscillations (BAO) and Full-Shape two approaches are usually considered. First: analytical estimates of the covariance matrix use Gaussian approximations and (nonlinear) clustering measurements to estimate the matrix, which allows a relatively fast and computationally cheap way to generate matrices that adapt to an arbitrary clustering measurement. On the other hand, sample covariances are an empirical estimate of the matrix based on an ensemble of clustering measurements from fast and approximate simulations. While more computationally expensive due to the large amount of simulations and volume required, these allow us to take into account systematics that are impossible to model analytically. In this work we compare these two approaches in order to enable DESI's key analyses. We find that the configuration space analytical estimate performs satisfactorily in BAO analyses and its flexibility in terms of input clustering makes it the fiducial choice for DESI's 2024 BAO analysis. On the contrary, the analytical computation of the covariance matrix in Fourier space does not reproduce the expected measurements in terms of Full-Shape analyses, which motivates the use of a corrected mock covariance for DESI's 2024 Full Shape analysis.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2024

Formation and transformation of iron oxy-hydroxide precursor clusters to ferrihydrite

Iron (Fe) oxy-hydroxide minerals such as ferrihydrite (Fh) are ubiquitous in Earth-surface environments and important in biogeochemical element cycling. Recent research has suggested that their formation is preceded by the precipitation of ultrasmall (~1 nm) Keggin-like Fe oxy-hydroxide clusters. However, relatively little is understood about the structure of the precursor clusters and the impacts of pH and time on their growth and transformation to more stable phases. Here, we used a new method that involves mixed flow reactors (MFR) to synthesize these Fe oxy-hydroxide precursor clusters at pH 1.0, 1.5, 2.5, and 4.5. In situ and ex situ synchrotron scattering measurements and laboratory small-angle X-ray scattering (SAXS) were used to study the structure and size of Fe oxy-hydroxide clusters and their transformation products, respectively. Results show that with increasing pH, the particle size and structural order of samples increase, forming solids that resemble 2-line Fh at pH 4.5. The experimental data were compared with X-ray pair distribution functions (PDF) calculated for a range of Fe(III) oxyhydroxide clusters, including Fe 13 Keggin isomers computed previously using density functional theory (DFT), which yielded at best only partial agreement at short range (<5 Å). Aging of the clusters synthesized at pH 1.5 and 2.5 results in growth and transformation via Ostwald ripening to mixtures of goethite (Gt) and lepidocrocite (Lp). This process was inhibited by immediately reacting the early-formed clusters with phosphate (PO 4 3– ), suggesting that oxyanion surface complexes can stabilize the initial clusters by preventing growth and crystallization to more stable phases.

58 GEOSCIENCES↗

NASA NTRS2010

Using Agent Base Models to Optimize Large Scale Network for Large System Inventories

The aim of this paper is to use Agent Base Models (ABM) to optimize large scale network handling capabilities for large system inventories and to implement strategies for the purpose of reducing capital expenses. The models used in this paper either use computational algorithms or procedure implementations developed by Matlab to simulate agent based models in a principal programming language and mathematical theory using clusters, these clusters work as a high performance computational performance to run the program in parallel computational. In both cases, a model is defined as compilation of a set of structures and processes assumed to underlie the behavior of a network system.

Shameldin, Ramez Ahmed↗

DOE OSTI2020

ENSIGN

ENSIGN is a data analytics software package offering a modern unsupervised machine learning solution for scalable discovery in Big Data. The analytics in ENSIGN are based on an advanced mathematical tool called tensor decomposition and they are optimized to run efficiently on a range of computing platforms (from small multicore Desktop platforms to large Supercomputing clusters and novel high-end memory-driven computing platforms such as HPE Superdome Flex). ENSIGN enables the user to extract deep insights from the entirety of massive-scale (100s of Gigabytes or Terabytes scale) multidimensional data. ENSIGN uncovers latent patterns in data without the user having to specify or describe what the patterns are; the user, in the first place, may not even know such patterns existed and that they have to look for such patterns. The insights gained from ENSIGN could be trailheads that can be used as starting points for deeper forensic investigation.

Baskaran, Muthu↗

DOE OSTI2022

ENSIGN

Baskaran, Muthu↗

NASA NTRS2007

Monitoring by Use of Clusters of Sensor-Data Vectors

The inductive monitoring system (IMS) is a system of computer hardware and software for automated monitoring of the performance, operational condition, physical integrity, and other aspects of the health of a complex engineering system (e.g., an industrial process line or a spacecraft). The input to the IMS consists of streams of digitized readings from sensors in the monitored system. The IMS determines the type and amount of any deviation of the monitored system from a nominal or normal ( healthy ) condition on the basis of a comparison between (1) vectors constructed from the incoming sensor data and (2) corresponding vectors in a database of nominal or normal behavior. The term inductive reflects the use of a process reminiscent of traditional mathematical induction to learn about normal operation and build the nominal-condition database. The IMS offers two major advantages over prior computational monitoring systems: The computational burden of the IMS is significantly smaller, and there is no need for abnormal-condition sensor data for training the IMS to recognize abnormal conditions. The figure schematically depicts the relationships among the computational processes effected by the IMS. Training sensor data are gathered during normal operation of the monitored system, detailed computational simulation of operation of the monitored system, or both. The training data are formed into vectors that are used to generate the database. The vectors in the database are clustered into regions that represent normal or nominal operation. Once the database has been generated, the IMS compares the vectors of incoming sensor data with vectors representative of the clusters. The monitored system is deemed to be operating normally or abnormally, depending on whether the vector of incoming sensor data is or is not, respectively, sufficiently close to one of the clusters. For this purpose, a distance between two vectors is calculated by a suitable metric (e.g., Euclidean distance) and "sufficiently close" signifies lying at a distance less than a specified threshold value. It must be emphasized that although the IMS is intended to detect off-nominal or abnormal performance or health, it is not necessarily capable of performing a thorough or detailed diagnosis. Limited diagnostic information may be available under some circumstances. For example, the distance of a vector of incoming sensor data from the nearest cluster could serve as an indication of the severity of a malfunction. The identity of the nearest cluster may be a clue as to the identity of the malfunctioning component or subsystem. It is possible to decrease the IMS computation time by use of a combination of cluster-indexing and -retrieval methods. For example, in one method, the distances between each cluster and two or more reference vectors can be used for the purpose of indexing and retrieval. The clusters are sorted into a list according to these distance values, typically in ascending order of distance. When a set of input data arrives and is to be tested, the data are first arranged as an ordered set (that is, a vector). The distances from the input vector to the reference points are computed. The search of clusters from the list can then be limited to those clusters lying within a certain distance range from the input vector; the computation time is reduced by not searching the clusters at a greater distance.

Iverson, David L.↗

DOE OSTI2021

PDG: A Composite Method Based on the Resolution of the Identity

The Gaussian-3 (G3) composite approach for thermochemical properties is revisited in light of the enhanced computational efficiency and reduced memory costs by applying the resolution-of-the-identity (RI) approximation for two-electron repulsion integrals (ERIs) to the computationally demanding component methods in the G3 model: the energy and gradient computations via the second-order Møller–Plesset perturbation theory (MP2) and the energy computations using the coupled-cluster singles–doubles method augmented with noniterative triples corrections [CCSD(T)]. Efficient implementation of the RI-based methods is achieved by employing a hybrid distributed/shared memory model based on MPI and OpenMP. The new variant of the G3 composite approach based on the RI approximation is termed the RI-G3 scheme, or alternatively the PDG method. The accuracy of the new RI-G3/PDG scheme is compared to the “standard” G3 composite approach that employs the memory-expensive four-center ERIs in the MP2 and CCSD(T) calculations. Taking the computation of the heats of formation of the closed-shell molecules in the G3/99 test set as a test case, it is demonstrated that the RI approximation introduces negligible changes to the mean absolute errors relative to the standard G3 model (less than 0.1 kcal/mol), while the standard deviations remain unaltered. Furthermore, the efficiency and memory requirements for the RI-MP2 and RI-CCSD(T) methods are compared to the standard MP2 and CCSD(T) approaches, respectively. The hybrid MPI/OpenMP-based RI-MP2 energy plus gradient computation is found to attain a 7.5× speedup over the standard MP2 calculations. For the most demanding CCSD(T) calculations, the application of the RI approximation is found to nearly halve the memory demand, confer about a 4–5× speedup for the CCSD iterations, and reduce the computational time for the compute-intensive triples correction step by several hours.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NASA NTRS1994

The luminosity functions of embedded stellar clusters. 1: Method of solution and analytic results

We describe a method for computing the history of the luminosity function in a young cluster still forming within a molecular cloud complex. Our method, which utilizes detailed results from stellar evolution theory, assumes that clusters arise from the continuous collapse of dense cloud cores over a protracted period of time. It is also assumed that stars reaching the main sequence are distributed in mass according to a prescribed initial mass function (IMF). We keep track separately of the contributions to the luminosity function from the populations of protostars, pre-main-sequence stars, and main-sequence stars. We derive expressions for the fractional contribution of these populations to both the total number of stars produced and the total cluster luminosity. In our model, the number of protostars rises quickly at first, but then levels off to a nearly constant value, which it maintains until the dispersal of the cloud complex. The number fraction of protostars always decreases with time. Averaged over the life of the parent cloud, this fraction is typically a few percent. The protostar mass distribution can be expressed as an integral over the IMF.

Fletcher, Andre B.↗

NASA NTRS1992

Accurate ab initio quartic force fields for borane and BeH2

The quartic force fields of BH3 and BeH2 have been computed ab initio using an augmented coupled cluster (CCSD(T)) method and basis sets of spdf and spdfg quality. For BH3, the computed spectroscopic constants are in very good agreement with recent experimental data, and definitively confirm misassignments in some older work, in agreement with recent ab initio studies. Using the computed spectroscopic constants, the rovibrational partition function for both molecules has been constructed using a modified direct numerical summation algorithm, and JANAF-style thermochemical tables are presented.

Martin, J. M. L.↗

NASA NTRS1992

A computer search for asteroid families

The improved proper elements of 4100 numbered asteroids have been searched for clusterings in a, e, i space using a computer technique based on the D-criterion. A list of 14 dynamical families each with more than 15 members is presented. Quantitative measurements of the density and dimensions in phase space of each family are presented.

Lindblad, Bertil A.↗

DOE OSTI2024

Redshift evolution and covariances for joint lensing and clustering studies with DESI Y1

ABSTRACT Galaxy–galaxy lensing (GGL) and clustering measurements from the Dark Energy Spectroscopic Instrument Year 1 (DESI Y1) data set promise to yield unprecedented combined-probe tests of cosmology and the galaxy–halo connection. In such analyses, it is essential to identify and characterize all relevant statistical and systematic errors. We forecast the covariances of DESI Y1 GGL + clustering measurements and the systematic bias due to redshift evolution in the lens samples. Focusing on the projected clustering and GGL correlations, we compute a Gaussian analytical covariance, using a suite of N-body and lognormal simulations to characterize the effect of the survey footprint. Using the DESI one percent survey data, we measure the evolution of galaxy bias parameters for the DESI luminous red galaxy (LRG) and bright galaxy survey (BGS) samples. We find mild evolution in the LRGs in $0.4 < z < 0.8$, subdominant to the expected statistical errors. For BGS, we find less evolution for brighter absolute magnitude cuts, at the cost of reduced sample size. We find that for a redshift bin width $\Delta z = 0.1$, evolution effects on DESI Y1 GGL is negligible across all scales, all fiducial selection cuts, all fiducial redshift bins. Galaxy clustering is more sensitive to evolution due to the bias squared scaling. Nevertheless the redshift evolution effect is insignificant for clustering above the 1-halo scale of $0.1h^{-1}$ Mpc. For studies that wish to reliably access smaller scales, additional treatment of redshift evolution is likely needed. This study serves as a reference for GGL and clustering studies using the DESI Y1 sample.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2021

Theoretical study of the HCS + –H 2 van der Waals complex: potential energy surface, rovibrational bound states, and rotationally inelastic collisional cross sections

An accurate ground-state intermolecular potential energy surface (PES) was calculated for the HCS + –H 2 complex. The surface was constructed from 3023 ab initio energies, computed with explicitly correlated coupled-cluster theory, CCSD(T)-F12b, with extrapolation to the complete basis set limit (VTZ-F12/VQZ-F12). The new 4D PES was used to compute rovibrational energies, rota- tional constants, and close-coupling quantum scattering calculations at low collision energies. A symmetry-adapted Lanczos algorithm was used to variationally compute the low-lying rovibrational bound states. Rotational constants for states of two isomers were determined from the energy levels and reported in hopes of motivating experiments. The rotationally inelastic state-to-state cross sections of HCS + by collision with para- and ortho-H 2 were computed and compared, and trends and propensities are discussed.

74 ATOMIC AND MOLECULAR PHYSICS↗

DOE OSTI2020

Scalable All-pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters

We present an optimized Floyd-Warshall (Floyd-Warshall) algorithm that computes the All-pairs shortest path (APSP) for GPU accelerated clusters. The Floyd-Warshall algorithm due to its structural similarities to matrix-multiplication is well suited for highly parallel GPU architectures. To achieve high parallel efficiency, we address two key algorithmic challenges: reducing high communication overhead and addressing limited GPU memory. To reduce high communication costs, we redesign the parallel (a) to expose more parallelism, (b) aggressively overlap communication and computation with pipelined and asynchronous scheduling of operations, and (c) tailored MPI-collective. To cope with limited GPU memory, we employ an offload model, where the data resides on the host and is transferred to GPU on-demand. The proposed optimizations are supported with detailed performance models for tuning. Our optimized parallel Floyd-Warshall implementation is up to 5x faster than a strong baseline and achieves 8.1 PetaFLOPS/sec on 256~nodes of the Summit supercomputer at Oak Ridge National Laboratory. This performance represents 70% of the theoretical peak and 80% parallel efficiency. The offload algorithm can handle 2.5x larger graphs with a 20% increase in overall running time.

Sao, Piyush↗

DOE OSTI2023

The Back Door to the Surface Hydrated Electron

We use a Mg + metal to extend the size regime of water clusters to extrapolate to the bulk limit of the Vertical Detachment Energy (VDE) of the solvated electron to >3,200, a value between one to over two orders of magnitude for clusters previously measured experimentally or computed theoretically. We relate the VDE to the energy difference between the Mg + (H 2 O) $n$ and Mg 2+ (H 2 O) $n$ systems and the metal’s second ionization potential. The extrapolated bulk VDEs of the localized surface electron, which moves away from the metal as n increases, are 1.89 ± 0.01 eV for semiempirical ($n$ ~ 3,200; PM6-D 3 H 4 ) and 1.73 ± 0.03 eV ($n$ ~ 150; HF), 1.83 ± 0.02 eV ($n$ ~ 150; MP2) for ab-initio, in excellent agreement with the 1.6 – 1.8 eV range of experimental results. In conclusion, the VDEs converge from above (larger values) to the bulk limit, in a manner qualitatively different than previous studies and experiments, a fact justifying the “back door” approach to the solvated electron.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2022

Investigation of plasmon relaxation mechanisms using nonadiabatic molecular dynamics

Hot carriers generated from the decay of plasmon excitation can be harvested to drive a wide range of physical or chemical processes. However, their generation efficiency is limited by the concomitant phonon-induced relaxation processes by which the energy in excited carriers is transformed into heat. However, simulations of dynamics of nanoscale clusters are challenging due to the computational complexity involved. Here, in this paper, we adopt our newly developed Trajectory Surface Hopping (TSH) nonadiabatic molecular dynamics algorithm to simulate plasmon relaxation in Au 20 clusters, taking the atomistic details into account. The electronic properties are treated within the Linear Response Time-Dependent Tight-binding Density Functional Theory (LR-TDDFTB) framework. The relaxation of plasmon due to coupling to phonon modes in Au 20 beyond the Born–Oppenheimer approximation is described by the TSH algorithm. The numerically efficient LR-TDDFTB method allows us to address a dense manifold of excited states to ensure the inclusion of plasmon excitation. Starting from the photoexcited plasmon states in Au 20 cluster, we find that the time constant for relaxation from plasmon excited states to the lowest excited states is about 2.7 ps, mainly resulting from a stepwise decay process caused by low-frequency phonons of the Au 20 cluster. Furthermore, our simulations show that the lifetime of the phonon-induced plasmon dephasing process is ~10.4 fs and that such a swift process can be attributed to the strong nonadiabatic effect in small clusters. Our simulations demonstrate a detailed description of the dynamic processes in nanoclusters, including plasmon excitation, hot carrier generation from plasmon excitation dephasing, and the subsequent phonon-induced relaxation process.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2021

ParChain: a framework for parallel hierarchical agglomerative clustering using nearest-neighbor chain

This paper studies the hierarchical clustering problem, where the goal is to produce a dendrogram that represents clusters at varying scales of a data set. We propose the ParChain framework for designing parallel hierarchical agglomerative clustering (HAC) algorithms, and using the framework we obtain novel parallel algorithms for the complete linkage, average linkage, and Ward's linkage criteria. Compared to most previous parallel HAC algorithms, which require quadratic memory, our new algorithms require only linear memory, and are scalable to large data sets. ParChain is based on our parallelization of the nearest-neighbor chain algorithm, and enables multiple clusters to be merged on every round. We introduce two key optimizations that are critical for efficiency: a range query optimization that reduces the number of distance computations required when finding nearest neighbors of clusters, and a caching optimization that stores a subset of previously computed distances, which are likely to be reused. Experimentally, we show that our highly-optimized implementations using 48 cores with two-way hyper-threading achieve 5.8--110.1x speedup over state-of-the-art parallel HAC algorithms and achieve 13.75--54.23x self-relative speedup. Compared to state-of-the-art algorithms, our algorithms require up to 237.3x less space. Our algorithms are able to scale to data set sizes with tens of millions of points, which existing algorithms are not able to handle.

Computer Science↗

DOE OSTI2025

Cosmological constraints from the Planck cluster catalogue with DES shear profiles and Chandra observations

We present cosmological constraints from the Planck PSZ2 cosmological cluster sample, using weak-lensing shear profiles from Dark Energy Survey (DES) data and X-ray observations from the Chandra telescope for the mass calibration. We compute hydrostatic mass estimates for all clusters in the PSZ2 sample with a scaling relation between their Sunyaev-Zeldovich signal and X-ray derived hydrostatic mass, calibrated with the Chandra data. We introduce a method to correct these masses with a hydrostatic mass bias using shear profiles from wide-field galaxy surveys. We simultaneously fit the number counts of the PSZ2 sample and the mass calibration with the DES data, finding $Ω_\text{m}=0.312^{+0.018}_{-0.024}$, $σ_8=0.777\pm 0.024$, $S_8\equiv σ_8 \sqrt{Ω_\text{m} / 0.3}=0.791^{+0.023}_{-0.021}$, and $(1-b)=0.844^{+0.055}_{-0.062}$ for our baseline analysis when combined with BAO data. When considering a hydrostatic mass bias evolving with mass, we find $Ω_\text{m}=0.353^{+0.025}_{-0.031}$, $σ_8=0.751\pm 0.023$, and $S_8=0.814^{+0.019}_{-0.020}$. We verify the robustness of our results by exploring a variety of analysis settings, with a particular focus on the definition of the halo centre used for the extraction of shear profiles. We compare our results with a number of other analyses, in particular two recent analyses of cluster samples obtained from SPT and eROSITA data that share the same mass calibration data set. We find that our results are in overall agreement with most late-time probes, in very mild tension with CMB results (1.6$σ$), and in significant tension with results from eROSITA clusters (2.9$σ$). We confirm that our mass calibration is consistent with the eROSITA analysis by comparing masses for clusters present in both Planck and eROSITA samples, eliminating it as a potential cause of tension.

Aymerich, G. [Orsay, IAS; AIM, Saclay] (ORCID:0009↗

NASA NTRS2000

Numerical Propulsion System Simulation: An Overview

The cost of implementing new technology in aerospace propulsion systems is becoming prohibitively expensive and time consuming. One of the main contributors to the high cost and lengthy time is the need to perform many large-scale hardware tests and the inability to integrate all appropriate subsystems early in the design process. The NASA Glenn Research Center is developing the technologies required to enable simulations of full aerospace propulsion systems in sufficient detail to resolve critical design issues early in the design process before hardware is built. This concept, called the Numerical Propulsion System Simulation (NPSS), is focused on the integration of multiple disciplines such as aerodynamics, structures and heat transfer with computing and communication technologies to capture complex physical processes in a timely and cost-effective manner. The vision for NPSS, as illustrated, is to be a "numerical test cell" that enables full engine simulation overnight on cost-effective computing platforms. There are several key elements within NPSS that are required to achieve this capability: 1) clear data interfaces through the development and/or use of data exchange standards, 2) modular and flexible program construction through the use of object-oriented programming, 3) integrated multiple fidelity analysis (zooming) techniques that capture the appropriate physics at the appropriate fidelity for the engine systems, 4) multidisciplinary coupling techniques and finally 5) high performance parallel and distributed computing. The current state of development in these five area focuses on air breathing gas turbine engines and is reported in this paper. However, many of the technologies are generic and can be readily applied to rocket based systems and combined cycles currently being considered for low-cost access-to-space applications. Recent accomplishments include: (1) the development of an industry-standard engine cycle analysis program and plug 'n play architecture, called NPSS Version 1, (2) A full engine simulation that combines a 3D low-pressure subsystem with a 0D high pressure core simulation. This demonstrates the ability to integrate analyses at different levels of detail and to aerodynamically couple components, the fan/booster and low-pressure turbine, through a 3D computational fluid dynamics simulation. (3) Simulation of all of the turbomachinery in a modern turbofan engine on parallel computing platform for rapid and cost-effective execution. This capability can also be used to generate full compressor map, requiring both design and off-design simulation. (4) Three levels of coupling characterize the multidisciplinary analysis under NPSS: loosely coupled, process coupled and tightly coupled. The loosely coupled and process coupled approaches require a common geometry definition to link CAD to analysis tools. The tightly coupled approach is currently validating the use of arbitrary Lagrangian/Eulerian formulation for rotating turbomachinery. The validation includes both centrifugal and axial compression systems. The results of the validation will be reported in the paper. (5) The demonstration of significant computing cost/performance reduction for turbine engine applications using PC clusters. The NPSS Project is supported under the NASA High Performance Computing and Communications Program.

Lytle, John K.↗