Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

High Performance Computing Based Parallel HIearchical Modal Association Clustering (HPAR HMAC)

For many applications, clustering is a crucial step in order to gain insight into the makeup of a dataset. The best approach to a given problem often depends on a variety of factors, such as the size of the dataset, time restrictions, and soft clustering requirements. The HMAC algorithm seeks to combine the strengths of 2 particular clustering approaches: model-based and linkage-based clustering. One particular weakness of HMAC is its computational complexity. HMAC is not practical for mega-scale data clustering. For high-definition imagery, a user would have to wait months or years for a result; for a 16-megapixel image, the estimated runtime skyrockets to over a decade! To improve the execution time of HMAC, it is reasonable to consider an multi-core implementation that utilizes available system resources. An existing imple-mentation (Ray and Cheng 2014) divides the dataset into N partitions - one for each thread prior to executing the HMAC algorithm. This implementation benefits from 2 types of optimization: parallelization and divide-and-conquer. By running each partition in parallel, the program is able to accelerate computation by utilizing more system resources. Although the parallel implementation provides considerable improvement over the serial HMAC, it still suffers from poor computational complexity, O(N2). Once the maximum number of cores on a system is exhausted, the program exhibits slower behavior. We now consider a modification to HMAC that involves a recursive partitioning scheme. Our modification aims to exploit divide-and-conquer benefits seen by the parallel HMAC implementation. At each level in the recursion tree, partitions are divided into 2 sub-partitions until a threshold size is reached. When the partition can no longer be divided without falling below threshold size, the base HMAC algorithm is applied. This results in a significant speedup over the parallel HMAC.

Patlolla, Dilip R↗
DOE OSTI2014

Core-halo age gradients and star formation in the Orion Nebula and NGS 2024 young stellar clusters

We analyze age distributions of two nearby rich stellar clusters, the NGC 2024 (Flame Nebula) and Orion Nebula cluster (ONC) in the Orion molecular cloud complex. Our analysis is based on samples from the MYStIX survey and a new estimator of pre-main sequence (PMS) stellar ages, Age{sub JX} , derived from X-ray and near-infrared photometric data. To overcome the problem of uncertain individual ages and large spreads of age distributions for entire clusters, we compute median ages and their confidence intervals of stellar samples within annular subregions of the clusters. We find core-halo age gradients in both the NGC 2024 cluster and ONC: PMS stars in cluster cores appear younger and thus were formed later than PMS stars in cluster peripheries. These findings are further supported by the spatial gradients in the disk fraction and K-band excess frequency. Our age analysis is based on Age{sub JX} estimates for PMS stars and is independent of any consideration of OB stars. The result has important implications for the formation of young stellar clusters. One basic implication is that clusters form slowly and the apparent age spreads in young stellar clusters, which are often controversial, are (at least in part) real. The result further implies that simple models where clusters form inside-out are incorrect and more complex models are needed. We provide several star formation scenarios that alone or in combination may lead to the observed core-halo age gradients.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Drugsniffer: An Open Source Workflow for Virtually Screening Billions of Molecules for Binding Affinity to Protein Targets

The SARS-CoV2 pandemic has highlighted the importance of efficient and effective methods for identification of therapeutic drugs, and in particular has laid bare the need for methods that allow exploration of the full diversity of synthesizable small molecules. While classical high-throughput screening methods may consider up to millions of molecules, virtual screening methods hold the promise of enabling appraisal of billions of candidate molecules, thus expanding the search space while concurrently reducing costs and speeding discovery. Here, we describe a new screening pipeline, called drugsniffer, that is capable of rapidly exploring drug candidates from a library of billions of molecules, and is designed to support distributed computation on cluster and cloud resources. As an example of performance, our pipeline required ~40,000 total compute hours to screen for potential drugs targeting three SARS-CoV2 proteins among a library of ~3.7 billion candidate molecules.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2018

Local rewiring algorithms to increase clustering and grow a small world

Abstract Many real-world networks have high clustering among vertices: vertices that share neighbours are often also directly connected to each other. A network’s clustering can be a useful indicator of its connectedness and community structure. Algorithms for generating networks with high clustering have been developed, but typically rely on adding or removing edges and nodes, sometimes from a completely empty network. Here, we introduce algorithms that create a highly clustered network by starting with an existing network and rearranging edges, without adding or removing them; these algorithms can preserve other network properties even as the clustering increases. They rely on local rewiring rules, in which a single edge changes one of its vertices in a way that is guaranteed to increase clustering. This greedy step can be applied iteratively to transform a random network into a form with much higher clustering. Additionally, the algorithms presented grow a network’s clustering faster than they increase its path length, meaning that network enters a regime of comparatively high clustering and low path length: a small world. These algorithms may be a basis for how real-world networks rearrange themselves organically to achieve or maintain high clustering and small-world structure.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Electron Binding Energy Spectra of Al n Pt – Clusters—A Combined Experimental and Computational Study

Results of size-selected electron photo-detachment experiments and density functional theory calculations on anionic Al n Pt – , n = 1–7, clusters are presented and analyzed. The measured and calculated spectra of electron binding energies are, overall, in excellent accord with each other. The analysis reveals the general importance of accounting for the multiplicity of structural forms of a given-size cluster that can contribute to its measured spectrum, especially when the clusters are fluxional and/or the conditions of the experiment allow for structural transitions. Here, we show that for the systems studied here, the size-specific peculiarities of the measured spectra can be understood in terms of the combined contributions of corresponding different accessible stable equilibrium conformations, bona-fide transition-state configurations, and electronic-crossing structures that may play the role of effective barriers in electronically nonadiabatic dynamics.

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

Spatial clustering of pixels of a multispectral image

A method and system for clustering the pixels of a multispectral image is provided. A clustering system computes a maximum spectral similarity score for each pixel that indicates the similarity between that pixel and the most similar neighboring. To determine the maximum similarity score for a pixel, the clustering system generates a similarity score between that pixel and each of its neighboring pixels and then selects the similarity score that represents the highest similarity as the maximum similarity score. The clustering system may apply a filtering criterion based on the maximum similarity score so that pixels with similarity scores below a minimum threshold are not clustered. The clustering system changes the current pixel values of the pixels in a cluster based on an averaging of the original pixel values of the pixels in the cluster.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

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

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 (AIW) 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, dktibuted 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 PC) 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 interoperability 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 (DOES) Lawrence Liverrnore National Laboratory (LLNL). The industial 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↗
DOE OSTI2018

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↗
DOE OSTI2021

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↗
DOE OSTI2013

WEIGHING GALAXY CLUSTERS WITH GAS. I. ON THE METHODS OF COMPUTING HYDROSTATIC MASS BIAS

Mass estimates of galaxy clusters from X-ray and Sunyeav-Zel'dovich observations assume the intracluster gas is in hydrostatic equilibrium with their gravitational potential. However, since galaxy clusters are dynamically active objects whose dynamical states can deviate significantly from the equilibrium configuration, the departure from the hydrostatic equilibrium assumption is one of the largest sources of systematic uncertainties in cluster cosmology. In the literature there have been two methods for computing the hydrostatic mass bias based on the Euler and the modified Jeans equations, respectively, and there has been some confusion about the validity of these two methods. The word 'Jeans' was a misnomer, which incorrectly implies that the gas is collisionless. To avoid further confusion, we instead refer these methods as 'summation' and 'averaging' methods respectively. In this work, we show that these two methods for computing the hydrostatic mass bias are equivalent by demonstrating that the equation used in the second method can be derived from taking spatial averages of the Euler equation. Specifically, we identify the correspondences of individual terms in these two methods mathematically and show that these correspondences are valid to within a few percent level using hydrodynamical simulations of galaxy cluster formation. In addition, we compute the mass bias associated with the acceleration of gas and show that its contribution is small in the virialized regions in the interior of galaxy clusters, but becomes non-negligible in the outskirts of massive galaxy clusters. We discuss future prospects of understanding and characterizing biases in the mass estimate of galaxy clusters using both hydrodynamical simulations and observations and their implications for cluster cosmology.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

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↗
DOE OSTI2014

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↗
DOE OSTI2018

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↗
DOE OSTI2016

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↗
DOE OSTI2017

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↗
DOE OSTI2024

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↗
DOE OSTI2025

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↗
DOE OSTI2021

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↗