Searcharxiv⌕ Search

arXiv subjects

Jeremy Buhler

Publications and source records attributed to Jeremy Buhler.

2 recordsLinked to original sources

FastSpecFit: Spectrophotometric Modeling of 38 Million Extragalactic Targets from the Dark Energy Spectroscopic Instrument Second Data Release

Optical spectrophotometry provides a direct window into the physical conditions, kinematics, and formation histories of galaxies and quasars. FastSpecFit is an open-source Python software package that forward-models each Dark Energy Spectroscopic Instrument (DESI) spectrum jointly with its broadband photometry, convolving stellar-population synthesis and emission-line templates with each fiber's native spectral resolution. This forward-modeling approach preserves DESI's uncorrelated pixel statistics, fits a typical spectrum in ~0.1 s of single-core time, and scales to tens of millions of objects, with uncertainties estimated via Monte Carlo resampling. FastSpecFit measures stellar velocity dispersions, non-parametric star-formation histories, stellar masses, star-formation rates, dust attenuation, K-corrections, rest-frame magnitudes, and fluxes and equivalent widths for 46 emission lines, including separate narrow and broad components for the Balmer lines. We describe these algorithms in detail, validate the measurements against independent codes, and present the resulting value-added catalog for DESI Data Release 2, which provides spectrophotometric and physical properties for 38 million extragalactic targets at 0<z<4. We also release a companion photometry-only catalog and document the catalogs previously released for the DESI Early Data Release and Data Release 1.

astro-ph.GA↗

Streaming Computations with Region-Based State on SIMD Architectures

Streaming computations on massive data sets are an attractive candidate for parallelization, particularly when they exhibit independence (and hence data parallelism) between items in the stream. However, some streaming computations are stateful, which disrupts independence and can limit parallelism. In this work, we consider how to extract data parallelism from streaming computations with a common, limited form of statefulness. The stream is assumed to be divided into variably-sized regions, and items in the same region are processed in a common context of state. In general, the computation to be performed on a stream is also irregular, with each item potentially undergoing different, data-dependent processing. This work describes mechanisms to implement such computations efficiently on a SIMD-parallel architecture such as a GPU. We first develop a low-level protocol by which a data stream can be augmented with control signals that are delivered to each stage of a computation at precise points in the stream. We then describe an abstraction, enumeration and aggregation, by which an application developer can specify the behavior of a streaming application with region-based state. Finally, we study an implementation of our ideas as part of the MERCATOR system for irregular streaming computations on GPUs, investigating how the frequency of region boundaries in a stream impacts SIMD occupancy and hence application performance.

cs.DC↗