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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 505 records · Page 28

All sources NASA NTRS DOE OSTI

DOE OSTI2020

Iron(III)–Oxo Cluster Chemistry with Dimethylarsinate Ligands: Structures, Magnetic Properties, and Computational Studies

A program has been initiated to develop Fe III /oxo cluster chemistry with the ‘pseudo-carboxylate’ ligand dimethylarsinate (Me 2 AsO 2 - ) for comparison with the well investigated Fe III /oxo/carboxylate cluster area. The synthesis and characterization of three polynuclear Fe III complexes are reported, [Fe 12 O 4 (O 2 C t Bu) 8 (O 2 AsMe 2 ) 17 (H 2 O) 3 ]Cl 3 (1), Na 2 [Fe 12 Na 2 O 4 (O 2 AsMe 2 ) 20 (NO 3 ) 6 (Me 2 AsO 2 H) 2 (H 2 O) 4 ](NO 3 ) 6 (2) and [Fe 3 (O 2 AsMe 2 ) 6 (Me 2 AsO 2 H) 2 (hqn) 2 ](NO 3 ) (3), where hqn is 8-hydroxyquinoline. The Fe 12 core of 1 is a type never previously encountered in Fe III carboxylate chemistry, consisting of two Fe 6 units each of which comprises two {Fe 3 (μ 3 -O 2- )} units bridged by three Me 2 AsO 2 - groups and linked into an Fe 12 loop structure by two anti-anti η 1 :η 1 :μ Me 2 AsO 2 - groups, a bridging mode extremely rare with carboxylates. 2 also consists of two Fe 6 units, differing in their ligation from those in 1, and this time linked together into a linear structure by a central {Na 2 (NO 3 ) 2 } bridging unit. 3 is a linear Fe 3 complex with no monoatomic bridges between Fe III ions, a very rare situation in Fe III chemistry with any ligands, and unprecedented in Fe carboxylate chemistry. The distinct differences observed in arsinate vs carboxylate ligation modes are rationalized largely based on the greater basicity of the former vs the latter. Variable-temperature dc and ac magnetic susceptibility data reveal all Fe 2 pairwise interactions to be antiferromagnetic. For 1 and 2, the different J ij couplings were estimated by use of a magnetostructural correlation for high nuclearity Fe III -oxo clusters and by density functional theory calculations using broken symmetry methods, allowing identification of their relative spin vector alignments and thus rationalization of their S = 0 ground states. The J ij values were then used as input values to give excellent fits of the experimental χM T vs T data. For 3, the fits of the experimental χM T vs T data to the Van Vleck equation or with PHI gave a very weak J 12 = -0.8(1) cm -1 (H = –2JŠ i ·Š j convention) between adjacent Fe III ions, and an S = 5/2 ground state. Furthermore, these initial Fe III arsinate complexes also provide structural parameters that help validate literature assignments of arsinate binding modes to iron oxide/hydroxide minerals as part of environmental concerns of using arsenic-containing herbicides in agriculture.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NASA NTRS2006

PVM Enhancement for Beowulf Multiple-Processor Nodes

A recent version of the Parallel Virtual Machine (PVM) computer program has been enhanced to enable use of multiple processors in a single node of a Beowulf system (a cluster of personal computers that runs the Linux operating system). A previous version of PVM had been enhanced by addition of a software port, denoted BEOLIN, that enables the incorporation of a Beowulf system into a larger parallel processing system administered by PVM, as though the Beowulf system were a single computer in the larger system. BEOLIN spawns tasks on (that is, automatically assigns tasks to) individual nodes within the cluster. However, BEOLIN does not enable the use of multiple processors in a single node. The present enhancement adds support for a parameter in the PVM command line that enables the user to specify which Internet Protocol host address the code should use in communicating with other Beowulf nodes. This enhancement also provides for the case in which each node in a Beowulf system contains multiple processors. In this case, by making multiple references to a single node, the user can cause the software to spawn multiple tasks on the multiple processors in that node.

Springer, Paul↗

DOE OSTI2014

Region templates: Data representation and management for high-throughput image analysis

Compartment fires exhibit unique features associated with smoke accumulation and restricted air ventilation. The objective of the present study is to evaluate the ability of CFD-based fire models to simulate these features and in particular the effects of flame extinction that results from under-ventilated fire conditions. The study is performed using FireFOAM; FireFOAM is an advanced fire modeling software developed by FM Global and is based on a general-purpose open-source software called OpenFOAM. A new flame extinction model based on the concept of a critical value of the flame Damköhler number is incorporated into FireFOAM. The performance of the extinction model is evaluated via comparisons with a previously developed experimental database corresponding to a reduced-scale, heptane-fueled, compartment fire configuration. The numerical simulations also include a description of fuel evaporation driven by the computed gas-to-liquid heat feedback. Comparisons between experimental data and numerical results provide a suitable test bed to evaluate the ability of CFD-based fire models to describe the transition from over- to under-ventilated fire conditions, as well as the transition from extinction-free conditions to conditions in which the flame experiences partial or total quenching.

Energy & Fuels↗

DOE OSTI2015

Reproduction of the Yucca Mountain Project TSPA-LA Model Runs using TSPA Computing Systems

Sandia National Laboratories (SNL) conducted an evaluation of total system performance assessment (TSPA) related 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). The current work examined main components of the computing system identified in the previous work (Lee and Hadgu, 2014) to ensure the operational readiness of the TSPA-LA model capability on the server cluster. The TSPA computing hardware and storage system were replaced in late 2014 to maintain core capability and improve computation efficiency. One floating license of GoldSim Version 9.60.300 was installed on the upgraded cluster head node, and its distributed processing capability was mapped on the cluster processors. Other supporting software was tested and installed to support the TSPA-type analysis on the server cluster. All the TSPA-LA modeling cases were tested and verified for the model reproducibility on the upgraded 2014 server cluster (CL2014). All test runs were executed on multiple processors on the server cluster utilizing the GoldSim distributed processing capability, and all runs completed successfully. The model reproducibility verification was evaluated by two approaches: numerical value comparison and graphical comparison. The analysis demonstrated an excellent reproducibility of the TSPA-LA model runs on the upgraded server cluster. The 2014 server cluster and supporting software systems are fully operational to support TSPA- LA type analysis.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

Reproduction of the Yucca Mountain Project TSPA-LA Model Runs using TSPA Computing Systems

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2013

Scheduling Operations for Massive Heterogeneous Clusters

High-performance computing (HPC) programming has become increasingly difficult with the advent of hybrid supercomputers consisting of multicore CPUs and accelerator boards such as the GPU. Manual tuning of software to achieve high performance on this type of machine has been performed by programmers. This is needlessly difficult and prone to being invalidated by new hardware, new software, or changes in the underlying code. A system was developed for task-based representation of programs, which when coupled with a scheduler and runtime system, allows for many benefits, including higher performance and utilization of computational resources, easier programming and porting, and adaptations of code during runtime. The system consists of a method of representing computer algorithms as a series of data-dependent tasks. The series forms a graph, which can be scheduled for execution on many nodes of a supercomputer efficiently by a computer algorithm. The schedule is executed by a dispatch component, which is tailored to understand all of the hardware types that may be available within the system. The scheduler is informed by a cluster mapping tool, which generates a topology of available resources and their strengths and communication costs. Software is decoupled from its hardware, which aids in porting to future architectures. A computer algorithm schedules all operations, which for systems of high complexity (i.e., most NASA codes), cannot be performed optimally by a human. The system aids in reducing repetitive code, such as communication code, and aids in the reduction of redundant code across projects. It adds new features to code automatically, such as recovering from a lost node or the ability to modify the code while running. In this project, the innovators at the time of this reporting intend to develop two distinct technologies that build upon each other and both of which serve as building blocks for more efficient HPC usage. First is the scheduling and dynamic execution framework, and the second is scalable linear algebra libraries that are built directly on the former.

Humphrey, John↗

DOE OSTI2022

Quantum annealing for jet clustering with thrust

Quantum computing holds the promise of substantially speeding up computationally expensive tasks, such as solving optimization problems over a large number of elements. In high-energy collider physics, quantum-assisted algorithms might accelerate the clustering of particles into jets. In this study, we benchmark quantum annealing strategies for jet clustering based on optimizing a quantity called “thrust” in electron-positron collision events. Here, we find that quantum annealing yields similar performance to exact classical approaches and classical heuristics, after tuning the annealing parameters. Without tuning, comparable performance can be obtained through a hybrid quantum/classical approach.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2020

SPIDERS: overview of the X-ray galaxy cluster follow-up and the final spectroscopic data release

ABSTRACT SPIDERS (The SPectroscopic IDentification of eROSITA Sources) is a large spectroscopic programme for X-ray selected galaxy clusters as part of the Sloan Digital Sky Survey-IV (SDSS-IV). We describe the final data set in the context of SDSS Data Release 16 (DR16): the survey overall characteristics, final targeting strategies, achieved completeness, and spectral quality, with special emphasis on its use as a galaxy cluster sample for cosmology applications. SPIDERS now consists of about 27 000 new optical spectra of galaxies selected within 4000 photometric red sequences, each associated with an X-ray source. The excellent spectrograph efficiency and a robust analysis pipeline yield a spectroscopic redshift measurement success rate exceeding 98 per cent, with a median velocity accuracy of 20 km s−1 (at z = 0.2). Using the catalogue of 2740 X-ray galaxy clusters confirmed with DR16 spectroscopy, we reveal the 3D map of the galaxy cluster distribution in the observable Universe up to z ∼ 0.6. We highlight the homogeneity of the member galaxy spectra among distinct regions of the galaxy cluster phase space. Aided by accurate spectroscopic redshifts and by a model of the sample selection effects, we compute the galaxy cluster X-ray luminosity function and we present its lack of evolution up to z = 0.6. Finally we discuss the prospects of forthcoming large multiplexed spectroscopic programmes dedicated to follow up the next generation of all-sky X-ray source catalogues.

Clerc, N.↗

DOE OSTI2017

BD-CATS-IO

Modern cosmology and plasma physics codes are now capable of simulating trillions of particles on petascale systems. Each timestep output from such simulations is on the order of 10s of TBs. Summarizing and visualizing raw particle data is challenging, and scientists often focus on density structures, whether in the real 3D space, or a high-dimensional phase space. In this work, code was developed for reading 10s of terabytes of data and for writing the resultant cluster IDs for each particle. This code will be part of a highly scalable version of the clustering algorithm DBSCAN, and apply it to the largest datasets produced by state-of-the-art codes. The overall function of BD-CATS (Big Data Clustering at Trillion Particles Scale) is to perform end-to-end analysis: loading the data, dynamic partitioning, computing kdtrees, performing clustering analysis, and storing the results. BD-CATS-IO provides the functionality of loading the data and storing the results.

Byna, Surendra↗

NASA NTRS2003

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental tool in numerous image processing and remote sensing applications. For example, unsupervised clustering is often used to obtain vegetation maps of an area of interest. This approach is useful when reliable training data are either scarce or expensive, and when relatively little a priori information about the data is available. Unsupervised clustering methods play a significant role in the pursuit of unsupervised classification. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points (or samples) in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute a set of cluster centers in d-space. Although there is no specific optimization criterion, the algorithm is similar in spirit to the well known k-means clustering method in which the objective is to minimize the average squared distance of each point to its nearest center, called the average distortion. One significant feature of ISOCLUS over k-means is that clusters may be merged or split, and so the final number of clusters may be different from the number k supplied as part of the input. This algorithm will be described in later in this paper. The ISOCLUS algorithm can run very slowly, particularly on large data sets. Given its wide use in remote sensing, its efficient computation is an important goal. We have developed a fast implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm, the filtering algorithm, by Kanungo et al.. They showed that, by storing the data in a kd-tree, it was possible to significantly reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm. For technical reasons, which are explained later, it is necessary to make a minor modification to the ISOCLUS specification. We provide empirical evidence, on both synthetic and Landsat image data sets, that our algorithm's performance is essentially the same as that of ISOCLUS, but with significantly lower running times. We show that our algorithm runs from 3 to 30 times faster than a straightforward implementation of ISOCLUS. Our adaptation of the filtering algorithm involves the efficient computation of a number of cluster statistics that are needed for ISOCLUS, but not for k-means.

Memarsadeghi, Nargess↗

DOE OSTI2021

hydro-hifem v.1.0

SAND2021-3180 O The hydro-hifem 1.0 software is used to simulate transient physical processes in large geologic environments consisting of complex fractures and man-made infrastructures with affordable computational cost and mesh refinement. The Earth models with such complex model features can be designed by considering the reduction of insignificant dimensions of fractures/infrastructures and embracing their corresponding hierarchical material properties, and their computational meshes are generated by using Cubit. The finite element solutions are automatically distributed across nodes of parallel cluster for efficient computation of transient fluid flow or heat conduction in geologic media. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Beskardes, GungorDidem↗

NASA NTRS2006

Radio Point Sources Toward Galaxy Clusters at 30 GHz

Extra-galactic point sources are a significant contaminant in cosmic microwave background and Sunyaev-Zel'dovich effect experiments. Deep interferometric observations with the BIMA and OVRO arrays are used to characterize the spatial, spectral, and flux distributions of radio point sources toward galaxy clusters at 28.5 GHz. We compute counts of mJy point source fluxes from 90 fields centered on known massive galaxy clusters and 8 non-cluster fields. Counts in the non-cluster fields are consistent with extrapolations from the results of other surveys. We also compute counts towards clusters as a function of luminosity in three redshift bins out to z = 1.0 and see no clear evidence for evolution with redshift. We compute spectral indices of mJy sources in cluster fields between 1.4 and 28.5 GHz. The distribution is skewed, with a median spectral index of 0.76 and 25th and 75th percentiles of 0.55 and 0.95, respectively. This is steeper than the spectral indices of brighter field point sources measured by other surveys.

Coble, K.↗

DOE OSTI2017

Sulfate radical oxidation of aromatic contaminants: a detailed assessment of density functional theory and high-level quantum chemical methods

We present that advanced oxidation processes that utilize highly oxidative radicals are widely used in water reuse treatment. In recent years, the application of sulfate radical (SO 4 ˙ - ) as a promising oxidant for water treatment has gained increasing attention. To understand the efficiency of SO 4 ˙ - in the degradation of organic contaminants in wastewater effluent, it is important to be able to predict the reaction kinetics of various SO 4 ˙ - -driven oxidation reactions. In this study, we utilize density functional theory (DFT) and high-level wavefunction-based methods (including computationally-intensive coupled cluster methods), to explore the activation energies of SO 4 ˙ - -driven oxidation reactions on a series of benzene-derived contaminants. Additionally, these high-level calculations encompass a wide set of reactions including 110 forward/reverse reactions and 5 different computational methods in total. Based on the high-level coupled-cluster quantum calculations, we find that the popular M06-2X DFT functional is significantly more accurate for OH - additions than for SO 4 ˙ - reactions. Most importantly, we highlight some of the limitations and deficiencies of other computational methods, and we recommend the use of high-level quantum calculations to spot-check environmental chemistry reactions that may lie outside the training set of the M06-2X functional, particularly for water oxidation reactions that involve SO 4 ˙ - and other inorganic species.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2016

Multi-node and Multi-core Performance Studies of a Monte Carlo code RMC

Over the past 15 years the architecture of high-performance computing systems has become increasingly heterogeneous with individual computing cores being subdivided into nodes and even auxiliary co-processing units such as graphics processing units or the Intel many integrated core co-processors. In fact, future computer platforms is moving toward a larger number of nodes and cores with lower memory available per node. Today, several production Monte Carlo codes use some types of hybrid parallelism strategy that makes use of shared-memory parallelism within a computing node and message-passing parallelism between nodes, which enables the codes to utilize available computing resources as much as possible, both among and within computing nodes on a cluster. The so-called hybrid parallelization is also possible with Reactor Monte Carlo Code RMC by activating both MPI and OpenMP parallel algorithms together. On HPC' which typically consists of several or several-ten thousand nodes equipping 16-32 computing intra-cores per node, simulation of RMC can be carried out in the hybrid parallelization with the MPI inter-node parallelization and the OpenMP intra-node parallelization. RMC has adopted a hybrid message-passing and shared-memory approach to parallelism, which enables the code to utilize available computing resources, both among and within computing nodes on a cluster. Shared-memory parallelism is especially valuable for large-model simulations because it enables multiple compute cores within a node to share common model information such as the geometry description, material, cross section and tally data, thus reducing the memory usage per processor. The calculation on the Tianhe-2 supercomputer took 6144 cores, resulting in a rate of 173,314,000 neutrons/minute for BEAVRS benchmark. While pin-wise full core H-M benchmark burnup calculations with millions of depletion regions was selected using MPI/OpenMP parallelism, the speed of 6,144 cores reach 1,843,200 burnable regions per minute. Keeping up with the continuing trend for increases in the number of computing resources within modern HPC systems is a significant challenge for teams that develop and maintain high-performance MC radiation transport solvers. order to address this challenge, RMC has adopted a hybrid message-passing and shared-memory approach to parallelism, which enables the code to utilize available computing resources, both among and within computing nodes on a cluster. Shared-memory parallelism is especially valuable for large-model simulations because it enables multiple compute cores within a node to share common model information such as the geometry description, material and composition definitions, and cross section data, thus reducing the memory usage per processor. The parallel performance has been studied by using two complex and representative benchmarks, H-M and BEAVRS benchmark. All simulations were run on Intel Xeon E5-2692 12 core, 2.2 GHz processors at MilkyWay-2 Super Computer with up to 12,288 available computing cores. While employing MPI parallelism, excellent parallel efficiency is achieved even above 12,000 processors and RMC reaches the parallel efficiency of 96% on 12,288 cores for the pin-by-pin computation of the BEAVRS benchmark. While BEAVRS criticality benchmark was selected using MPI/OpenMP parallelism, the speed of 6,144 cores reach 173,314,000 particles per minute. While pin-wise full core H-M benchmark burnup calculations with millions of depletion regions was selected using MPI/OpenMP parallelism, the speed of 6,144 cores reach 1,843,200 burnable regions per minute. Results from these studies demonstrate that RMC, using the hybrid parallel model described in this paper, is able to handle pin-wise full core burnup calculations with millions of depletion regions and scales well through thousands of processors. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2017

Computing eddy-driven effective diffusivity using Lagrangian particles

A novel method to derive effective diffusivity from Lagrangian particle trajectory data sets is developed and then analyzed relative to particle-derived meridional diffusivity for eddy-driven mixing in an idealized circumpolar current. Quantitative standard dispersion- and transport-based mixing diagnostics are defined, compared and contrasted to motivate the computation and use of effective diffusivity derived from Lagrangian particles. We compute the effective diffusivity by first performing scalar transport on Lagrangian control areas using stored trajectories computed from online Lagrangian In-situ Global High-performance particle Tracking (LIGHT) using the Model for Prediction Across Scales Ocean (MPAS-O). Furthermore, the Lagrangian scalar transport scheme is compared against an Eulerian scalar transport scheme. Spatially-variable effective diffusivities are computed from resulting time-varying cumulative concentrations that vary as a function of cumulative area. The transport-based Eulerian and Lagrangian effective diffusivity diagnostics are found to be qualitatively consistent with the dispersion-based diffusivity. All diffusivity estimates show a region of increased subsurface diffusivity within the core of an idealized circumpolar current and results are within a factor of two of each other. The Eulerian and Lagrangian effective diffusivities are most similar; smaller and more spatially diffused values are obtained with the dispersion-based diffusivity computed with particle clusters.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2016

Photoconductivities from band states and a dissipative electron dynamics: Si(111) without and with adsorbed Ag clusters

A new general computational procedure is presented to obtain photoconductivities starting from atomic structures, combining ab initio electronic energy band states with populations from density matrix theory, and implemented for a specific set of materials based on Si crystalline slabs and their nanostructured surfaces without and with adsorbed Ag clusters. The procedure accounts for charge mobility in semiconductors in photoexcited states, and specifically electron and hole photomobilities at Si(111) surfaces with and without adsorbed Ag clusters using ab initio energy bands and orbitals generated from a generalized gradient functional, however with excited energy levels modified to provide correct bandgaps. Photoexcited state populations for each band and carrier type were generated using steady state solution of a reduced density matrix which includes dissipative medium effects. The present calculations provide photoexcited electronic populations and photoinduced mobilities resulting from applied electric fields and obtained from the change of driven electron energies with their electronic momentum. Extensive results for Si slabs with 8 layers, without and with adsorbed Ag clusters, show that the metal adsorbates lead to substantial increases in the photomobility and photoconductivity of electrons and holes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2026

How Cloud is Accelerating Research at NREL

This presentation coincides with AWS's announcement of their new Parallel Computing Service (PCS) which allows for easy creation of HPC-style clusters in their AWS cloud computing platform. I helped them beta test this service before it was made generally available in August. AWS asked if we would be interested in discussing our experience with the PCS service, and our experience with HPC workloads in the cloud in general, so this slideshow discusses a brief history of scientific computing at NREL and shares a bit of our experiences and approach to utilizing cloud services for HPC-style workloads.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1994

Convergence rate enhancement of navier-stokes codes on clustered grids

Our Sensitivity-Based Minimal Residual (SBMR) method which is based on our earlier Distributed Minimal Residual (DMR) method allows each component of the solution vector in a system of equations to have its own convergence speed. Our global SBMR method was found to consistently outperform the DMR method while requiring considerably less computer memory. Recently, we have developed and tested a new Line SBMR or LSBMR method and a Time-Step-Scaling (TSS) method that are even more robust and computationally efficient than our global SBMR method, especially on highly clustered computational grids in laminar and turbulent flow computations.

Choi, Kwang-Yoon↗