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 1,315 records · Page 73
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Hiperclust

This software leverages transfer learning to analyze atom probe tomography (APT) data. It is trained on synthetic data and then applies this knowledge to predict the optimal number of clusters for a given APT dataset. Initially, the software used preliminary clustering to estimate the general structure of the data. Based on this, it provides suggestions for key parameters like minimum cluster size and minimum number of points. These parameters are critical for algorithms like HDBSCAN, ensuring accurate cluster formation without the need for trial-and-error testing. The software runs on High-Performance computing (HPC) systems, enabling fast, scalable analysis of large APT datasets, ultimately saving time and improving the reliability of clustering outcomes.

Tang, Yalei [Idaho National Laboratory (INL), Idah↗
DOE OSTI2025

Control of Permanent Porosity in Type 3 Porous Liquids via Solvent Clustering

Porous liquids (PLs) are an exciting new class of materials for carbon capture due to their high gas adsorption capacity and ease of industrial implementation. They are composed of sorbent particles suspended in a nonadsorbed solvent, forming a liquid with permanent porosity. While PLs have a vast number of potential compositions based on the number of solvents and sorbent materials available, most of the research has been focused on the selection of the sorbent rather than the solvent. Therefore, PL design criteria on the supramolecular structures of the solvent are explored to create a fundamental understanding of how the solvent enables PL formation for rapid discovery of new PL compositions. Atomistic molecular dynamics simulation of eight solvents with a range of molecular sizes, shapes, and intramolecular bonding was performed, identifying that the shape and size of molecular clusters formed in the solvent are the driving predictor of PL formation rather than the size of the individual solvent molecule. The results demonstrate a significant departure from common approaches to PL formation based on the steric exclusion of solvent molecules from the sorbent via the size of the pore aperture. A modeling and experimental validation study further supports these findings. In conclusion, through this computational material design study, a previously unexplored mechanism in PL formation, solvent–solvent clustering, is identified as a critical factor for the accelerated discovery of liquid phase carbon capture materials.

Carbon capture↗
DOE OSTI2015

Electronic excitation of molecules in solution calculated using the symmetry-adapted cluster–configuration interaction method in the polarizable continuum model

The effects from solvent environment are specific to the electronic states; therefore, a computational scheme for solvent effects consistent with the electronic states is necessary to discuss electronic excitation of molecules in solution. The PCM (polarizable continuum model) SAC (symmetry-adapted cluster) and SAC-CI (configuration interaction) methods are developed for such purposes. The PCM SAC-CI adopts the state-specific (SS) solvation scheme where solvent effects are self-consistently considered for every ground and excited states. For efficient computations of many excited states, we develop a perturbative approximation for the PCM SAC-CI method, which is called corrected linear response (cLR) scheme. Our test calculations show that the cLR PCM SAC-CI is a very good approximation of the SS PCM SAC-CI method for polar and nonpolar solvents.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Deploying and Operating CephFS for Scientific Applications at Fermilab

Fermilab has been running a Ceph cluster in production for several years to support high-throughput scientific computing. Our primary use case is CephFS, which serves interactive data analysis workloads, with growing interest in using RGW for scalable object storage of scientific datasets. In this talk, we'll share lessons learned from successfully deploying and maintaining our Ceph cluster with cephadm, including challenges faced, performance tuning, and operational practices. We'll also present custom tools we've developed to streamline monitoring and management and discuss how Ceph fits into our broader storage architecture for large-scale scientific research.

Peisker, Alison [Fermilab]↗
DOE OSTI2014

Planck 2013 results. XXI. Power spectrum and high-order statistics of the Planck all-sky Compton parameter map

We have constructed the first all-sky map of the thermal Sunyaev-Zeldovich (tSZ) effect by applying specifically tailored component separation algorithms to the 100 to 857 GHz frequency channel maps from the Planck survey. This map shows an obvious galaxy cluster tSZ signal that is well matched with blindly detected clusters in the Planck SZ catalogue. To characterize the signal in the tSZ map we have computed its angular power spectrum. At large angular scales (&ell; < 60), the major foreground contaminant is the diffuse thermal dust emission. At small angular scales (&ell; > 500) the clustered cosmic infrared background and residual point sources are the major contaminants. These foregrounds are carefully modelled and subtracted. We thus measure the tSZ power spectrum over angular scales 0.17° ≲ θ ≲ 3.0° that were previously unexplored. The measured tSZ power spectrum is consistent with that expected from the Planck catalogue of SZ sources, with clear evidence of additional signal from unresolved clusters and, potentially, diffuse warm baryons. Marginalized band-powers of the Planck tSZ power spectrum and the best-fit model are given. The non-Gaussianity of the Compton parameter map is further characterized by computing its 1D probability distribution function and its bispectrum. The measured tSZ power spectrum and high order statistics are used to place constraints on σ 8 .

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Scalable edge clustering of dynamic graphs via weighted line graphs

Timestamped relational datasets consisting of records (or connections) between pairs of entities are ubiquitous in network science. For applications like peer-to-peer communication, email, various social network interactions, and computer network security, it is useful to organize these records into groups based on how and when they are occurring. Weighted line graphs offer a natural way to model how records are related in such datasets but for large real-world graph topologies, building and utilizing the line graph is prohibitively expensive. Here, we present the framework to cluster the edges of a dynamic graph via the associated line graph that contains two major contributions. The first is a method to work with the line graph implicitly and the second is a distributed scale implementation of an agglomerative hierarchical graph clustering algorithm. We outline a novel hierarchical dynamic graph edge clustering approach that efficiently breaks massive relational datasets into small sets of edges containing events at various timescales. This is in stark contrast to traditional graph clustering algorithms that prioritize highly connected (clique-like) community structures. Our approach relies on constructing a sufficient subgraph of a weighted line graph and applying a hierarchical agglomerative clustering. This approach is related to scalable techniques from spatial clustering, nonlinear-dimension reduction, topological data analysis, and draws particular inspiration from HDBSCAN. As an edge clustering, this method yields an overlapping node clustering. Our algorithm is parallelizable and we demonstrate efficient clustering of a billion-scale, real-world dynamic graph into small edge sets that correlate in topology and time. The entire clustering process for a graph with tens of billions of edges takes just a few minutes of run time on 256 nodes of a distributed compute environment. We argue how the output of the edge clustering is useful for a multitude of data visualization and powerful machine learning tasks, both involving the original massive dynamic graph data and metadata associated with the nodes and edges. Finally, we describe how this approach can be extended to dynamic hypergraphs and dynamic graphs/hypergraphs with unstructured data living on vertices and edges.

Data Analysis↗
DOE OSTI2017

Nuclear Computational Low Energy Initiative (NUCLEI)

This is the Final Report for Ohio State University for the NUCLEI SciDAC­3 project. In addition to the local OSU summary given here, we have attached a global NUCLEI summary and a list of papers and talks by the full collaboration, with OSU contributions marked in red. The NUCLEI project, as defined by the scope of work, developed, implemented and ran codes for large­scale computations of many topics in low­energy nuclear physics. Physics studied included the properties of nuclei and nuclear decays, nuclear structure and reactions, and the properties of nuclear matter. The computational techniques used included Quantum Monte Carlo, Configuration Interaction, Coupled Cluster, In­Medium SRG, and Density Functional methods. The research program emphasized areas of high interest to current and possible future DOE nuclear physics facilities, including ATLAS and FRIB (nuclear structure and reactions, and nuclear astrophysics), TJNAF (neutron distributions in nuclei, few body systems, and electroweak processes), NIF (thermonuclear reactions), MAJORANA and FNPB (neutrinoless double­beta decay and physics beyond the Standard Model), and LANSCE (fission studies). Research at Ohio State University played an integral role in NUCLEI by providing input microscopic interactions and operators needed for ab initio structure and reaction calculations including uncertainty quantification, independent ab initio calculations using the in­medium similarity renormalization group (IM­SRG), and developing microscopic constraints for the next­generation energy density functionals (EDF). Much of the theoretical work at OSU was closely coordinated with the theory team at Michigan State University. Although the OSU group did not usually directly develop codes for the highest performance computing components of NUCLEI, we provided needed inputs for much of the effort. In particular, our work contributes to the “Validated Nuclear Interactions” task as well as to both of the “Structure and Reactions” tasks.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Integrating subsystem embedding subalgebras and coupled cluster Green’s function: a theoretical foundation for quantum embedding in excitation manifold

Here, in this study, we introduce a novel approach to coupled-cluster Green's function (CCGF) embedding by seamlessly integrating conventional CCGF theory with the state-of-the-art sub-system embedding sub-algebras coupled cluster (SES-CC) formalism. This integration focuses primarily on delineating the characteristics of the sub-system and the corresponding segments of the Green's function, defined explicitly by active orbitals. Crucially, our work involves the adaptation of the SES-CC paradigm, addressing the left eigenvalue problem through a distinct form of Hamiltonian similarity transformation. This advancement not only facilitates a comprehensive representation of the interaction between the embedded sub-system and its surrounding environment but also paves the way for the quantum mechanical description of multiple embedded domains, particularly by employing the emergent quantum flow algorithms. Our theoretical underpinnings further set the stage for a generalization to multiple embedded sub-systems. This expansion holds significant promise for the exploration and application of non-equilibrium quantum systems, enhancing the understanding of system–environment interactions. In doing so, the research underscores the potential of SES-CC embedding within the realm of quantum computations and multi-scale simulations, promising a good balance between accuracy and computational efficiency.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1979

Atmospheric effects on cluster analyses

Ground reflected radiance, from which information is extracted through techniques of cluster analyses for remote sensing application, is altered by the atmosphere when it reaches the satellite. Therefore it is essential to understand the effects of the atmosphere on Landsat measurements, cluster characteristics and analysis accuracy. A doubling model is employed to compute the effective reflectivity, observed from the satellite, as a function of ground reflectivity, solar zenith angle and aerosol optical thickness for standard atmosphere. The relation between the effective reflectivity and ground reflectivity is approximately linear. It is shown that for a horizontally homogeneous atmosphere, the classification statistics from a maximum likelihood classifier remains unchanged under these transforms. If inhomogeneity is present, the divergence between clusters is reduced, and correlation between spectral bands increases. Radiance reflected by the background area surrounding the target may also reach the satellite. The influence of background reflectivity on effective reflectivity is discussed.

Kiang, R. K.↗
DOE OSTI2018

Multivariate network traffic analysis using clustered patterns

Traffic analysis is a core element in network operations and management for various purposes including change detection, traffic prediction, and anomaly detection. In this paper, we introduce a new approach to online traffic analysis based on a pattern-based representation for high-level summarization of the traffic measurement data. Unlike the past online analysis techniques limited to a single variable to summarize (e.g., sketch), the focus of this study is on capturing the network state from the multivariate attributes under consideration. To this end, we employ clustering with its benefit of the aggregation of multidimensional variables. The clustered result represents the state of the network with regard to the monitored variables, which can also be compared with the observed patterns from previous time windows enabling intuitive analysis. Finally, we demonstrate the proposed method with two popular use cases, one for estimating state changes and the other for identifying anomalous states, to confirm its feasibility. Our extensive experimental results with public traces and collected monitoring measurements from ESnet traffic traces show that our pattern-based approach is effective for multivariate analysis of online network traffic with visual and quantitative tools.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Neural Network for Principle of Least Action

The principle of least action is the cornerstone of classical mechanics, theory of relativity, quantum mechanics, and thermodynamics. Here, we describe how a neural network (NN) learns to find the trajectory for a Lennard-Jones (LJ) system that maintains balance in minimizing the Onsager–Machlup (OM) action and maintaining the energy conservation. The phase-space trajectory thus calculated is in excellent agreement with the corresponding results from the “ground-truth” molecular dynamics (MD) simulation. Furthermore, we show that the NN can easily find structural transformation pathways for LJ clusters, for example, the basin-hopping transformation of an LJ 38 from an incomplete Mackay icosahedron to a truncated face-centered cubic octahedron. Unlike MD, the NN computes atomic trajectories over the entire temporal domain in one fell swoop, and the NN time step is a factor of 20 larger than the MD time step. The NN approach to OM action is quite general and can be adapted to model morphometrics in a variety of applications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2017

Cluster Dynamics Modeling with Bubble Nucleation, Growth and Coalescence

The topic of this communication pertains to defect formation in irradiated solids such as plasma-facing tungsten submitted to helium implantation in fusion reactor com- ponents, and nuclear fuel (metal and oxides) submitted to volatile ssion product generation in nuclear reactors. The purpose of this progress report is to describe ef- forts towards addressing the prediction of long-time evolution of defects via continuum cluster dynamics simulation. The di culties are twofold. First, realistic, long-time dynamics in reactor conditions leads to a non-dilute di usion regime which is not accommodated by the prevailing dilute, stressless cluster dynamics theory. Second, long-time dynamics calls for a large set of species (ideally an in nite set) to capture all possible emerging defects, and this represents a computational bottleneck. Extensions beyond the dilute limit is a signi cant undertaking since no model has been advanced to extend cluster dynamics to non-dilute, deformable conditions. Here our proposed approach to model the non-dilute limit is to monitor the appearance of a spatially localized void volume fraction in the solid matrix with a bell shape pro le and insert an explicit geometrical bubble onto the support of the bell function. The newly cre- ated internal moving boundary provides the means to account for the interfacial ux of mobile species into the bubble, and the growth of bubbles allows for coalescence phenomena which captures highly non-dilute interactions. We present a preliminary interfacial kinematic model with associated interfacial di usion transport to follow the evolution of the bubble in any number of spatial dimensions and any number of bubbles, which can be further extended to include a deformation theory. Finally we comment on a computational front-tracking method to be used in conjunction with conventional cluster dynamics simulations in the non-dilute model proposed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2016

OpenSHMEM Implementation of IOR Benchmark

The benchmarking effort within the Computational Research & Development Programs at the Oak Ridge National Laboratory (ORNL) seeks to design and enable High Performance Computing (HPC) benchmarks and test suites. The work described in this report is a part of the effort focusing on the comparison and analysis of OpenSHMEM implementations using the Interleave Or Random (IOR) software for benchmarking parallel file system using POSIX, MPIIO, or HDF5 interfaces. We describe the effort to emulate the MPIIO parallel collective capabilities in the IOR benchmark using OpenSHMEM communication. One development effort was in emulating the MPI derived datatype used in the read/write operations and in setting the file view. Another effort was in implementing an internal cache in OpenSHMEM distributed shared memory to facilitate global collective I/O operations. Experiments comparing collective I/O in MPIIO implementations with the OpenSHMEM implementations were performed on the SGI Turing Cluster and the Cray XK7 Titan supercomputer at the Oak Ridge Leadership Computing Facility (OLCF). The preliminary results suggest that on the Cray XK7 Titan, the MPIIO implementations obtained higher write performance and the OpenSHMEM version obtained slightly higher read performance. On the SGI Turing Cluster, the MPIIO implementations obtained slightly higher performance over the OpenSHMEM implementations on large files.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Neural Network Water Model Based on the MB-Pol Many-Body Potential

The MB-pol many-body potential accurately predicts many properties of water, including cluster, liquid phase, and vapor–liquid equilibrium properties, but its high computational cost can make applying it in large-scale simulations quite challenging. Here, in order to address this limitation, we developed a “deep potential” neural network (DPMD) model based on the MB-pol potential for water. We find that a DPMD model trained on mostly liquid configurations yields a good description of the bulk liquid phase but severely underpredicts vapor–liquid coexistence densities. By contrast, adding cluster configurations to the neural network training set leads to a good agreement for the vapor coexistence densities. Liquid phase densities under supercooled conditions are also represented well, even though they were not included in the training set. These results confirm that neural network models can combine accuracy and transferability if sufficient attention is given to the construction of a representative training set for the target system.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2018

Revealing micro-asperity rupture through finite source inversion

Laboratory studies of acoustic emission events with seismic signatures have used the point source assumption. Given the millimeter-scale size and clustering of the asperities and the centimeter-scale distances to the sensors, the records can convey information about the source complexity that is not fully revealed in a point source inversion. We develop a finite source inversion technique following Hartzell and Heaton, 1983 to compute the spatiotemporal distribution of slip during rupture of asperities and asperity clusters. First inversions of purely synthetic signals reveal some of the applicability and limitations of the algorithm. A preliminary inversion of one recorded event is included for demonstration. With much further sensitivity analysis and modeling improvements, the resulting slip profiles will provide a new tool for understanding the frictional strength and rupture behaviors of self-similar rough-rough interfaces at any scale.

Parker, JM↗
DOE OSTI2020

Accurate prediction of core-level spectra of radicals at density functional theory cost via square gradient minimization and recoupling of mixed configurations

State-specific orbital optimized approaches are more accurate at predicting core-level spectra than traditional linear-response protocols, but their utility had been restricted due to the risk of "variational collapse" down to the ground state. We employ the recently developed square gradient minimization algorithm to reliably avoid variational collapse and study the effectiveness of orbital optimized density functional theory (DFT) at predicting second period element 1s core-level spectra of open-shell systems. Several density functionals (including SCAN, B3LYP, and ωB97X-D3) are found to predict excitation energies from the core to singly occupied levels with high accuracy (≤0.3 eV RMS error) against available experimental data. Higher excited states are, however, more challenging by virtue of being intrinsically multiconfigurational. We thus present a configuration interaction inspired route to self-consistently recouple single determinant mixed configurations obtained from DFT, in order to obtain approximate doublet states. This recoupling scheme is used to predict the C K-edge spectra of the allyl radical, the O K-edge spectra of CO + , and the N K-edge of NO 2 with high accuracy relative to experiment, indicating substantial promise in using this approach for the computation of core-level spectra for doublet species [vs more traditional time dependent DFT, equation of motion coupled cluster singles and doubles (EOM-CCSD), or using unrecoupled mixed configurations]. Finally, we also present general guidelines for computing core-excited states from orbital optimized DFT.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1995

Visualization of unsteady computational fluid dynamics

The current computing environment that most researchers are using for the calculation of 3D unsteady Computational Fluid Dynamic (CFD) results is a super-computer class machine. The Massively Parallel Processors (MPP's) such as the 160 node IBM SP2 at NAS and clusters of workstations acting as a single MPP (like NAS's SGI Power-Challenge array) provide the required computation bandwidth for CFD calculations of transient problems. Work is in progress on a set of software tools designed specifically to address visualizing 3D unsteady CFD results in these super-computer-like environments. The visualization is concurrently executed with the CFD solver. The parallel version of Visual3, pV3 required splitting up the unsteady visualization task to allow execution across a network of workstation(s) and compute servers. In this computing model, the network is almost always the bottleneck so much of the effort involved techniques to reduce the size of the data transferred between machines.

Haimes, Robert↗