arXiv subjects

Michael Gowanlock

Publications and source records attributed to Michael Gowanlock.

17 recordsLinked to original sources

arXiv2026

RT-HiSS: Ray Tracing Accelerated High Dimensional Vector Similarity Searches

Recent GPU generations include special-purpose ray tracing (RT) cores for graphics applications. While RT cores are primarily used for rendering, recent works show they can be leveraged for general-purpose tasks, including similarity searches. However, existing approaches do not support datasets exceeding three dimensions. In this work, we propose RT-HiSS, the first exact GPU RT-core-based similarity search algorithm for high-dimensional datasets. GPU similarity search often scales poorly for large datasets with substantial search distances. To address this, RT-HiSS uses RT cores for fast index construction and searches, followed by candidate refinement on CUDA cores. We introduce a two-pass approach to estimate an upper bound on result size, enabling efficient batching under GPU memory constraints with near-perfect load balancing. Additionally, we examine shared memory tiling and compressed result masks to improve GPU resource utilization. RT-HiSS yields speedups up to 8.37$\times$ over competitive state-of-the-art GPU algorithms and up to 2,368.26$\times$ relative to the brute-force algorithm across six real-world datasets.

cs.DC↗

arXiv2026

The Solar System Notification Alert Processing System (SNAPS): Public access to SNAPS data and products

The Solar System Notification Alert Processing System, SNAPS, is a downstream broker that ingests moving object data from ZTF and LSST and serves these data and derived properties to the public. This document describes how users can access our SNAPS data and products. This is intended to be a living document that will be updated on the arXiv when significant improvements are made to our data access schemes, and will therefore always contain the most up to date information about interacting with our databases and infrastructure. This is version 1.0.

astro-ph.EP↗

arXiv2026

Parallel R-tree-based Spatial Query Processing on a Commercial Processing-in-Memory System

The growing volume of data in scientific domains has made spatial query processing increasingly challenging due to high data transfer costs across the memory hierarchy and limited memory bandwidth. To address these bottlenecks and reduce the energy consumed on data movement, this work explores Processing-in-Memory (PIM) systems by executing range queries directly inside memory chips. Unlike prior PIM studies centered on linear scans or hash-based queries, this work is the first to map R-tree range queries onto commercial PIM hardware. The proposed broadcast-based method constructs the R-tree bottom-up on the CPU, broadcasts top levels to UPMEM DPUs (DRAM Processing Units) for global filtering, and distributes lower levels for parallel batched queries in a CPU-DPU system. We evaluate our approach on two real spatial datasets, Sports (999K rectangles) and Lakes (8.4M rectangles), and assess scalability using a synthetic dataset with up to 16M rectangles and 3.9M queries on a commercial UPMEM PIM system with up to 2,540 DPUs. Across all datasets, broadcast-based execution consistently outperforms subtree partitioning by preventing communication from dominating execution. On the Lakes dataset, strong scaling from 512 to 2,540 DPUs reduces kernel time from 64.9 s to 17.6 s, yielding up to 3.66x kernel and 2.70x end-to-end speedup relative to the CPU R-tree search on the same system. The PIM kernel also consumes approximately 3.4x less energy than the corresponding CPU search (e.g., 59.6 kJ vs. 167.0 kJ on Lakes), demonstrating scalable and energy-efficient hierarchical spatial range queries.

cs.DB↗

arXiv2025

Fast and Scalable Mixed Precision Euclidean Distance Calculations Using GPU Tensor Cores

Modern GPUs are equipped with tensor cores (TCs) that are commonly used for matrix multiplication in artificial intelligence workloads. However, because they have high computational throughput, they can lead to significant performance gains in other algorithms if they can be successfully exploited. We examine using TCs to compute Euclidean distance calculations, which are used in many data analytics applications. Prior work has only investigated using 64 bit floating point (FP64) data for computation; however, TCs can operate on lower precision floating point data (i.e., 16 bit matrix multiplication and 32 bit accumulation), which we refer to as FP16-32. FP16-32 TC peak throughput is so high that TCs are easily starved of data. We propose a Fast and Scalable Tensor core Euclidean Distance (FaSTED) algorithm. To achieve high computational throughput, we design FaSTED for significant hierarchical reuse of data and maximize memory utilization at every level (global memory, shared memory, and registers). We apply FaSTED to the application of similarity searches, which typically employ an indexing data structure to eliminate superfluous Euclidean distance calculations. We compare to the state-of-the-art (SOTA) TC Euclidean distance algorithm in the literature that employs FP64, as well as to two single precision (FP32) CUDA core algorithms that both employ an index. We find that across four real-world high-dimensional datasets spanning 128-960 dimensions, the mixed-precision brute force approach achieves a speedup over the SOTA algorithms of 2.5-51x. We also quantify the accuracy loss of our mixed precision algorithm to be less than <0.06% when compared to the FP64 baseline.

cs.DC↗

arXiv2024

Asteroid Period Solutions from Combined Dense and Sparse Photometry

Deriving high quality lightcuves for asteroids and other periodic sources from survey data is challenging due to many factors, including the sparsely sampled observational record and diurnal aliasing which is a signature imparted into the periodic signal of a source that is a function of the observing schedule of ground-based telescopes. In this paper, we examine the utility of combining asteroid observational records from the Zwicky Transient Facility (ZTF) and the Transiting Exoplanet Survey Satellite (TESS) which are the ground- and space-based facilities, respectively, to determine to what degree the data from the space-based facility can suppress diurnal aliases. Furthermore, we examine several optimizations that are used to derive the rotation periods of asteroids which we then compare to the reported rotation periods in the literature. Through this analysis we find that we can reliably derive the rotation periods for ~85% of our sample of 222 objects that are also reported in the literature and that the remaining ~15% are difficult to reliably derive as many are asteroids that are insufficiently elongated which produces a lightcurve with an insufficient amplitude and consequently, an incorrect rotation period. We also investigate a binary classification method that biases against reporting incorrect rotation periods. We conclude the paper by assessing the utility of using other ground- or space-based facilities as companion telescopes to the forthcoming Rubin Observatory.

astro-ph.EP↗

arXiv2024

The Solar System Notification Alert Processing System (SNAPS): Asteroid Population Outlier Detection

The Solar System Notification Alert Processing System (SNAPS) is a ZTF and Rubin Observatory alert broker that will send alerts to the community regarding interesting events in the Solar System. SNAPS is actively monitoring Solar System objects and one of its functions is to compare objects (primarily main belt asteroids) to one another to find those that are outliers relative to the population. In this paper, we use the SNAPShot1 dataset which contains 31,693 objects from ZTF and derive outlier scores for each of these objects. SNAPS employs an unsupervised approach; consequently, to derive outlier rankings for each object, we propose four different outlier metrics such that we can explore variants of outlier scores and add confidence to outlier rankings. We also provide outlier scores for each object in each permutation of 15 feature spaces, between 2 and 15 features, which yields 32,752 total feature spaces. We show that we can derive population outlier rankings each month at Rubin Observatory scale using four Nvidia A100 GPUs, and present several avenues of scientific investigation that can be explored using population outlier detection.

astro-ph.EP↗

arXiv2023

Removing Aliases in Time-Series Photometry

Ground-based, all-sky astronomical surveys are imposed with an inevitable day-night cadence that can introduce aliases in period-finding methods. We examined four different methods -- three from the literature and a new one that we developed -- that remove aliases to improve the accuracy of period-finding algorithms. We investigate the effectiveness of these methods in decreasing the fraction of aliased period solutions by applying them to the Zwicky Transient Facility (ZTF) and the LSST Solar System Products Data Base (SSPDB) asteroid datasets. We find that the VanderPlas method had the worst accuracy for each survey. The mask and our newly proposed window method yields the highest accuracy when averaged across both datasets. However, the Monte Carlo method had the highest accuracy for the ZTF dataset, while for SSPDB, it had lower accuracy than the baseline where none of these methods are applied. Where possible, detailed de-aliasing studies should be carried out for every survey with a unique cadence.

astro-ph.EP↗

arXiv2023

The Solar System Notification Alert Processing System (SNAPS): Design, Architecture, and First Data Release (SNAPShot1)

We present here the design, architecture, and first data release for the Solar System Notification Alert Processing System (SNAPS). SNAPS is a Solar System broker that ingests alert data from all-sky surveys. At present, we ingest data from the Zwicky Transient Facility (ZTF) public survey, and we will ingest data from the forthcoming Legacy Survey of Space and Time (LSST) when it comes online. SNAPS is an official LSST downstream broker. In this paper we present the SNAPS design goals and requirements. We describe the details of our automatic pipeline processing in which physical properties of asteroids are derived. We present SNAPShot1, our first data release, which contains 5,458,459 observations of 31,693 asteroids observed by ZTF from July, 2018, through May, 2020. By comparing a number of derived properties for this ensemble to previously published results for overlapping objects we show that our automatic processing is highly reliable. We present a short list of science results, among many that will be enabled by our SNAPS catalog: (1) we demonstrate that there are no known asteroids with very short periods and high amplitudes, which clearly indicates that in general asteroids in the size range 0.3--20 km are strengthless; (2) we find no difference in the period distributions of Jupiter Trojan asteroids, implying that the L4 and L5 cloud have different shape distributions; and (3) we highlight several individual asteroids of interest. Finally, we describe future work for SNAPS and our ability to operate at LSST scale.

astro-ph.EP↗

arXiv2022

Leveraging GPU Tensor Cores for Double Precision Euclidean Distance Calculations

Tensor cores (TCs) are a type of Application-Specific Integrated Circuit (ASIC) and are a recent addition to Graphics Processing Unit (GPU) architectures. As such, TCs are purposefully designed to greatly improve the performance of Matrix Multiply-Accumulate (MMA) operations. While TCs are heavily studied for machine learning and closely related fields, where their high efficiency is undeniable, MMA operations are not unique to these fields. More generally, any computation that can be expressed as MMA operations can leverage TCs, and potentially benefit from their higher computational throughput compared to other general-purpose cores, such as CUDA cores on Nvidia GPUs. In this paper, we propose the first double precision (FP64) Euclidean distance calculation algorithm, which is expressed as MMA operations to leverage TCs on Nvidia GPUs, rather than the more commonly used CUDA cores. To show that the Euclidean distance can be accelerated in a real-world application, we evaluate our proposed TC algorithm on the distance similarity self-join problem, as the most computationally intensive part of the algorithm consists of computing distances in a multi-dimensional space. We find that the performance gain from using the tensor core algorithm over the CUDA core algorithm depends weakly on the dataset size and distribution, but is strongly dependent on data dimensionality. Overall, TCs are a compelling alternative to CUDA cores, particularly when the data dimensionality is low ($\leq{4}$), as we achieve an average speedup of $1.28\times$ and up to $2.23\times$ against a state-of-the-art GPU distance similarity self-join algorithm. Furthermore, because this paper is among the first to explore the use of TCs for FP64 general-purpose computation, future research is promising.

cs.DC↗

arXiv2021

GPU-Enabled Searches for Periodic Signals of Unknown Shape

Recent and future generation observatories will enable the study of variable astronomical phenomena through their time-domain capabilities. High temporal fidelity will allow for unprecedented investigations into the nature of variable objects -- those objects that vary in brightness over time. A major bottleneck in data processing pipelines is constructing light curve solutions for catalogs of variable objects, as it is well-known that period finding algorithms are computationally expensive. Furthermore, there are many period finding algorithms that are often suited for specific science cases. In this paper, we present the first GPU-accelerated Super Smoother algorithm. Super Smoother is general purpose and uses cross-validation to fit line segments to a time series, and as such, is more computationally expensive than other algorithms, such as Lomb-Scargle. Because the algorithm requires making several scans over the input time series for a tested frequency, we also propose a novel generalized-validation variant of Super Smoother that only requires a single scan over the data. We compare the performance of our algorithms to analogous parallel multi-core CPU implementations on three catalogs of data, and show that it is generally advantageous to use the GPU algorithm over the CPU counterparts. Furthermore, we demonstrate that our single-pass variant of Super Smoother is roughly equally as accurate at finding correct period solutions as the original algorithm. Our software supports several features, such as batching the computation to eliminate the possibility of exceeding global memory on the GPU, processing a single object or batches of objects, and we allow for scaling the algorithm across multiple GPUs.

astro-ph.IM↗

arXiv2021

Fast Period Searches Using the Lomb-Scargle Algorithm on Graphics Processing Units for Large Datasets and Real-Time Applications

Computing the periods of variable objects is well-known to be computationally expensive. Modern astronomical catalogs contain a significant number of observed objects. Therefore, even if the period ranges for particular classes of objects are well-constrained due to expected physical properties, periods must be derived for a tremendous number of objects. In this paper, we propose a GPU-accelerated Lomb-Scargle period finding algorithm that computes periods for single objects or for batches of objects as is necessary in many data processing pipelines. We demonstrate the performance of several optimizations, including comparing the use of shared and global memory GPU kernels and using multiple CUDA streams to copy periodogram data from the GPU to the host. Also, we quantify the difference between 32-bit and 64-bit floating point precision on two classes of GPUs, and show that the performance degradation of using 64-bit over 32-bit is greater on the CPU than a GPU designed for scientific computing. We find that the GPU algorithm achieves superior performance over the baseline parallel CPU implementation, achieving a speedup of up to 174.53$\times$. The Vera C. Rubin Observatory will carry out the Legacy Survey of Space and Time (LSST). We perform an analysis that shows we can derive the rotation periods of batches of Solar System objects at LSST scale in near real-time, which will be employed in a future LSST event broker. All source code has been made publicly available.

astro-ph.IM↗

arXiv2021

The Breakthrough Listen Search For Intelligent Life Near the Galactic Center I

A line-of-sight towards the Galactic Center (GC) offers the largest number of potentially habitable systems of any direction in the sky. The Breakthrough Listen program is undertaking the most sensitive and deepest targeted SETI surveys towards the GC. Here, we outline our observing strategies with Robert C. Byrd Green Bank Telescope (GBT) and Parkes telescope to conduct 600 hours of deep observations across 0.7--93 GHz. We report preliminary results from our survey for ETI beacons across 1--8 GHz with 7.0 and 11.2 hours of observations with Parkes and GBT, respectively. With our narrowband drifting signal search, we were able to place meaningful constraints on ETI transmitters across 1--4 GHz and 3.9--8 GHz with EIRP limits of $\geq$4$\times$10$^{18}$ W among 60 million stars and $\geq$5$\times$10$^{17}$ W among half a million stars, respectively. For the first time, we were able to constrain the existence of artificially dispersed transient signals across 3.9--8 GHz with EIRP $\geq$1$\times$10$^{14}$ W/Hz with a repetition period $\leq$4.3 hours. We also searched our 11.2 hours of deep observations of the GC and its surrounding region for Fast Radio Burst-like magnetars with the DM up to 5000 pc cm$^{-3}$ with maximum pulse widths up to 90 ms at 6 GHz. We detected several hundred transient bursts from SGR J1745$-$2900, but did not detect any new transient burst with the peak luminosity limit across our observed band of $\geq$10$^{31}$ erg s$^{-1}$ and burst-rate of $\geq$0.23 burst-hr$^{-1}$. These limits are comparable to bright transient emission seen from other Galactic radio-loud magnetars, constraining their presence at the GC.

astro-ph.HE↗

arXiv2020

Hybrid KNN-Join: Parallel Nearest Neighbor Searches Exploiting CPU and GPU Architectural Features

K Nearest Neighbor (KNN) joins are used in scientific domains for data analysis, and are building blocks of several well-known algorithms. KNN-joins find the KNN of all points in a dataset. This paper focuses on a hybrid CPU/GPU approach for low-dimensional KNN-joins, where the GPU may not yield substantial performance gains over parallel CPU algorithms. We utilize a work queue that prioritizes computing data points in high density regions on the GPU, and low density regions on the CPU, thereby taking advantage of each architecture's relative strengths. Our approach, HybridKNN-Join, effectively augments a state-of-the-art multi-core CPU algorithm. We propose optimizations that $(i)$ maximize GPU query throughput by assigning the GPU large batches of work; $(ii)$ increase workload granularity to optimize GPU utilization; and, $(iii)$ limit load imbalance between CPU and GPU architectures. We compare HybridKNN-Join to one GPU and two parallel CPU reference implementations. Compared to the reference implementations, we find that the hybrid algorithm performs best on larger workloads (dataset size and K). The methods employed in this paper show promise for the general division of work in other hybrid algorithms.

cs.DC↗

arXiv2018

GPU Accelerated Similarity Self-Join for Multi-Dimensional Data

The self-join finds all objects in a dataset that are within a search distance, epsilon, of each other; therefore, the self-join is a building block of many algorithms. We advance a GPU-accelerated self-join algorithm targeted towards high dimensional data. The massive parallelism afforded by the GPU and high aggregate memory bandwidth makes the architecture well-suited for data-intensive workloads. We leverage a grid-based, GPU-tailored index to perform range queries. We propose the following optimizations: (i) a trade-off between candidate set filtering and index search overhead by exploiting properties of the index; (ii) reordering the data based on variance in each dimension to improve the filtering power of the index; and (iii) a pruning method for reducing the number of expensive distance calculations. Across most scenarios on real-world and synthetic datasets, our algorithm outperforms the parallel state-of-the-art approach. Exascale systems are converging on heterogeneous distributed-memory architectures. We show that an entity partitioning method can be utilized to achieve a balanced workload, and thus good scalability for multi-GPU or distributed-memory self-joins.

cs.DC↗

arXiv2018

GPU Accelerated Self-join for the Distance Similarity Metric

The self-join finds all objects in a dataset within a threshold of each other defined by a similarity metric. As such, the self-join is a building block for the field of databases and data mining, and is employed in Big Data applications. In this paper, we advance a GPU-efficient algorithm for the similarity self-join that uses the Euclidean distance metric. The search-and-refine strategy is an efficient approach for low dimensionality datasets, as index searches degrade with increasing dimension (i.e., the curse of dimensionality). Thus, we target the low dimensionality problem, and compare our GPU self-join to a search-and-refine implementation, and a state-of-the-art parallel algorithm. In low dimensionality, there are several unique challenges associated with efficiently solving the self-join problem on the GPU. Low dimensional data often results in higher data densities, causing a significant number of distance calculations and a large result set. As dimensionality increases, index searches become increasingly exhaustive, forming a performance bottleneck. We advance several techniques to overcome these challenges using the GPU. The techniques we propose include a GPU-efficient index that employs a bounded search, a batching scheme to accommodate large result set sizes, and a reduction in distance calculations through duplicate search removal. Our GPU self-join outperforms both search-and-refine and state-of-the-art algorithms.

cs.DC↗

arXiv2017

Super-resolution Full Polarimetric Imaging for Radio Interferometry with Sparse Modeling

We propose a new technique for radio interferometry to obtain super-resolution full polarization images in all four Stokes parameters using sparse modeling. The proposed technique reconstructs the image in each Stokes parameter from the corresponding full-complex Stokes visibilities by utilizing two regularization functions: the $\ell _1$-norm and total variation (TV) of the brightness distribution. As an application of this technique, we present simulated linear polarization observations of two physically motivated models of M87 with the Event Horizon Telescope (EHT). We confirm that $\ell _1$+TV regularization can achieve an optimal resolution of $\sim 25-30$\% of the diffraction limit $λ/D_{\rm max}$, which is the nominal spatial resolution of a radio interferometer for both the total intensity (i.e. Stokes $I$) and linear polarizations (i.e. Stokes $Q$ and $U$). This optimal resolution is better than that obtained from the widely used Cotton-Schwab CLEAN algorithm or from using $\ell _1$ or TV regularizations alone. Furthermore, we find that $\ell _1$+TV regularization can achieve much better image fidelity in linear polarization than other techniques over a wide range of spatial scales, not only in the super-resolution regime, but also on scales larger than the diffraction limit. Our results clearly demonstrate that sparse reconstruction is a useful choice for high-fidelity full-polarimetric interferometric imaging.

astro-ph.IM↗

arXiv2014

Technical Report: Towards Efficient Indexing of Spatiotemporal Trajectories on the GPU for Distance Threshold Similarity Searches

Applications in many domains require processing moving object trajectories. In this work, we focus on a trajectory similarity search that finds all trajectories within a given distance of a query trajectory over a time interval, which we call the distance threshold similarity search. We develop three indexing strategies with spatial, temporal and spatiotemporal selectivity for the GPU that differ significantly from indexes suitable for the CPU, and show the conditions under which each index achieves good performance. Furthermore, we show that the GPU implementations outperform multithreaded CPU implementations in a range of experimental scenarios, making the GPU an attractive technology for processing moving object trajectories. We test our implementations on two synthetic and one real-world dataset of a galaxy merger.

cs.DC↗