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,135 records · Page 63
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Linear-scaling quadruple excitations in local pair natural orbital coupled-cluster theory

Here, we present a fast, asymptotically linear-scaling implementation of the perturbative quadruples energy correction in coupled-cluster theory using local natural orbitals. Our work follows the domain-based local pair natural orbital (DLPNO) approach previously applied to lower levels of excitations in coupled-cluster theory. Our DLPNO-CCSDT(Q) algorithm uses converged doubles and triples amplitudes from a preceding DLPNO-CCSDT computation to compute the quadruples amplitude and energy in the quadruples natural orbital (QNO) basis. We demonstrate the compactness of the QNO space, showing that more than 95% of the (Q) correction can be recovered using relatively loose natural orbital cutoffs, compared to the tighter cutoffs used in pair and triples natural orbitals at lower levels of coupled-cluster theory. We also highlight the accuracy of our algorithm in the computation of relative energies, which yields deviations of sub-kJ mol −1 in relative energy compared to the canonical CCSDT(Q). Timings are conducted on a series of growing linear alkanes (up to 10 carbons and 608 basis functions) and water clusters (up to 49 water molecules and 2842 basis functions) to establish the asymptotic linear-scaling of our DLPNO-(Q) algorithm.

Auxiliary functions↗
DOE OSTI2018

Detecting Anomalies from End-to-End Internet Performance Measurements (PingER) Using Cluster Based Local Outlier Factor

PingER (Ping End-to-End Reporting) is a worldwide end-to-end Internet performance measurement framework. It was developed by the SLAC National Accelerator Laboratory, Stanford, USA and running from the last 20 years. It has more than 700 monitoring agents and remote sites which monitor the performance of Internet links around 170 countries of the world. At present, the size of the compressed PingER data set is about 60 GB comprising of 100,000 flat files. The data is publicly available for valuable Internet performance analyses. However, the data sets suffer from missing values and anomalies due to congestion, bottleneck links, queuing overflow, network software misconfiguration, hardware failure, cable cuts, and social upheavals. Therefore, the objective of this paper is to detect such performance drops or spikes labeled as anomalies or outliers for the PingER data set. In the proposed approach, the raw text files of the data set are transformed into a PingER dimensional model. The missing values are imputed using the k-NN algorithm. The data is partitioned into similar instances using the k-means clustering algorithm. Afterward, clustering is integrated with the Local Outlier Factor (LOF) using the Cluster Based Local Outlier Factor (CBLOF) algorithm to detect the anomalies or outliers from the PingER data. Lastly, anomalies are further analyzed to identify the time frame and location of the hosts generating the major percentage of the anomalies in the PingER data set ranging from 1998 to 2016.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Clustering VoIP caller for SPIT identification

Abstract The number of unsolicited and advertisement telephony calls over traditional and Internet telephony has rapidly increased over recent few years. Every year, the telecommunication regulators, law enforcement agencies and telecommunication operators receive a very large number of complaints against these unsolicited, unwanted calls. These unwanted calls not only bring financial loss to the users of the telephony but also annoy them with unwanted ringing alerts. Therefore, it is important for the operators to block telephony spammers at the edge of the network so to gain trust of their customers. In this paper, we propose a novel spam detection system by incorporating different social network features for combating unwanted callers at the edge of the network. To this extent the reputation of each caller is computed by processing call detailed records of user using three social network features that are the frequency of the calls between caller and the callee, the duration between caller and the callee and the number of outgoing partners associated with the caller. Once the reputation of the caller is computed, the caller is then places in a spam and non‐spam clusters using unsupervised machine learning. The performance of the proposed approach is evaluated using a synthetic dataset generated by simulating the social behaviour of the spammers and the non‐spammers. The evaluation results reveal that the proposed approach is highly effective in blocking spammer with 2% false positive rate under a large number of spammers. Moreover, the proposed approach does not require any change in the underlying VoIP network architecture, and also does not introduce any additional signalling delay in a call set‐up phase. Copyright © 2016 John Wiley & Sons, Ltd.

Azad, Muhammad Ajmal↗
DOE OSTI2021

Photoelectron Spectroscopic and ab Initio Computational Studies of the Anion, HThO –

The synergetic combination of anion photoelectron spectroscopy and high-level relativistic coupled-cluster calculations was employed to study the anion, HThO-. The atomic connectivity of this anion was found to be HThO- and not ThOH-. Vibrational and electronic energy spacings in the HThO- photoelectron spectrum were measured and calculated, with good agreement between them being found. Computations yielded electronic energies and equilibrium structures as well as enabling orbital analyses. The adiabatic electron affinity of HThO was determined to be 1.297 ± 0.035 eV.

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

MemXCT: Design, Optimization, Scaling, and Reproducibility of X-Ray Tomography Imaging

Here, this work extends our previous research entitled "MemXCT: Memory-centric X-ray CT Reconstruction with Massive Parallelization" that was originally published at SC19 conference (Hidayetoglu et al., 2019) with reproducibility of the computational imaging performance. X-ray computed tomography (XCT) is regularly used at synchrotron light sources to study the internal morphology of materials at high resolution. However, experimental constraints, such as radiation sensitivity, can result in noisy or undersampled measurements. Further, depending on the resolution, sample size and data acquisition rates, the resulting noisy dataset can be in the order of terabytes. Advanced iterative reconstruction techniques can produce high-quality images from noisy measurements, but their computational requirements have made their use an exception rather than the rule. We propose a novel memory-centric approach that avoids redundant computations at the expense of additional memory complexity. We develop a memory-centric iterative reconstruction system, MemXCT, that uses an optimized SpMV implementation with two-level pseudo-Hilbert ordering and multi-stage input buffering. We evaluate MemXCT on various supercomputer architectures involving KNL and GPU. MemXCT can reconstruct a large (11Kx11K) mouse brain tomogram in 10 seconds using 4096 KNL nodes (256K cores). The results presented in our original article at the SC19 were based on large-scale supercomputing resources. The MemXCT application was selected for the Student Cluster Competition (SCC) Reproducibility Challenge and evaluated on a variety of cloud computing resources by universities around the world in the SC20 conference. We summarize the results of the top-ranked SCC Reproducibility Challenge teams and identify the most pertinent measures for ensuring the reproducibility of our experiments in this article.

47 OTHER INSTRUMENTATION↗
DOE OSTI2020

Interpreting the Operando XANES of Surface-Supported Subnanometer Clusters: When Fluxionality, Oxidation State, and Size Effect Fight.

X-ray absorption near edge structure (XANES) spectroscopy is widely used for operando catalyst characterization. We show that, for highly fluxional supported nanoclusters, the customary extraction of the oxidation state of the metal from the XANES data by fitting to the bulk standards is highly questionable. The XANES signatures as well as the apparent oxidation state for such clusters arise from a complex combination of many factors, and not only from the chemical composition in reaction conditions (e.g., oxygen content in oxidizing atmosphere). The thermally accessible isomerization and population of several structurally distinct cluster forms, cluster-support interaction, and intrinsic size effects all impact the metal oxidation state and XANES signal. We demonstrate this on copper oxide clusters with different compositions, Cu4Ox(x = 2-5) and Cu5Oy (y = 3, 5), deposited on amorphous alumina and ultrananocrystalline diamond, for which we computed the XANES spectra and compare the results to the experiment. We show in addition that fitting the experimental spectrum to calculated spectra of supported clusters can, in contrast, provide good agreement and insight into the spectrum-composition-structure relation. Experimental XANES interpreted using the proposed fitting scheme shows the partial reduction of Cu oxide clusters at rising temperatures, and pinpoints the specific stoichiometries that dominate in the ensemble of cluster states as the temperature changes.

Zandkarimi, Borna↗
DOE OSTI2024

Electromagnetic observables of open-shell nuclei from coupled-cluster theory

Here we develop a new method to describe electromagnetic observables of open-shell nuclei with two nucleons outside a closed shell. This approach combines the equation-of-motion coupled-cluster method for such systems and the Lorentz integral transform technique, expanding the applicability of coupled-cluster theory for electromagnetic observables beyond closed-(sub)shell nuclei. To validate this new approach, we compute the non-energy-weighted dipole sum rule and the dipole polarizability of 16,24 ⁢O in both the closed-(sub)shell and the new equation-of-motion coupled-cluster frameworks, finding agreement within error bars. We then analyze the evolution of the dipole polarizability along the oxygen and calcium isotopic chains. Our predictions agree well with available experimental data and other available theoretical calculations for the closed-(sub)shell 16,22 ⁢O and the open-shell 18 O. In the calcium isotopes, we observe that our dipole polarizability predictions for open-shell nuclei are lower than those of closed-(sub)shell nuclei. We expect that our predictions for 24 O and 54,56 ⁢Ca will motivate future experimental studies at the drip line.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2016

Thermodynamic stability and structural properties of cluster crystals formed by amphiphilic dendrimers

We pursue the goal of finding real-world examples of macromolecular aggregates that form cluster crystals, which have been predicted on the basis of coarse-grained, ultrasoft pair potentials belonging to a particular mathematical class [B. M. Mladek et al., Phys. Rev. Lett. 46, 045701 (2006)]. For this purpose, we examine in detail the phase behavior and structural properties of model amphiphilic dendrimers of the second generation by means of monomer-resolved computer simulations. On augmenting the density of these systems, a fluid comprised of clusters that contain several overlapping and penetrating macromolecules is spontaneously formed. Upon further compression of the system, a transition to multi-occupancy crystals takes place, the thermodynamic stability of which is demonstrated by means of free-energy calculations, and where the FCC is preferred over the BCC-phase. Contrary to predictions for coarse-grained theoretical models in which the particles interact exclusively by effective pair potentials, the internal degrees of freedom of these molecules cause the lattice constant to be density-dependent. Furthermore, the mechanical stability of monodisperse BCC and FCC cluster crystals is restricted to a bounded region in the plane of cluster occupation number versus density. The structural properties of the dendrimers in the dense crystals, including their overall sizes and the distribution of monomers are also thoroughly analyzed.

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

A Clustering-based biased Monte Carlo Approach to Protein Titration Curve Prediction

We develop and implement a novel approach to computing the ensemble averages in systems characterized by pair-wise interactions between the entities. Methods involving full enumeration of the configuration space result in exponential complexity. Sampling methods such as Markov Chain Monte Carlo (MCMC) algorithms have been proposed to tackle the exponential complexity of these problems. In certain scenarios where significant energetic coupling exists between the entities, the accuracy of the such algorithms can be diminished. We propose a strategy to improve the accuracy of the MCMC runs by taking advantage of the cluster structure in the interaction energy matrix. We propose two different schemes for performing the biased MCMC runs on the partitioned systems and show that they are valid MCMC schemes. We then apply these algorithms to the problem of computing the protonation fractions and hence the titration curves of titratable protein residues that constitute a given protein. We leverage both synthesized and real-world systems and show the improved performance of our biased MCMC methods when compared to the regular MCMC method.

Visweswara Sathanur, Arun↗
DOE OSTI2025

Monopole Fluctuations in Galaxy Surveys

Galaxy clustering provides a powerful way to probe cosmology. This requires understanding of the background mean density of galaxy samples, which is estimated from the survey itself by averaging the observed galaxy number density over the angular position. The angle average includes not only the background mean density but also the monopole fluctuation at each redshift. Here for the first time we compute the monopole fluctuations in galaxy surveys and investigate their impact on galaxy clustering. The monopole fluctuations vary as a function of redshift, and it is correlated with other fluctuations, affecting the two-point correlation function measurements. In an idealized all-sky survey, the rms fluctuation at z = 0.5 can be as large as 7% of the two-point correlation function in amplitude at the baryonic acoustic oscillation scale, and it becomes smaller than 1% at z > 2. The monopole fluctuations are unavoidable, but they can be modeled. We discuss its relation to the integral constraint and the implications for the galaxy clustering analysis.

Baryon acoustic oscillations↗
DOE OSTI2022

Netostat: analyzing dynamic flow patterns in high-speed networks

Understanding flow traffic patterns in networks, such as the Internet or service provider networks, is crucial to improving their design and building them robustly. However, as networks grow and become more complex, it is increasingly cumbersome and challenging to study how the many flow patterns, sizes and the continually changing source-destination pairs in the network evolve with time. Here, we present Netostat, a visualization-based network analysis tool that uses visual representation and a mathematics framework to study and capture flow patterns, using graph theoretical methods such as clustering, similarity and difference measures. Netostat generates an interactive graph of all traffic patterns in the network, to isolate key elements that can provide insights for traffic engineering. We present results for U.S. and European research networks, ESnet and GEANT, demonstrating network state changes, to identify major flow trends, potential points of failure, and bottlenecks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

The accuracies of effective interactions in downfolding coupled-cluster approaches for small-dimensionality active spaces

Here, this paper evaluates the accuracy of the Hermitian form of the downfolding procedure using the double unitary coupled cluster (DUCC) ansatz on the benchmark systems of linear chains of hydrogen atoms, H6 and H8. The computational infrastructure employs the occupation-number-representation codes to construct the matrix representation of arbitrary second-quantized operators, allowing for the exact representation of exponentials of various operators. The tests demonstrate that external amplitudes from standard single-reference coupled cluster methods that sufficiently describe external (out-of-active-space) correlations reliably parameterize the Hermitian downfolded effective Hamiltonians in the DUCC formalism. The results show that this approach can overcome the problems associated with losing the variational character of corresponding energies in the corresponding SR-CC theories.

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

Hyperspectral Image Classification Using Graph Clustering Methods

Hyperspectral imagery is a challenging modality due to the dimension of the pixels which can range from hundreds to over a thousand frequencies depending on the sensor. Most methods in the literature reduce the dimension of the data using a method such as principal component analysis, however this procedure can lose information. More recently methods have been developed to address classification of large datasets in high dimensions. This paper presents two classes of graph-based classification methods for hyperspectral imagery. Using the full dimensionality of the data, we consider a similarity graph based on pairwise comparisons of pixels. The graph is segmented using a pseudospectral algorithm for graph clustering that requires information about the eigenfunctions of the graph Laplacian but does not require computation of the full graph. We develop a parallel version of the Nyström extension method to randomly sample the graph to construct a low rank approximation of the graph Laplacian. With at most a few hundred eigenfunctions, we can implement the clustering method designed to solve a variational problem for a graph-cut-based semi-supervised or unsupervised classification problem. We implement OpenMP directive-based parallelism in our algorithms and show performance improvement and strong, almost ideal, scaling behavior. The method can handle very large datasets including a video sequence with over a million pixels, and the problem of segmenting a data set into a pre-determined number of classes.

47 OTHER INSTRUMENTATION↗
DOE OSTI2018

Parallel k-means Clustering of Geospatial Data Sets Using Manycore CPU Architectures

The increasing availability of high-resolution geospatiotemporal data sets from sources such as observatory networks, remote sensing platforms, and computational Earth system models has opened new possibilities for knowledge discovery and mining of weather, climate, ecological, and other geoscientific data sets fused from disparate sources. Many of the standard tools used on individual workstations are impractical for the analysis and synthesis of data sets of this size; however, new algorithmic approaches that can effectively utilize the complex memory hierarchies and the extremely high levels of parallelism available in state-of-the-art high-performance computing platforms can enable such analysis. Here, we describe pKluster, an open-source tool we have developed for accelerated k-means clustering of geospatial and geospatiotemporal data, and discuss algorithmic modifications and code optimizations we have made to enable it to effectively use parallel machines based on novel CPU architectures—such as the Intel “Knights Landing” Xeon Phi and Skylake Xeon processors—with many cores and hardware threads, and employing significant single instruction, multiple data (SIMD) parallelism. We outline some applications of the code in ecology and climate science contexts and present a detailed discussion of the performance of the code for one such application, LiDAR-derived vertical vegetation structure classification.

Mills, Richard T↗
DOE OSTI2014

Understanding the many-body expansion for large systems. I. Precision considerations

Electronic structure methods based on low-order “n-body” expansions are an increasingly popular means to defeat the highly nonlinear scaling of ab initio quantum chemistry calculations, taking advantage of the inherently distributable nature of the numerous subsystem calculations. Here, we examine how the finite precision of these subsystem calculations manifests in applications to large systems, in this case, a sequence of water clusters ranging in size up to (H{sub 2}O){sub 47}. Using two different computer implementations of the n-body expansion, one fully integrated into a quantum chemistry program and the other written as a separate driver routine for the same program, we examine the reproducibility of total binding energies as a function of cluster size. The combinatorial nature of the n-body expansion amplifies subtle differences between the two implementations, especially for n ⩾ 4, leading to total energies that differ by as much as several kcal/mol between two implementations of what is ostensibly the same method. This behavior can be understood based on a propagation-of-errors analysis applied to a closed-form expression for the n-body expansion, which is derived here for the first time. Discrepancies between the two implementations arise primarily from the Coulomb self-energy correction that is required when electrostatic embedding charges are implemented by means of an external driver program. For reliable results in large systems, our analysis suggests that script- or driver-based implementations should read binary output files from an electronic structure program, in full double precision, or better yet be fully integrated in a way that avoids the need to compute the aforementioned self-energy. Moreover, four-body and higher-order expansions may be too sensitive to numerical thresholds to be of practical use in large systems.

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

Future Generation High Performance Computing Center (FG-HPCC): RFI Technical Considerations

Lawrence Livermore National Security, LLC (LLNS) is interested in receiving information about technologies that could be available in the 2029-2030 timeframe that may serve to enable the vision for a Future Generation High Performance Computing (HPC) Center (FG-HPCC) described in this document. The future HPC Center vision has been conceived to meet the future mission needs of the Advanced Simulation and Computing (ASC) Program within the National Nuclear Security Administration (NNSA). LLNS envisions a center composed not of many independent clusters, but of heterogeneous elements accessible to users as a single system. The capabilities will be integrated to create a scalable, flexible, yet tightly coupled computing center capable of integrated HPC, AI, and cloud-like workloads.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Accelerating Subsurface Transport Simulation on Heterogeneous Clusters

Reactive transport numerical models simulate chemical and microbiological reactions that occur along a flowpath. These models have to compute reactions for a large number of locations. They solve the set of ordinary differential equations (ODEs) that describes the reaction for each location through the Newton-Raphson technique. This technique involves computing a Jacobian matrix and a residual vector for each set of equation, and then solving iteratively the linearized system by performing Gaussian Elimination and LU decomposition until convergence. STOMP, a well known subsurface flow simulation tool, employs matrices with sizes in the order of 100x100 elements and, for numerical accuracy, LU factorization with full pivoting instead of the faster partial pivoting. Modern high performance computing systems are heterogeneous machines whose nodes integrate both CPUs and GPUs, exposing unprecedented amounts of parallelism. To exploit all their computational power, applications must use both the types of processing elements. For the case of subsurface flow simulation, this mainly requires implementing efficient batched LU-based solvers and identifying efficient solutions for enabling load balancing among the different processors of the system. In this paper we discuss two approaches that allows scaling STOMP's performance on heterogeneous clusters. We initially identify the challenges in implementing batched LU-based solvers for small matrices on GPUs, and propose an implementation that fulfills STOMP's requirements. We compare this implementation to other existing solutions. Then, we combine the batched GPU solver with an OpenMP-based CPU solver, and present an adaptive load balancer that dynamically distributes the linear systems to solve between the two components inside a node. We show how these approaches, integrated into the full application, provide speed ups from 6 to 7 times on large problems, executed on up to 16 nodes of a cluster with two AMD Opteron 6272 and a Tesla M2090 per node.

GPU↗
DOE OSTI2014

Scaling Semantic Graph Databases in Size and Performance

In this paper we present SGEM, a full software system for accelerating large-scale semantic graph databases on commodity clusters. Unlike current approaches, SGEM addresses semantic graph databases by only employing graph methods at all the levels of the stack. On one hand, this allows exploiting the space efficiency of graph data structures and the inherent parallelism of graph algorithms. These features adapt well to the increasing system memory and core counts of modern commodity clusters. On the other hand, however, these systems are optimized for regular computation and batched data transfers, while graph methods usually are irregular and generate fine-grained data accesses with poor spatial and temporal locality. Our framework comprises a SPARQL to data parallel C compiler, a library of parallel graph methods and a custom, multithreaded runtime system. We introduce our stack, motivate its advantages with respect to other solutions and show how we solved the challenges posed by irregular behaviors. We present the result of our software stack on the Berlin SPARQL benchmarks with datasets up to 10 billion triples (a triple corresponds to a graph edge), demonstrating scaling in dataset size and in performance as more nodes are added to the cluster.

Aggregation↗