activity
20172025
most citedAn Efficient Multiway Mergesort for GPU Architectures

3 citations · 7 across the 6 of their papers we have counts for

collaborators

7 papers

cs.DB2025

VecFlow: A High-Performance Vector Data Management System for Filtered-Search on GPUs

Jingyi Xi, Chenghao Mo, Benjamin Karsin +3

Vector search and database systems have become a keystone component in many AI applications. While many prior research has investigated how to accelerate the performance of generic…

cs.DS2019★ 2 cited

A parallel priority queue with fast updates for GPU architectures

Kyle Berney, John Iacono, Ben Karsin +1

The single-source shortest path (SSSP) problem is a well-studied problem that is used in many applications. In the parallel setting, a work-efficient algorithm that additionally at…

cs.DS2019

External Memory Planar Point Location with Fast Updates

John Iacono, Ben Karsin, Grigorios Koumoutsos

We study dynamic planar point location in the External Memory Model or Disk Access Model (DAM). Previous work in this model achieves polylog query and polylog amortized update time…

cs.DS2019

Locality

Peyman Afshani, John Iacono, Varunkumar Jayapaul +2

The program performance on modern hardware is characterized by \emph{locality of reference}, that is, it is faster to access data that is close in address space to data that has be…

cs.DC2018

GPU Accelerated Similarity Self-Join for Multi-Dimensional Data

Michael Gowanlock, Ben Karsin

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…

cs.DC2018★ 2 cited

GPU Accelerated Self-join for the Distance Similarity Metric

Michael Gowanlock, Ben Karsin

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…

cs.DS2017★ 3 cited

An Efficient Multiway Mergesort for GPU Architectures

Henri Casanova, John Iacono, Ben Karsin +2

Sorting is a primitive operation that is a building block for countless algorithms. As such, it is important to design sorting algorithms that approach peak performance on a range…