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,243 records · Page 69
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Continuous-variable quantum computation of the O(3) model in 1+1 dimensions

We formulate the $O(3)$ non-linear sigma model in $1+1$ dimensions as a limit of a three-component scalar field theory restricted to the unit sphere in the large squeezing limit. This allows us to describe the model in terms of the continuous variable (CV) approach to quantum computing. Here we construct the ground state and excited states using the coupled cluster ansatz and find excellent agreement with the exact diagonalization results for a small number of lattice sites. We then present the simulation protocol for the time evolution of the model using CV gates, estimate the discretization error, and present numerical results obtained from a photonic quantum simulator. We expect that the methods developed in this work will be useful for exploring interesting dynamics for a wide class of sigma models and gauge theories, as well as for simulating scattering events on quantum hardware in the coming decade.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Rapid subsurface analysis of frequency-domain thermoreflectance images with K-means clustering

K-means clustering analysis is applied to frequency-domain thermoreflectance (FDTR) hyperspectral image data to rapidly screen the spatial distribution of thermophysical properties at material interfaces. Performing FDTR while raster scanning a sample consisting of 8.6 μm of doped-silicon (Si) bonded to a doped-Si substrate identifies spatial variation in the subsurface bond quality. Routine thermal analysis at select pixels quantifies this variation in bond quality and allows assignment of bonded, partially bonded, and unbonded regions. Performing this same routine thermal analysis across the entire map, however, becomes too computationally demanding for rapid screening of bond quality. To address this, K-means clustering was used to reduce the dimensionality of the dataset from more than 20 000 pixel spectra to just K = 3 component spectra. The three component spectra were then used to express every pixel in the image through a least-squares minimized linear combination providing continuous interpolation between the components across spatially varying features, e.g., bonded to unbonded transition regions. Fitting the component spectra to the thermal model, thermal properties for each K cluster are extracted and then distributed according to the weighting established by the regressed linear combination. Thermophysical property maps are then constructed and capture significant variation in bond quality over 25 μm length scales. The use of K-means clustering to achieve these thermal property maps results in a 74-fold speed improvement over explicit fitting of every pixel.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Ab Initio Computation of the Longitudinal Response Function in 40 Ca

In this work, we present a consistent ab initio computation of the longitudinal response function RL in 40 Ca using the coupled-cluster and Lorentz integral transform methods starting from chiral nucleon-nucleon and three-nucleon interactions. We validate our approach by comparing our results for R L in 4 He and the Coulomb sum rule in 40 Ca against experimental data and other calculations. For R L in 40 Ca we obtain a very good agreement with experiment in the quasielastic peak up to intermediate momentum transfers, and we find that final state interactions are essential for an accurate description of the data. This work presents a milestone towards ab initio computations of neutrino-nucleus cross sections relevant for experimental long-baseline neutrino programs.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2017

An approach to online network monitoring using clustered patterns

Network traffic monitoring is a core element in network operations and management for various purposes such as anomaly detection, change detection, and fault/failure detection. In this study, we introduce a new approach to online monitoring using a pattern-based representation of the network traffic. Unlike the past online 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 previously observed patterns visually and quantitatively. 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.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Productive Programming of Distributed Systems with the SHAD C++ Library

High-performance computing (HPC) is often perceived as a matter of making large-scale systems (e.g., clusters) run as fast as possible, regardless the required programming effort. However, the idea of "bringing HPC to the masses" has recently emerged. Inspired by this vision, we have designed SHAD, the Scalable High-performance Algorithms and Data-structures library. SHAD is open source software, written in C++, for C++ developers. Unlike other HPC libraries for distributed systems, which rely on SPMD models, SHAD adopts a shared-memory programming abstraction, to make C++ programmers feel at home. Underneath, SHAD manages tasking and data-movements, moving the computation where data resides and taking advantage of asynchrony to tolerate network latency. At the bottom of his stack, SHAD can interface with multiple runtime systems: this not only improves developer’s productivity, by hiding the complexity of such software and of the underlying hardware, but also greatly enhance code portability. Thanks to its abstraction layers, SHAD can indeed target different systems, ranging from laptops to HPC clusters, without any need for modifying the user-level code. We have prototyped and open-sourced the implementation of (a subset of) the C++ standard library (STL) targeting multi-node HPC clusters. Our work allows plain STL-based C++ code to scale on HPC systems, with no need for rewriting the code to exploit the complex hardware. SHAD is available under Apache v2 License at https://github.com/pnnl/SHAD. In this paper we overview the design of the SHAD library, depicting its main components: runtime systems abstractions for tasking; parallel and distributed data-structures; STL-compliant interfaces and algorithms.

Castellana, Vito G.↗
DOE OSTI2024

Sachdev-Ye-Kitaev model on a noisy quantum computer

Here we study the SYK model -- an important toy model for quantum gravity on IBM's superconducting qubit quantum computers. By using a graph-coloring algorithm to minimize the number of commuting clusters of terms in the qubitized Hamiltonian, we find the gate complexity of the time evolution using the first-order product formula for N Majorana fermions is $\mathscr{O}$(N 5 J 2 t 2 /ε) where J is the dimensionful coupling parameter, t is the evolution time, and ε is the desired precision. With this improved resource requirement, we perform the time evolution for N=6,8 with maximum two-qubit circuit depth of 343. We perform different error mitigation schemes on the noisy hardware results and find good agreement with the exact diagonalization results on classical computers and noiseless simulators. In particular, we compute return probability after time t and out-of-time order correlators (OTOC) which is a standard observable of quantifying the chaotic nature of quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

xSDK: Building an ecosystem of highly efficient math libraries for exascale

Current efforts to build increasingly powerful computer architectures are opening up new avenues for more complex and higher fidelity simulations coupled with data analytics and learning, leading to new scientific insights and deeper understanding. At one extreme, exascale computers will be much faster than previous computer generations (performing 10 18 operations per second—that is, 1,000 times faster than petascale). To achieve these performance improvements, computer architectures are becoming increasingly complex, with deep memory hierarchies, very high node and core counts, and heterogeneous features such as graphics processing units (GPUs). Such architectural changes impact the full breadth of computing scales, as heterogeneity pervades even current-generation laptops, workstations, and moderate-sized clusters. While emerging advanced architectures provide unprecedented opportunities, they also present significant challenges for developers of scientific applications, such as multiphysics and multiscale codes, who must adapt their software to handle disruptive changes in architectures and new programming models that have not yet stabilized. Developers must consider increasing concurrency while reducing communication and synchronization, and other complexities such as the potential for using mixed precision to leverage the compute power available in low-precision tensor cores. On one hand, developers must implement new scientific capabilities, which in turn increase code complexity. On the other hand, the codes must be ported to new architectures, requiring the inclusion of new programming models and the restructuring of code to achieve good performance. Addressing these issues is beyond the capability of any single person or team—leading to the need for collaboration among many teams, who encapsulate their expertise in reusable software and work together to create sustainable software ecosystems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Identification of stable adsorption sites and diffusion paths on nanocluster surfaces: an automated scanning algorithm

The diverse coordination environments on the surfaces of discrete, three-dimensional (3D) nanoclusters contribute significantly to their unique catalytic properties. Identifying the numerous adsorption sites and diffusion paths on these clusters is however tedious and time-consuming, especially for large, asymmetric nanoclusters. Here, we present a simple, automated method for constructing approximate 2D potential energy surfaces for the adsorption of atomic species on the surfaces of 3D nanoclusters with minimal human intervention. These potential energy surfaces fully characterize the important adsorption sites and diffusion paths on the nanocluster surfaces with accuracies similar to current approaches and at comparable computational cost. Our method can treat complex nanoclusters, such as alloy nanoclusters, and accounts for cluster relaxation and adsorbate-induced reconstruction, important for obtaining accurate energetics. Moreover, its highly parallelizable nature is ideal for modern supercomputer architectures. We showcase our method using two clusters: Au 18 and Pt 55 . For Au 18 , diffusion of atomic hydrogen between the most stable sites occurs via non-intuitive paths, underlining the necessity of exploring the complete potential energy surface. By enabling the rapid and unbiased assessment of adsorption and diffusion on large, complex nanoclusters, which are particularly difficult to handle manually, our method will help advance materials discovery and the rational design of catalysts.

36 MATERIALS SCIENCE↗
DOE OSTI2021

I-GCN: A Graph Convolutional Network Accelerator with Runtime Locality Enhancement through Islandization

In this paper, we propose a novel hardware accelerator for GCN inference called I-GCN that significantly improves data locality and reduces unnecessary computation through a new online graph restructuring algorithm we refer to as islandization. The proposed algorithm finds clusters of nodes with strong internal but weak external connections. The islandization process yields two major benefits. First, by processing islands rather than individual nodes, there is better on-chip data reuse and fewer off-chip memory accesses. Second, there is less redundant computation as aggregation for common/shared neighbors in an island can be reused. The parallel search, identification, and leverage of graph islands are all handled purely in hardware at runtime working in an incremental pipelined manner. This is done without any preprocessing of the graph data or adjustment of the GCN model structure.

Geng, Tong↗
DOE OSTI2016

ASA-FTL: An adaptive separation aware flash translation layer for solid state drives

Here, the flash-memory based Solid State Drive (SSD) presents a promising storage solution for increasingly critical data-intensive applications due to its low latency (high throughput), high bandwidth, and low power consumption. Within an SSD, its Flash Translation Layer (FTL) is responsible for exposing the SSD’s flash memory storage to the computer system as a simple block device. The FTL design is one of the dominant factors determining an SSD’s lifespan and performance. To reduce the garbage collection overhead and deliver better performance, we propose a new, low-cost, adaptive separation-aware flash translation layer (ASA-FTL) that combines sampling, data clustering and selective caching of recency information to accurately identify and separate hot/cold data while incurring minimal overhead. We use sampling for light-weight identification of separation criteria, and our dedicated selective caching mechanism is designed to save the limited RAM resource in contemporary SSDs. Using simulations of ASA-FTL with both real-world and synthetic workloads, we have shown that our proposed approach reduces the garbage collection overhead by up to 28% and the overall response time by 15% compared to one of the most advanced existing FTLs. We find that the data clustering using a small sample size provides significant performance benefit while only incurring a very small computation and memory cost. In addition, our evaluation shows that ASA-FTL is able to adapt to the changes in the access pattern of workloads, which is a major advantage comparing to existing fixed data separation methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

An Effective Collaborative Mobile Weighted Clustering Schemes for Energy Balancing in Wireless Sensor Networks

Collaborative strategies for mobile sensor nodes ensure the efficiency and the robustness of data processing, while limiting the required communication bandwidth. In order to solve the problem of pipeline inspection and oil leakage monitoring, a collaborative weighted mobile sensing scheme is proposed. By adopting a weighted mobile sensing scheme, the adaptive collaborative clustering protocol can realize an even distribution of energy load among the mobile sensor nodes in each round, and make the best use of battery energy. A detailed theoretical analysis and experimental results revealed that the proposed protocol is an energy efficient collaborative strategy such that the sensor nodes can communicate with a fusion center and produce high power gain.

42 ENGINEERING↗
DOE OSTI2013

Scalable Prediction of Energy Consumption using Incremental Time Series Clustering

Time series datasets are a canonical form of high velocity Big Data, and often generated by pervasive sensors, such as found in smart infrastructure. Performing predictive analytics on time series data can be computationally complex, and requires approximation techniques. In this paper, we motivate this problem using a real application from the smart grid domain. We propose an incremental clustering technique, along with a novel affinity score for determining cluster similarity, which help reduce the prediction error for cumulative time series within a cluster. We evaluate this technique, along with optimizations, using real datasets from smart meters, totaling ~700,000 data points, and show the efficacy of our techniques in improving the prediction error of time series data within polynomial time.

Simmhan, Yogesh↗
DOE OSTI2021

Conservation laws in coupled cluster dynamics at finite temperature

We extend the finite-temperature Keldysh non-equilibrium coupled cluster theory (Keldysh-CC) [A. F. White and G. K.-L. Chan, J. Chem. Theory Comput. 15, 6137–6253 (2019)] to include a time-dependent orbital basis. When chosen to minimize the action, such a basis restores local and global conservation laws (Ehrenfest’s theorem) for all one-particle properties while remaining energy conserving for time independent Hamiltonians. We present the time-dependent Keldysh orbital-optimized coupled cluster doubles method in analogy with the formalism for zero-temperature dynamics, extended to finite temperatures through the time-dependent action on the Keldysh contour. To demonstrate the conservation property and understand the numerical performance of the method, we apply it to several problems of nonequilibrium finite-temperature dynamics: a 1D Hubbard model with a time-dependent Peierls phase, laser driving of molecular H2, driven dynamics in warm-dense silicon, and transport in the single impurity Anderson model.

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

Structural evolution of small ruthenium cluster anions

The structures of ruthenium cluster anions have been investigated using a combination of trapped ion electron diffraction and density functional theory computations in the size range from eight to twenty atoms. In this size range, three different structural motifs are found: Ru{sub 8}{sup −}–Ru{sub 12}{sup −} have simple cubic structures, Ru{sub 13}{sup −}–Ru{sub 16}{sup −} form double layered hexagonal structures, and larger clusters form close packed motifs. For Ru{sub 17}{sup −}, we find hexagonal close packed stacking, whereas octahedral structures occur for Ru{sub 18}{sup −}–Ru{sub 20}{sup −}. Our calculations also predict simple cubic structures for the smaller clusters Ru{sub 4}{sup −}–Ru{sub 7}{sup −}, which were not accessible to electron diffraction measurements.

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

The dynamical state of RXCJ1230.7+3439: A multi-substructured merging galaxy cluster

We analyse the kinematical and dynamical state of the galaxy cluster RXCJ1230.7+3439 (RXCJ1230), at $z$ = 0.332 using 93 new spectroscopic redshifts of galaxies acquired at the Telescopio Nazionale Galileo and from SDSS DR16 public data. We study the density galaxy distribution retrieved from photometric SDSS multiband data and find that RXCJ1230 appears as a clearly isolated peak in the redshift space, with a global line-of-sight (LOS) velocity dispersion of $σ$ v = 1004 -122 +147 km s -1 . Several tests applied to the spatial and velocity distributions reveal that RXCJ1230 is a complex system with the presence of three subclusters, located to the southwest, east, and south with respect to the main body of the cluster, containing several bright galaxies (BGs) in their respective cores. Our analyses confirm that the three substructures are in a pre-merger phase, where the main interaction takes place with the southwest subclump, almost in the plane of the sky. We compute a velocity dispersion of $σ$ v ~ 1000 and $σ$ v ~ 800 km s -1 for the main cluster and the southwest substructure, respectively. The central main body and southwest substructure differ by ~870 km s -1 in the LOS velocity. From these data, we estimate a dynamical mass of $M$ 200 = 9.0 ± 1.5 × 1014 $M$ ⊙ and 4.4 ± 3.3 × 1014 $M$ ⊙ for the RXCJ1230 main body and southwest clump, respectively, which reveals that the cluster will undergo a merger characterised by a 2:1 mass ratio impact. We solve a two-body problem for this interaction and find that the most likely solution suggests that the merging axis lies ~17° from the plane of the sky and the subcluster will fully interact in ~0.3 Gyr. However, a slight excess in the X-ray temperature observed in the southwest clump confirms a certain degree of interaction already. The comparison between the dynamical masses and those derived from X-ray data reveals good agreement within errors (differences ~15%), which suggests that the innermost regions (< r 500 ) of the galaxy clumps are almost in hydrostatical equilibrium. In summary, RXCJ1230 is a young but also massive cluster in a pre-merging phase accreting other galaxy systems from its environment.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Efficient Parameterization of Density Functional Tight-Binding for 5 f -Elements: A Th–O Case Study

Density functional tight binding (DFTB) models for f-element species are challenging to parametrize owing to the large number of adjustable parameters. The explicit optimization of the terms entering the semiempirical DFTB Hamiltonian related to f orbitals is crucial to generating a reliable parametrization for f-block elements, because they play import roles in bonding interactions. However, since the number of parameters grows quadratically with the number of orbitals, the computational cost for parameter optimization is much more expensive for the f-elements than for the main group elements. In this work we present a set of efficient approaches for mitigating the hurdle imposed by the large size of the parameter space. A novel group-by-orbital correction functions for two-center bond integrals was developed. With this approach the number of parameters is reduced, and it grows linearly with the number of elements, maintaining the accuracy and the number of parameters, in the case of f elements, by more than 40%. The parameter optimization step was accelerated by means of the mini-batch BFGS method. This method allows parameter optimizations with much larger training sets than other single batch methods. A stochastic optimizer was employed that helped overcome shallow local minima in the objective function. The proposed algorithm was used to parametrize the DFTB Hamiltonian for the Th–O system, which was subsequently applied to the study of ThO 2 nanoparticles. The training set consisted of 6322 unique structures, which is barely feasible with conventional optimization methods. The optimized parameter set, LANL-ThO, displays good agreement with DFT-calculated properties such as energies, forces, and structures for both clusters and bulk ThO 2 . Benefiting from the fewer number of parameters and lower computational costs for objective function evaluations, this new approach shows its potential applications in DFTB parametrization for elements with high angular momentum, which present a challenge to conventional methods.

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

National Computational Infrastructure for LatticeGauge Theory SciDAC-2 Closeout Report

As part of the reliability project work, researchers from Vanderbilt University, Fermi National Laboratory and Illinois Institute of technology developed a real-time cluster fault-tolerant cluster monitoring framework. The goal for the scientific workflow project is to investigate and develop domain-specific workflow tools for LQCD to help effectively orchestrate, in parallel, computational campaigns consisting of many loosely-coupled batch processing jobs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A dynamic parameterization of sulfuric acid–dimethylamine nucleation and its application in three-dimensional modeling

Sulfuric acid (SA) is a governing gaseous precursor for atmospheric new particle formation (NPF), a major source of global ultrafine particles, in environments studied around the world. In polluted urban atmospheres with high condensation sinks (CSs), the formation of stable SA–amine clusters, such as SA–dimethylamine (DMA) clusters, usually initializes intense NPF events. Coagulation scavenging and cluster evaporation are dominant sink processes of SA–amine clusters in urban atmospheres, yet these loss processes are not quantitatively included in the present parameterizations of SA–amine nucleation. We herein report a parameterization of SA–DMA nucleation, based on cluster dynamic simulations and quantum chemistry calculations, with certain simplifications to greatly reduce the computational costs. Compared with previous SA–DMA nucleation parameterizations, this new parameterization was able to reproduce the dependences of particle formation rates on temperature and CSs. We then incorporated it in a three-dimensional (3-D) chemical transport model to simulate the evolution of the particle number size distributions. Simulation results showed good consistency with the observations in the occurrence of NPF events and particle number size distributions in wintertime Beijing and represented a significant improvement compared to that using a parameterization without coagulation scavenging. Quantitative analysis shows that SA–DMA nucleation contributes significantly to nucleation rates and aerosol population during the 3-D simulations in Beijing (>99 % and >60 %, respectively). These results broaden the understanding of NPF in urban atmospheres and stress the necessity of including the effects of coagulation scavenging and cluster stability in simulating SA–DMA nucleation in 3-D simulations. Representing these processes is thus likely to improve model performance in particle source apportionment and quantification of aerosol effects on air quality, human health, and climate.

Li, Yuyang↗