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 793 records · Page 44

Structure and Synthesizability of Iron–Sulfur Metal–Organic Frameworks

Sulfur-based metal–organic frameworks (MOFs) and coordination polymers (CPs) are an emerging class of hybrid materials that have received growing attention due to their magnetic, conductive, and catalytic properties with potential applications in electrocatalysis and energy storage. In this work, we report a high-throughput virtual screening protocol to predict the synthesizability of candidate metal–sulfur MOFs/CPs by computing the thermodynamically stable structures resulting from a particular combination of metal cluster, linker, cation, and synthetic conditions. Free energies are computed by using all-atom classical mechanical thermodynamic integration. Low-free-energy structures are refined using ab initio density functional theory, and pair distribution functions and powder X-ray diffraction patterns are calculated to complement and guide experimental structure determination. We validate the computational approach by retrospective predictions of the stable structure produced by experimental syntheses, and a subsequent screen predicts Fe 4 S 4 -BDT–TPP as a new thermodynamically stable one-dimensional (1D) CP comprising a redox-active Fe 4 S 4 cluster, a 1,4-benzenedithiolate (BDT) linker, and a tetraphenylphosphonium (TPP) countercation. Furthermore, this material is experimentally synthesized, and the 1D chain structure of the crystal is confirmed using microcrystal electron diffraction. The computational screening pipeline is generically transferable to neutral and ionic MOFs/CPs comprising arbitrary metal clusters, linkers, cations, and synthetic conditions, and we make it freely available as an open source tool to guide and accelerate the discovery and engineering of novel porous materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Understanding GPU errors on large-scale HPC systems and the implications for system design and operation

Increase in graphics hardware performance and improvements in programmability has enabled GPUs to evolve from a graphics-specific accelerator to a general-purpose computing device. Titan, the world's second fastest supercomputer for open science in 2014, consists of more dum 18,000 GPUs that scientists from various domains such as astrophysics, fusion, climate, and combustion use routinely to run large-scale simulations. Unfortunately, while the performance efficiency of GPUs is well understood, their resilience characteristics in a large-scale computing system have not been fully evaluated. We present a detailed study to provide a thorough understanding of GPU errors on a large-scale GPU-enabled system. Our data was collected from the Titan supercomputer at the Oak Ridge Leadership Computing Facility and a GPU cluster at the Los Alamos National Laboratory. We also present results from our extensive neutron-beam tests, conducted at Los Alamos Neutron Science Center (LANSCE) and at ISIS (Rutherford Appleron Laboratories, UK), to measure the resilience of different generations of GPUs. We present several findings from our field data and neutron-beam experiments, and discuss the implications of our results for future GPU architects, current and future HPC computing facilities, and researchers focusing on GPU resilience.

Tiwari, Devesh↗

Performance Analysis of Data Processing in Distributed File Systems with Near Data Processing

In the era of big data, the escalating volume and velocity of data generation pose significant challenges in data processing. Traditional systems like Spark and Hadoop manage the increasing amount and velocity of data by improving data placement and processing speeds. However, they face inherent limitations due to the essential data movement required for processing. In this paper, we explore the Skyhook framework, a novel extension of the Ceph distributed system, which significantly reduces the need for data movement. We present an extensive case study using the Skyhook framework, applying it with the TPC-H and K-means clustering algorithms. More specifically, we leverage the TPC-H benchmark to distinguish between CPU-intensive and I/O-intensive tasks. We explore the integration of K-means clustering into SQL, coupled with a near-data processing system to offload the computational burden of the K-means clustering algorithm to storage nodes. We conduct a comprehensive performance evaluation of distributed data processing applications across three processing approaches: traditional layout (baseline), optimized layout, and near-data processing. Additionally, we introduce the use of the FIO tool to simulate real-world system workloads, enabling the measurement of performance metrics such as average latency and CPU utilization. Our research is a significant advance in understanding how to optimize data processing systems to meet the demands of the modern data landscape.

Hou, Shiyue↗

Uncertainty estimation of bifurcated solutions in the Rayleigh–Bénard problem for advanced nuclear reactors applications

Multiphysics models of nuclear reactors frequently comprise nonlinear systems of equations. The nonlinear nature of these models could lead to solution bifurcations, where a small change in a certain parameter, e.g., the thermophysical properties of the coolant, can lead to a sudden change in the system’s behavior. At the point in parameter space where this happens, called a critical point, the Jacobian matrix of the model’s nonlinear operator becomes singular potentially permitting multiple solutions to coexist. In this paper, we perform uncertainty estimation (UE) in a parameter range that includes bifurcated solutions within the context of Rayleigh–Bénard problem. We perform this analysis assuming uncertain temperature difference, and tilt angle for the iterative solution algorithm with a unit Prandtl number (Pr = 1). Also, we perform this analysis under uncertain thermophysical properties for both FLiBe molten salt and liquid sodium as working fluid. We deploy two approaches to compute statistical moments for the resulting distributions of selected flow-field variables. The first approach is the blind computation of the mean and the standard deviation without any consideration of solution bifurcation, while the second approach utilizes k-means clustering to cluster each branch’s solutions together and compute separate statistical moments for each branch. The statistical distributions are obtained by perturbing the selected parameters about nominal values that correspond to a solution on one of the valid branches, and that solution is used as initial guess for the iterative solution algorithm. We found that perturbation of any parameter when its nominal value is close to its critical point always leads to branch jumping, i.e., the iterations converge to a solution on a branch different from the branch of the initial guess. This produces a statistical ensemble comprised of fundamentally different solutions leading to wrong mean values and uncertainty estimates, whereas clustering provides an efficient way to deal with this type of computation. This work is important for developing Gen IV nuclear systems because many of these systems rely on natural convection for cooling especially in accident conditions.

97 - MATHEMATICS AND COMPUTING↗

Nowcasting Earthquakes in Southern California With Machine Learning: Bursts, Swarms, and Aftershocks May Be Related to Levels of Regional Tectonic Stress

Abstract Seismic bursts in Southern California are sequences of small earthquakes strongly clustered in space and time and include seismic swarms and aftershock sequences. A readily observable property of these events, the radius of gyration ( R G ), allows us to connect the bursts to the temporal occurrence of the largest M ≥ 7 earthquakes in California since 1984. In the Southern California earthquake catalog, we identify hundreds of these potentially coherent space‐time structures in a region defined by a circle of radius 600 km around Los Angeles. We compute R G for each cluster then filter them to identify those bursts with large numbers of events closely clustered in space, which we call “compact” bursts. Our basic assumption is that these compact bursts reflect the dynamics associated with large earthquakes. Once we have filtered the burst catalog, we apply an exponential moving average to construct a time series for the Southern California region. We observe that the R G of these bursts systematically decreases prior to large earthquakes, in a process that we might term “radial localization.” The R G then rapidly increases during an aftershock sequence, and a new cycle of “radial localization” then begins. These time series display cycles of recharge and discharge reminiscent of seismic stress accumulation and release in the elastic rebound process. The complex burst dynamics we observe are evidently a property of the region as a whole, rather than being associated with individual faults. This new method allows us to improve earthquake nowcasting, which is a technique to evaluate the current state of hazard in a seismically active region.

58 GEOSCIENCES↗

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↗

ManiNetCluster: a novel manifold learning approach to reveal the functional links between gene networks

BACKGROUND:The coordination of genomic functions is a critical and complex process across biological systems such as phenotypes or states (e.g., time, disease, organism, environmental perturbation). Understanding how the complexity of genomic function relates to these states remains a challenge. To address this, we have developed a novel computational method, ManiNetCluster, which simultaneously aligns and clusters gene networks (e.g., co-expression) to systematically reveal the links of genomic function between different conditions. Specifically, ManiNetCluster employs manifold learning to uncover and match local and non-linear structures among networks, and identifies cross-network functional links. RESULTS:We demonstrated that ManiNetCluster better aligns the orthologous genes from their developmental expression profiles across model organisms than state-of-the-art methods (p-value <2.2×10-16). This indicates the potential non-linear interactions of evolutionarily conserved genes across species in development. Furthermore, we applied ManiNetCluster to time series transcriptome data measured in the green alga Chlamydomonas reinhardtii to discover the genomic functions linking various metabolic processes between the light and dark periods of a diurnally cycling culture. We identified a number of genes putatively regulating processes across each lighting regime. CONCLUSIONS:ManiNetCluster provides a novel computational tool to uncover the genes linking various functions from different networks, providing new insight on how gene functions coordinate across different conditions. ManiNetCluster is publicly available as an R package at https://github.com/daifengwanglab/ManiNetCluster.

Comparative network analysis↗

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↗

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↗

Performance Improvements to the Cross Section Calculation in MPACT

The MPACT code is the primary deterministic neutron transport solver available in the Virtual Environment for Reactor Applications (VERA) as part of the Consortium for Advanced Simulation of Light Water Reactors (CASL). In contrast to the conventional two-step method using homogenization techniques, MPACT employs a direct transport methodology, where the transport calculation is performed with the explicit reactor core geometry, material compositions, and temperature distribution. As the direct whole-core transport calculation requires significant computational resources, performance improvements have been recently conducted in various components of MPACT. The initial MPACT profiling was performed on the EOS cluster at the Oak Ridge Leadership Computing Facility. Table I shows that the cross section processing accounted for 74% and 33% of the total runtime for VERA Progression Problems 5 and 7. Starting with a problem-independent multigroup (MG) library, two primary functionalities are performed in MPACT to obtain the problem-dependent MG cross sections: (1) the resonance self-shielding calculation, which currently MPACT is approaching with the subgroup method; (2) use of equivalence cross section from resonance calculation to compute the microscopic cross sections, and thus, the macroscopic cross sections of material regions. As shown in Table I, the time distribution in cross section processing varies from case to case. For Problem 5, a 2-D quarter core depletion case, the macroscopic XS dominates due to the increased number of isotopes in the depleted fuel. For Problem 7, a 3-D quarter core PWR at HFP and BOL, more subgroup calculations are performed to obtain updated self-shielded cross sections during the iteration. In this summary, the approaches to reduce the computing time in cross section processing are presented. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Symplectic multi-particle tracking on GPUs

A symplectic multi-particle tracking model is implemented on the Graphic Processing Units (GPUs) using the Compute Unified Device Architecture (CUDA) language. The symplectic tracking model can preserve phase space structure and reduce non-physical effects in long term simulation, which is important for beam property evaluation in particle accelerators. Though this model is computationally expensive, it is very suitable for parallelization and can be accelerated significantly by using GPUs. In this paper, we optimized the implementation of the symplectic tracking model on both single GPU and multiple GPUs. Using a single GPU processor, the code achieves a factor of 2-10 speedup for a range of problem sizes compared with the time on a single state-of-the-art Central Processing Unit (CPU) node with similar power consumption and semiconductor technology. It also shows good scalability on a multi-GPU cluster at Oak Ridge Leadership Computing Facility. In an application to beam dynamics simulation, the GPU implementation helps save more than a factor of two total computing time in comparison to the CPU implementation.

43 PARTICLE ACCELERATORS↗

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↗

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↗

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.↗

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↗

Effect of hydrogenation on the structure and magnetic properties of an iron oxide cluster

The structure and properties of the Fe8O12Hn clusters (n = 0–18) are computed using the all-electron density functional theory with the generalized gradient approximation for the exchange–correlation potential. The ground state of Fe8O12 is found to be a singlet state having a bi-capped octahedron geometry. Upon hydrogenation, the octahedral framework of Fe is retained in Fe8O12Hn up to n < 7, beyond which point the iron octahedron transforms into a cube. Hydrogen atoms are bound to oxygen atoms up to n = 12, but they bind to the faces of the Fe8 cube when n > 12. The total spin magnetic moment of a Fe8O12Hn cluster is larger than 6 μB for 1 ≤ n ≤ 18, except for n = 8 and 10, where the lowest total energy states are antiferromagnetic singlets. The reason for this deviation from the general behavior in the Fe8O12Hn series is attributed to the collective superexchange phenomenon. Surprisingly, the total spin magnetic moment of a Fe8O12Hn cluster is found to be substantially larger than the total spin magnetic moment of the bare Fe8 cluster when n = 12–18. All of the Fe8O12Hn clusters are stable with respect to an abstraction of a single hydrogen atom but are unstable toward the abstraction of an H2 dimer when n =10 and n = 14–18.

Gutsev, G. L.↗

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.↗

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.↗