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 253 records · Page 14

Fibre Channel Development Final Report CRADA No. TC-0340-92-C

The Fibre Channel (FC) Development project was designed to enhance U.S. industrial competitiveness by accelerating the standardization and subsequent industrial acceptance of the American National Standards Institute’s (ANSI) Fibre Channel Standard (now X3T1 1). It was also intended to give the principal U.S. participants a one-to two-year lead in developing heterogeneous high-speed computer networks, distributed computing through clustering, scientific visualization techniques, and high speed channels. The project was proposed to benefit U.S. industry as these high performance computing methods became generally available. In 1992-93, during the initial project phases, Fibre Channel (FC) was emerging as a new ANSI standard. It was envisioned as becoming the mechanism for data transfer between the next generation of computers, and between these computers and their peripherals. Using this channel standard, U.S. computer vendors were expecting to be able to provide high-speed interoperatillity between heterogeneous computers and their storage devices, with data transfer rates greater than a GBit/sec. Our project was composed of key principal players in the FC standardization effort from both U.S. industry and the Department of Energy’s@OEs) Lawrence Liverrnore National Laboratory (LLNL). The industrial participants were developing individual FC interfaces to operate with their platform products. LLNL’s.role was to be a neutral testing site and a facilitator for helping to resolve conflicting interpretations of the embryonic Fibre Channel specification. LLNL anticipated that conflicts in the interpretation of such a standard would arise and require neutral resolution and that such resolutions would best be achieved in cooperation with the ANSI FC Working Group. Project plans included transferring to U.S. industry any resilient FC testing capabilities at the project conclusion.

42 ENGINEERING↗

Observation of Conformational Simplification upon N-methylation on Amino Acid Iodide Clusters

This work reports a surprising observation that methylation of glycine-iodide cluster leads to less conformations and spectroscopic simplicity. We used cryogenic “iodide-tagging” negative ion photoelectron spectroscopy (NIPES) to probe specific binding sites of three N-methylated glycine derivatives, i.e., N-methylglycine (sarcosine, Sar), N,N-dimethylglycine (Dmg), and N,N,N-trimethylglycine (glycine betaine, Bet). NIPES reveals a progressive spectral simplification of the iodide clusters with increasing methylation due to the presence of fewer contributing structures, a reduction in the number of NH and OH hydrogen bond donating sites, and an increase in the basicity of the amine. Low energy conformers and tautomers of each cluster are computationally identified, and those observed in the experiments are assigned based on excellent agreement between the NIPE spectra and theoretical simulations. Clusters with zwitterionic structures for Gly, Sar, and Dmg are found to be less stable than their canonical forms and do not contribute to the observed spectra. This work demonstrates the power of “iodide-tagging” NIPES in probing conformational and tautomeric structures of amino acid-iodide clusters and provides a molecular level understanding on the effect of methyl substitution on the active binding sites of amino acids.

Cao, Wenjin↗

Plasma Surface Interactions: Predicting the Performance and Impact of Dynamic PFC Surfaces

The objective of this project is to develop, and integrate, high-performance simulation tools capable of predicting plasma-facing component (PFC) operating lifetime and the impact of the evolving surface morphology of tungsten-based PFCs on plasma contamination, including the dynamic recycling of fuel species and tritium retention, in future magnetic fusion devices. Establishing a fundamental physical understanding and developing predictive capabilities of plasma-surface interactions (PSI) requires simultaneously addressing complex and diverse physics occurring over a wide range of length (Angstroms to meters) and time (femtoseconds to years) scales, as well as integrating extensive physical processes across the plasma–surface interface. This requires development of not only detailed physics models and computational strategies at each scale, but also algorithms and methods to couple them effectively in a way that can be robustly validated. Deploying these tools requires the continued development and coupling of leadership-scale computational codes to describe the boundary plasma and the evolving PFC surface, as well as a host of simulations that bridge disparate scales to address complex physical and computational issues at the plasma–surface interface in multi-component materials systems for magnetic fusion energy development beyond ITER.

36 MATERIALS SCIENCE↗

Understanding I/O workload characteristics of a Peta-scale storage system

Understanding workload characteristics is critical for optimizing and improving the performance of current systems and software, and architecting new storage systems based on observed workload patterns. In this paper, we characterize the I/O workloads of scientific applications of one of the world's fastest high performance computing (HPC) storage cluster, Spider, at the Oak Ridge Leadership Computing Facility (OLCF). OLCF flagship petascale simulation platform, Titan, and other large HPC clusters, in total over 250 thousands compute cores, depend on Spider for their I/O needs. We characterize the system utilization, the demands of reads and writes, idle time, storage space utilization, and the distribution of read requests to write requests for the Peta-scale Storage Systems. From this study, we develop synthesized workloads, and we show that the read and write I/O bandwidth usage as well as the inter-arrival time of requests can be modeled as a Pareto distribution. We also study the I/O load imbalance problems using I/O performance data collected from the Spider storage system.

I/O↗

The Hardware of Smaller Clusters

Chris Saunders and three technologists are in high demand from Sandia's deep learning teams, and they're kept busy by building new clusters of computer nodes for researchers who need the power of supercomputing on a smaller scale. Sandia researchers working on Laboratory Directed Research & Development (LDRD) projects, or innovative ideas for solutions on short timeframes, formulate new ideas on old themes and frequently rely on smaller cluster machines to help solve problems before introducing their code to larger HPC resources. These research teams need an agile hardware and software environment where nascent ideas can be tested and cultivated on a smaller scale. Saunders and his team at Sandia's Science and Engineering Computing Environments are successfully enabling this research by creating pipelines for emerging code—from Cloud, to containers, to virtual machines—that build the right environment quickly to help teams solve their problems in a matter of days rather than months. While the larger HPC sources are available, it's these smaller clusters that can rapidly build a foundation for teams to build on for later development on larger systems.

97 MATHEMATICS AND COMPUTING↗

Quantum chemical study of the geometrical and electronic structures of ScSi{sub 3}{sup −/0} clusters and assignment of the anion photoelectron spectra

The geometrical and electronic structures of ScSi{sub 3}{sup −/0} clusters have been studied with the B3LYP, CCSD(T), and CASPT2 methods. The ground state of the anionic cluster was evaluated to be the {sup 1}A{sub 1} of rhombic η{sup 2}-(Si{sub 3})Sc{sup −} isomer, whereas that of the neutral cluster was computed to be the {sup 2}A{sub 1} of the same isomer. All features in the 266 and 193 nm photoelectron spectra of ScSi{sub 3}{sup −} cluster were interpreted by the one- and two-electron detachments from the {sup 1}A{sub 1} of rhombic η{sup 2}-(Si{sub 3})Sc{sup −} isomer. The Franck-Condon factor simulation results show that the first broad band starting at 1.78 eV in the spectra comprises several vibrational progression peaks of two totally symmetric modes with the corresponding frequencies of 296 and 354 cm{sup −1}.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Cluster partition function and invariants of 3-manifolds

We review some recent developments in Chern-Simons theory on a hyperbolic 3-manifold M with complex gauge group G. We focus on the case G = SL(N, C) and with M a knot complement. The main result presented in this note is the cluster partition function, a computational tool that uses cluster algebra techniques to evaluate the Chern-Simons path integral. We also review various applications and open questions regarding the cluster partition function and some of its relation with string theory.

97 MATHEMATICS AND COMPUTING↗

Identifying Climate Patterns Using Clustering Autoencoder Techniques

Abstract The complexity of growing spatiotemporal resolution of climate simulations produces a variety of climate patterns under different projection scenarios. This paper proposes a new data-driven climate classification workflow via an unsupervised deep learning technique that can dimensionally reduce the vast volume of spatiotemporal numerical climate projection data into a compact representation. We aim to identify distinct zones that capture multiple climate variables as well as their future changes under different climate change scenarios. Our approach leverages convolutional autoencoders combined with k -means clustering (standard autoencoder) and online clustering based on the Sinkhorn–Knopp algorithm (clustering autoencoder) across the conterminous United States (CONUS) to capture unique climate patterns in a data-driven fashion from the Geophysical Fluid Dynamics Laboratory Earth System Model with GOLD component (GFDL-ESM2G). The developed approach compresses 70 years of GFDL-ESM2G simulation at 0.125° spatial resolution across the CONUS under multiple warming scenarios to a lower-dimensional space by a factor of 660 000 and then tested on 150 years of GFDL-ESM2G simulation data. The results show that five climate clusters capture physically reasonable and spatially stable climatological patterns matched to known climate classes defined by human experts. Results also show that using a clustering autoencoder can reduce the computational time for clustering by up to 9.2 times when compared to using a standard autoencoder. Our five unique climate patterns resulting from the deep learning–based clustering of the lower-dimensional space thereby enable us to provide insights on hydrometeorology and its spatial heterogeneity across the conterminous United States immediately without downloading large climate datasets. Significance Statement This paper presents a data-driven climate classification approach using unsupervised deep learning to dimensionally reduce climate model outputs and to identify distinct climate regions for their future changes. Our approach compresses climate information for 70 years of Geophysical Fluid Dynamics Laboratory Earth System Model data across the conterminous United States (CONUS) at 0.125° spatial resolution. The results reveal that five climate clusters capture reasonable and stable climatological patterns matched to known climate patterns. The embedded clustering process in deep learning provides ×9.2 times faster execution than the k -means clustering technique. These results give us insight about climate spatial patterns and heterogeneity of hydrological patterns across the conterminous United States without downloading large climate datasets.

Kurihana, Takuya↗

Parallel Programming in MCNP6

Monte Carlo N-Particle (MCNP)1 is a general-purpose Monte Carlo particle transport code developed by Los Alamos National Laboratory (LANL). To efficiently handle long simulations, MCNP version 6 (MCNP6) supports parallel execution using two primary programming models: • Shared-memory task-based threading using OpenMP (Open Multi-Processing), and • Distributed-memory calculations using MPI (Message Passing Interface). The OpenMP and MPI programming models enable MCNP6 to scale from desktop systems to high-performance computing (HPC) clusters, allowing users to run MCNP in one of three parallel modes: • OpenMP-only, • MPI-only, and • Hybrid (MPI + OpenMP). The choice of parallelization mode depends on the underlying computer architecture and the characteristics of the simulation problem.

97 MATHEMATICS AND COMPUTING↗

Cluster Configuration Spaces of Finite Type

For each Dynkin diagram $D$, we define a ''cluster configuration space'' ${\mathcal{M}}_D$ and a partial compactification ${\widetilde {\mathcal{M}}}_D$. For $D = A_{n-3}$, we have ${\mathcal{M}}_{A_{n-3}} = {\mathcal{M}}_{0,n}$, the configuration space of $n$ points on ${\mathbb P}^1$, and the partial compactification ${\widetilde {\mathcal{M}}}_{A_{n-3}}$ was studied in this case by Brown. The space ${\widetilde {\mathcal{M}}}_D$ is a smooth affine algebraic variety with a stratification in bijection with the faces of the Chapoton-Fomin-Zelevinsky generalized associahedron. The regular functions on ${\widetilde {\mathcal{M}}}_D$ are generated by coordinates $u_\gamma$, in bijection with the cluster variables of type $D$, and the relations are described completely in terms of the compatibility degree function of the cluster algebra. As an application, we define and study cluster algebra analogues of tree-level open string amplitudes.

97 MATHEMATICS AND COMPUTING↗

First principle calculations of effective exchange integrals: Comparison between SR (BS) and MR computational results

First principle calculations of effective exchange integrals (J) in the Heisenberg model for diradical species were performed by both symmetry-adapted (SA) multi-reference (MR) and broken-symmetry (BS) single reference (SR) methods. Mukherjee-type (Mk) state specific (SS) MR coupled-cluster (CC) calculations by the use of natural orbital (NO) references of ROHF, UHF, UDFT and CASSCF solutions were carried out to elucidate J values for di- and poly-radical species. Spin-unrestricted Hartree Fock (UHF) based coupled-cluster (CC) computations were also performed to these species. Comparison between UHF-NO(UNO)-MkMRCC and BS UHF-CC computational results indicated that spin-contamination of UHF-CC solutions still remains at the SD level. In order to eliminate the spin contamination, approximate spin-projection (AP) scheme was applied for UCC, and the AP procedure indeed corrected the error to yield good agreement with MkMRCC in energy. The CC double with spin-unrestricted Brueckner's orbital (UBD) was furthermore employed for these species, showing that spin-contamination involved in UHF solutions is largely suppressed, and therefore AP scheme for UBCCD removed easily the rest of spin-contamination. We also performed spin-unrestricted pure- and hybrid-density functional theory (UDFT) calculations of diradical and polyradical species. Three different computational schemes for total spin angular momentums were examined for the AP correction of the hybrid (H) UDFT. HUDFT calculations followed by AP, HUDFT(AP), yielded the S-T gaps that were qualitatively in good agreement with those of MkMRCCSD, UHF-CC(AP) and UB-CC(AP). Thus a systematic comparison among MkMRCCSD, UCC(AP) UBD(AP) and UDFT(AP) was performed concerning with the first principle calculations of J values in di- and poly-radical species. It was found that BS (AP) methods reproduce MkMRCCSD results, indicating their applicability to large exchange coupled systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The globus compute dataset: An open function-as-a-service dataset from the edge to the cloud

Here we present a unique function-as-a-service (FaaS) dataset capturing the use of the Globus Compute (previously funcX) platform. Globus Compute implements a federated model via which users may deploy endpoints on arbitrary remote computers, from the edge to high performance computing (HPC) cluster, and they may then invoke Python functions on those endpoints via a reliable cloud -hosted service. The dataset covers 31 weeks and includes 2121472 task submissions from 252 users executed on 580 remote computing endpoints. It includes 277386 registered functions. We describe the dataset and various observations, some that are similar to other FaaS datasets, for example, that 74% of tasks run for less than 1 s, and some that are unique to Globus Compute, for example, that endpoints are used in different ways and that the majority of functions are related to scientific computing and machine learning. To the best of our knowledge, this dataset represents the first federated FaaS dataset that includes user workloads, distributed computing endpoints, and analysis of registered function bodies. We expect the dataset to be useful for researching FaaS architectures, workload modeling, container warming, and other distributed computing architectures.

97 MATHEMATICS AND COMPUTING↗

Effects of Ionic Group Distribution on the Structure and Dynamics of Amorphous Polymer Melts

Ionizable groups tethered to a polymer backbone often associate to form ionic clusters, whose features are determined by the balance of the polymer backbone and electrostatics. These assemblies impact the dynamics of the macromolecules and their ability to transport ions. Here, using fully atomistic molecular dynamics (MD) simulations, we investigate the effects of the distribution of ionizable groups along the polymer backbone on cluster characteristics and the resulting impacts on the structure and dynamics of amorphous polymers. Particularly, we probe polystyrene sulfonates (PSS) with random, precise, and block configurations of the SO 3 – sulfonate groups along the backbone with Na + as the counterion. We find that the distribution of the ionic groups affects the shape and distribution of the clusters as well as the internal packing of the ionizable groups in the cluster and the number of unique chains that participate in each cluster, affecting the structure and the dynamics of the polymers. Furthermore, the signature of ionic clusters, observed in the static structure factor S(q) for all three distributions, is significantly more pronounced for the precise and blocky polymers compared to the random one. Remarkably, we find that the local mobility of the polymer segments is not only affected by the number and size of the clusters but also by the number of polymer chains associated with clusters.

36 MATERIALS SCIENCE↗

Disruption-Robust Community Detection Using Consensus Clustering in Complex Networks

Topological (graph-theoretic) analysis of critical infrastructure networks provides insight on several aspects of resilience. Graph clustering or community detection, which identifies densely connected components in a graph, has been employed for analysis. In this paper, we propose employing consensus clustering, which is a technique to determine consensus from a collection of different clusters on an input, such that the resulting clustering is robust to disruptions, where a disruption is represented as loss of one or more vertices or edges in the graph. Using two critical infrastructure networks as case studies, we empirically demonstrate the need to compute consensus clustering in order to address the drastic changes in the topology due to disruptions in the network.

Hussain, Md Taufique↗

The Hardware of Smaller Clusters (V.3.0)

Chris Saunders and three technologists are in high demand from Sandia’s deep learning teams, and they’re kept busy by building new clusters of computer nodes for researchers who need the power of supercomputing on a smaller scale. Sandia researchers working on Laboratory Directed Research & Development (LDRD) projects, or innovative ideas for solutions on short timeframes, formulate new ideas on old themes and frequently rely on smaller cluster machines to help solve problems before introducing their code to larger HPC resources. These research teams need an agile hardware and software environment where nascent ideas can be tested and cultivated on a smaller scale.

97 MATHEMATICS AND COMPUTING↗

Searching for metastable particles using graph computing

The reconstruction of charged particle trajectories at the Large Hadron Collider and future colliders relies on energy depositions in sensors placed at distances ranging from a centimeter to a meter from the colliding beams. We propose a method of detecting charged particles that decay invisibly after traversing a short distance of about 25 cm inside the experimental apparatus. One of the decay products may constitute the dark matter known to be 84% of all matter at galactic and cosmological distance scales. Our method uses graph computing to cluster spacepoints recorded by two-dimensional silicon pixel sensors into mathematically-defined patterns. The algorithm may be implemented on silicon-based integrated circuits using field-programmable gate array technology to augment or replace traditional computing platforms.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Electronic structures and binding motifs of sodium polysulfide clusters NaSn- (n = 5-9): a joint negative ion photoelectron spectroscopy and computational investigation

Motivated by the significant biological functions of polysulfides in life processes and important applications of sodium polysulfides in battery sciences, herein we report a joint experimental and computational study on the electronic and geometric structures of a series of NaSn- (n = 5-9) clusters. The cryogenic, size-selective, negative ion photoelectron spectroscopy (NIPES) is employed to obtain their photoelectron spectra, in which distinctive spectral features with electron binding energy (EBE) up to 6.4 eV are unraveled. The EBE of the first peak in each spectrum for NaSn- (n =5-9), assigned to the transition from the ground state of anion to the ground state of each neutral radical, is observed to increase with cluster size. The vertical detachment energies (VDEs), determined from the first peak maximum, are 3.43 ± 0.02, 3.57 ± 0.02, 3.82 ± 0.03, 3.86 ± 0.02, and 4.00 ± 0.02 eV and the adiabatic detachment energies (ADEs), determined by the onset of the first peak, are 3.27 ± 0.05, 3.44 ± 0.05, 3.65 ± 0.05, 3.75 ± 0.05, and 3.93 ± 0.05 eV, for n = 5-9, respectively. A plural of low-lying isomers of anions are screened and identified with density functional theory calculations, showing that all featuring preference for a chain-like polysulfide moiety electrostatically interacted with a sodium cation. The calculated VDEs and ADEs using the high-level CCSD(T)/aug-cc-pVTZ method are in excellent agreement with experimental results, further confirming the identified isomers as most stable ones. Further analyses based on the excited-state transition, molecular orbitals and natural population charge are performed to assign all observed spectral bands along the binding energy axis, suggesting that the electron detachment process and observed excitations mainly derived from the polysulfide chain of NaSn- clusters. This work provides a fundamental understanding of the intrinsic molecular properties of sodium polysulfide systems, which widely exist in life science and sodium-sulfur cells.

Li, Zhipeng↗

ShareAnalytics

ShareAnalytics is a lightweight extensible platform for collaborative data analytics and facility characterization via Non-intrusive Load Monitoring (NILM). It consists of three core components: a full stack web application, a dashboard tool for analyzing streaming data and a High Performance Computing (HPC) cluster leveraging slurm for resource management to perform real time analysis. The entire framework is implemented in Docker for ease of deployment and to allow the user to test the platform before making a significant investment in hardware if they require additional computing resources. While many other platforms for analyzing streaming data exists, ShareAnalytics is unique in that HPC capabilities and facility characterization via scored analytics are fully integrated into the platform.

Oesch, TimothyS↗