cuSLINK: Single-Linkage Agglomerative Clustering on the GPU

Nolet, Corey J.; Gala, Divye; Fender, Alex; Doijade, Mahesh; Eaton, Joe; Raff, Edward; Zedlewski, John; Rees, Brad; Oates, Tim

doi:10.1007/978-3-031-43412-9_42

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Other1

Article1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs

Ootomo,

Naruse,

Nolet

et al. 2024

2024 IEEE 40th International Conference on Data Engineering (ICDE)

View full text Add to dashboard Cite

CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs

Ootomo,

Naruse,

Nolet

et al. 2024

2024 IEEE 40th International Conference on Data Engineering (ICDE)

View full text Add to dashboard Cite

Redzone stream compaction: removing k items from a list in parallel O(k) time

Bontes,

Gain

2024

ACM Trans. Parallel Comput.

View full text Add to dashboard Cite

Stream compaction, the parallel removal of selected items from a list, is a fundamental building block in parallel algorithms. It is extensively used, both in computer graphics, for shading, collision detection, and ray tracing, as well as in general computing, such as for tree traversal and database selection. In this paper we present Redzone stream compaction, the first parallel stream compaction algorithm to remove k items from a list with n ≥ k elements in O ( k ) rather than O ( n ) time. Based on our benchmark experiments on both GPU and CPU, if k is proportionally small ( k ≪ n ) Redzone outperforms existing parallel stream compaction by orders of magnitude, while if k is close to n it underperforms by a constant factor. Redzone removes items in-place and needs only O (1) auxiliary space. However, unlike current O ( n ) algorithms, it is unstable (i.e., the order of elements is not preserved) and it needs a list of the items to be removed.

show abstract

cuSLINK: Single-Linkage Agglomerative Clustering on the GPU

Cited by 2 publications

References 26 publications

CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs

CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs

Redzone stream compaction: removing k items from a list in parallel O(k) time

Contact Info

Product

Resources

About