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 973 records · Page 54

Computer Simulation of Fracture in Aerogels

Aerogels are of interest to the aerospace community primarily for their thermal properties, notably their low thermal conductivities. While the gels are typically fragile, recent advances in the application of conformal polymer layers to these gels has made them potentially useful as lightweight structural materials as well. In this work, we investigate the strength and fracture behavior of silica aerogels using a molecular statics-based computer simulation technique. The gels' structure is simulated via a Diffusion Limited Cluster Aggregation (DLCA) algorithm, which produces fractal structures representing experimentally observed aggregates of so-called secondary particles, themselves composed of amorphous silica primary particles an order of magnitude smaller. We have performed multi-length-scale simulations of fracture in silica aerogels, in which the interaction b e e n two secondary particles is assumed to be described by a Morse pair potential parameterized such that the potential range is much smaller than the secondary particle size. These Morse parameters are obtained by atomistic simulation of models of the experimentally-observed amorphous silica "bridges," with the fracture behavior of these bridges modeled via molecular statics using a Morse/Coulomb potential for silica. We consider the energetics of the fracture, and compare qualitative features of low-and high-density gel fracture.

Good, Brian S.↗

NASA Wearable Technology CLUSTER 2013-2014 Report

Wearable technology has the potential to revolutionize the way humans interact with one another, with information, and with the electronic systems that surround them. This change can already be seen in the dramatic increase in the availability and use of wearable health and activity monitors. These devices continuously monitor the wearer using on-­‐body sensors and wireless communication. They provide feedback that can be used to improve physical health and performance. Smart watches and head mounted displays are also receiving a great deal of commercial attention, providing immediate access to information via graphical displays, as well as additional sensing features. For the purposes of the Wearable Technology CLUSTER, wearable technology is broadly defined as any electronic sensing, human interfaces, computing, or communication that is mounted on the body. Current commercially available wearable devices primarily house electronics in rigid packaging to provide protection from flexing, moisture, and other contaminants. NASA mentors are interested in this approach, but are also interested in direct integration of electronics into clothing to enable more comfortable systems. For human spaceflight, wearable technology holds a great deal of promise for significantly improving safety, efficiency, autonomy, and research capacity for the crew in space and support personnel on the ground. Specific capabilities of interest include: Continuous biomedical monitoring for research and detection of health problems. Environmental monitoring for individual exposure assessments and alarms. Activity monitoring for responsive robotics and environments. Multi-modal caution and warning using tactile, auditory, and visual alarms. Wireless, hands-free, on-demand voice communication. Mobile, on-demand access to space vehicle and robotic displays and controls. Many technical challenges must be overcome to realize these wearable technology applications. For example, to make a wearable device that is both functional and comfortable for long duration wear, developers must strive to reduce electronic mass and volume while also addressing constraints imposed by the body attachment method. Depending on the application, the device must be placed in a location that the user can see and reach, and that provides the appropriate access to air and the wearer's skin. Limited power is available from body-­‐worn batteries and heat must be managed to prevent discomfort. If the clothing is to be washed, there are additional durability and washability hurdles that traditional electronics are not designed to address. Finally, each specific capability has unique technical challenges that will likely require unique solutions. In addition to the technical challenges, development of wearable devices is made more difficult by the diversity of skills required and the historic lack of collaboration across domains. Wearable technology development requires expertise in textiles engineering, apparel design, software and computer engineering, electronic design and manufacturing, human factors engineering, and application-­‐specific fields such as acoustics, medical devices, and sensing. Knowledge from each of these domains must be integrated to create functional and comfortable devices. For this reason, the diversity of knowledge and experience represented in the Wearable Technology is critical to overcoming the fundamental challenges in the field.

Simon, Cory↗

Performance and usability enhancements for continuous subgraph matching queries on graph-structured data

A query graph, which includes vertices and edges, represents a query on graph-structured data. The query graph is decomposed into query subgraphs. A network analysis tool performs continuous subgraph matching queries to facilitate analysis of computer network traffic, social media events, or other streams of data represented as a dynamic data graph (graph-structured data). This can help identify emerging trends in the data. Some features of the network analysis tool enhance performance by effectively utilizing distributed computing resources (including processing cores and memory at different nodes of a cluster) to speed up the process of updating the dynamic data graph and detecting matches of query subgraphs. Features of a query graph building tool enhance usability by providing intuitive ways to specify query graphs and their subgraphs. Features of a results visualization tool enhance usability by providing an intuitive way to present the results of continuous subgraph matching queries.

Choudhury, Sutanay↗

The DESI DR1 Peculiar Velocity Survey: Mock Catalog

We describe the production of the official set of mock catalogs for the Dark Energy Spectroscopic Instrument Peculiar Velocity Survey (DESI-PV) Data Release 1 (DR1). Our mock catalogs reproduce the Bright Galaxy Survey number density and clustering at low redshift $(z<0.1)$ and the DESI PV samples of Fundamental plane and Tully-Fisher distances, from which we derive peculiar velocities. We carefully match mock and data properties and we mimic measurements of distance indicators and peculiar velocities, which follow the same statistical properties as real data. Mock samples of type-Ia supernovae also complement the other two distance indicators. Our 675 available mock realizations were used consistently by our three different methodologies described in our companion papers that measure the growth rate of structure $fσ_8$ with DESI PV DR1. Those mocks allow us to perform precise tests of clustering models and uncertainty estimation to an unprecedented level of accuracy, and compute correlations between methodologies. The consensus value for the DESI DR1 PV growth rate measurement is $fσ_8 = 0.450 \pm 0.055$. This sample of mock catalogs represents the largest and most realistic set for cosmological measurements with peculiar velocities to date.

Bautista, J. [Marseille, CPPM]↗

Continuous-variable quantum computation of the O(3) model in 1+1 dimensions

We formulate the $O(3)$ non-linear sigma model in $1+1$ dimensions as a limit of a three-component scalar field theory restricted to the unit sphere in the large squeezing limit. This allows us to describe the model in terms of the continuous variable (CV) approach to quantum computing. Here we construct the ground state and excited states using the coupled cluster ansatz and find excellent agreement with the exact diagonalization results for a small number of lattice sites. We then present the simulation protocol for the time evolution of the model using CV gates, estimate the discretization error, and present numerical results obtained from a photonic quantum simulator. We expect that the methods developed in this work will be useful for exploring interesting dynamics for a wide class of sigma models and gauge theories, as well as for simulating scattering events on quantum hardware in the coming decade.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Rapid subsurface analysis of frequency-domain thermoreflectance images with K-means clustering

K-means clustering analysis is applied to frequency-domain thermoreflectance (FDTR) hyperspectral image data to rapidly screen the spatial distribution of thermophysical properties at material interfaces. Performing FDTR while raster scanning a sample consisting of 8.6 μm of doped-silicon (Si) bonded to a doped-Si substrate identifies spatial variation in the subsurface bond quality. Routine thermal analysis at select pixels quantifies this variation in bond quality and allows assignment of bonded, partially bonded, and unbonded regions. Performing this same routine thermal analysis across the entire map, however, becomes too computationally demanding for rapid screening of bond quality. To address this, K-means clustering was used to reduce the dimensionality of the dataset from more than 20 000 pixel spectra to just K = 3 component spectra. The three component spectra were then used to express every pixel in the image through a least-squares minimized linear combination providing continuous interpolation between the components across spatially varying features, e.g., bonded to unbonded transition regions. Fitting the component spectra to the thermal model, thermal properties for each K cluster are extracted and then distributed according to the weighting established by the regressed linear combination. Thermophysical property maps are then constructed and capture significant variation in bond quality over 25 μm length scales. The use of K-means clustering to achieve these thermal property maps results in a 74-fold speed improvement over explicit fitting of every pixel.

36 MATERIALS SCIENCE↗

Ab Initio Computation of the Longitudinal Response Function in 40 Ca

In this work, we present a consistent ab initio computation of the longitudinal response function RL in 40 Ca using the coupled-cluster and Lorentz integral transform methods starting from chiral nucleon-nucleon and three-nucleon interactions. We validate our approach by comparing our results for R L in 4 He and the Coulomb sum rule in 40 Ca against experimental data and other calculations. For R L in 40 Ca we obtain a very good agreement with experiment in the quasielastic peak up to intermediate momentum transfers, and we find that final state interactions are essential for an accurate description of the data. This work presents a milestone towards ab initio computations of neutrino-nucleus cross sections relevant for experimental long-baseline neutrino programs.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Reefing Line Tension in CPAS Main Parachute Clusters

Reefing lines are an essential feature to manage inflation loads. During each Engineering Development Unit (EDU) test of the Capsule Parachute Assembly System (CPAS), a chase aircraft is staged to be level with the cluster of Main ringsail parachutes during the initial inflation and reefed stages. This allows for capturing high-quality still photographs of the reefed skirt, suspension line, and canopy geometry. The over-inflation angles are synchronized with measured loads data in order to compute the tension force in the reefing line. The traditional reefing tension equation assumes radial symmetry, but cluster effects cause the reefed skirt of each parachute to elongate to a more elliptical shape. This effect was considered in evaluating multiple parachutes to estimate the semi-major and semi-minor axes. Three flight tests are assessed, including one with a skipped first stage, which had peak reefing line tension over three times higher than the nominal parachute disreef sequence.

Ray, Eric S.↗

Productive Programming of Distributed Systems with the SHAD C++ Library

High-performance computing (HPC) is often perceived as a matter of making large-scale systems (e.g., clusters) run as fast as possible, regardless the required programming effort. However, the idea of "bringing HPC to the masses" has recently emerged. Inspired by this vision, we have designed SHAD, the Scalable High-performance Algorithms and Data-structures library. SHAD is open source software, written in C++, for C++ developers. Unlike other HPC libraries for distributed systems, which rely on SPMD models, SHAD adopts a shared-memory programming abstraction, to make C++ programmers feel at home. Underneath, SHAD manages tasking and data-movements, moving the computation where data resides and taking advantage of asynchrony to tolerate network latency. At the bottom of his stack, SHAD can interface with multiple runtime systems: this not only improves developer’s productivity, by hiding the complexity of such software and of the underlying hardware, but also greatly enhance code portability. Thanks to its abstraction layers, SHAD can indeed target different systems, ranging from laptops to HPC clusters, without any need for modifying the user-level code. We have prototyped and open-sourced the implementation of (a subset of) the C++ standard library (STL) targeting multi-node HPC clusters. Our work allows plain STL-based C++ code to scale on HPC systems, with no need for rewriting the code to exploit the complex hardware. SHAD is available under Apache v2 License at https://github.com/pnnl/SHAD. In this paper we overview the design of the SHAD library, depicting its main components: runtime systems abstractions for tasking; parallel and distributed data-structures; STL-compliant interfaces and algorithms.

Castellana, Vito G.↗

Sachdev-Ye-Kitaev model on a noisy quantum computer

Here we study the SYK model -- an important toy model for quantum gravity on IBM's superconducting qubit quantum computers. By using a graph-coloring algorithm to minimize the number of commuting clusters of terms in the qubitized Hamiltonian, we find the gate complexity of the time evolution using the first-order product formula for N Majorana fermions is $\mathscr{O}$(N 5 J 2 t 2 /ε) where J is the dimensionful coupling parameter, t is the evolution time, and ε is the desired precision. With this improved resource requirement, we perform the time evolution for N=6,8 with maximum two-qubit circuit depth of 343. We perform different error mitigation schemes on the noisy hardware results and find good agreement with the exact diagonalization results on classical computers and noiseless simulators. In particular, we compute return probability after time t and out-of-time order correlators (OTOC) which is a standard observable of quantifying the chaotic nature of quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

xSDK: Building an ecosystem of highly efficient math libraries for exascale

Current efforts to build increasingly powerful computer architectures are opening up new avenues for more complex and higher fidelity simulations coupled with data analytics and learning, leading to new scientific insights and deeper understanding. At one extreme, exascale computers will be much faster than previous computer generations (performing 10 18 operations per second—that is, 1,000 times faster than petascale). To achieve these performance improvements, computer architectures are becoming increasingly complex, with deep memory hierarchies, very high node and core counts, and heterogeneous features such as graphics processing units (GPUs). Such architectural changes impact the full breadth of computing scales, as heterogeneity pervades even current-generation laptops, workstations, and moderate-sized clusters. While emerging advanced architectures provide unprecedented opportunities, they also present significant challenges for developers of scientific applications, such as multiphysics and multiscale codes, who must adapt their software to handle disruptive changes in architectures and new programming models that have not yet stabilized. Developers must consider increasing concurrency while reducing communication and synchronization, and other complexities such as the potential for using mixed precision to leverage the compute power available in low-precision tensor cores. On one hand, developers must implement new scientific capabilities, which in turn increase code complexity. On the other hand, the codes must be ported to new architectures, requiring the inclusion of new programming models and the restructuring of code to achieve good performance. Addressing these issues is beyond the capability of any single person or team—leading to the need for collaboration among many teams, who encapsulate their expertise in reusable software and work together to create sustainable software ecosystems.

97 MATHEMATICS AND COMPUTING↗

The Einstein Observatory survey of stars in the Hyades cluster region

The paper reports the results of an extensive X-ray study of the Hyades region and improves on previous studies by using refined X-ray source detection algorithms and the complete set of Einstein Observatory IPC exposures covering the Hyades cluster region (a total of 63 1 x 1 deg images). Maximum likelihood integral X-ray luminosity functions were computed for the Hyades stars for given color index (B-V) ranges. The present results agree substantially with a previous survey about the ubiquity of the stellar activity in the Hyades cluster, especially among solar-type stars. The result of Stern et al. (1981) that stellar X-ray emission is dependent on stellar age is confrimed.

Micela, G.↗

I-GCN: A Graph Convolutional Network Accelerator with Runtime Locality Enhancement through Islandization

In this paper, we propose a novel hardware accelerator for GCN inference called I-GCN that significantly improves data locality and reduces unnecessary computation through a new online graph restructuring algorithm we refer to as islandization. The proposed algorithm finds clusters of nodes with strong internal but weak external connections. The islandization process yields two major benefits. First, by processing islands rather than individual nodes, there is better on-chip data reuse and fewer off-chip memory accesses. Second, there is less redundant computation as aggregation for common/shared neighbors in an island can be reused. The parallel search, identification, and leverage of graph islands are all handled purely in hardware at runtime working in an incremental pipelined manner. This is done without any preprocessing of the graph data or adjustment of the GCN model structure.

Geng, Tong↗

Conservation laws in coupled cluster dynamics at finite temperature

We extend the finite-temperature Keldysh non-equilibrium coupled cluster theory (Keldysh-CC) [A. F. White and G. K.-L. Chan, J. Chem. Theory Comput. 15, 6137–6253 (2019)] to include a time-dependent orbital basis. When chosen to minimize the action, such a basis restores local and global conservation laws (Ehrenfest’s theorem) for all one-particle properties while remaining energy conserving for time independent Hamiltonians. We present the time-dependent Keldysh orbital-optimized coupled cluster doubles method in analogy with the formalism for zero-temperature dynamics, extended to finite temperatures through the time-dependent action on the Keldysh contour. To demonstrate the conservation property and understand the numerical performance of the method, we apply it to several problems of nonequilibrium finite-temperature dynamics: a 1D Hubbard model with a time-dependent Peierls phase, laser driving of molecular H2, driven dynamics in warm-dense silicon, and transport in the single impurity Anderson model.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The dynamical state of RXCJ1230.7+3439: A multi-substructured merging galaxy cluster

We analyse the kinematical and dynamical state of the galaxy cluster RXCJ1230.7+3439 (RXCJ1230), at $z$ = 0.332 using 93 new spectroscopic redshifts of galaxies acquired at the Telescopio Nazionale Galileo and from SDSS DR16 public data. We study the density galaxy distribution retrieved from photometric SDSS multiband data and find that RXCJ1230 appears as a clearly isolated peak in the redshift space, with a global line-of-sight (LOS) velocity dispersion of $σ$ v = 1004 -122 +147 km s -1 . Several tests applied to the spatial and velocity distributions reveal that RXCJ1230 is a complex system with the presence of three subclusters, located to the southwest, east, and south with respect to the main body of the cluster, containing several bright galaxies (BGs) in their respective cores. Our analyses confirm that the three substructures are in a pre-merger phase, where the main interaction takes place with the southwest subclump, almost in the plane of the sky. We compute a velocity dispersion of $σ$ v ~ 1000 and $σ$ v ~ 800 km s -1 for the main cluster and the southwest substructure, respectively. The central main body and southwest substructure differ by ~870 km s -1 in the LOS velocity. From these data, we estimate a dynamical mass of $M$ 200 = 9.0 ± 1.5 × 1014 $M$ ⊙ and 4.4 ± 3.3 × 1014 $M$ ⊙ for the RXCJ1230 main body and southwest clump, respectively, which reveals that the cluster will undergo a merger characterised by a 2:1 mass ratio impact. We solve a two-body problem for this interaction and find that the most likely solution suggests that the merging axis lies ~17° from the plane of the sky and the subcluster will fully interact in ~0.3 Gyr. However, a slight excess in the X-ray temperature observed in the southwest clump confirms a certain degree of interaction already. The comparison between the dynamical masses and those derived from X-ray data reveals good agreement within errors (differences ~15%), which suggests that the innermost regions (< r 500 ) of the galaxy clumps are almost in hydrostatical equilibrium. In summary, RXCJ1230 is a young but also massive cluster in a pre-merging phase accreting other galaxy systems from its environment.

79 ASTRONOMY AND ASTROPHYSICS↗

Computer simulation of ledge formation and ledge interaction for the silicon (111) free surface

Both strip and triangular clusters, composed of 2 -1 -1 line ledges, have been simulated on the Si (111) surface. The long-range ledge-ledge interaction and the surface stress tensor distribution have been evaluated for these two pill-box geometries using a semiempirical potential-energy function that incorporates both two-body and three-body contributions. The consequences of the ledge-ledge interaction on two-dimensional nucleation for Si (111) has been evaluated as a function of Si adatom supersaturation and shown to differ significantly from conventional theory, where such interaction is neglected.

Balamane, H.↗

Efficient Parameterization of Density Functional Tight-Binding for 5 f -Elements: A Th–O Case Study

Density functional tight binding (DFTB) models for f-element species are challenging to parametrize owing to the large number of adjustable parameters. The explicit optimization of the terms entering the semiempirical DFTB Hamiltonian related to f orbitals is crucial to generating a reliable parametrization for f-block elements, because they play import roles in bonding interactions. However, since the number of parameters grows quadratically with the number of orbitals, the computational cost for parameter optimization is much more expensive for the f-elements than for the main group elements. In this work we present a set of efficient approaches for mitigating the hurdle imposed by the large size of the parameter space. A novel group-by-orbital correction functions for two-center bond integrals was developed. With this approach the number of parameters is reduced, and it grows linearly with the number of elements, maintaining the accuracy and the number of parameters, in the case of f elements, by more than 40%. The parameter optimization step was accelerated by means of the mini-batch BFGS method. This method allows parameter optimizations with much larger training sets than other single batch methods. A stochastic optimizer was employed that helped overcome shallow local minima in the objective function. The proposed algorithm was used to parametrize the DFTB Hamiltonian for the Th–O system, which was subsequently applied to the study of ThO 2 nanoparticles. The training set consisted of 6322 unique structures, which is barely feasible with conventional optimization methods. The optimized parameter set, LANL-ThO, displays good agreement with DFT-calculated properties such as energies, forces, and structures for both clusters and bulk ThO 2 . Benefiting from the fewer number of parameters and lower computational costs for objective function evaluations, this new approach shows its potential applications in DFTB parametrization for elements with high angular momentum, which present a challenge to conventional methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A dynamic parameterization of sulfuric acid–dimethylamine nucleation and its application in three-dimensional modeling

Sulfuric acid (SA) is a governing gaseous precursor for atmospheric new particle formation (NPF), a major source of global ultrafine particles, in environments studied around the world. In polluted urban atmospheres with high condensation sinks (CSs), the formation of stable SA–amine clusters, such as SA–dimethylamine (DMA) clusters, usually initializes intense NPF events. Coagulation scavenging and cluster evaporation are dominant sink processes of SA–amine clusters in urban atmospheres, yet these loss processes are not quantitatively included in the present parameterizations of SA–amine nucleation. We herein report a parameterization of SA–DMA nucleation, based on cluster dynamic simulations and quantum chemistry calculations, with certain simplifications to greatly reduce the computational costs. Compared with previous SA–DMA nucleation parameterizations, this new parameterization was able to reproduce the dependences of particle formation rates on temperature and CSs. We then incorporated it in a three-dimensional (3-D) chemical transport model to simulate the evolution of the particle number size distributions. Simulation results showed good consistency with the observations in the occurrence of NPF events and particle number size distributions in wintertime Beijing and represented a significant improvement compared to that using a parameterization without coagulation scavenging. Quantitative analysis shows that SA–DMA nucleation contributes significantly to nucleation rates and aerosol population during the 3-D simulations in Beijing (>99 % and >60 %, respectively). These results broaden the understanding of NPF in urban atmospheres and stress the necessity of including the effects of coagulation scavenging and cluster stability in simulating SA–DMA nucleation in 3-D simulations. Representing these processes is thus likely to improve model performance in particle source apportionment and quantification of aerosol effects on air quality, human health, and climate.

Li, Yuyang↗