Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel clustering”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

The evolution of the galaxy rest-frame ultraviolet luminosity function over the first two billion years

We present a robust measurement and analysis of the rest-frame ultraviolet (UV) luminosity functions at z = 4–8. We use deep Hubble Space Telescope imaging over the Cosmic Assembly Near-infrared Deep Extragalactic Legacy Survey/GOODS fields, the Hubble Ultra Deep Field, and the Hubble Frontier Field deep parallel observations near the Abell 2744 and MACS J0416.1-2403 clusters. The combination of these surveys provides an effective volume of 0.6–1.2 × 10{sup 6} Mpc{sup 3} over this epoch, allowing us to perform a robust search for faint (M{sub UV}=−18) and bright (M{sub UV}<−21) high-redshift galaxies. We select candidate galaxies using a well-tested photometric redshift technique with careful screening of contaminants, finding a sample of 7446 candidate galaxies at 3.5 < z < 8.5, with >1000 galaxies at z ≈ 6–8. We measure both a stepwise luminosity function for candidate galaxies in our redshift samples, and a Schechter function, using a Markov Chain Monte Carlo analysis to measure robust uncertainties. At the faint end, our UV luminosity functions agree with previous studies, yet we find a higher abundance of UV-bright candidate galaxies at z ⩾ 6. Our best-fit value of the characteristic magnitude M{sub UV}{sup ∗} is consistent with −21 at z ⩾ 5, which is different than that inferred based on previous trends at lower redshift, and brighter at ∼2σ significance than previous measures at z = 6 and 7. At z = 8, a single power law provides an equally good fit to the UV luminosity function, while at z = 6 and 7 an exponential cutoff at the bright end is moderately preferred. We compare our luminosity functions to semi-analytical models, and find that the lack of evolution in M{sub UV}{sup ∗} is consistent with models where the impact of dust attenuation on the bright end of the luminosity function decreases at higher redshift, although a decreasing impact of feedback may also be possible. We measure the evolution of the cosmic star-formation rate (SFR) density by integrating our observed luminosity functions to M{sub UV}=−17, correcting for dust attenuation, and find that the SFR density declines proportionally to (1 +z){sup −4.3±0.5} at z > 4, which is consistent with observations at z ⩾ 9. Our observed luminosity functions are consistent with a reionization history that starts at z ≳ 10, completes at z > 6, and reaches a midpoint (x{sub H II} = 0.5) at 6.7 < z < 9.4. Finally, using a constant cumulative number density selection and an empirically derived rising star-formation history, our observations predict that the abundance of bright z = 9 galaxies is likely higher than previous constraints, although consistent with recent estimates of bright z ∼ 10 galaxies.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2011

FISH: A THREE-DIMENSIONAL PARALLEL MAGNETOHYDRODYNAMICS CODE FOR ASTROPHYSICAL APPLICATIONS

FISH is a fast and simple ideal magnetohydrodynamics code that scales to {approx}10,000 processes for a Cartesian computational domain of {approx}1000{sup 3} cells. The simplicity of FISH has been achieved by the rigorous application of the operator splitting technique, while second-order accuracy is maintained by the symmetric ordering of the operators. Between directional sweeps, the three-dimensional data are rotated in memory so that the sweep is always performed in a cache-efficient way along the direction of contiguous memory. Hence, the code only requires a one-dimensional description of the conservation equations to be solved. This approach also enables an elegant novel parallelization of the code that is based on persistent communications with MPI for cubic domain decomposition on machines with distributed memory. This scheme is then combined with an additional OpenMP parallelization of different sweeps that can take advantage of clusters of shared memory. We document the detailed implementation of a second-order total variation diminishing advection scheme based on flux reconstruction. The magnetic fields are evolved by a constrained transport scheme. We show that the subtraction of a simple estimate of the hydrostatic gradient from the total gradients can significantly reduce the dissipation of the advection scheme in simulations of gravitationally bound hydrostatic objects. Through its simplicity and efficiency, FISH is as well suited for hydrodynamics classes as for large-scale astrophysical simulations on high-performance computer clusters. In preparation for the release of a public version, we demonstrate the performance of FISH in a suite of astrophysically orientated test cases.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2016

SU-G-TeP1-06: Fast GPU Framework for Four-Dimensional Monte Carlo in Adaptive Intensity Modulated Proton Therapy (IMPT) for Mobile Tumors

Purpose: To demonstrate the feasibility of fast Monte Carlo (MC) treatment planning and verification using four-dimensional CT (4DCT) for adaptive IMPT for lung cancer patients. Methods: A validated GPU MC code, gPMC, has been linked to the patient database at our institution and employed to compute the dose-influence matrices (Dij) on the planning CT (pCT). The pCT is an average of the respiratory motion of the patient. The Dijs and patient structures were fed to the optimizer to calculate a treatment plan. To validate the plan against motion, a 4D dose distribution averaged over the possible starting phases is calculated using the 4DCT and a model of the time structure of the delivered spot map. The dose is accumulated using vector maps created by a GPU-accelerated deformable image registration program (DIR) from each phase of the 4DCT to the reference phase using the B-spline method. Calculation of the Dij matrices and the DIR are performed on a cluster, with each field and vector map calculated in parallel. Results: The Dij production takes ∼3.5s per beamlet for 10e6 protons, depending on the energy and the CT size. Generating a plan with 4D simulation of 1000 spots in 4 fields takes approximately 1h. To test the framework, IMPT plans for 10 lung cancer patients were generated for validation. Differences between the planned and the delivered dose of 19% in dose to some organs at risk and 1.4/21.1% in target mean dose/homogeneity with respect to the plan were observed, suggesting potential for improvement if adaptation is considered. Conclusion: A fast MC treatment planning framework has been developed that allows reliable plan design and verification for mobile targets and adaptation of treatment plans. This will significantly impact treatments for lung tumors, as 4D-MC dose calculations can now become part of planning strategies.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2018

Performance Optimization of a Beam Dynamics PIC Code On Hybrid Computer Architectures

The self-consistent multi-particle tracking based on particle-in-cell method (PIC) has been widely used in particle accelerator beam dynamics study. However, the PIC simulation is time-consuming and needs to use modern parallel computers for high resolution applications. In this paper, we implemented and optimized a parallel beam dynamics PIC code on two types of hybrid parallel computer architectures: one is the GPU and GPU cluster, while the other is the "Knight Landing" CPU cluster.

Liu, Zhicong↗
DOE OSTI2022

Early Results from GLASS-JWST. II. NIRCam Extragalactic Imaging and Photometric Catalog

We present the reduced images and multiwavelength catalog of the first JWST NIRCam extragalactic observations from the GLASS Early Release Science Program, obtained as coordinated parallels of the NIRISS observations of the Abell 2744 cluster. Images in seven bands (F090W, F115W, F150W, F200W, F277W, F356W, and F444W) have been reduced using an augmented version of the official JWST pipeline; we discuss the procedures adopted to remove or mitigate defects in the raw images. We obtain a multiband catalog by means of forced aperture photometry on point-spread function (PSF)-matched images at the position of F444W-detected sources. The catalog is intended to enable early scientific investigations, and it is optimized for faint galaxies; it contains 6368 sources, with limiting magnitude 29.7 at 5 σ in F444W. We release both images and catalog in order to allow the community to become familiar with the JWST NIRCam data and evaluate their merit and limitations given the current level of knowledge of the instrument.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Virtual Log-Structured Storage for High-Performance Streaming

Over the past decade, given the higher number of data sources (e.g., Cloud applications, Internet of things) and critical business demands, Big Data transitioned from batch-oriented to real-time analytics. Stream storage systems, such as Apache Kafka, are well known for their increasing role in real-time Big Data analytics. For scalable stream data ingestion and processing, they logically split a data stream topic into multiple partitions. Stream storage systems keep multiple data stream copies to protect against data loss while implementing a stream partition as a replicated log. This architectural choice enables simplified development while trading cluster size with performance and the number of streams optimally managed. This paper introduces a shared virtual log-structured storage approach for improving the cluster throughput when multiple producers and consumers write and consume in parallel data streams. Stream partitions are associated with shared replicated virtual logs transparently to the user, effectively separating the implementation of stream partitioning (and data ordering) from data replication (and durability). We implement the virtual log technique in the KerA stream storage system. When comparing with Apache Kafka, KerA improves the cluster ingestion throughput by up to 4x when multiple producers write over hundreds of data streams.

consistent stream ordering↗
DOE OSTI2026

Symbol alphabets in QCD and flag cluster algebras

The full 245-letter symbol alphabet for all planar massless two-loop six-point Feynman integrals was recently determined in arXiv:2412.19884 and arXiv:2501.01847. In a parallel mathematical development, it was shown in arXiv:2408.14956 that there is an embedding of the cluster algebra associated to the partial flag variety $\mathcal{Fl}$ $2,n-2;n$ , which describes the kinematics of n massless particles, into that of the Grassmannian Gr(n–2, 2n–4). In this paper we connect these developments by showing that most of the rational symbol letters can be expressed in terms of flag cluster variables, and that all of the algebraic symbol letters arise from infinite mutation sequences.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Distributed-Memory Parallel Symmetric Nonnegative Matrix Factorization

We develop the first distributed-memory parallel implementation of Symmetric Nonnegative Matrix Factorization (SymNMF), a key data analytics kernel for clustering and dimensionality reduction. Our implementation includes two different algorithms for SymNMF, which give comparable results in terms of time and accuracy. The first algorithm is a parallelization of an existing sequential approach that uses solvers for non symmetric NMF. The second algorithm is a novel approach based on the Gauss-Newton method. It exploits second-order information without incurring large computational and memory costs. We evaluate the scalability of our algorithms on the Summit system at Oak Ridge National Laboratory, scaling up to 128 nodes (4,096 cores) with 70% efficiency. Additionally, we demonstrate our software on an image segmentation task.

Eswar, Srinivas↗
DOE OSTI2013

COLD FRONTS AND GAS SLOSHING IN GALAXY CLUSTERS WITH ANISOTROPIC THERMAL CONDUCTION

Cold fronts in cluster cool cores should be erased on short timescales by thermal conduction, unless protected by magnetic fields that are 'draped' parallel to the front surfaces, suppressing conduction perpendicular to the sloshing fronts. We present a series of MHD simulations of cold front formation in the core of a galaxy cluster with anisotropic thermal conduction, exploring a parameter space of conduction strengths parallel and perpendicular to the field lines. Including conduction has a strong effect on the temperature distribution of the core and the appearance of the cold fronts. Though magnetic field lines are draping parallel to the front surfaces, preventing conduction directly across them, the temperature jumps across the fronts are nevertheless reduced. The geometry of the field is such that the cold gas below the front surfaces can be connected to hotter regions outside via field lines along directions perpendicular to the plane of the sloshing motions and along sections of the front that are not perfectly draped. This results in the heating of this gas below the front on a timescale of a Gyr, but the sharpness of the density and temperature jumps may nevertheless be preserved. By modifying the gas density distribution below the front, conduction may indirectly aid in suppressing Kelvin-Helmholtz instabilities. If conduction along the field lines is unsuppressed, we find that the characteristic sharp jumps seen in Chandra observations of cold front clusters do not form. Therefore, the presence of cold fronts in hot clusters is in contradiction with our simulations with full Spitzer conduction. This suggests that the presence of cold fronts in hot clusters could be used to place upper limits on conduction in the bulk of the intracluster medium. Finally, the combination of sloshing and anisotropic thermal conduction can result in a larger flux of heat to the core than either process in isolation. While still not sufficient to prevent a cooling catastrophe in the very central (r {approx} 5 kpc) regions of the cool core (where something else is required, such as active galactic nucleus feedback), it reduces significantly the mass of gas that experiences a cooling catastrophe outside those small radii.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2014

Hidden axion dark matter decaying through mixing with QCD axion and the 3.5 keV X-ray line

Hidden axions may be coupled to the standard model particles through a kinetic or mass mixing with QCD axion. We study a scenario in which a hidden axion constitutes a part of or the whole of dark matter and decays into photons through the mixing, explaining the 3.5 keV X-ray line signal. Interestingly, the required long lifetime of the hidden axion dark matter can be realized for the QCD axion decay constant at an intermediate scale, if the mixing is sufficiently small. In such a two component dark matter scenario, the primordial density perturbations of the hidden axion can be highly non-Gaussian, leading to a possible dispersion in the X-ray line strength from various galaxy clusters and near-by galaxies. We also discuss how the parallel and orthogonal alignment of two axions affects their couplings to gauge fields. In particular, the QCD axion decay constant can be much larger than the actual Peccei-Quinn symmetry breaking.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Fast tree-based algorithms for DBSCAN for low-dimensional data on GPUs

DBSCAN is a well-known density-based clustering algorithm to discover arbitrary shape clusters. While conceptually simple in serial, the algorithm is challenging to efficiently parallelize on manycore GPU architectures. Common pitfalls, such as asynchronous range query calls, result in high thread execution divergence in many implementations. In this paper, we propose a new framework for GPU-accelerated DBSCAN, and describe two tree-based algorithms within that framework. Both algorithms fuse the search for neighbors with updating cluster information, but differ in their treatment of dense regions of the data. We show that the time taken to compute clusters is at most twice that of determination of the neighbors. We compare the proposed algorithms with existing CPU and GPU implementations, and demonstrate their competitiveness and performance using a fast traversal structure (bounding volume hierarchy) for low dimensional data. We also show that the memory usage can be reduced by processing object neighbors dynamically without storing them.

Prokopenko, Andrey↗
DOE OSTI2019

GUNDAM: a toolkit for fast spatial correlation functions in galaxy surveys

ABSTRACT We describe the capabilities of a new software package to calculate two-point correlation functions (2PCFs) of large galaxy samples. The code can efficiently estimate 3D/projected/angular 2PCFs with a variety of statistical estimators and bootstrap errors, and is intended to provide a complete framework (including calculation, storage, manipulation, and plotting) to perform this type of spatial analysis with large redshift surveys. Gundam implements a very fast skip list/linked list algorithm that efficiently counts galaxy pairs and avoids the computation of unnecessary distances. It is several orders of magnitude faster than a naive pair counter, and matches or even surpass other advanced algorithms. The implementation is also embarrassingly parallel, making full use of multicore processors or large computational clusters when available. The software is designed to be flexible, user friendly and easily extensible, integrating optimized, well-tested packages already available in the astronomy community. Out of the box, it already provides advanced features such as custom weighting schemes, fibre collision corrections and 2D correlations. Gundam will ultimately provide an efficient toolkit to analyse the large-scale structure ‘buried’ in upcoming extremely large data sets generated by future surveys.

Donoso, E.↗
DOE OSTI2019

The global star formation law by supernova feedback

ABSTRACT We address a simple model where the Kennicutt–Schmidt (KS) relation between the macroscopic densities of star formation rate (SFR, ρsfr) and gas (n) in galactic discs emerges from self-regulation of the SFR via supernova feedback. It arises from the physics of supernova bubbles, insensitive to the microscopic SFR recipe and not explicitly dependent on gravity. The key is that the filling factor of SFR-suppressed supernova bubbles self-regulates to a constant, f ∼ 0.5. Expressing the bubble fading radius and time in terms of n, the filling factor is $f\propto S\, n^{-s}$ with s ≃ 1.5, where S is the supernova rate density. A constant f thus refers to ρsfr ∝ n1.5, with a density-independent SFR efficiency per free-fall time ∼0.01. The self-regulation to f ∼ 0.5 and the convergence to a KS relation independent of the local SFR recipe are demonstrated in cosmological and isolated-galaxy simulations using different codes and recipes. In parallel, the spherical analysis of bubble evolution is generalized to clustered supernovae, analytically and via simulations, yielding s ≃ 1.5 ± 0.5. An analysis of photoionized bubbles about pre-supernova stars yields a range of KS slopes but the KS relation is dominated by the supernova bubbles. Superbubble blowouts may lead to an alternative self-regulation by outflows and recycling. While the model is oversimplified, its simplicity and validity in the simulations may argue that it captures the origin of the KS relation.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2014

Exotic Magnetic Order in the Orbital-Selective Mott Regime of Multiorbital Systems

The orbital-selective Mott phase of multiorbital Hubbard models has been extensively analyzed before using static and dynamical mean-field approximations. In parallel, the properties of block states (antiferromagnetically coupled ferromagnetic spin clusters) in Fe-based superconductors have also been much discussed. The present effort uses numerically exact techniques in one-dimensional systems to report the observation of block states within the orbital-selective Mott phase regime, connecting two seemingly independent areas of research, and providing analogies with the physics of double-exchange models.

Rincon, Julian↗
DOE OSTI2018

PyBioNetFit

Systems biology models written in the BioNetGen language often contain parameters that must be fit based on experimental data. PyBioNetFit is a software tool designed to fit parameters of BioNetGen models. The user is expected to provide a BioNetGen model that contains unknown parameters, along with one or more text files containing experimental data. PyBioNetFit will perform a series of calls to the BioNetGen simulator using different parameter sets, to identify the parameter set that best fits the data. The parameter search is dictated by the user's choice of one of several metaheuristic optimization algorithms, including differential evolution, particle swarm optimization, scatter search, and simulated annealing. The software supports parallelized computing on multi-core computers and on computing clusters. We expect this software to be a useful tool for researchers designing BioNetGen models in collaboration with experimentalists.

Mitra, Eshan↗
DOE OSTI2013

Testbed Environment for Space Situational Awareness: The world’s most accurate simulation of space debris and orbital object tracking

The Testbed Environment for Space Situational Awareness (TESSA) is a modeling and simulation environment designed for efficient exploration of scenarios involving satellites and space debris and their detection by both ground and space-based radars and optical sensors. TESSA is a Parallelized Discrete Event Simulator optimized for deployment on a large cluster of high-performance computers running Linux. TESSA includes capabilities for predicting the future location of a satellite using the satellite’s current location and velocity, determining an object’s orbit from sensor data, finding new orbital objects, predicting close approaches, determining the probability of collisions, modeling radar and optical and dynamic sensors, and modeling the generation of debris. TESSA also includes a scalable visualization environment implemented as a post-processor on workstation-class platforms.

42 ENGINEERING↗
DOE OSTI2020

CSRI Summer Proceedings 2020

The Computer Science Research Institute (CSRI) brings university faculty and students to Sandia for focused collaborative research on Department of Energy (DOE) computer and computational science problems. The institute provides an opportunity for university researchers to learn about problems in computer and computational science at DOE laboratories. Participants conduct leading-edge research, interact with scientists and engineers at the laboratories, and help transfer results of their research to programs at the labs. Some specific CSRI research interest areas are: scalable solvers, optimization, adaptivity and mesh refinement, graph-based, discrete, and combinatorial algorithms, uncertainty estimation, mesh generation, dynamic load-balancing, virus and other malicious-code defense, visualization, scalable cluster computers, data-intensive computing, environments for scalable computing, parallel input/output, advanced architectures, and theoretical computer science. The CSRI Summer Program is organized by CSRI and typically includes the organization of a weekly seminar series and the publication of a summer proceedings. In 2020, the CSRI summer program was executed completely virtually; all student interns worked from home, due to the COVID-19 pandemic.

97 MATHEMATICS AND COMPUTING↗