Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “cluster computer”

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 703 records · Page 39
All sourcesNASA NTRSDOE OSTI
NASA NTRS1998

Navier-Stokes Computations on Commodity Computers

In this paper we discuss and demonstrate the feasibility of solving high-fidelity, nonlinear computational fluid dynamics (CFD) problems of practical interest on commodity machines, namely Pentium Pro PC's. Such calculations have now become possible due to the progress in computational power and memory of the off-the-shelf commodity computers, along with the growth in bandwidth and communication speeds of networks. A widely used CFD code known as TLNS3D, which was developed originally on large shared memory computers was selected for this effort. This code has recently been ported to massively parallel processor (MPP) type machines, where natural partitioning along grid blocks is adopted in which one or more blocks are distributed to each of the available processors. In this paper, a similar approach is adapted to port this code to a cluster of Pentium Pro computers. The message passing among the processors is accomplished through the use of standard message passing interface (MPI) libraries. Scaling studies indicate fairly high level of parallelism on such clusters of commodity machines, thus making solutions to Navier-Stokes equations for practical problems more affordable.

Vatsa, Veer N.↗
NASA NTRS1987

Simulation studies for surfaces and materials strength

A realistic potential energy function comprising angle dependent terms was employed to describe the potential surface of the N+O2 system. The potential energy parameters were obtained from high level ab-initio results using a nonlinear fitting procedure. It was shown that the potential function is able to reproduce a large number of points on the potential surface with a small rms deviation. A literature survey was conducted to analyze exclusively the status of current small cluster research. This survey turned out to be quite useful in understanding and finding out the existing relationship between theoretical as well as experimental investigative techniques employed by different researchers. Additionally, the importance of the role played by computer simulation in small cluster research, was documented.

Halicioglu, Timur↗
DOE OSTI2024

Streaming Matching and Edge Cover in Practice

Graph algorithms with polynomial space and time requirements often become infeasible for massive graphs with billions of edges or more. State-of-the-art approaches therefore employ approximate serial, parallel, and distributed algorithms to tackle these challenges. However, such approaches require storing the entire graph in memory and thus need access to costly computing resources such as clusters and supercomputers. In this paper, we present practical streaming approaches for solving massive graph problems using limited memory for two prototypical graph problems: maximum weighted matching and minimum weighted edge cover. For matching, we conduct a thorough computational study on two of the semi-streaming algorithms including a recent breakthrough result that achieves a $1/(2+\varepsilon)$-approximation of the weight while using $O( n \log W /\epsilon)$ memory (here $n$ is the number of vertices and $W$ is the maximum edge weight), designed by Paz and Schwartzman [SODA, 2017]. Empirically, we show that the semi-streaming algorithms produce matchings whose weight is close to the best $1/2$-approximate offline algorithm while requiring less time and an order-of-magnitude less memory. For minimum weighted edge cover, we develop three novel semi-streaming algorithms. Two of these algorithms require a single pass through the input graph, require $O(n \log n)$ memory, and provide a 2-approximation guarantee on the objective. We also leverage a relationship between approximate maximum weighted matching and approximate minimum weighted edge cover to develop a two-pass $3/2+\epsilon$-approximate algorithm with the memory requirement of Paz and Schwartzman's semi-streaming matching algorithm. These streaming approaches are compared against the state-of-the-art 3/2-approximate offline algorithm. The semi-streaming matching and the novel edge cover algorithms proposed in this paper can process graphs with several billions of edges in under 30 minutes using 6 GB of memory, which is at least an order of magnitude improvement from the offline (non-streaming) algorithms. For the largest graph, the best alternative offline parallel approximation algorithm (GPA+ROMA) could not finish in three hours even while employing hundreds of processors and 1 TB of memory. We also demonstrate an application of the semi-streaming algorithm by computing a matching using linearly bounded memory on item intersection graphs derived from three machine learning datasets, whereas the existing offline algorithms could not complete on one of these datasets since their memory requirements exceeded 1TB.

Ferdous, S M.↗
DOE OSTI2014

Analysis of perceived similarity between pairs of microcalcification clusters in mammograms

Purpose: Content-based image retrieval aims to assist radiologists by presenting example images with known pathology that are visually similar to the case being evaluated. In this work, the authors investigate several fundamental issues underlying the similarity ratings between pairs of microcalcification (MC) lesions on mammograms as judged by radiologists: the degree of variability in the similarity ratings, the impact of this variability on agreement between readers in retrieval of similar lesions, and the factors contributing to the readers’ similarity ratings. Methods: The authors conduct a reader study on a set of 1000 image pairs of MC lesions, in which a group of experienced breast radiologists rated the degree of similarity between each image pair. The image pairs are selected, from among possible pairings of 222 cases (110 malignant, 112 benign), based on quantitative image attributes (features) and the results of a preliminary reader study. Next, the authors apply analysis of variance (ANOVA) to quantify the level of variability in the readers’ similarity ratings, and study how the variability in individual reader ratings affects consistency between readers. The authors also measure the extent to which readers agree on images which are most similar to a given query, for which the Dice coefficient is used. To investigate how the similarity ratings potentially relate to the attributes underlying the cases, the authors study the fraction of perceptually similar images that also share the same benign or malignant pathology as the query image; moreover, the authors apply multidimensional scaling (MDS) to embed the cases according to their mutual perceptual similarity in a two-dimensional plot, which allows the authors to examine the manner in which similar lesions relate to one another in terms of benign or malignant pathology and clustered MCs. Results: The ANOVA results show that the coefficient of determination in the reader similarity ratings is 0.59. The variability level in the similarity ratings is proved to be a limiting factor, leading to only moderate correlation between the readers in their readings. The Dice coefficient, measuring agreement between readers in retrieval of similar images, can vary from 0.45 to 0.64 with different levels of similarity for individual readers, but is higher for average ratings from a group of readers (from 0.59 to 0.78). More importantly, the fraction of retrieved cases that match the benign or malignant pathology of the query image was found to increase with the degree of similarity among the retrieved images, reaching average value as high as 0.69 for the radiologists (p-value <10{sup −4} compared to random guessing). Moreover, MDS embedding of all the cases shows that cases having the same pathology tend to cluster together, and that neighboring cases in the plot tend to be similar in their clustered MCs. Conclusions: While individual readers exhibit substantial variability in their similarity ratings, similarity ratings averaged from a group of readers can achieve a high level of intergroup consistency and agreement in retrieval of similar images. More importantly, perceptually similar cases are also likely to be similar in their underlying benign or malignant pathology and image features of clustered MCs, which could be of diagnostic value in computer-aided diagnosis for lesions with clustered MCs.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2017

Compiling on Linux Clusters

This is a presentation for LANL's Parallel Computing Summer Research Internship that describes the process of compiling Linux clusters.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A Generic Advanced Computing Framework for Executing Windows-based Dynamic Contingency Analysis Tool in Parallel on Cluster Machines

Dynamic contingency analysis tool (DCAT) has been developed to assess the impact and likelihood of extreme contingencies and potential cascading events across their systems and interconnections. By including more customized protection models and corrective actions into the Windows-based commercial tools, DCAT can help operators understand the cascading behavior and find mitigation approaches to reduce the risk of cascading outages in a more realistic manner. In order to further enhance the capability of DCAT, this paper presents a design of an advanced computing framework that enables DCAT to run on a cluster machine to improve its computational performance. This framework is generic and can be applied to other Windows-based simulation tools to fill the technical gap of applying advanced computing technology to vendors' Windows-based tools. The preliminary tests using medium to large power systems have shown the effectiveness of this framework and its potential for accelerating the adoption of advanced computing in utilities.

Advanced computing, dynamic contingency analysis, ↗
DOE OSTI2024

Community detection in hypergraphs via mutual information maximization

Abstract The hypergraph community detection problem seeks to identify groups of related vertices in hypergraph data. We propose an information-theoretic hypergraph community detection algorithm which compresses the observed data in terms of community labels and community-edge intersections. This algorithm can also be viewed as maximum-likelihood inference in a degree-corrected microcanonical stochastic blockmodel. We perform the compression/inference step via simulated annealing. Unlike several recent algorithms based on canonical models, our microcanonical algorithm does not require inference of statistical parameters such as vertex degrees or pairwise group connection rates. Through synthetic experiments, we find that our algorithm succeeds down to recently-conjectured thresholds for sparse random hypergraphs. We also find competitive performance in cluster recovery tasks on several hypergraph data sets.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1986

Analyzing Multidimensional Image Data

Six computer programs perform histogram cluster analysis. Histogram Cluster Analysis Procedure (HICAP) developed to perform unsupervised classification of multidimensional image data. Clustering approach used in HICAP based on algorithm which uses multidimensional histogram to perform unsupervised classification of four-dimensional Landsat multispectral-scanner data. HICAP generalizes this procedure to process up to 32-bit data with arbitrary number of dimensions. Also incorporates efficiency improvements so classification requires less computation than original algorithm. Computational savings afforded by HICAP increase with number of dimensions in data. HICAP programs written in FORTRAN 77 for batch or interactive execution.

Wharton, S. W.↗
DOE OSTI2017

Dark Energy Survey Year 1 Results: Cross-Correlation Redshifts in the DES -- Calibration of the Weak Lensing Source Redshift Distributions

We present the calibration of the Dark Energy Survey Year 1 (DES Y1) weak lensing source galaxy redshift distributions from clustering measurements. By cross-correlating the positions of source galaxies with luminous red galaxies selected by the redMaGiC algorithm we measure the redshift distributions of the source galaxies as placed into different tomographic bins. These measurements constrain any such shifts to an accuracy of $\sim0.02$ and can be computed even when the clustering measurements do not span the full redshift range. The highest-redshift source bin is not constrained by the clustering measurements because of the minimal redshift overlap with the redMaGiC galaxies. We compare our constraints with those obtained from $\texttt{COSMOS}$ 30-band photometry and find that our two very different methods produce consistent constraints.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Adaptive Conformer Sampling for Property Prediction Using the Conductor-like Screening Model for Real Solvents

The valorization of lignocellulose-derived bioproducts requires effective separation from excessive water. Liquid–liquid extraction is a promising low-energy separation technology, but effective extraction requires solvent selection based on the thermodynamic properties of the bioproduct and solvent components. We propose a computational framework for predicting such properties by developing an adaptive conformer selection approach for use with COSMO-RS (conductor-like screening model for real solvents) calculations. In this framework, molecular dynamics simulations are used to generate many molecular structures (conformers) at representative temperatures in varying solvent environments. Conformers are then clustered based on structural metrics in a low-dimensional space and selected using a mixed-integer quadratic programming problem to iteratively insert a sampled conformer. At each iteration, we determine bioproduct properties using COSMO-RS. Here, we demonstrate the capability of the proposed framework on representative bioproducts to show convergence of the adaptive sampling toward experimentally measured properties with fewer calculations than required by random conformer sampling, enabling the improved screening of solvent systems for liquid-phase separation.

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

Fuzzy logic, neural networks, and soft computing

The past few years have witnessed a rapid growth of interest in a cluster of modes of modeling and computation which may be described collectively as soft computing. The distinguishing characteristic of soft computing is that its primary aims are to achieve tractability, robustness, low cost, and high MIQ (machine intelligence quotient) through an exploitation of the tolerance for imprecision and uncertainty. Thus, in soft computing what is usually sought is an approximate solution to a precisely formulated problem or, more typically, an approximate solution to an imprecisely formulated problem. A simple case in point is the problem of parking a car. Generally, humans can park a car rather easily because the final position of the car is not specified exactly. If it were specified to within, say, a few millimeters and a fraction of a degree, it would take hours or days of maneuvering and precise measurements of distance and angular position to solve the problem. What this simple example points to is the fact that, in general, high precision carries a high cost. The challenge, then, is to exploit the tolerance for imprecision by devising methods of computation which lead to an acceptable solution at low cost. By its nature, soft computing is much closer to human reasoning than the traditional modes of computation. At this juncture, the major components of soft computing are fuzzy logic (FL), neural network theory (NN), and probabilistic reasoning techniques (PR), including genetic algorithms, chaos theory, and part of learning theory. Increasingly, these techniques are used in combination to achieve significant improvement in performance and adaptability. Among the important application areas for soft computing are control systems, expert systems, data compression techniques, image processing, and decision support systems. It may be argued that it is soft computing, rather than the traditional hard computing, that should be viewed as the foundation for artificial intelligence. In the years ahead, this may well become a widely held position.

Zadeh, Lofti A.↗
DOE OSTI2016

Quantum Chemistry via Walks in Determinant Space

There are many chemical questions of practical interest to the DOE that could be answered if there were an electronic structure method that provided consistently accurate results for all systems at an affordable computational cost. The coupled cluster method with single, double and perturbative triple excitations (CCSD(T)) is the most frequently used high-order method, but it has known deficiencies, e.g., in the description of stretched bonds. The full configuration interaction (FCI) method is the most robust method for treating electronic correlations, but it is little used because its computational cost scales exponentially in the size of the system. The largest calculation that has been done to date employed 10 billion determinants. In this regard, there was a major advance in 2010. The Alavi group at Cambridge University developed a stochastic approach to FCI --- combining it with ideas from quantum Monte Carlo (QMC) --- called FCIQMC, that allows one to go to a far larger number of determinants in certain circumstances. The computational cost is exponential in the system and basis size but with a much reduced exponent compared to conventional FCI. In this project Umrigar's group made several major improvements to the FCIQMC method that increased its efficiency by many orders of magnitude. In addition this project resulted in a cross-fertilization of ideas between the FCIQMC method, the older phaseless auxilliary-field quantum Monte Carlo (AFQMC) method developed by Zhang and Krakauer (two of the PI's of this project), and symmetry-restored wavefunctions developed by Scuseria (also a PI of this project).

36 MATERIALS SCIENCE↗
DOE OSTI2015

Structure of overheated metal clusters: MD simulation study

The structure of overheated metal clusters appeared in condensation process was studied by computer simulation techniques. It was found that clusters with size larger than several tens of atoms have three layers: core part, intermediate dense packing layer and a gas- like shell with low density. The change of the size and structure of these layers with the variation of internal energy and the size of cluster is discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1995

The coupling of fluids, dynamics, and controls on advanced architecture computers

This grant provided for the demonstration of coupled controls, body dynamics, and fluids computations in a workstation cluster environment; and an investigation of the impact of peer-peer communication on flow solver performance and robustness. The findings of these investigations were documented in the conference articles.The attached publication, 'Towards Distributed Fluids/Controls Simulations', documents the solution and scaling of the coupled Navier-Stokes, Euler rigid-body dynamics, and state feedback control equations for a two-dimensional canard-wing. The poor scaling shown was due to serialized grid connectivity computation and Ethernet bandwidth limits. The scaling of a peer-to-peer communication flow code on an IBM SP-2 was also shown. The scaling of the code on the switched fabric-linked nodes was good, with a 2.4 percent loss due to communication of intergrid boundary point information. The code performance on 30 worker nodes was 1.7 (mu)s/point/iteration, or a factor of three over a Cray C-90 head. The attached paper, 'Nonlinear Fluid Computations in a Distributed Environment', documents the effect of several computational rate enhancing methods on convergence. For the cases shown, the highest throughput was achieved using boundary updates at each step, with the manager process performing communication tasks only. Constrained domain decomposition of the implicit fluid equations did not degrade the convergence rate or final solution. The scaling of a coupled body/fluid dynamics problem on an Ethernet-linked cluster was also shown.

Atwood, Christopher↗
DOE OSTI2015

The hyperfine structure in the rotational spectra of D{sub 2}{sup 17}O and HD{sup 17}O: Confirmation of the absolute nuclear magnetic shielding scale for oxygen

Guided by theoretical predictions, the hyperfine structures of the rotational spectra of mono- and bideuterated-water containing {sup 17}O have been experimentally investigated. To reach sub-Doppler resolution, required to resolve the hyperfine structure due to deuterium quadrupole coupling as well as to spin-rotation (SR) and dipolar spin-spin couplings, the Lamb-dip technique has been employed. The experimental investigation and in particular, the spectral analysis have been supported by high-level quantum-chemical computations employing coupled-cluster techniques and, for the first time, a complete experimental determination of the hyperfine parameters involved was possible. The experimentally determined {sup 17}O spin-rotation constants of D{sub 2}{sup 17}O and HD{sup 17}O were used to derive the paramagnetic part of the corresponding nuclear magnetic shielding constants. Together with the computed diamagnetic contributions as well as the vibrational and temperature corrections, the latter constants have been employed to confirm the oxygen nuclear magnetic shielding scale, recently established on the basis of spin-rotation data for H{sub 2}{sup 17}O [Puzzarini et al., J. Chem. Phys. 131, 234304 (2009)].

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Elucidating the Molecular Origins of the Transference Number in Battery Electrolytes Using Computer Simulations

The rate at which rechargeable batteries can be charged and discharged is governed by the selective transport of the working ions through the electrolyte. Conductivity, the parameter commonly used to characterize ion transport in electrolytes, reflects the mobility of both cations and anions. The transference number, a parameter introduced over a century ago, sheds light on the relative rates of cation and anion transport. This parameter is, not surprisingly, affected by cation–cation, anion–anion, and cation–anion correlations. In addition, it is affected by correlations between the ions and neutral solvent molecules. Computer simulations have the potential to provide insights into the nature of these correlations. We review the dominant theoretical approaches used to predict the transference number from simulations by using a model univalent lithium electrolyte. In electrolytes of low concentration, one can obtain a quantitative model by assuming that the solution is made up of discrete ion-containing clusters–neutral ion pairs, negatively and positively charged triplets, neutral quadruplets, and so on. These clusters can be identified in simulations using simple algorithms, provided their lifetimes are sufficiently long. In concentrated electrolytes, more clusters are short-lived and more rigorous approaches that account for all correlations are necessary to quantify transference. Elucidating the molecular origin of the transference number in this limit remains an unmet challenge.

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

FY 18 Status Report on the Computing Systems for the Yucca Mountain Project TSPA-LA Models and Inventory of Software used for Process Models

Sandia National Laboratories (SNL) continued evaluation of total system performance assessment (TSPA) computing systems for the previously considered Yucca Mountain Project (YMP). This was done to maintain the operational readiness of the computing infrastructure (computer hardware and software) and knowledge capability for total system performance assessment (TSPA) type analysis, as directed by the National Nuclear Security Administration (NNSA), DOE 2010. This work is a continuation of the ongoing readiness evaluation reported in Lee and Hadgu (2014), Hadgu et al. (2015) and Hadgu and Appel (2016), and Hadgu et al. (2017). The TSPA computing hardware (2014 server cluster -CL2014) and storage system described in Hadgu et al. (2015) were used for the current analysis. One floating license of Gold Sim with Versions 9.60.300, 10.5, 11.1 and 12.0 was installed on the cluster head node, and its distributed processing capability was mapped on the cluster processors. Other supporting software were tested and installed to support the TSPA-type analysis on the server cluster. The FY18 task included developing an inventory of software used for the Yucca Mountain Project process models and preliminary assessment of status of the software; enhancing security of the cluster and setting a backup system. The 2014 server cluster and supporting software systems are fully operational to support TSPA-LA type analysis.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2025

Density Functional Tight Binding Insights into Plasmonic Silver–Platinum Nanoparticles and Alloys for Enhanced Photocatalysis

Developing accurate and efficient Slater-Koster (SK) tight-binding parameter sets is essential for quantum plasmonic studies of alloyed metal nanoparticles, as conventional time dependent density functional theory (TD-DFT) calculations are computationally prohibitive for larger clusters. In this work, we develop and validate density functional tight binding (DFTB) parameter sets for both ground state (GS-SK) and excited state (ES-SK) calculations to study the structural, electronic, and optical properties of silver (Ag), platinum (Pt), and Ag–Pt nanoalloys. Our investigation of the ground state properties demonstrates that the GS-SK parameters enable DFTB to closely reproduce the electronic structures of platinum clusters with diverse sizes and geometries – showing qualitative agreement with DFT for density of states (DOS) profiles and energy levels. The ES-SK parameters accurately describe excited-state properties compared to TD-DFT reference calculations, including the broad, featureless absorption profiles of Pt that are dominated by interband transitions. Using the ES-SK parameters within a real-time TD-DFTB framework, we compute size-dependent optical absorption spectra of Ag, Pt and Ag-Pt nanocubes containing up to 1099 atoms (size ∼4.18 nm). A detailed study of Ag–Pt and Pt-Ag core–shell nanoparticles shows quenching of the Ag plasmon resonance even at monolayer coverage for Ag-Pt, but not for Pt-Ag. We also show how to define submonolayer Ag-core Pt-shell cubic structures that have similar optical properties to those generated experimentally for much larger particles, which offers potential for describing plasmon-enhanced photocatalysis. Collectively, the GS-SK and ES-SK parameter sets provide an accurate, computationally efficient approach for modeling the complex optical and electronic behavior of noble–transition metal nanostructures and their alloys.

SPR↗